Efficient Geometric Matching with Higher-Order Features

被引:0
|
作者
Paramanand, C. [1 ]
Rajagopalan, A. N. [1 ]
机构
[1] Indian Inst Technol Madras, Dept Elect Engn, Image Proc & Comp Vis Lab, Madras, Tamil Nadu, India
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We propose a new technique in which line segments and elliptical arcs are used as features for recognizing image patterns. By using this approach, the process of locating a model in a given image is efficient since the number of features to be compared is few. We propose distance measures to evaluate the similarity between the features of the model and that of the image. The model transformation parameters are found by searching the transformation space using cell decomposition.
引用
收藏
页码:3241 / 3244
页数:4
相关论文
共 50 条
  • [21] Geometric Formulation of Higher-Order Lagrangian Systems in Supermechanics
    José F. Cariñena
    Héctor Figueroa
    Acta Applicandae Mathematica, 1998, 51 : 25 - 58
  • [22] An Energy Approach to Uniqueness for Higher-Order Geometric Flows
    Kotschwar, Brett
    JOURNAL OF GEOMETRIC ANALYSIS, 2016, 26 (04) : 3344 - 3368
  • [23] Geometric formulation of higher-order Lagrangian systems in supermechanics
    Universidad de Zaragoza, Zaragoza, Spain
    Acta Appl Math, 1 (25-58):
  • [24] An Energy Approach to Uniqueness for Higher-Order Geometric Flows
    Brett Kotschwar
    The Journal of Geometric Analysis, 2016, 26 : 3344 - 3368
  • [25] Higher-Order Feature-Preserving Geometric Regularization
    Droske, Marc
    Bertozzi, Andrea
    SIAM JOURNAL ON IMAGING SCIENCES, 2010, 3 (01): : 21 - 51
  • [26] The HyperKron Graph Model for higher-order features
    Eikmeier, Nicole
    Gleich, David F.
    Ramani, Arjun S.
    2018 IEEE INTERNATIONAL CONFERENCE ON DATA MINING (ICDM), 2018, : 941 - 946
  • [27] Linear higher-order matching is NP-complete
    de Groote, P
    REWRITING TECHNIQUES AND APPLICATIONS, PROCEEDINGS, 2000, 1833 : 127 - 140
  • [28] Multimodal surface matching with higher-order smoothness constraints
    Robinson, Emma C.
    Garcia, Kara
    Glasser, Matthew F.
    Chen, Zhengdao
    Coalson, Timothy S.
    Makropoulos, Antonios
    Bozek, Jelena
    Wright, Robert
    Schuh, Andreas
    Webster, Matthew
    Hutter, Jana
    Price, Anthony
    Grande, Lucilio Cordero
    Hughes, Emer
    Tusor, Nora
    Bayly, Philip V.
    Van Essen, David C.
    Smith, Stephen M.
    Edwards, A. David
    Hajnal, Joseph
    Jenkinson, Mark
    Glocker, Ben
    Rueckert, Daniel
    NEUROIMAGE, 2018, 167 : 453 - 465
  • [29] Higher-order matching polynomials and d-orthogonality
    Drake, Dan
    ADVANCES IN APPLIED MATHEMATICS, 2011, 46 (1-4) : 226 - 246
  • [30] Decidability of arity-bounded higher-order matching
    Schmidt-Schauss, M
    AUTOMATED DEDUCTION - CADE-19, PROCEEDINGS, 2003, 2741 : 488 - 502