Abstract
In this paper, evaluation is made on the result of CBIR system based on haar wavelet transform with different distances for similarity matching to calculate the deviation from query image. So, different distances used are Chessboard distance, Cityblock distance and Euclidean distance. In this paper discrete wavelet transform is used to decompose the image. The image is decomposed till sixth level and last level approximate component is saved as feature vector. Comparison is made between different distances to see the best suited distance for CBIR. The wavelet used is “Haar”. Haar has compact support and it is the simplest orthogonal wavelet. It is very fast also. General Terms Average Precision, Average Recall, Query Image, Database, Similarity Measurement.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
