2005
DOI: 10.1007/11492429_28
|View full text |Cite
|
Sign up to set email alerts
|

Contour-Based Image Registration Using Mutual Information

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2007
2007
2023
2023

Publication Types

Select...
2
2

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(6 citation statements)
references
References 14 publications
0
6
0
Order By: Relevance
“…The (x, y) is coordinate in 2D image. Then, a searching function of the joint probability 31 is established by…”
Section: G Coarse-to-fine Estimationmentioning
confidence: 99%
“…The (x, y) is coordinate in 2D image. Then, a searching function of the joint probability 31 is established by…”
Section: G Coarse-to-fine Estimationmentioning
confidence: 99%
“…However, a closer look at (1) reveals that finding the a that minimizes the expression is equivalent to finding a that maximizes: Finding a maximizing (2) can be solved efficiently by computations in the Fourier domain using the Fast Fourier Transform where the wrap-around effect is NOT avoided; i.e., the computation can be derived using:…”
Section: Registration Of Contoursmentioning
confidence: 99%
“…Feature characteristics like location, edge strength and orientation are taken into account to compute a joint probability distribution of corresponding edge points in two images [1,9,16]. Optimization based registration of images is achieved by optimizing a similarity criterion, such as a correlation coefficient, a correlation function, a sum of absolute differences or correlation information entropy [6].…”
Section: Introductionmentioning
confidence: 99%
“…c) Contour-based FD. In [14], A. Alvarez et al proposed a contour-based image registration using mutual information. In [21], Li et al introduced an elastic contour matching scheme based on the active contour model to perform multi-sensor image registration.…”
Section: Related Workmentioning
confidence: 99%
“…Various feature descriptors (chain-code [11], length code method [12] etc.) and similarity measures (Bessel method [13], mutual information [14] etc.) can be applied to determinate the correspondence points.…”
Section: Introductionmentioning
confidence: 99%