Application of SIFT algorithm in the image copyright search

Chunhua Wu · Electronic Design Engineering · 2012

Fast accurate description of image content is the focus and difficulties of image retrieval technology,and the traditional method of robust image feature extraction is poor,unable to retrieve the modified image.Characterization of the ability of local good SIFT algorithm is good at partial characterization description,while the scale scaling,rotation,translation,affine transformations,illumination changes,cut,dimension reduction and other changes,it has good robustness and can be applied in a variety of scenarios,but Lowe proposed the SIFT operator complexity of the extraction and matching complexity is very high.In order to apply SIFT description of the image capacity and its robustness,and efficiency,this extraction of SIFT algorithm has been modified to eliminate some of the response can cause the edge of extreme points,eliminating the image detail is too close to a wealth of local points,to eliminate image in the background of low contrast points to reduce the complexity of the algorithm.Also increased position in the feature extraction limit and rate limit to reduce the number of feature points,resulting in matching efficiency can be improved.Simulation results show that the method to ensure the accuracy of image retrieval at the same time,improve the efficiency of the algorithm.

Read the paper · More papers on PaperTik