Sciweavers

1525 search results - page 35 / 305
» Matching with Regular Constraints
Sort
View
VMV
2001
161views Visualization» more  VMV 2001»
15 years 4 months ago
Regularized Quadrature Filters for Local Frequency Estimation: Application to Multimodal Volume Image Registration
Multimodal image registration is a fundamental problem in medical image analysis. In this paper, we propose a novel algorithm to compute the local frequency representations of the...
Jundong Liu
CVPR
2005
IEEE
16 years 5 months ago
Optimal Point Correspondence through the Use of Rank Constraints
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...
João Costeira, João Xavier, Ricardo ...
ACL
2011
14 years 7 months ago
In-domain Relation Discovery with Meta-constraints via Posterior Regularization
We present a novel approach to discovering relations and their instantiations from a collection of documents in a single domain. Our approach learns relation types by exploiting m...
Harr Chen, Edward Benson, Tahira Naseem, Regina Ba...
CORR
2008
Springer
79views Education» more  CORR 2008»
15 years 3 months ago
Free Distance Bounds for Protograph-Based Regular LDPC Convolutional Codes
In this paper asymptotic methods are used to form lower bounds on the free distance to constraint length ratio of several ensembles of regular, asymptotically good, protographbased...
David G. M. Mitchell, Ali Emre Pusane, Norbert Goe...
130
Voted
CORR
2008
Springer
153views Education» more  CORR 2008»
15 years 3 months ago
Decomposition Techniques for Subgraph Matching
In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For suc...
Stéphane Zampelli, Martin Mann, Yves Devill...