31 search results - page 6 / 7 » A Unified Formulation of Invariant Point Pattern Matching |
100
click to vote
Book
Markov random field (MRF) theory provides a basis for modeling contextual constraints in visual processing and interpretation. It enables us to develop optimal vision algorithms sy...
PR
2008
13 years 7 months ago
2008
The spectrum of a graph has been widely used in graph theory to characterise the properties of a graph and extract information from its structure. It has also been employed as a g...
CVPR
2011
IEEE
12 years 11 months ago
2011
IEEE
Document registration is a problem where the image of a template document whose layout is known is registered with a test document image. Given the registration parameters, layout...
ICA
2012
Springer
12 years 3 months ago
2012
Springer
A novel tensor decomposition called pattern or P-decomposition is proposed to make it possible to identify replicating structures in complex data, such as textures and patterns in ...
JFP
2006
13 years 7 months ago
2006
Even in statically typed languages it is useful to have certain invariants checked dynamically. Findler and Felleisen gave an algorithm for dynamically checking expressive highero...