Image compression and matching

Author

Lew, Michael S. ; Huang, Thomas S.

Author_Institution

Beckman Inst. for Adv. Sci. & Technol., Illinois Univ., Urbana, IL, USA

Volume

2

fYear

1994

fDate

13-16 Nov 1994

Firstpage

720

Abstract

This paper addresses the novel idea of whether it is possible to perform spatial matching of compressed images. What are the fundamental problems and limitations of limiting the knowledge to that of the compressed image? We present an algorithm which matches transform block encoded images, without performing the decoding stage. The theoretical 2D image matching model is developed and applied to the discrete Karhunen-Loeve transform and the discrete cosine transform. In addition, we discuss the tradeoffs in using our algorithm for matching compressed images. As a validation step, we apply our algorithm to a video sequence and discuss the results for 2D matching and 3D reconstruction

Keywords

data compression; discrete cosine transforms; image matching; image reconstruction; image sequences; transform coding; transforms; video coding; 2D image matching model; 2D matching; 3D reconstruction; algorithm; compressed images; discrete Karhunen-Loeve transform; discrete cosine transform; image compression; image matching; spatial matching; transform block encoded images; validation step; video sequence; Computer graphics; Decoding; Discrete cosine transforms; Discrete transforms; Frequency; Image coding; Image matching; Image reconstruction; Karhunen-Loeve transforms; Video sequences;

fLanguage

English

Publisher

ieee

Conference_Titel

Image Processing, 1994. Proceedings. ICIP-94., IEEE International Conference

Conference_Location

Austin, TX

Print_ISBN

0-8186-6952-7

Type

conf

DOI

10.1109/ICIP.1994.413665

Filename

413665