Sciweavers

270 search results - page 49 / 54
» Graph Cuts and Efficient N-D Image Segmentation
Sort
View
PAMI
2007
196views more  PAMI 2007»
13 years 7 months ago
Clustering and Embedding Using Commute Times
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...
Huaijun Qiu, Edwin R. Hancock
ICIP
2006
IEEE
14 years 9 months ago
A New Method for Boundary-Based Shape Matching and Retrieval
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...
Minh-Son Dao, Raffaele de Amicis
ICPR
2006
IEEE
14 years 8 months ago
Finding Text in Natural Scenes by Figure-Ground Segmentation
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...
Huiying Shen, James Coughlan
ICIP
2009
IEEE
13 years 5 months ago
Graph-based foreground extraction in extended color space
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...
Hansung Kim, Adrian Hilton
ACIVS
2008
Springer
14 years 1 months ago
Scene Reconstruction Using MRF Optimization with Image Content Adaptive Energy Functions
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 ...
Ping Li, Rene Klein Gunnewiek, Peter H. N. de With