Please use this identifier to cite or link to this item:
https://hdl.handle.net/2440/57261
Citations | ||
Scopus | Web of Science® | Altmetric |
---|---|---|
?
|
?
|
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Eriksson, A. | - |
dc.contributor.author | Astrom, K. | - |
dc.date.issued | 2006 | - |
dc.identifier.citation | Proceedings. 18th International Conference on Pattern Recognition, 20-24 August, 2006, Hong Kong, Volume 3 / Y. Y. Tang, S. P. Wang, G. Lorette, D. S. Yeung and H. Yan (eds.) : : pp.798-801 | - |
dc.identifier.isbn | 0769525210 | - |
dc.identifier.uri | http://hdl.handle.net/2440/57261 | - |
dc.description | © 2006 IEEE | - |
dc.description.abstract | Image registration is the process of geometrically aligning two or more images. In this paper we describe a method for registering pairs of images based on thin-plate spline mappings. The proposed algorithm minimizes the difference in gray-level intensity over bijective deformations. By using quadratic sufficient constraints for bijectivity and a least squares formulation this optimization problem can be addressed using quadratic programming and a modified Gauss-Newton method. This approach also results in a very computationally efficient algorithm. Example results from the algorithm on three different types of images are also presented. | - |
dc.description.statementofresponsibility | Anders P. Eriksson and Kalle Astrom | - |
dc.language.iso | en | - |
dc.publisher | IEEE | - |
dc.source.uri | http://dx.doi.org/10.1109/icpr.2006.323 | - |
dc.title | Bijective image registration using thin-plate splines | - |
dc.type | Conference paper | - |
dc.contributor.conference | International Conference on Pattern Recognition (18th : 2006 : Hong Kong) | - |
dc.identifier.doi | 10.1109/ICPR.2006.323 | - |
dc.publisher.place | United States | - |
pubs.publication-status | Published | - |
Appears in Collections: | Aurora harvest Computer Science publications |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.