Constrained contouring in polar coordinates

Author

Revankar, Shriram ; Sher, David

Author_Institution

XEROX Corp., Webster, NY, USA

fYear

1993

fDate

15-17 Jun 1993

Firstpage

688

Lastpage

689

Abstract

A constrained contour is an outline of a region of interest, obtained by linking the possible edge points under the constraints of connectivity, smoothness, image context, and an externally specified approximate contour. A constrained contouring algorithm in polar coordinates that traces closed contours using their rough approximations is discussed. A set of locally optimal contour locations (LOCLs) is found in all the selected radial directions by analyzing the image features and the external constraints. A graph search based algorithm is used to select a smooth contour that passes through the maximum number of LOCLs

Keywords

edge detection; graph theory; image processing; optimisation; search problems; connectivity; constrained contour; edge detection; graph search; image context; image features; image processing; locally optimal contour locations; polar coordinates; rough approximations; smoothness; Algorithm design and analysis; Brightness; Deformable models; Humans; Image analysis; Image motion analysis; Joining processes; Motion analysis; Shape; Shearing;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Vision and Pattern Recognition, 1993. Proceedings CVPR '93., 1993 IEEE Computer Society Conference on

Conference_Location

New York, NY

ISSN

1063-6919

Print_ISBN

0-8186-3880-X

Type

conf

DOI

10.1109/CVPR.1993.341026

Filename

341026