loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
XVIII Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI'05)
Object Detection by K-Connected Seed Competition
Natal, Rio Grande do Norte, Brazil
October 09-October 12
ISBN: 0-7695-2389-7
Alexandre X. Falcão, State University of Campinas
Paulo A. V. Miranda, State University of Campinas
Anderson Rocha, State University of Campinas
Felipe P. G. Bergo, State University of Campinas
The notion of "strength of connectedness" between pixels has been successfully used in image segmentation. We present an extension to these works, which can considerably increase the efficiency of object definition tasks. A set of pixels is said a ?-connected component with respect to a seed pixel when the strength of connectedness of any pixel in that set with respect to the seed is higher than or equal to a threshold. While the previous approaches either assume no competition with a single threshold for all seeds or eliminate the threshold for seed competition, we found that seed competition with different thresholds can reduce the number of seeds and the need for user interaction during segmentation. We also propose automatic and user-friendly interactive methods for determining the thresholds. The improvements are demonstrated through several segmentation experiments involving medical images.
Citation:
Alexandre X. Falcão, Paulo A. V. Miranda, Anderson Rocha, Felipe P. G. Bergo, "Object Detection by K-Connected Seed Competition," sibgrapi, pp.97-104, XVIII Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.