Abstract
We propose the use of approximate digital signatures of selected multimedia feature vectors for fast content-based retrieval in large multimedia databases. We adapt and extend the approximate message authentication code (AMAC), introduced by some of the authors recently in the area of message authentication, to the multimedia searching problem. An AMAC is a binary signature with the ability to reflect changes in the message it represents. The Hamming distance between two AMACs is used to measure the degree of the similarity between multimedia objects. We develop a method to compress AMAC signatures to create a direct look-up table that allows for fast searching of a database. The color histogram is used as the example feature space to show how the signature is applied. Experimental results show that the performance of the proposed method is comparable with existing methods based on other popular metrics, but it significantly decreases search time.
© 2003 Optical Society of America
Full Article | PDF ArticleMore Like This
Ahmed Louri and James A. Hatch
Appl. Opt. 33(35) 8153-8163 (1994)
M. S. Shahriar, R. Tripathi, M. Kleinschmit, J. Donoghue, W. Weathers, M. Huq, and J. T. Shen
Opt. Lett. 28(7) 525-527 (2003)
Bhargab Das, Joby Joseph, and Kehar Singh
Appl. Opt. 49(5) 781-789 (2010)