Image Segmentation by Discounted Cumulative Ranking on Maximal Cliques

Details Image Segmentation by Discounted Cumulative Ranking on Maximal Cliques Image Segmentation by Discounted Cumulative Ranking on Maximal Cliques

2010-09-24

arxiv.org/abs/1009.4823v1

Computer Science

Computer Vision and Pattern Recognition

11 pages, 5 figures

Scientific paper

We propose a mid-level image segmentation framework that combines multiple figure-ground hypothesis (FG) constrained at different locations and scales, into interpretations that tile the entire image. The problem is cast as optimization over sets of maximal cliques sampled from the graph connecting non-overlapping, putative figure-ground segment hypotheses. Potential functions over cliques combine unary Gestalt-based figure quality scores and pairwise compatibilities among spatially neighboring segments, constrained by T-junctions and the boundary interface statistics resulting from projections of real 3d scenes. Learning the model parameters is formulated as rank optimization, alternating between sampling image tilings and optimizing their potential function parameters. State of the art results are reported on both the Berkeley and the VOC2009 segmentation dataset, where a 28% improvement was achieved.

Affiliated with

Also associated with

No associations

Rating

Image Segmentation by Discounted Cumulative Ranking on Maximal Cliques does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Image Segmentation by Discounted Cumulative Ranking on Maximal Cliques, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Image Segmentation by Discounted Cumulative Ranking on Maximal Cliques will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-274340