Sciweavers

1525 search results - page 22 / 305
» Matching with Regular Constraints
Sort
View
ICPR
2010
IEEE
13 years 10 months ago
Triangle-Constraint for Finding More Good Features
We present a novel method for finding more good feature pairs between two sets of features. We first select matched features by Bi-matching method as seed points, then organize th...
Xiaojie Guo, Xiaochun Cao
MSCS
2007
91views more  MSCS 2007»
13 years 7 months ago
A rewriting calculus for cyclic higher-order term graphs
Introduced at the end of the nineties, the Rewriting Calculus (ρ-calculus, for short) is a simple calculus that fully integrates term-rewriting and λ-calculus. The rewrite rules...
Paolo Baldan, Clara Bertolissi, Horatiu Cirstea, C...
CP
2006
Springer
13 years 11 months ago
The Theory of Grammar Constraints
Abstract. By introducing the Regular Membership Constraint, Gilles Pesant pioneered the idea of basing constraints on formal languages. The paper presented here is highly motivated...
Meinolf Sellmann
PAMI
1998
134views more  PAMI 1998»
13 years 7 months ago
A Bayesian Framework for Deformable Pattern Recognition With Application to Handwritten Character Recognition
—Deformable models have recently been proposed for many pattern recognition applications due to their ability to handle large shape variations.These proposed approaches represent...
Kwok-Wai Cheung, Dit-Yan Yeung, Roland T. Chin
PRL
2008
122views more  PRL 2008»
13 years 6 months ago
Constraints for closest point finding
The traditional closest point criterion has been widely used for 3D free form shape matching, object recognition, internet search, computer graphics and medical imaging. However, ...
Yonghuai Liu