Sciweavers

39 search results - page 2 / 8
» The Pyramid Match: Efficient Learning with Partial Correspon...
Sort
View
ICCV
2005
IEEE
14 years 7 months ago
The Pyramid Match Kernel: Discriminative Classification with Sets of Image Features
Discriminative learning is challenging when examples are sets of features, and the sets vary in cardinality and lack any sort of meaningful ordering. Kernel-based classification m...
Kristen Grauman, Trevor Darrell
AAAI
2008
13 years 7 months ago
Dimension Amnesic Pyramid Match Kernel
With the success of local features in object recognition, feature-set representations are widely used in computer vision and related domains. Pyramid match kernel (PMK) is an effi...
Yi Liu, Xulei Wang, Hongbin Zha
ECCV
2010
Springer
13 years 5 months ago
Efficient Computation of Scale-Space Features for Deformable Shape Correspondences
Abstract. With the rapid development of fast data acquisition techniques, 3D scans that record the geometric and photometric information of deformable objects are routinely acquire...
Tingbo Hou, Hong Qin
ICCV
2009
IEEE
14 years 10 months ago
Optimal Correspondences from Pairwise Constraints
Correspondence problems are of great importance in computer vision. They appear as subtasks in many applications such as object recognition, merging partial 3D reconstructions a...
Olof Enqvist, Klas Josephson, Fredrik Kahl
PAMI
2006
191views more  PAMI 2006»
13 years 5 months ago
Principal Axis-Based Correspondence between Multiple Cameras for People Tracking
Visual surveillance using multiple cameras has attracted increasing interest in recent years. Correspondence between multiple cameras is one of the most important and basic problem...
Weiming Hu, Min Hu, Xue Zhou, Tieniu Tan, Jianguan...