Sciweavers

2031 search results - page 215 / 407
» On Tree-Constrained Matchings and Generalizations
Sort
View
95
Voted
SODA
2012
ACM
205views Algorithms» more  SODA 2012»
13 years 1 months ago
Global minimum cuts in surface embedded graphs
We give a deterministic algorithm to find the minimum cut in a surface-embedded graph in near-linear time. Given an undirected graph embedded on an orientable surface of genus g,...
Jeff Erickson, Kyle Fox, Amir Nayyeri
106
Voted
CVPR
2012
IEEE
13 years 1 months ago
Cross-based local multipoint filtering
This paper presents a cross-based framework of performing local multipoint filtering efficiently. We formulate the filtering process as a local multipoint regression problem, c...
Jiangbo Lu, Keyang Shi, Dongbo Min, Liang Lin, Min...
103
Voted
CVPR
2012
IEEE
13 years 1 months ago
Intrinsic shape context descriptors for deformable shapes
In this work, we present intrinsic shape context (ISC) descriptors for 3D shapes. We generalize to surfaces the polar sampling of the image domain used in shape contexts: for this...
Iasonas Kokkinos, Michael M. Bronstein, Roee Litma...
CVPR
2012
IEEE
13 years 1 months ago
A codebook-free and annotation-free approach for fine-grained image categorization
Fine-grained categorization refers to the task of classifying objects that belong to the same basic-level class (e.g. different bird species) and share similar shape or visual app...
Bangpeng Yao, Gary R. Bradski, Fei-Fei Li
115
Voted
CVPR
2012
IEEE
13 years 1 months ago
FREAK: Fast Retina Keypoint
A large number of vision applications rely on matching keypoints across images. The last decade featured an arms-race towards faster and more robust keypoints and association algo...
Alexandre Alahi, Raphael Ortiz, Pierre Vandergheyn...