MMSP 1999, IEEE Workshop on Multimedia Signal Processing, September 13, 1999, Copenhagen, Denmark
This paper proposes an algorithm for Content-based Image Indexing whose formulation of similarity is borrowed from methods for fractal compression. Unlike most traditional block-based image indexing algorithms, the proposed method employs dynamic programming to exploit inter-block dependencies. A regularization constraint is globally
imposed, and the overall optimal transformation relating two images is efficiently determined by application of the Viterbi algorithm. Preliminary experimental results on a sample of eighty binary images from the MPEG-7 database are presented.
Type:
Conférence
City:
Copenhagen
Date:
1999-09-13
Department:
Sécurité numérique
Eurecom Ref:
251
Copyright:
© 1999 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
See also:
