loading...
Image Segmentation Through Energy Minimization Based Subspace Fusion
Cambridge UK August 23-August 26
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICPR.2004.133407617th International Conference on Patt ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Jason J. Corso, The Johns Hopkins University, Baltimore, MD
Maneesh Dewan, The Johns Hopkins University, Baltimore, MD
Gregory D. Hager, The Johns Hopkins University, Baltimore, MD
In this paper we present an image segmentation technique that fuses contributions from multiple feature subspaces using an energy minimization approach. For each subspace, we compute a per-pixel quality measure and perform a partitioning through the standard normalized cut algorithm [Normalized Cuts and Image Segmentation]. To fuse the subspaces into a final segmentation, we compute a subspace label for every pixel. The labeling is computed through the graph-cut energy minimization framework proposed by [Fast Approximate Energy Minimization via Graph Cuts]. Finally, we combine the initial subspace segmentation with the subspace labels obtained from the energy minimization to yield the final segmentation. We have implemented the algorithm and provide results for both synthetic and real images.
Citation:
Jason J. Corso, Maneesh Dewan, Gregory D. Hager, "Image Segmentation Through Energy Minimization Based Subspace Fusion," icpr, vol. 2, pp.120-123, 17th International Conference on Pattern Recognition (ICPR'04) - Volume 2, 2004
Usage of this product signifies your acceptance of the Terms of Use.