DocumentCode
2583851
Title
The 2.1-D sketch
Author
Nitzberg, Mark ; Mumford, David
Author_Institution
Div. of Appl. Sci., Harvard Univ., Cambridge, MA, USA
fYear
1990
fDate
4-7 Dec 1990
Firstpage
138
Lastpage
144
Abstract
A model is described for image segmentation that tries to capture the low-level depth reconstruction exhibited in early human vision, giving an important role to edge terminations. The problem is to find a decomposition of the domain D of an image that has a minimum of disrupted edges-junctions of edges, crack tips, corners, and cusps-by creating suitable continuations for the disrupted edges behind occluding regions. The result is a decomposition of D into overlapping regions R 1∪. . .∪R n ordered by occlusion, which is called the 2.1-D sketch. Expressed as a minimization problem, the model gives rise to a family of optimal contours, called nonlinear splines, that minimize length and the square of curvature. These are essential in the construction of the 2.1-D sketch of an image, as the continuations of disrupted edges. An algorithm is described that constructs the 2.1-D sketch of an image, and gives results for several example images. The algorithm yields the same interpretations of optical illusions as the human visual system
Keywords
computer vision; computerised picture processing; minimisation; 2.1-D sketch; corners; crack tips; cusps; depth reconstruction; disrupted edges; edge junctions; edge terminations; human vision; human visual system; image segmentation; minimization problem; nonlinear splines; occluding regions; optical illusions; optimal contours; square of curvature; Blades; Electronic mail; Humans; Image segmentation; Information resources; Layout; Lenses; Military computing; Motion estimation; Visual system;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Vision, 1990. Proceedings, Third International Conference on
Conference_Location
Osaka
Print_ISBN
0-8186-2057-9
Type
conf
DOI
10.1109/ICCV.1990.139511
Filename
139511
Link To Document