A new image matching algorithm for change detection using hilbert curve

Li Tian, Seiichiro Kamata, Yoshimitsu Kuroki, Yoshifumi Ugeshige

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Finding significant change in high resolution sensed image is an important task in maintaining GIS database. A class of these algorithms detects changed regions by means of edge comparisons. After extraction of feature points from a sensed image and a reference image, the feature points matching is a pivotal key in change detection. In general, given two point sets, find the minimum or maximal value of some measuring distances under the (affine) transformation. Because of the measurement errors and some outlying points, it is important that the measuring distances should be robust. Recently, a well known robust measuring distance called (partial) Hausdorff distance is widely used in feature points matching. It is more efficient than other conventional methods and has been applied in many fields. Although it is a reliable similarity measure, it is also a computational task. In this paper, we present a new algorithm using Hubert curve in order to resolve the computational complexity problem. This distance can be computed in the 1-D space rather than in the 2-D space that can greatly reduce the computational complexity. Our algorithm shows good performances for this task.

Original languageEnglish
Title of host publicationInternational Astronautical Federation - 56th International Astronautical Congress 2005
Pages1432-1437
Number of pages6
Volume3
Publication statusPublished - 2005
EventInternational Astronautical Federation - 56th International Astronautical Congress 2005 - Fukuoka
Duration: 2005 Oct 172005 Oct 21

Other

OtherInternational Astronautical Federation - 56th International Astronautical Congress 2005
CityFukuoka
Period05/10/1705/10/21

Fingerprint

change detection
Image matching
Computational complexity
curves
image resolution
Image resolution
Measurement errors
Geographic information systems
GIS
detection
measuring
high resolution

ASJC Scopus subject areas

  • Space and Planetary Science
  • Aerospace Engineering

Cite this

Tian, L., Kamata, S., Kuroki, Y., & Ugeshige, Y. (2005). A new image matching algorithm for change detection using hilbert curve. In International Astronautical Federation - 56th International Astronautical Congress 2005 (Vol. 3, pp. 1432-1437)

A new image matching algorithm for change detection using hilbert curve. / Tian, Li; Kamata, Seiichiro; Kuroki, Yoshimitsu; Ugeshige, Yoshifumi.

International Astronautical Federation - 56th International Astronautical Congress 2005. Vol. 3 2005. p. 1432-1437.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Tian, L, Kamata, S, Kuroki, Y & Ugeshige, Y 2005, A new image matching algorithm for change detection using hilbert curve. in International Astronautical Federation - 56th International Astronautical Congress 2005. vol. 3, pp. 1432-1437, International Astronautical Federation - 56th International Astronautical Congress 2005, Fukuoka, 05/10/17.
Tian L, Kamata S, Kuroki Y, Ugeshige Y. A new image matching algorithm for change detection using hilbert curve. In International Astronautical Federation - 56th International Astronautical Congress 2005. Vol. 3. 2005. p. 1432-1437
Tian, Li ; Kamata, Seiichiro ; Kuroki, Yoshimitsu ; Ugeshige, Yoshifumi. / A new image matching algorithm for change detection using hilbert curve. International Astronautical Federation - 56th International Astronautical Congress 2005. Vol. 3 2005. pp. 1432-1437
@inproceedings{75960e2af16e4da38661eae95b16c7e3,
title = "A new image matching algorithm for change detection using hilbert curve",
abstract = "Finding significant change in high resolution sensed image is an important task in maintaining GIS database. A class of these algorithms detects changed regions by means of edge comparisons. After extraction of feature points from a sensed image and a reference image, the feature points matching is a pivotal key in change detection. In general, given two point sets, find the minimum or maximal value of some measuring distances under the (affine) transformation. Because of the measurement errors and some outlying points, it is important that the measuring distances should be robust. Recently, a well known robust measuring distance called (partial) Hausdorff distance is widely used in feature points matching. It is more efficient than other conventional methods and has been applied in many fields. Although it is a reliable similarity measure, it is also a computational task. In this paper, we present a new algorithm using Hubert curve in order to resolve the computational complexity problem. This distance can be computed in the 1-D space rather than in the 2-D space that can greatly reduce the computational complexity. Our algorithm shows good performances for this task.",
author = "Li Tian and Seiichiro Kamata and Yoshimitsu Kuroki and Yoshifumi Ugeshige",
year = "2005",
language = "English",
volume = "3",
pages = "1432--1437",
booktitle = "International Astronautical Federation - 56th International Astronautical Congress 2005",

}

TY - GEN

T1 - A new image matching algorithm for change detection using hilbert curve

AU - Tian, Li

AU - Kamata, Seiichiro

AU - Kuroki, Yoshimitsu

AU - Ugeshige, Yoshifumi

PY - 2005

Y1 - 2005

N2 - Finding significant change in high resolution sensed image is an important task in maintaining GIS database. A class of these algorithms detects changed regions by means of edge comparisons. After extraction of feature points from a sensed image and a reference image, the feature points matching is a pivotal key in change detection. In general, given two point sets, find the minimum or maximal value of some measuring distances under the (affine) transformation. Because of the measurement errors and some outlying points, it is important that the measuring distances should be robust. Recently, a well known robust measuring distance called (partial) Hausdorff distance is widely used in feature points matching. It is more efficient than other conventional methods and has been applied in many fields. Although it is a reliable similarity measure, it is also a computational task. In this paper, we present a new algorithm using Hubert curve in order to resolve the computational complexity problem. This distance can be computed in the 1-D space rather than in the 2-D space that can greatly reduce the computational complexity. Our algorithm shows good performances for this task.

AB - Finding significant change in high resolution sensed image is an important task in maintaining GIS database. A class of these algorithms detects changed regions by means of edge comparisons. After extraction of feature points from a sensed image and a reference image, the feature points matching is a pivotal key in change detection. In general, given two point sets, find the minimum or maximal value of some measuring distances under the (affine) transformation. Because of the measurement errors and some outlying points, it is important that the measuring distances should be robust. Recently, a well known robust measuring distance called (partial) Hausdorff distance is widely used in feature points matching. It is more efficient than other conventional methods and has been applied in many fields. Although it is a reliable similarity measure, it is also a computational task. In this paper, we present a new algorithm using Hubert curve in order to resolve the computational complexity problem. This distance can be computed in the 1-D space rather than in the 2-D space that can greatly reduce the computational complexity. Our algorithm shows good performances for this task.

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

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

M3 - Conference contribution

AN - SCOPUS:34250825216

VL - 3

SP - 1432

EP - 1437

BT - International Astronautical Federation - 56th International Astronautical Congress 2005

ER -