{"title":"3D non-linear invisible boundary detection filters","authors":"M. Petrou, F. Mohanna, V. Kovalev","doi":"10.1109/TDPVT.2004.1335421","DOIUrl":"https://doi.org/10.1109/TDPVT.2004.1335421","url":null,"abstract":"The human vision system can discriminate regions which differ up to the second order statistics only. A lot of malignant tumours have boundaries which are not visible to the human eye. We present an algorithm designed to reveal \"hidden\" boundaries in grey level images, by computing gradients in higher order statistics of the data. We demonstrate it by applying it to the identification of possible \"hidden\" boundaries of gliomas as manifest themselves in MRI 3D scans.","PeriodicalId":191172,"journal":{"name":"Proceedings. 2nd International Symposium on 3D Data Processing, Visualization and Transmission, 2004. 3DPVT 2004.","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126186007","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Bayesian surface reconstruction","authors":"N. Moretto, R. Frezza","doi":"10.1109/TDPVT.2004.1335200","DOIUrl":"https://doi.org/10.1109/TDPVT.2004.1335200","url":null,"abstract":"We illustrate an innovative method, which estimates the surfaces -modelled as polygonal meshes- bounding objects present in a scene, viewed by arbitrarily placed cameras. We present a Monte Carlo based iterative approach which, at every step, increases its knowledge about the scene sampling the unknown volume around the current estimation. Then, the samples, which mostly appear to be consistent with the measurements, are used to extend the mesh representing the surface. The reconstruction is regularized applying a filter -based on a dynamic system- to the mesh. This operation will preserve the high curvature areas of the surface, while smoothing away the noise in the estimation.","PeriodicalId":191172,"journal":{"name":"Proceedings. 2nd International Symposium on 3D Data Processing, Visualization and Transmission, 2004. 3DPVT 2004.","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129547188","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Filling the signed distance field by fitting local quadrics","authors":"T. Masuda","doi":"10.1109/TDPVT.2004.1335425","DOIUrl":"https://doi.org/10.1109/TDPVT.2004.1335425","url":null,"abstract":"We propose a method of filling unmeasured regions of shape models integrated from multiple measurements of surface shapes. We use the signed distance field (SDF) as shape representation that contains information of the surface normal along with the signed distance at the closest point on the surface from the sampling point. We solve this problem by iteratively fitting quadratic function to generate smoothly connected SDF. We analyzed the relationship between the quadratic coefficients and the surface curvature, and by using the coefficients, we evenly propagated the SDF so that it satisfies the constraints of the field. The proposed method was tested on synthetic data and real data that was generated by integrating multiple range images.","PeriodicalId":191172,"journal":{"name":"Proceedings. 2nd International Symposium on 3D Data Processing, Visualization and Transmission, 2004. 3DPVT 2004.","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120995207","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Progressive compression of volumetric subdivision meshes","authors":"D. Laney, Valerio Pascucci","doi":"10.1109/TDPVT.2004.1335304","DOIUrl":"https://doi.org/10.1109/TDPVT.2004.1335304","url":null,"abstract":"We present a progressive compression technique for volumetric subdivision meshes based on the slow growing refinement algorithm. The system is comprised of a wavelet transform followed by a progressive encoding of the resulting wavelet coefficients. We compare the efficiency of two wavelet transforms. The first transform is based on the smoothing rules used in the slow growing subdivision technique. The second transform is a generalization of lifted linear B-spline wavelets to the same multitier refinement structure. Direct coupling with a hierarchical coder produces progressive bit streams. Rate distortion metrics are evaluated for both wavelet transforms. We tested the practical performance of the scheme on synthetic data as well as data from laser indirect-drive fusion simulations with multiple fields per vertex. Both wavelet transforms result in high quality trade off curves and produce qualitatively good coarse representations.","PeriodicalId":191172,"journal":{"name":"Proceedings. 2nd International Symposium on 3D Data Processing, Visualization and Transmission, 2004. 3DPVT 2004.","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121338149","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Topology and geometry of unorganized point clouds","authors":"G. Kamberov, G. Kamberova","doi":"10.1109/TDPVT.2004.1335390","DOIUrl":"https://doi.org/10.1109/TDPVT.2004.1335390","url":null,"abstract":"We present a new method for defining neighborhoods, and assigning principal curvature frames, and mean and Gauss curvatures to the points of an unorganized oriented point-cloud. The neighborhoods are estimated by measuring implicitly the surface distance between points. The 3D shape recovery is based on conformal geometry, works directly on the cloud, does not rely on the generation of polygonal, or smooth models. Test results on publicly available synthetic data, as ground truth, demonstrate that the method compares favorably to the established approaches for quantitative 3D shape recovery. The proposed method is developed to serve applications involving point based rendering and reliable extraction of differential properties from noisy unorganized point-clouds.","PeriodicalId":191172,"journal":{"name":"Proceedings. 2nd International Symposium on 3D Data Processing, Visualization and Transmission, 2004. 3DPVT 2004.","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117344075","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Entire model acquisition system using handheld 3D digitizer","authors":"Hiroshi Kawasaki, Furukawa Ryo","doi":"10.1109/TDPVT.2004.1335276","DOIUrl":"https://doi.org/10.1109/TDPVT.2004.1335276","url":null,"abstract":"In this paper, a real-time, handheld 3D model acquisition system consisting of a laser projector, a video camera and a turntable is described. The user projects a stripe of light at the 3D object by hand while rotating the object on a turntable. The projected light and LED markers attached to the laser projector and turntable are captured by the video camera. By estimating the 3D orientation of the laser projector and the turntable angle from the 2D locations of the markers, the 3D location of the surface lit by the laser can be calculated. In addition, post-processing algorithms for refining the estimated 3D data have been proposed. The algorithm not only improves the accuracy of the 3D measurement, but also achieves to decrease the number of LEDs for 3D data estimation; therefore, it significantly improves the user's convenience in scanning the object. With this system, users can measure an entire 3D object in real-time.","PeriodicalId":191172,"journal":{"name":"Proceedings. 2nd International Symposium on 3D Data Processing, Visualization and Transmission, 2004. 3DPVT 2004.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128809978","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"3-Dimensional object modeling with mesh simplification based resolution adjustment","authors":"Özgür Ulucay, S. Ertürk","doi":"10.1109/TDPVT.2004.1335186","DOIUrl":"https://doi.org/10.1109/TDPVT.2004.1335186","url":null,"abstract":"A 3-dimensional (3D) object modeling technique with mesh simplification and refinement based resolution adjustment is proposed in this paper. Polygonal models which are widely utilized in the modeling of 3D objects are taken as basis, making use of the polygonal structure and vertex coordinates for the display of 3D models. The amount of polygons and vertices of a model is proportional to the resolution as well as data quantity. In other words the resolution and data increases with the number of polygons. In this paper, it is proposed to utilize resolution, and hence data amount, adjustable 3D modeling so that model resolution and transmitted data amount can be regulated according to access constraints.","PeriodicalId":191172,"journal":{"name":"Proceedings. 2nd International Symposium on 3D Data Processing, Visualization and Transmission, 2004. 3DPVT 2004.","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128940965","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Testing reflectance models against radiance data","authors":"H. Ragheb, A. Robles-Kelly, E. Hancock","doi":"10.1109/3DPVT.2004.129","DOIUrl":"https://doi.org/10.1109/3DPVT.2004.129","url":null,"abstract":"We describe an empirical investigation of departures from Lambert's law for rough and shiny surfaces. We commence by using a recently reported method to recover estimates of the surface radiance function for objects illuminated in the viewer direction. This method is nonparametric, and offers the advantage that it is simple to use since it does not require detailed camera calibration. We compare the radiance data with a number of phenomenological and physics-based reflectance models. The models studied include those of Oren-Nayar, Wolff and different variants of the Beckmann model. The main conclusion of the study is that among these models the best fit to the empirical data is found to be the Wolff model for smooth objects and the modified Beckmann model for rough objects.","PeriodicalId":191172,"journal":{"name":"Proceedings. 2nd International Symposium on 3D Data Processing, Visualization and Transmission, 2004. 3DPVT 2004.","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131799264","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"3D shape registration using regularized medial scaffolds","authors":"Ming-Ching Chang, F. Leymarie, B. Kimia","doi":"10.1109/TDPVT.2004.1335423","DOIUrl":"https://doi.org/10.1109/TDPVT.2004.1335423","url":null,"abstract":"This work proposes a method for global registration based on matching 3D medial structures of unorganized point clouds or triangulated meshes. Most practical known methods are based on the iterative closest point (ICP) algorithm, which requires an initial alignment close to the globally optimal solution to ensure convergence to a valid solution. Furthermore, it can also fail when there are points in one dataset with no corresponding matches in the other dataset. The proposed method automatically finds an initial alignment close to the global optimal by using the medial structure of the datasets. For this purpose, we first compute the medial scaffold of a 3D dataset: a 3D graph made of special shock curves linking special shock nodes. This medial scaffold is then regularized exploiting the known transitions of the 3D medial axis under deformation or perturbation of the input data. The resulting simplified medial scaffolds are then registered using a modified graduated assignment graph matching algorithm. The proposed method shows robustness to noise, shape deformations, and varying surface sampling densities.","PeriodicalId":191172,"journal":{"name":"Proceedings. 2nd International Symposium on 3D Data Processing, Visualization and Transmission, 2004. 3DPVT 2004.","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133874844","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Disordered patterns projection for 3D motion recovering","authors":"A. Adán, F. Molina, Luis Morena","doi":"10.1109/TDPVT.2004.1335204","DOIUrl":"https://doi.org/10.1109/TDPVT.2004.1335204","url":null,"abstract":"We present a new color structured light technique based on a disordered codeword strategy. The aim of this method is to recover 3D information in moving scenes in such a way that the correspondence problem is easily and robustly solved. With this goal in mind a six-connectivity topology has been introduced in our pattern and color features have been inserted on it. Repetition and disorder are allowed in the codeword which implies that the Hamming distance between contiguous codewords increases. As a consequence of that, code loss circumstances can be efficiently handled. Additionally, computational cost in the code recovering phase is highly reduced since codewords are defined as sets. A structured light projection system has been built in our lab and a wide test under real moving conditions has been carried out. This experimentation has been performed on medium resolution and for slow movements specifications giving promising results.","PeriodicalId":191172,"journal":{"name":"Proceedings. 2nd International Symposium on 3D Data Processing, Visualization and Transmission, 2004. 3DPVT 2004.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127730400","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}