“Ratio regions”: a technique for image segmentation
Cox, I.J.
Rao, S.B.
Yu Zhong
NEC Res. Inst., Princeton, NJ;
This paper appears in: Pattern Recognition, 1996., Proceedings of the 13th International Conference on
Publication Date: 25-29 Aug 1996
Volume: 2,
On page(s): 557-564 vol.2
Meeting Date: 08/25/1996 - 08/29/1996
Location: Vienna, Austria
ISBN: 0-8186-7282-X
References Cited: 16
INSPEC Accession Number: 5443865
Digital Object Identifier: 10.1109/ICPR.1996.546886
Current Version Published: 2002-08-06
Abstract
We develop a image segmentation algorithm in which the segmented
region has both an exterior boundary cost and an interior benefit
associated with it. Our segmentation method proceeds by minimizing the
ratio between the exterior boundary cost and the enclosed interior
benefit using a computationally efficient graph partitioning algorithm.
Our interest is motivated by very efficient algorithms for finding the
globally optimum solution, and a desire to investigate how weak
smoothness constraints may be globally imposed without disallowing very
high local curvature. We analyze the performance of the approach,
indicating both strengths and weaknesses, and discuss its connections
with prior image partitioning algorithms. The relationship with snakes
is discussed in detail and it is shown how to efficiently compute an
approximation to common snakes under the additional constraint that it
enclose a given point. When user interaction is available, there is a
clear advantage to minimizing user interaction for purposes of improved
speed and ease of use and for robustness. “Ratio regions”
can accommodate several levels of user interaction and it is empirically
shown that very coarse initializations can be tolerated. User
interaction not only guides the algorithm to perceptually salient
regions but can also be exploited to significantly reduce the
computational cost
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.