Efficient and accurate set-based registration of time-separated aerial images
This paper addresses the task of time-separated aerial image registration. The ability to solve this problem accurately and reliably is important for a variety of subsequent image understanding applications. The principal challenge lies in the extent and nature of transient appearance variation that...
| Main Authors: | , , |
|---|---|
| Format: | Journal Article |
| Published: |
Elsevier
2015
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/20.500.11937/22651 |
| _version_ | 1848750929350754304 |
|---|---|
| author | Arandjelovic, O. Pham, DucSon Venkatesh, S. |
| author_facet | Arandjelovic, O. Pham, DucSon Venkatesh, S. |
| author_sort | Arandjelovic, O. |
| building | Curtin Institutional Repository |
| collection | Online Access |
| description | This paper addresses the task of time-separated aerial image registration. The ability to solve this problem accurately and reliably is important for a variety of subsequent image understanding applications. The principal challenge lies in the extent and nature of transient appearance variation that a land area can undergo, such as that caused by the change under illumination conditions, seasonal variations, or the occlusion by non-persistent objects (people, cars). Our work introduces several major novelties (i) unlike previous work on aerial image registration, we approach the problem using a set-based paradigm; (ii) we show how image space local, pair-wise constraints can be used to enforce a globally good registration using a constraints graph structure; (iii) we show how a simple holistic representation derived from raw aerial images can be used as a basic building block of the constraints graph in a manner which achieves both high registration accuracy and speed; (iv) lastly, we introduce a new and, to the best of our knowledge, the only data corpus suitable for the evaluation of set-based aerial image registration algorithms. Using this data set, we demonstrate (i) that the proposed method outperforms the state-of-the-art for pair-wise registration already, achieving greater accuracy and reliability, while at the same time reducing the computational cost of the task and (ii) that the increase in the number of available images in a set consistently reduces the average registration error, with a major difference already for a single additional image. |
| first_indexed | 2025-11-14T07:44:38Z |
| format | Journal Article |
| id | curtin-20.500.11937-22651 |
| institution | Curtin University Malaysia |
| institution_category | Local University |
| last_indexed | 2025-11-14T07:44:38Z |
| publishDate | 2015 |
| publisher | Elsevier |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | curtin-20.500.11937-226512017-09-13T21:30:10Z Efficient and accurate set-based registration of time-separated aerial images Arandjelovic, O. Pham, DucSon Venkatesh, S. Remote Map Constraints Graph Sensing Alignment This paper addresses the task of time-separated aerial image registration. The ability to solve this problem accurately and reliably is important for a variety of subsequent image understanding applications. The principal challenge lies in the extent and nature of transient appearance variation that a land area can undergo, such as that caused by the change under illumination conditions, seasonal variations, or the occlusion by non-persistent objects (people, cars). Our work introduces several major novelties (i) unlike previous work on aerial image registration, we approach the problem using a set-based paradigm; (ii) we show how image space local, pair-wise constraints can be used to enforce a globally good registration using a constraints graph structure; (iii) we show how a simple holistic representation derived from raw aerial images can be used as a basic building block of the constraints graph in a manner which achieves both high registration accuracy and speed; (iv) lastly, we introduce a new and, to the best of our knowledge, the only data corpus suitable for the evaluation of set-based aerial image registration algorithms. Using this data set, we demonstrate (i) that the proposed method outperforms the state-of-the-art for pair-wise registration already, achieving greater accuracy and reliability, while at the same time reducing the computational cost of the task and (ii) that the increase in the number of available images in a set consistently reduces the average registration error, with a major difference already for a single additional image. 2015 Journal Article http://hdl.handle.net/20.500.11937/22651 10.1016/j.patcog.2015.04.011 Elsevier restricted |
| spellingShingle | Remote Map Constraints Graph Sensing Alignment Arandjelovic, O. Pham, DucSon Venkatesh, S. Efficient and accurate set-based registration of time-separated aerial images |
| title | Efficient and accurate set-based registration of time-separated aerial images |
| title_full | Efficient and accurate set-based registration of time-separated aerial images |
| title_fullStr | Efficient and accurate set-based registration of time-separated aerial images |
| title_full_unstemmed | Efficient and accurate set-based registration of time-separated aerial images |
| title_short | Efficient and accurate set-based registration of time-separated aerial images |
| title_sort | efficient and accurate set-based registration of time-separated aerial images |
| topic | Remote Map Constraints Graph Sensing Alignment |
| url | http://hdl.handle.net/20.500.11937/22651 |