Sciweavers

570 search results - page 14 / 114
» A Connectivity Constraint Using Bridges
Sort
View
ICCV
2005
IEEE
15 years 11 months ago
A Spectral Technique for Correspondence Problems Using Pairwise Constraints
We present an efficient spectral method for finding consistent correspondences between two sets of features. We build the adjacency matrix M of a graph whose nodes represent the p...
Marius Leordeanu, Martial Hebert
111
Voted
FPGA
2008
ACM
151views FPGA» more  FPGA 2008»
14 years 11 months ago
Beyond the arithmetic constraint: depth-optimal mapping of logic chains in LUT-based FPGAs
Look-up table based FPGAs have migrated from a niche technology for design prototyping to a valuable end-product component and, in some cases, a replacement for general purpose pr...
Michael T. Frederick, Arun K. Somani
CVPR
2007
IEEE
15 years 11 months ago
Efficient Belief Propagation for Vision Using Linear Constraint Nodes
Belief propagation over pairwise connected Markov Random Fields has become a widely used approach, and has been successfully applied to several important computer vision problems....
Brian Potetz
ICPR
2008
IEEE
15 years 10 months ago
Object localization using affine invariant substructure constraints
In this paper we propose a novel method for generic object localization. The method is based on modeling the object as a graph at two levels: a local substructural representation ...
Ahmed M. Elgammal, Ishani Chakraborty
76
Voted
CGF
2010
99views more  CGF 2010»
14 years 9 months ago
Trivial Connections on Discrete Surfaces
This paper presents a straightforward algorithm for constructing connections on discrete surfaces that are as smooth as possible everywhere but on a set of isolated singularities ...
Keenan Crane, Mathieu Desbrun, Peter Schröder