Computer Science – Computer Vision and Pattern Recognition
Scientific paper
2012-01-13
Computer Science
Computer Vision and Pattern Recognition
Since it's an unlucky failure about length-limit violation, I'd like to save it on arXiv as a record. Any suggestions are welc
Scientific paper
Solving the Maximum a Posteriori on Markov Random Field, MRF-MAP, is a prevailing method in recent interactive image segmentation tools. Although mathematically explicit in its computational targets, and impressive for the segmentation quality, MRF-MAP is hard to accomplish without the interactive information from users. So it is rarely adopted in the automatic style up to today. In this paper, we present an automatic image segmentation algorithm, NegCut, based on the approximation to MRF-MAP. First we prove MRF-MAP is NP-hard when the probabilistic models are unknown, and then present an approximation function in the form of minimum cuts on graphs with negative weights. Finally, the binary segmentation is taken from the largest eigenvector of the target matrix, with a tuned version of the Lanczos eigensolver. It is shown competitive at the segmentation quality in our experiments.
No associations
LandOfFree
NegCut: Automatic Image Segmentation based on MRF-MAP 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 NegCut: Automatic Image Segmentation based on MRF-MAP, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and NegCut: Automatic Image Segmentation based on MRF-MAP will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-472172