International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 106 - Number 17 |
Year of Publication: 2014 |
Authors: K.Lakshmi Sudha, Megha Redkar, Anitha Ranganathan, Karishma Upadhyay |
10.5120/18711-9688 |
K.Lakshmi Sudha, Megha Redkar, Anitha Ranganathan, Karishma Upadhyay . An Improvised Approach to Content based Image Retrieval. International Journal of Computer Applications. 106, 17 ( November 2014), 41-44. DOI=10.5120/18711-9688
Image matching is a fundamental aspect of many problems in computer vision, solving for 3D structure from multiple images, stereo correspondence, and motion tracking. An image may have features that have properties making them suitable for matching images. There have been various algorithms and optimizations for Content Based Image Retrieval. A few algorithms include Simple Harris, SIFT. Feature detectors and high matching consuming creates a low automation problem. To overcome these issues there have also been papers proposing optimized algorithms on Harris and SIFT [1]. This algorithm also has several flaws. The optimized algorithm uses Harris for feature extraction and description but Harris has a constraint that Harris detectors detect points only on black and white events. SIFT is flawed in itself since it is inefficient for poor resolution images and is also a time consuming algorithm [5]. The nearest neighbor search used as a matching algorithm is also time consuming and results in random overhead of outcomes. To overcome these shortcomings this paper proposes an algorithm that combines the advantages of Harris, SIFT and the matching algorithms. Color saliency is used along with Harris improvising its efficiency [6]. SIFT matching technique along with the nearest neighbor algorithm is supplemented with an epipolar concept to tender accurate results with lesser discrepant values.