Parametric image alignment using enhanced correlation coefficient maximization

In this work we propose the use of a modified version of the correlation coefficient as a performance criterion for the image alignment problem. The proposed modification has the desirable characteristic of being invariant with respect to photometric distortions. Since the resulting similarity measu...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on pattern analysis and machine intelligence. - 1979. - 30(2008), 10 vom: 01. Okt., Seite 1858-65
1. Verfasser: Evangelidis, Georgios D (VerfasserIn)
Weitere Verfasser: Psarakis, Emmanouil Z
Format: Online-Aufsatz
Sprache:English
Veröffentlicht: 2008
Zugriff auf das übergeordnete Werk:IEEE transactions on pattern analysis and machine intelligence
Schlagworte:Journal Article Research Support, Non-U.S. Gov't
LEADER 01000naa a22002652 4500
001 NLM181592770
003 DE-627
005 20231223161521.0
007 cr uuu---uuuuu
008 231223s2008 xx |||||o 00| ||eng c
024 7 |a 10.1109/TPAMI.2008.113  |2 doi 
028 5 2 |a pubmed24n0605.xml 
035 |a (DE-627)NLM181592770 
035 |a (NLM)18703836 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Evangelidis, Georgios D  |e verfasserin  |4 aut 
245 1 0 |a Parametric image alignment using enhanced correlation coefficient maximization 
264 1 |c 2008 
336 |a Text  |b txt  |2 rdacontent 
337 |a ƒaComputermedien  |b c  |2 rdamedia 
338 |a ƒa Online-Ressource  |b cr  |2 rdacarrier 
500 |a Date Completed 22.10.2008 
500 |a Date Revised 15.08.2008 
500 |a published: Print 
500 |a Citation Status MEDLINE 
520 |a In this work we propose the use of a modified version of the correlation coefficient as a performance criterion for the image alignment problem. The proposed modification has the desirable characteristic of being invariant with respect to photometric distortions. Since the resulting similarity measure is a nonlinear function of the warp parameters, we develop two iterative schemes for its maximization, one based on the forward additive approach and the second on the inverse compositional method. As it is customary in iterative optimization, in each iteration, the nonlinear objective function is approximated by an alternative expression for which the corresponding optimization is simple. In our case we propose an efficient approximation that leads to a closed-form solution (per iteration) which is of low computational complexity, the latter property being particularly strong in our inverse version. The proposed schemes are tested against the Forward Additive Lucas-Kanade and the Simultaneous Inverse Compositional (SIC) algorithm through simulations. Under noisy conditions and photometric distortions, our forward version achieves more accurate alignments and exhibits faster convergence whereas our inverse version has similar performance as the SIC algorithm but at a lower computational complexity 
650 4 |a Journal Article 
650 4 |a Research Support, Non-U.S. Gov't 
700 1 |a Psarakis, Emmanouil Z  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t IEEE transactions on pattern analysis and machine intelligence  |d 1979  |g 30(2008), 10 vom: 01. Okt., Seite 1858-65  |w (DE-627)NLM098212257  |x 1939-3539  |7 nnns 
773 1 8 |g volume:30  |g year:2008  |g number:10  |g day:01  |g month:10  |g pages:1858-65 
856 4 0 |u http://dx.doi.org/10.1109/TPAMI.2008.113  |3 Volltext 
912 |a GBV_USEFLAG_A 
912 |a SYSFLAG_A 
912 |a GBV_NLM 
912 |a GBV_ILN_350 
951 |a AR 
952 |d 30  |j 2008  |e 10  |b 01  |c 10  |h 1858-65