270 search results - page 49 / 54 » Graph Cuts and Efficient N-D Image Segmentation |
115
click to vote
PAMI
2007
14 years 11 months ago
2007
This paper exploits the properties of the commute time between nodes of a graph for the purposes of clustering and embedding, and explores its applications to image segmentation a...
84
Voted
ICIP
2006
IEEE
16 years 1 months ago
2006
IEEE
This paper presents a novel method for efficient boundary based shapes matching and retrieval in presence of occlusion. In this method, the geometric and topological information o...
ICPR
2006
IEEE
16 years 21 days ago
2006
IEEE
Much past research on finding text in natural scenes uses bottom-up grouping processes to detect candidate text features as a first processing step. While such grouping procedures...
ICIP
2009
IEEE
14 years 9 months ago
2009
IEEE
We propose a region-based method to extract semantic foreground regions from color video sequences with static backgrounds. First, we introduce a new distance measure for backgrou...
ACIVS
2008
Springer
15 years 6 months ago
2008
Springer
Multi-view scene reconstruction from multiple uncalibrated images can be solved by two stages of processing: first, a sparse reconstruction using Structure From Motion (SFM), and ...