Proceedings Article10.1109/ICPR.2006.1012
Robust Object Segmentation Using Graph Cut with Object and Background Seed Estimation
Jung-Ho Ahn,Kil-Cheon Kim,Hyeran Byun +2 more
- 20 Aug 2006
- Vol. 2, pp 361-364
16
TL;DR: A new robust way of extracting accurate human silhouettes indoors with an active stereo camera is proposed by fusing color, stereo matching information and image segmentation methods to infer the parts of object and background areas of high confidence.
read more
Abstract: In this paper we propose a new robust way of extracting accurate human silhouettes indoors with an active stereo camera. We first infer the parts of object and background areas of high confidence by fusing color, stereo matching information and image segmentation methods. Then the inferred areas (seeds) are incorporated in a graph cut. The experimental results were presented with image sequences taken with pan-tilt stereo camera. Our proposed algorithms were evaluated with respect to the ground truth data. We proved that our algorithms can outperform other methods that are based on either color/contrast or stereo/contrast principles alone
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
StereoCut: Consistent interactive object selection in stereo image pairs
Brian Price,Scott Cohen +1 more
- 06 Nov 2011
TL;DR: This paper introduces a framework for interactively selecting objects in two stereo images simultaneously using graph cut using the use of stereo correspondence probability distributions to govern the strength of the connection between the two images.
33
Interactive RGB-D Image Segmentation Using Hierarchical Graph Cut and Geodesic Distance
Ling Ge,Ran Ju,Tongwei Ren,Gangshan Wu +3 more
- 16 Sep 2015
TL;DR: This paper utilizes Euclidean distance on RGB space and geodesic distance on 3D space to measure how likely a pixel belongs to foreground or background in color and depth respectively, and integrates the color cue and depth cue into a unified Graph Cut framework to obtain the optimal segmentation result.
25
D - Clutter: Building object model library from unsupervised segmentation of cluttered scenes
Gowri Somanath,M. V. Rohith,Dmitris Metaxas,Chandra Kambhamettu +3 more
- 20 Jun 2009
TL;DR: A solution to the following question: given a collection of images where each object appears in one or more images and multiple objects occur in each image, how best can the authors extract the boundaries of the different objects?
21
Human tracking and silhouette extraction for human–robot interaction systems
TL;DR: The proposed integrated computer vision system designed to track multiple human beings and extract their silhouette with a pan-tilt stereo camera can assist in gesture and gait recognition in the field of Human–Robot Interaction (HRI).
20
Patent
Object Selection in Stereo Image Pairs
Scott Cohen,Brian Price +1 more
- 28 Jul 2011
TL;DR: In this article, the authors defined a boundary of the region and a corresponding boundary of a corresponding region of another digital image based on the input data, content of the digital image, and content of a stereo image pair.
18
References
Mean shift: a robust approach toward feature space analysis
Dorin Comaniciu,Peter Meer +1 more
TL;DR: It is proved the convergence of a recursive mean shift procedure to the nearest stationary point of the underlying density function and, thus, its utility in detecting the modes of the density.
12.9K
Adaptive background mixture models for real-time tracking
Chris Stauffer,W.E.L. Grimson +1 more
- 23 Jun 1999
TL;DR: This paper discusses modeling each pixel as a mixture of Gaussians and using an on-line approximation to update the model, resulting in a stable, real-time outdoor tracker which reliably deals with lighting changes, repetitive motions from clutter, and long-term scene changes.
"GrabCut": interactive foreground extraction using iterated graph cuts
Carsten Rother,Vladimir Kolmogorov,Andrew Blake +2 more
- 01 Aug 2004
TL;DR: A more powerful, iterative version of the optimisation of the graph-cut approach is developed and the power of the iterative algorithm is used to simplify substantially the user interaction needed for a given quality of result.
An experimental comparison of min-cut/max- flow algorithms for energy minimization in vision
Yuri Boykov,Vladimir Kolmogorov +1 more
TL;DR: This paper compares the running times of several standard algorithms, as well as a new algorithm that is recently developed that works several times faster than any of the other methods, making near real-time performance possible.
An Experimental Comparison of Min-cut/Max-flow Algorithms for Energy Minimization in Vision
Yuri Boykov,Vladimir Kolmogorov +1 more
- 03 Sep 2001
TL;DR: The goal of this paper is to provide an experimental comparison of the efficiency of min-cut/max flow algorithms for applications in vision, comparing the running times of several standard algorithms, as well as a new algorithm that is recently developed.