Sciweavers

Share
MVA
2007

Fast Graph Segmentation Based on Statistical Aggregation Phenomena

9 years 9 months ago
Fast Graph Segmentation Based on Statistical Aggregation Phenomena
In this paper, we first generalize a recent statistical color image segmentation algorithm [5] to arbitrary graphs, and report its performance for 2D images, 3D meshes and volume data. We then describe a fast pre-segmentation to the main graph procedure that allows us to further speed-up the segmentation by a factor of ×2 to ×4, without decreasing significantly the quality of segmentations. As an application, we built a realtime video segmentation that is robust enough to be used in camera-driven user interfaces and robotics applications.
Frank Nielsen, Richard Nock
Added 30 Oct 2010
Updated 30 Oct 2010
Type Conference
Year 2007
Where MVA
Authors Frank Nielsen, Richard Nock
Comments (0)
books