Sciweavers

2105 search results - page 387 / 421
» Graph Based Image Matching
Sort
View
3DIM
2011
IEEE
12 years 9 months ago
Sampling Relevant Points for Surface Registration
—Surface registration is a fundamental step in the reconstruction of three-dimensional objects. This is typically a two-step process where an initial coarse motion estimation is ...
Andrea Torsello, Emanuele Rodolà, Andrea Al...
3DIM
2011
IEEE
12 years 9 months ago
6DoF Registration of 2D Laser Scans
—We address the problem of registering a set of 2D laser scans in 3D space with regard to six degrees of freedom. Registering single 2D scans is only possible when making strong ...
Benjamin Huhle, Timo Schairer, Andreas Schilling, ...
CVPR
2012
IEEE
12 years 7 days ago
Locality-constrained and spatially regularized coding for scene categorization
Improving coding and spatial pooling for bag-of-words based feature design have gained a lot of attention in recent works addressing object recognition and scene classification. ...
Aymen Shabou, Hervé Le Borgne
ICALP
2010
Springer
14 years 2 months ago
On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
Venkatesan Guruswami, Rishi Saket
FPGA
2010
ACM
232views FPGA» more  FPGA 2010»
13 years 10 months ago
High-throughput bayesian computing machine with reconfigurable hardware
We use reconfigurable hardware to construct a high throughput Bayesian computing machine (BCM) capable of evaluating probabilistic networks with arbitrary DAG (directed acyclic gr...
Mingjie Lin, Ilia Lebedev, John Wawrzynek