Abstract
Local optimum has been one of the most difficult problems in image registration notwithstanding the extensive research effort that has been put into solving it. Local optimums occur when a portion of patterns in the floating image coincide with a portion of patterns in the reference image even though the two images are not entirely marched. Existing hierarchical or multi-scale methods suffer from this problem mainly because some redundant information that causes local optimums appears in multiple scales. We propose to avoid it by decomposing an image into several mutually exclusive scale components so that minimal redundant information is present. Our method is evaluated and compared with existing methods using high resolution satellite imagery where thousands of local optimum traps are hidden. We show that our method has significant improvement over existing solutions in both robustness and efficiency.
Original language | English (US) |
---|---|
DOIs | |
State | Published - 2007 |
Externally published | Yes |
Event | 2007 IEEE 11th International Conference on Computer Vision, ICCV - Rio de Janeiro, Brazil Duration: Oct 14 2007 → Oct 21 2007 |
Other
Other | 2007 IEEE 11th International Conference on Computer Vision, ICCV |
---|---|
Country/Territory | Brazil |
City | Rio de Janeiro |
Period | 10/14/07 → 10/21/07 |
ASJC Scopus subject areas
- Software
- Computer Vision and Pattern Recognition