40 search results - page 3 / 8 » Combinatorial Laplacian of the Matching Complex |
LATIN
2004
Springer
13 years 10 months ago
2004
Springer
We address the problem of searching for a two-dimensional pattern in a two-dimensional text (or image), such that the pattern can be found even if it appears rotated and it is bri...
CVPR
2005
IEEE
14 years 7 months ago
2005
IEEE
We propose a solution to the n-frame correspondence problem under the factorization framework. During the matching process, our algorithm takes explicitly into account the geometr...
DCG
2007
13 years 5 months ago
2007
Motivated by Gauss’s first proof of the Fundamental Theorem of Algebra, we study the topology of harmonic algebraic curves. By the maximum principle, a harmonic curve has no bou...
ICRA
2010
IEEE
13 years 3 months ago
2010
IEEE
— In this note, we present initial results towards developing a distributed algorithm for repairing topological holes in the sensor cover of a mobile robot team. Central to our a...
EMMCVPR
2001
Springer
13 years 9 months ago
2001
Springer
The interest of graph matching techniques in the pattern recognition field is increasing due to the versatility of representing knowledge in the form of graphs. However, the size ...