Detection of sparse mixtures: The finite alphabet case

Jonathan G. Ligo; George V. Moustakides; Venugopal V. Veeravalli

doi:10.1109/ACSSC.2016.7869572

Detection of sparse mixtures: The finite alphabet case

Jonathan G. Ligo, George V. Moustakides, Venugopal V. Veeravalli

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

We study the problem of testing between a sparse signal in noise, modeled as a mixture distribution, versus pure noise, with finite alphabet observations. We study the consistency and adaptivity of the tests as the mixture proportion tends to zero with number of observations. The finite alphabet assumption allows for application to inherently categorical data, where no useful ordering relationship on the alphabet typically exists. We construct and analyze a divergence-based adaptive test for finite alphabets and validate it on a quantized Gaussian signal detection problem.

Original language	English (US)
Title of host publication	Conference Record of the 50th Asilomar Conference on Signals, Systems and Computers, ACSSC 2016
Editors	Michael B. Matthews
Publisher	IEEE Computer Society
Pages	1243-1247
Number of pages	5
ISBN (Electronic)	9781538639542
DOIs	https://doi.org/10.1109/ACSSC.2016.7869572
State	Published - Mar 1 2017
Event	50th Asilomar Conference on Signals, Systems and Computers, ACSSC 2016 - Pacific Grove, United States Duration: Nov 6 2016 → Nov 9 2016

Publication series

Name	Conference Record - Asilomar Conference on Signals, Systems and Computers
ISSN (Print)	1058-6393

Other

Other	50th Asilomar Conference on Signals, Systems and Computers, ACSSC 2016
Country/Territory	United States
City	Pacific Grove
Period	11/6/16 → 11/9/16

Keywords

Detection theory
error exponents
large deviations
likelihood ratio test
sparse detection

ASJC Scopus subject areas

Signal Processing
Computer Networks and Communications

Online availability

10.1109/ACSSC.2016.7869572

Library availability

Discover UIUC Full Text

Cite this

Ligo, J. G., Moustakides, G. V., & Veeravalli, V. V. (2017). Detection of sparse mixtures: The finite alphabet case. In M. B. Matthews (Ed.), Conference Record of the 50th Asilomar Conference on Signals, Systems and Computers, ACSSC 2016 (pp. 1243-1247). Article 7869572 (Conference Record - Asilomar Conference on Signals, Systems and Computers). IEEE Computer Society. https://doi.org/10.1109/ACSSC.2016.7869572

Detection of sparse mixtures: The finite alphabet case. / Ligo, Jonathan G.; Moustakides, George V.; Veeravalli, Venugopal V.
Conference Record of the 50th Asilomar Conference on Signals, Systems and Computers, ACSSC 2016. ed. / Michael B. Matthews. IEEE Computer Society, 2017. p. 1243-1247 7869572 (Conference Record - Asilomar Conference on Signals, Systems and Computers).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Ligo, JG, Moustakides, GV & Veeravalli, VV 2017, Detection of sparse mixtures: The finite alphabet case. in MB Matthews (ed.), Conference Record of the 50th Asilomar Conference on Signals, Systems and Computers, ACSSC 2016., 7869572, Conference Record - Asilomar Conference on Signals, Systems and Computers, IEEE Computer Society, pp. 1243-1247, 50th Asilomar Conference on Signals, Systems and Computers, ACSSC 2016, Pacific Grove, United States, 11/6/16. https://doi.org/10.1109/ACSSC.2016.7869572

Ligo JG, Moustakides GV, Veeravalli VV. Detection of sparse mixtures: The finite alphabet case. In Matthews MB, editor, Conference Record of the 50th Asilomar Conference on Signals, Systems and Computers, ACSSC 2016. IEEE Computer Society. 2017. p. 1243-1247. 7869572. (Conference Record - Asilomar Conference on Signals, Systems and Computers). doi: 10.1109/ACSSC.2016.7869572

Ligo, Jonathan G. ; Moustakides, George V. ; Veeravalli, Venugopal V. / Detection of sparse mixtures : The finite alphabet case. Conference Record of the 50th Asilomar Conference on Signals, Systems and Computers, ACSSC 2016. editor / Michael B. Matthews. IEEE Computer Society, 2017. pp. 1243-1247 (Conference Record - Asilomar Conference on Signals, Systems and Computers).

@inproceedings{6334b479673a4c0c89d5ef29f79d94d9,

title = "Detection of sparse mixtures: The finite alphabet case",

abstract = "We study the problem of testing between a sparse signal in noise, modeled as a mixture distribution, versus pure noise, with finite alphabet observations. We study the consistency and adaptivity of the tests as the mixture proportion tends to zero with number of observations. The finite alphabet assumption allows for application to inherently categorical data, where no useful ordering relationship on the alphabet typically exists. We construct and analyze a divergence-based adaptive test for finite alphabets and validate it on a quantized Gaussian signal detection problem.",

keywords = "Detection theory, error exponents, large deviations, likelihood ratio test, sparse detection",

author = "Ligo, {Jonathan G.} and Moustakides, {George V.} and Veeravalli, {Venugopal V.}",

note = "Publisher Copyright: {\textcopyright} 2016 IEEE.; 50th Asilomar Conference on Signals, Systems and Computers, ACSSC 2016 ; Conference date: 06-11-2016 Through 09-11-2016",

year = "2017",

month = mar,

day = "1",

doi = "10.1109/ACSSC.2016.7869572",

language = "English (US)",

series = "Conference Record - Asilomar Conference on Signals, Systems and Computers",

publisher = "IEEE Computer Society",

pages = "1243--1247",

editor = "Matthews, {Michael B.}",

booktitle = "Conference Record of the 50th Asilomar Conference on Signals, Systems and Computers, ACSSC 2016",

}

TY - GEN

T1 - Detection of sparse mixtures

T2 - 50th Asilomar Conference on Signals, Systems and Computers, ACSSC 2016

AU - Ligo, Jonathan G.

AU - Moustakides, George V.

AU - Veeravalli, Venugopal V.

PY - 2017/3/1

Y1 - 2017/3/1

N2 - We study the problem of testing between a sparse signal in noise, modeled as a mixture distribution, versus pure noise, with finite alphabet observations. We study the consistency and adaptivity of the tests as the mixture proportion tends to zero with number of observations. The finite alphabet assumption allows for application to inherently categorical data, where no useful ordering relationship on the alphabet typically exists. We construct and analyze a divergence-based adaptive test for finite alphabets and validate it on a quantized Gaussian signal detection problem.

AB - We study the problem of testing between a sparse signal in noise, modeled as a mixture distribution, versus pure noise, with finite alphabet observations. We study the consistency and adaptivity of the tests as the mixture proportion tends to zero with number of observations. The finite alphabet assumption allows for application to inherently categorical data, where no useful ordering relationship on the alphabet typically exists. We construct and analyze a divergence-based adaptive test for finite alphabets and validate it on a quantized Gaussian signal detection problem.

KW - Detection theory

KW - error exponents

KW - large deviations

KW - likelihood ratio test

KW - sparse detection

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

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

U2 - 10.1109/ACSSC.2016.7869572

DO - 10.1109/ACSSC.2016.7869572

M3 - Conference contribution

AN - SCOPUS:85016264151

T3 - Conference Record - Asilomar Conference on Signals, Systems and Computers

SP - 1243

EP - 1247

BT - Conference Record of the 50th Asilomar Conference on Signals, Systems and Computers, ACSSC 2016

A2 - Matthews, Michael B.

PB - IEEE Computer Society

Y2 - 6 November 2016 through 9 November 2016

ER -

Detection of sparse mixtures: The finite alphabet case

Abstract

Publication series

Other

Keywords

ASJC Scopus subject areas

Online availability

Library availability

Related links

Fingerprint

Cite this