A fast and accurate algorithm for matching images using hilbert scanning distance with threshold elimination function

Li Tian, Seiichiro Kamata, Kazuyuki Tsuneyoshi, Haijiang Tang

Research output: Contribution to journalArticle

20 Citations (Scopus)

Abstract

To find the best transformation between a "model" point set and an "image" point set is the main purpose of point pattern matching. The similarity measure plays a pivotal role and is used to determine the degree of resemblance between two objects. Although some well-known Hausdorff distance measures work well for this task, they are very computationally expensive and suffer from the noise points. In this paper, we propose a novel similarity measure using the Hilbert curve named Hilbert scanning distance (HSD) to resolve the problems. This method computes the distance measure in the one-dimensional (1-D) sequence instead of in the two-dimensional (2-D) space, which greatly reduces the computational complexity. By applying a threshold elimination function, large distance values caused by noise and position errors (e.g. those that occur with feature or edge extraction) are removed. The proposed algorithm has been applied to the task of matching edge maps with noise. The experimental results show that HSD can provide sufficient information for image matching within low computational complexity. We believe this sets a new direction for the research of point pattern recognition.

Original languageEnglish
Pages (from-to)291-297
Number of pages7
JournalIEICE Transactions on Information and Systems
VolumeE89-D
Issue number1
DOIs
Publication statusPublished - 2006 Jan

Fingerprint

Image matching
Computational complexity
Scanning
Pattern matching
Pattern recognition

Keywords

  • Hausdorff distance
  • Hilbert curve
  • Hilbert scanning distance
  • Point pattern matching
  • Threshold elimination function

ASJC Scopus subject areas

  • Information Systems
  • Computer Graphics and Computer-Aided Design
  • Software

Cite this

A fast and accurate algorithm for matching images using hilbert scanning distance with threshold elimination function. / Tian, Li; Kamata, Seiichiro; Tsuneyoshi, Kazuyuki; Tang, Haijiang.

In: IEICE Transactions on Information and Systems, Vol. E89-D, No. 1, 01.2006, p. 291-297.

Research output: Contribution to journalArticle

@article{167a28a5644e482e92ce80945900d009,
title = "A fast and accurate algorithm for matching images using hilbert scanning distance with threshold elimination function",
abstract = "To find the best transformation between a {"}model{"} point set and an {"}image{"} point set is the main purpose of point pattern matching. The similarity measure plays a pivotal role and is used to determine the degree of resemblance between two objects. Although some well-known Hausdorff distance measures work well for this task, they are very computationally expensive and suffer from the noise points. In this paper, we propose a novel similarity measure using the Hilbert curve named Hilbert scanning distance (HSD) to resolve the problems. This method computes the distance measure in the one-dimensional (1-D) sequence instead of in the two-dimensional (2-D) space, which greatly reduces the computational complexity. By applying a threshold elimination function, large distance values caused by noise and position errors (e.g. those that occur with feature or edge extraction) are removed. The proposed algorithm has been applied to the task of matching edge maps with noise. The experimental results show that HSD can provide sufficient information for image matching within low computational complexity. We believe this sets a new direction for the research of point pattern recognition.",
keywords = "Hausdorff distance, Hilbert curve, Hilbert scanning distance, Point pattern matching, Threshold elimination function",
author = "Li Tian and Seiichiro Kamata and Kazuyuki Tsuneyoshi and Haijiang Tang",
year = "2006",
month = "1",
doi = "10.1093/ietisy/e89-d.1.290",
language = "English",
volume = "E89-D",
pages = "291--297",
journal = "IEICE Transactions on Information and Systems",
issn = "0916-8532",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "1",

}

TY - JOUR

T1 - A fast and accurate algorithm for matching images using hilbert scanning distance with threshold elimination function

AU - Tian, Li

AU - Kamata, Seiichiro

AU - Tsuneyoshi, Kazuyuki

AU - Tang, Haijiang

PY - 2006/1

Y1 - 2006/1

N2 - To find the best transformation between a "model" point set and an "image" point set is the main purpose of point pattern matching. The similarity measure plays a pivotal role and is used to determine the degree of resemblance between two objects. Although some well-known Hausdorff distance measures work well for this task, they are very computationally expensive and suffer from the noise points. In this paper, we propose a novel similarity measure using the Hilbert curve named Hilbert scanning distance (HSD) to resolve the problems. This method computes the distance measure in the one-dimensional (1-D) sequence instead of in the two-dimensional (2-D) space, which greatly reduces the computational complexity. By applying a threshold elimination function, large distance values caused by noise and position errors (e.g. those that occur with feature or edge extraction) are removed. The proposed algorithm has been applied to the task of matching edge maps with noise. The experimental results show that HSD can provide sufficient information for image matching within low computational complexity. We believe this sets a new direction for the research of point pattern recognition.

AB - To find the best transformation between a "model" point set and an "image" point set is the main purpose of point pattern matching. The similarity measure plays a pivotal role and is used to determine the degree of resemblance between two objects. Although some well-known Hausdorff distance measures work well for this task, they are very computationally expensive and suffer from the noise points. In this paper, we propose a novel similarity measure using the Hilbert curve named Hilbert scanning distance (HSD) to resolve the problems. This method computes the distance measure in the one-dimensional (1-D) sequence instead of in the two-dimensional (2-D) space, which greatly reduces the computational complexity. By applying a threshold elimination function, large distance values caused by noise and position errors (e.g. those that occur with feature or edge extraction) are removed. The proposed algorithm has been applied to the task of matching edge maps with noise. The experimental results show that HSD can provide sufficient information for image matching within low computational complexity. We believe this sets a new direction for the research of point pattern recognition.

KW - Hausdorff distance

KW - Hilbert curve

KW - Hilbert scanning distance

KW - Point pattern matching

KW - Threshold elimination function

UR - http://www.scopus.com/inward/record.url?scp=32244441799&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=32244441799&partnerID=8YFLogxK

U2 - 10.1093/ietisy/e89-d.1.290

DO - 10.1093/ietisy/e89-d.1.290

M3 - Article

VL - E89-D

SP - 291

EP - 297

JO - IEICE Transactions on Information and Systems

JF - IEICE Transactions on Information and Systems

SN - 0916-8532

IS - 1

ER -