A segmentation and model-reconstruction algorithm is proposed based on polynomial approximation and on a new version of the “region growing” methodology. First, an initial partition is calculated on the basis of differential-geometric properties of the range image. Then, the first merging procedure is applied (“merge with constraints”) aiming at correctly identifying principal surfaces of the model. It examines all possible mergers of regions and selects those satisfying strict compatibility constraints. The second merging procedure relaxes these constraints to produce the “extended” regions and surfaces of the final segmentation. Theoretical work is presented proving the consistency of these merging procedures. Finally, application of the algorithm on industrial data is presented demonstrating the efficiency of the proposed methodology.
A Fit-and-Merge Algorithm for Range-Image Segmentation and Model Reconstruction
Contributed by the Engineering Simulation and Visualization Committee for publication in the JOURNAL OF COMPUTING AND INFORMATION SCIENCE IN ENGINEERING. Manuscript received Sept. 2002; Revised Nov. 2002. Associate Editor: N. Patrikalakis and K. Lee.
- Views Icon Views
- Share Icon Share
- Cite Icon Cite
- Search Site
Djebali , M., Melkemi, M., and Sapidis, N. (March 26, 2003). "A Fit-and-Merge Algorithm for Range-Image Segmentation and Model Reconstruction ." ASME. J. Comput. Inf. Sci. Eng. December 2002; 2(4): 285–293. https://doi.org/10.1115/1.1542637
Download citation file:
- Ris (Zotero)
- Reference Manager