Detection bounds for automatic target recognition in compressed domain

Pierre Moulin, M. I. Miller

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We study a problem of target detection given transform-coded image data. We formulate optimal likelihood ratio tests and derive detection bounds by application of Stein's lemma. This study provides a framework in which to study degradation in detection performance due to lossy compression.

Original languageEnglish (US)
Title of host publicationProceedings - 1998 IEEE International Symposium on Information Theory, ISIT 1998
Number of pages1
DOIs
StatePublished - Dec 1 1998
Event1998 IEEE International Symposium on Information Theory, ISIT 1998 - Cambridge, MA, United States
Duration: Aug 16 1998Aug 21 1998

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095

Other

Other1998 IEEE International Symposium on Information Theory, ISIT 1998
CountryUnited States
CityCambridge, MA
Period8/16/988/21/98

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Detection bounds for automatic target recognition in compressed domain'. Together they form a unique fingerprint.

Cite this