Image compression and matching

M. S. Lew; T. S. Huang

doi:10.1109/ICIP.1994.413665

Image compression and matching

M. S. Lew, T. S. Huang

Coordinated Science Lab

Research output: Contribution to journal › Conference article

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.

Original language	English (US)
Article number	413665
Pages (from-to)	720-724
Number of pages	5
Journal	Proceedings - International Conference on Image Processing, ICIP
Volume	2
DOIs	https://doi.org/10.1109/ICIP.1994.413665
State	Published - Jan 1 1994
Event	Proceedings of the 1994 1st IEEE International Conference on Image Processing. Part 3 (of 3) - Austin, TX, USA Duration: Nov 13 1994 → Nov 16 1994

Fingerprint

ASJC Scopus subject areas

Software
Computer Vision and Pattern Recognition
Signal Processing

Cite this

Lew, M. S., & Huang, T. S. (1994). Image compression and matching. Proceedings - International Conference on Image Processing, ICIP, 2, 720-724. [413665]. https://doi.org/10.1109/ICIP.1994.413665

@article{2538c616339b451ea77b7cab6d9f558a,

title = "Image compression and matching",

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.",

author = "Lew, {M. S.} and Huang, {T. S.}",

year = "1994",

month = jan

day = "1",

doi = "10.1109/ICIP.1994.413665",

language = "English (US)",

volume = "2",

pages = "720--724",

journal = "Proceedings - International Conference on Image Processing, ICIP",

issn = "1522-4880",

note = "Proceedings of the 1994 1st IEEE International Conference on Image Processing. Part 3 (of 3) ; Conference date: 13-11-1994 Through 16-11-1994",

}

TY - JOUR

T1 - Image compression and matching

AU - Lew, M. S.

AU - Huang, T. S.

PY - 1994/1/1

Y1 - 1994/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84999808929&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84999808929&partnerID=8YFLogxK

U2 - 10.1109/ICIP.1994.413665

DO - 10.1109/ICIP.1994.413665

M3 - Conference article

AN - SCOPUS:84999808929

VL - 2

SP - 720

EP - 724

JO - Proceedings - International Conference on Image Processing, ICIP

JF - Proceedings - International Conference on Image Processing, ICIP

SN - 1522-4880

M1 - 413665

T2 - Proceedings of the 1994 1st IEEE International Conference on Image Processing. Part 3 (of 3)

Y2 - 13 November 1994 through 16 November 1994

ER -

Access to Document

10.1109/ICIP.1994.413665