Options
Low Complexity Image Matching in the Compressed Domain by using the DCT-phase
Auteur(s)
Bracamonte, Javier
Ansorge, Michael
Pellandini, Fausto
Farine, Pierre-André
Date Issued
2004-05-06
Journal
Proceedings of the 6th COST 276 Workshop on Information and Knowledge Management for Integrated Media Communication, COST (European Cooperation in the field of Scientific and Technical Research), 2004/267/6/88-93
Abstract
This paper presents a new, simple, and efficient algorithm for image matching in the compressed domain. The proposed technique operates directly on transformed frequency-domain data, which makes it a good choice when dealing with standard-compliant Discrete Cosine Transform (DCT)-based compressed images since it avoids the large computational overhead associated with the decoding stage. Furthermore, the algorithm itself features a very low computational complexity and a high matching accuracy. An example of the effectiveness of this algorithm is illustrated in the frame of a particular content-based image retrieval application. The proposed method exploits the fact that the phase of the coefficients of a DCT transformed image contains a significant amount of information of the original image. By processing only the phase part of the DCT coefficients, a simple and yet high matching accuracy method is achieved. The underlying principle can also be applied in other computer vision applications and in video processing in the compressed domain.
Publication type
journal article
