|
ABSTRACT
Sculptural reliefs are widely used in various industries for purposes such as applying brands to packaging and decorating porcelain. In order to easily apply reliefs to CAD models, it is often desirable to reverse-engineer previously designed and manufactured reliefs. 3D scanners can generate triangle meshes from objects with reliefs; however, previous mesh segmentation work has not considered the particular problem of separation of reliefs from background. We consider here the specific case of segmenting a simple relief delimited by a single outer contour, which lies on a smooth, slowly varying background. Generally, such reliefs meet the surrounding surface in a small step, enabling us to devise a specific method for such relief segmentation.We find the boundary between the background and the relief using an adaptive snake. It starts at a simple user-drawn contour, and is driven inwards by a collapsing force until it matches the relief's boundary. Our method is insensitive to the choice of the initial contour. The snake's limiting position is controlled by a feature energy term designed to find a step. A refinement strategy is then used to drive the snake into concavities of the relief contour.We demonstrate operation of our algorithm using real scanned models with different relief contour shapes and triangle meshes with different resolutions.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
| |
2
|
Bischoff, S., Weyand, T., and Kobbelt, L. 2005. Snakes on triangle meshes. http://www-i8.informatik.rwth-aachen.de/publications/publications.html.
|
| |
3
|
|
| |
4
|
|
 |
5
|
|
 |
6
|
Thomas Funkhouser , Michael Kazhdan , Philip Shilane , Patrick Min , William Kiefer , Ayellet Tal , Szymon Rusinkiewicz , David Dobkin, Modeling by example, ACM Transactions on Graphics (TOG), v.23 n.3, August 2004
|
| |
7
|
|
| |
8
|
Kanai, T., and Suzuki, H. 2001. Approximate shortest path on a polyhedral surface and its applications. Computer-Aided Design 33, 11, 801--811.
|
| |
9
|
Kass, M., Witkin, A., and Terzopoulos, D. 1988. Snakes: Active contour models. International Journal of Computer Vision 1, 4, 321--331.
|
| |
10
|
Kimmel, R., and Sethian, J. A. 1998. Computing geodesic paths on manifolds. Proceedings of National Academy of Sciences 1995 15, 8431--8435.
|
| |
11
|
Lee, Y., and Lee, S. 2002. Geometric snakes for triangular meshes. Computer Graphics Forum 21, 3, 229--238.
|
| |
12
|
Milroy, M. J., Bradley, C., and Vickers, G. W. 1997. Segmentation of a wrap-around model using an active contour. Computer-Aided Design 29, 4, 299--320.
|
| |
13
|
Surazhsky, V., Surazhsky, T., Kirsanovand, D., Gortler, S., and Hoppe, H. 2005. Fast exact and approximate geodesics on meshes. Proceedings of ACM SIGGRAPH 2005 24, 553--560.
|
| |
14
|
|
| |
15
|
|
| |
16
|
Xu, C., and Prince, J. L. 1998. Snakes, shapes, and gradient vector flow. IEEE Trans. Image Processing 7, 3, 359--369.
|
|