Matching of Edge-Line Images Using Relaxation

Masao IZUMI; Takeshi ASANO; Kunio FUKUNAGA; Hideto MURATA

Matching of Edge-Line Images Using Relaxation

Masao IZUMI, Takeshi ASANO, Kunio FUKUNAGA, Hideto MURATA

Full Text Views

0

Cite this

Summary :

In this pater, we propose a method for matching of two images (stereo, motion stereo, etc.) using relaxation. We have already proposed an algebraic expression of line images using unit vectors, and matching method based on similarity measure between two image graphs. This similarity measure of images is insensitive to scaling, rotation, gray level modification and small motion between the two images in the case when we examine image registration or image matching. The approach based on the line structural similarity results in high rate of correspondence between nodes of the two images. In order to obtain higher rate of correspondence, we introduce a relaxation method when examine the degree of similarity between the two images. Our relaxation method improves a relational similarity of correspondence between two image graphs in an iterative manner. The relational similarity is defined as a correct likelihood of correspondence between nodes in consideration of connective relationship of the image graphs. Finally, we show several experimental results which confirm effectiveness of our approach.

Publication: IEICE TRANSACTIONS on Information Vol.E75-D No.6 pp.902-908

Publication Date: 1992/11/25

Publicized

Online ISSN

DOI

Type of Manuscript: PAPER

Category: Image Processing, Computer Graphics and Pattern Recognition

Cite this

Copy

Masao IZUMI, Takeshi ASANO, Kunio FUKUNAGA, Hideto MURATA, "Matching of Edge-Line Images Using Relaxation" in IEICE TRANSACTIONS on Information, vol. E75-D, no. 6, pp. 902-908, November 1992, doi: .
Abstract: In this pater, we propose a method for matching of two images (stereo, motion stereo, etc.) using relaxation. We have already proposed an algebraic expression of line images using unit vectors, and matching method based on similarity measure between two image graphs. This similarity measure of images is insensitive to scaling, rotation, gray level modification and small motion between the two images in the case when we examine image registration or image matching. The approach based on the line structural similarity results in high rate of correspondence between nodes of the two images. In order to obtain higher rate of correspondence, we introduce a relaxation method when examine the degree of similarity between the two images. Our relaxation method improves a relational similarity of correspondence between two image graphs in an iterative manner. The relational similarity is defined as a correct likelihood of correspondence between nodes in consideration of connective relationship of the image graphs. Finally, we show several experimental results which confirm effectiveness of our approach.
URL: https://global.ieice.org/en_transactions/information/10.1587/e75-d_6_902/_p

Copy

@ARTICLE{e75-d_6_902,
author={Masao IZUMI, Takeshi ASANO, Kunio FUKUNAGA, Hideto MURATA, },
journal={IEICE TRANSACTIONS on Information},
title={Matching of Edge-Line Images Using Relaxation},
year={1992},
volume={E75-D},
number={6},
pages={902-908},
abstract={In this pater, we propose a method for matching of two images (stereo, motion stereo, etc.) using relaxation. We have already proposed an algebraic expression of line images using unit vectors, and matching method based on similarity measure between two image graphs. This similarity measure of images is insensitive to scaling, rotation, gray level modification and small motion between the two images in the case when we examine image registration or image matching. The approach based on the line structural similarity results in high rate of correspondence between nodes of the two images. In order to obtain higher rate of correspondence, we introduce a relaxation method when examine the degree of similarity between the two images. Our relaxation method improves a relational similarity of correspondence between two image graphs in an iterative manner. The relational similarity is defined as a correct likelihood of correspondence between nodes in consideration of connective relationship of the image graphs. Finally, we show several experimental results which confirm effectiveness of our approach.},
keywords={},
doi={},
ISSN={},
month={November},}

Copy

TY - JOUR
TI - Matching of Edge-Line Images Using Relaxation
T2 - IEICE TRANSACTIONS on Information
SP - 902
EP - 908
AU - Masao IZUMI
AU - Takeshi ASANO
AU - Kunio FUKUNAGA
AU - Hideto MURATA
PY - 1992
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E75-D
IS - 6
JA - IEICE TRANSACTIONS on Information
Y1 - November 1992
AB - In this pater, we propose a method for matching of two images (stereo, motion stereo, etc.) using relaxation. We have already proposed an algebraic expression of line images using unit vectors, and matching method based on similarity measure between two image graphs. This similarity measure of images is insensitive to scaling, rotation, gray level modification and small motion between the two images in the case when we examine image registration or image matching. The approach based on the line structural similarity results in high rate of correspondence between nodes of the two images. In order to obtain higher rate of correspondence, we introduce a relaxation method when examine the degree of similarity between the two images. Our relaxation method improves a relational similarity of correspondence between two image graphs in an iterative manner. The relational similarity is defined as a correct likelihood of correspondence between nodes in consideration of connective relationship of the image graphs. Finally, we show several experimental results which confirm effectiveness of our approach.
ER -