Abstract
Scale Invariant Feature Transform (SIFT) is a powerful technique for image registration. Although SIFT descriptors accurately extract invariant image characteristics around keypoints, the commonly used matching approaches of registration loosely represent the geometric information among descriptors. In this paper, we propose an image registration algorithm named BP-SIFT, where we formulate keypoint matching of SIFT descriptors as a global optimization problem and provide a suboptimum solution using belief propagation (BP). Experimental results show significant improvement over conventional SIFT-based matching with reasonable computation complexity.
Original language | English |
---|---|
Pages (from-to) | 448-457 |
Number of pages | 10 |
Journal | Journal of Visual Communication and Image Representation |
Volume | 24 |
Issue number | 4 |
DOIs | |
Publication status | Published - 1 May 2013 |
Keywords
- image registration
- belief propagation
- min-sum algorithm
- keypoint matching
- descriptors matching
- image processing