Sciweavers

1190 search results - page 105 / 238
» Complex Salient Regions for Computer Vision Problems
Sort
View
64
Voted
ICPR
2002
IEEE
15 years 11 months ago
A Fast Leading Eigenvector Approximation for Segmentation and Grouping
We present a fast non-iterative method for approximating the leading eigenvector so as to render graph-spectral based grouping algorithms more efficient. The approximation is base...
Antonio Robles-Kelly, Sudeep Sarkar, Edwin R. Hanc...
ECCV
2004
Springer
16 years 1 days ago
A Constrained Semi-supervised Learning Approach to Data Association
Data association (obtaining correspondences) is a ubiquitous problem in computer vision. It appears when matching image features across multiple images, matching image features to ...
Hendrik Kück, Nando de Freitas, Peter Carbone...
ICCV
2011
IEEE
13 years 10 months ago
Latent Low-Rank Representation for Subspace Segmentation and Feature Extraction
Low-Rank Representation (LRR) [16, 17] is an effective method for exploring the multiple subspace structures of data. Usually, the observed data matrix itself is chosen as the dic...
Guangcan Liu, Shuicheng Yan
ECCV
2002
Springer
16 years 18 hour ago
Learning Shape from Defocus
We present a novel method for inferring three-dimensional shape from a collection of defocused images. It is based on the observation that defocused images are the null-space of ce...
Paolo Favaro, Stefano Soatto
CVPR
2006
IEEE
16 years 5 days ago
Extracting Subimages of an Unknown Category from a Set of Images
Suppose a set of images contains frequent occurrences of objects from an unknown category. This paper is aimed at simultaneously solving the following related problems: (1) unsupe...
Sinisa Todorovic, Narendra Ahuja