Sciweavers

6005 search results - page 226 / 1201
» Graph-Theoretical Methods in Computer Vision
Sort
View
CVPR
2011
IEEE
15 years 1 months ago
Blind Deconvolution Using A Normalized Sparsity Measure
Blind image deconvolution is an ill-posed problem that requires regularization to solve. However, many common forms of image prior used in this setting have a major drawback in th...
Dilip Krishnan, Rob Fergus
279
Voted
ACCV
2010
Springer
15 years 1 months ago
Planar Affine Rectification from Change of Scale
A method for affine rectification of a plane exploiting knowledge of relative scale changes is presented. The rectifying transformation is fully specified by the relative scale cha...
Ondrej Chum, Jiri Matas
CVPR
2012
IEEE
13 years 8 months ago
Spherical hashing
Many binary code encoding schemes based on hashing have been actively studied recently, since they can provide efficient similarity search, especially nearest neighbor search, an...
Jae-Pil Heo, Youngwoon Lee, Junfeng He, Shih-Fu Ch...
CVPR
2009
IEEE
17 years 1 months ago
Unsupervised Learning for Graph Matching
Graph matching is an important problem in computer vision. It is used in 2D and 3D object matching and recognition. Despite its importance, there is little literature on learnin...
Marius Leordeanu, Martial Hebert
CVPR
2001
IEEE
16 years 8 months ago
Feature Reduction and Hierarchy of Classifiers for Fast Object Detection in Video Images
We present a two-step method to speed-up object detection systems in computer vision that use Support Vector Machines (SVMs) as classifiers. In a first step we perform feature red...
Bernd Heisele, Thomas Serre, Sayan Mukherjee, Toma...