Noways,image matching is used to solve many problem in computer vision, including object or scene recogniton,3D structure from multiple images, stereo correspondence, and motion tracking. In recent years, an approach has been proposed to generate a se...
Noways,image matching is used to solve many problem in computer vision, including object or scene recogniton,3D structure from multiple images, stereo correspondence, and motion tracking. In recent years, an approach has been proposed to generate a set of image features.This approach has been named the Scale Invariant Feature Transform;it transforms image data into scale-invariant coordinates relative to local features. The SIFT algorithm combines a scale invariant region detector and a descriptor based on the gradient distribution in the detected regions. The descriptor is presented by a 3D histogram of gradient locations and orientations. Those descriptors(local features)are very distinctive and invariant for image scaling or rotation.SIFT keypoint is used in many object recognition applications because of this propery.
However, SIFT algorithm is a complex algorithm. To apply SIFT in multimedia applications, it is necessary to find a scheme to implement the algorithm in real-time.
In this thesis, I used a parallel approach to implement the SIFT algorithm. In my implementation,a single instruction stream multiple data stream pixel processor is used. By using the SIMD pixel processor system,the available parallelism of the SIFT algorithm can be exposed fully.Major results showed that we can apply this new approach to implement the SIFT algorithm in real-time.