By Topic

On region merging: the statistical soundness of fast sorting, with applications

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
F. Nielsen ; FRL, Sony CS Labs., Tokyo, Japan ; R. Nock

This work explores a statistical basis for a process often described in computer vision: image segmentation by region merging following a particular order in the choice of regions. We exhibit a particular blend of algorithmics and statistics whose error is, as we formally show, close to the best possible. This approach can be approximated in a very fast segmentation algorithm for processing images described using most common numerical feature spaces. Simple modifications of the algorithm allow us to cope with occlusions and/or hard noise levels. Experiments on grey-level and color images, obtained with a short C-code, display the quality of the segmentations obtained.

Published in:

Computer Vision and Pattern Recognition, 2003. Proceedings. 2003 IEEE Computer Society Conference on  (Volume:2 )

Date of Conference:

18-20 June 2003