Hierarchical progressive trust model for mismatch removal under both rigid and non-rigid transformations

Songlin Du, Takeshi Ikenaga

Research output: Contribution to journalArticle

Abstract

Accurate visual correspondence is the foundation of many computer vision based applications. Since existing image matching algorithms generate mismatches inevitably, a reliable mismatch-removal algorithm is highly desired to remove mismatches and preserve true matches. This paper proposes a hierarchical progressive trust (HPT) model to solve this problem. The HPT model first adopts a "trust the most trustworthy ones" strategy to select anchor inliers in its bottom layer, and then progressively propagates the trust from bottom layer to other layers in a bottomup way: 1) bottom layer verifies anchor inliers with the guidance of local features; 2) middle layers progressively estimate local transformations and perform local verifications; 3) top layer estimates a global transformation with an anchor-inliers-guided expectation maximization (EM) algorithm and performs global verifications. Experimental results show that the proposed HPT model achieves higher performance than state-of-the-art mismatch-removal methods under both rigid transformations and non-rigid deformations.

Original languageEnglish
Pages (from-to)1786-1794
Number of pages9
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE101A
Issue number11
DOIs
Publication statusPublished - 2018 Nov 1

    Fingerprint

Keywords

  • hierarchical progressive trust
  • image matching
  • mismatch removal
  • visual correspondence

ASJC Scopus subject areas

  • Signal Processing
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering
  • Applied Mathematics

Cite this