Better Foreground Segmentation Through Graph Cuts

Details Better Foreground Segmentation Through Graph Cuts Better Foreground Segmentation Through Graph Cuts

2004-01-21

arxiv.org/abs/cs/0401017v2

Computer Science

Computer Vision and Pattern Recognition

8 pages, 110 figures. Revision: Added web link to downloadable Matlab implementation

Scientific paper

For many tracking and surveillance applications, background subtraction provides an effective means of segmenting objects moving in front of a static background. Researchers have traditionally used combinations of morphological operations to remove the noise inherent in the background-subtracted result. Such techniques can effectively isolate foreground objects, but tend to lose fidelity around the borders of the segmentation, especially for noisy input. This paper explores the use of a minimum graph cut algorithm to segment the foreground, resulting in qualitatively and quantitiatively cleaner segmentations. Experiments on both artificial and real data show that the graph-based method reduces the error around segmented foreground objects. A MATLAB code implementation is available at http://www.cs.smith.edu/~nhowe/research/code/#fgseg

Affiliated with

Also associated with

No associations

Rating

Better Foreground Segmentation Through Graph Cuts 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 Better Foreground Segmentation Through Graph Cuts, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Better Foreground Segmentation Through Graph Cuts will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-384929