Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Identification Rates for Block-correlated Gaussian Sources
KTH, School of Electrical Engineering and Computer Science (EECS), Information Science and Engineering.
KTH, School of Electrical Engineering and Computer Science (EECS), Information Science and Engineering.ORCID iD: 0000-0001-9471-1409
KTH, School of Electrical Engineering and Computer Science (EECS), Information Science and Engineering.ORCID iD: 0000-0002-7807-5681
2018 (English)In: 2018 CONFERENCE RECORD OF 52ND ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS, AND COMPUTERS / [ed] Matthews, M B, IEEE , 2018, p. 2114-2118Conference paper, Published paper (Refereed)
Abstract [en]

Among many current data processing systems, the objectives are often not the reproduction of data, but to compute some answers based on the data responding to sonic queries. The similarity identification task is to identify the items in a database which are similar to a given query item regarding to a certain metric. The problem of compression for similarity identification has been studied in [1]. Unlike classic compression problems, the focus is not on reconstructing the original data. Instead, the compression rate is determined by the desired reliability of the answers. Specifically, the information measure identification rate of a compression scheme characterizes the minimum compression rate that can be achieved which guarantees reliable answers with respect to a given similarity threshold. In this paper, we study the component-based quadratic similarity identification for correlated sources. The blocks are first decorrelated by Karhunen-Loeve transform. Then, the decorrelated data is processed by a distinct D-admissible system for each component. We derive the identification rate of component-based scheme for block correlated Gaussian sources. In addition, we characterize the identification rate of a special setting where any information regarding to the component similarity thresholds is unknown while only the similarity threshold of the whole scheme is given. Furthermore, we prove that block-correlated Gaussian sources are the "most difficult" to code under the special setting.

Place, publisher, year, edition, pages
IEEE , 2018. p. 2114-2118
Series
Conference Record of the Asilomar Conference on Signals Systems and Computers, ISSN 1058-6393
National Category
Computer and Information Sciences
Identifiers
URN: urn:nbn:se:kth:diva-252677DOI: 10.1109/ACSSC.2018.8645306ISI: 000467845100373Scopus ID: 2-s2.0-85062960125ISBN: 978-1-5386-9218-9 (print)OAI: oai:DiVA.org:kth-252677DiVA, id: diva2:1319747
Conference
52nd Asilomar Conference on Signals, Systems, and Computers, OCT 28-NOV 01, 2018, Pacific Grove, CA
Note

QC 20190603

Available from: 2019-06-03 Created: 2019-06-03 Last updated: 2019-07-31Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records BETA

Wu, HanweiWang, QiwenFlierl, Markus

Search in DiVA

By author/editor
Wu, HanweiWang, QiwenFlierl, Markus
By organisation
Information Science and Engineering
Computer and Information Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 9 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf