Distributed Binary Detection With Lossy Data Compression

Consider the problem where a statistician in a two-node system receives rate-limited information from a transmitter about marginal observations of a memoryless process generated from two possible distributions. Using its own observations, this receiver is required to first identify the legitimacy of...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE transactions on information theory Ročník 63; číslo 8; s. 5207 - 5227
Hlavní autori: Katz, Gil, Piantanida, Pablo, Debbah, Merouane
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York IEEE 01.08.2017
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Institute of Electrical and Electronics Engineers
Predmet:
ISSN:0018-9448, 1557-9654
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract Consider the problem where a statistician in a two-node system receives rate-limited information from a transmitter about marginal observations of a memoryless process generated from two possible distributions. Using its own observations, this receiver is required to first identify the legitimacy of its sender by declaring the joint distribution of the process, and then depending on such authentication, it generates adequate reconstruction of the observations, satisfying an average per-letter distortion. The performance of this setup is investigated through the corresponding rate-error-distortion region, describing the tradeoff between: the communication rate, the error exponent induced by the detection, and the distortion incurred by the source reconstruction. In the special case of testing against independence, where the alternative hypothesis implies that the sources are independent, the optimal rate-error-distortion region is characterized. An application example to binary symmetric sources is given subsequently and the explicit expression for the rate-error-distortion region is provided as well. The case of "general hypotheses" is also investigated. A new achievable rate-error-distortion region is derived based on the use of non-asymptotic binning, improving the quality of communicated descriptions. Further improvement of performance in the general case is shown to be possible when the requirement of source reconstruction is relaxed, which stands in contrast to the case of general hypotheses.
AbstractList Consider the problem where a statistician in a two-node system receives rate-limited information from a transmitter about marginal observations of a memoryless process generated from two possible distributions. Using its own observations, this receiver is required to first identify the legitimacy of its sender by declaring the joint distribution of the process, and then depending on such authentication, it generates adequate reconstruction of the observations, satisfying an average per-letter distortion. The performance of this setup is investigated through the corresponding rate-error-distortion region, describing the tradeoff between: the communication rate, the error exponent induced by the detection, and the distortion incurred by the source reconstruction. In the special case of testing against independence, where the alternative hypothesis implies that the sources are independent, the optimal rate-error-distortion region is characterized. An application example to binary symmetric sources is given subsequently and the explicit expression for the rate-error-distortion region is provided as well. The case of "general hypotheses" is also investigated. A new achievable rate-error-distortion region is derived based on the use of non-asymptotic binning, improving the quality of communicated descriptions. Further improvement of performance in the general case is shown to be possible when the requirement of source reconstruction is relaxed, which stands in contrast to the case of general hypotheses.
—Consider the problem where a statistician in a two-node system receives rate-limited information from a transmitter about marginal observations of a memoryless process generated from two possible distributions. Using its own observations, this receiver is required to first identify the legitimacy of its sender by declaring the joint distribution of the process, and then depending on such authentication it generates the adequate reconstruction of the observations satisfying an average per-letter distortion. The performance of this setup is investigated through the corresponding rate-error-distortion region describing the trade-off between: the communication rate, the error exponent induced by the detection and the distortion incurred by the source reconstruction. In the special case of testing against independence, where the alternative hypothesis implies that the sources are independent, the optimal rate-error-distortion region is characterized. An application example to binary symmetric sources is given subsequently and the explicit expression for the rate-error-distortion region is provided as well. The case of " general hypotheses " is also investigated. A new achievable rate-error-distortion region is derived based on the use of non-asymptotic binning, improving the quality of communicated descriptions. Further improvement of performance in the general case is shown to be possible when the requirement of source reconstruction is relaxed, which stands in contrast to the case of general hypotheses.
Author Debbah, Merouane
Katz, Gil
Piantanida, Pablo
Author_xml – sequence: 1
  givenname: Gil
  surname: Katz
  fullname: Katz, Gil
  email: gil.katz@centralesupelec.fr
  organization: Large Networks & Syst. Group, Centrale-Supelec, Gif-sur-Yvette, France
– sequence: 2
  givenname: Pablo
  surname: Piantanida
  fullname: Piantanida, Pablo
  email: pablo.piantanida@centralesupelec.fr
  organization: Lab. de Signaux et Syst., Univ. Paris-Sud, Gif-sur-Yvette, France
– sequence: 3
  givenname: Merouane
  surname: Debbah
  fullname: Debbah, Merouane
  email: merouane.debbah@centralesupelec.fr
  organization: Large Networks & Syst. Group, Centrale-Supelec, Gif-sur-Yvette, France
BackLink https://centralesupelec.hal.science/hal-01742427$$DView record in HAL
BookMark eNp9kMFLwzAUxoNMcE7vgpeCJw-dSfrSpMe5qRsUvEw8hqx9YxlbO5NM8L83pdODBy8Jefl9j-_7LsmgaRsk5IbRMWO0eFgulmNOmRzzXKkM1BkZMiFkWuQCBmRIKVNpAaAuyKX32_gEwfiQqJn1wdnVMWCdPNrGuK9khgGrYNsmebdhk5St93Fogkmm7f7g0Pv4d0XO12bn8fp0j8jb89NyOk_L15fFdFKmVZbLkGYrISiwFQVRrSGelANKKGowVAlk0R5mqmaAhQBGc2kkUm4KmZuqghqyEbnv927MTh-c3UeHujVWzyel7mYxM3Dg8pNF9q5nD679OKIPetseXRPtaR6pjOcg80jlPVW5mMzhWlc2mC5vcMbuNKO6a1THRnXXqD41GoX0j_DHzz-S215iEfEXl0opwWT2Dbp1f9Y
CODEN IETTAW
CitedBy_id crossref_primary_10_1109_TIT_2019_2953750
crossref_primary_10_1016_j_comcom_2021_05_022
crossref_primary_10_1109_JSAC_2022_3223408
crossref_primary_10_3390_e27040378
crossref_primary_10_1109_TIT_2018_2883295
crossref_primary_10_1109_TIT_2019_2910065
crossref_primary_10_7717_peerj_cs_350
crossref_primary_10_1109_TIT_2023_3238339
crossref_primary_10_1002_dac_4809
crossref_primary_10_1109_TCOMM_2018_2847666
crossref_primary_10_3390_e25020304
crossref_primary_10_3390_e22060665
Cites_doi 10.1109/TSG.2015.2388545
10.1109/TIT.2012.2201346
10.1109/ISIT.2015.7282966
10.1002/0471200611
10.1109/TAES.1981.309178
10.1109/TIT.2008.928951
10.1109/18.340475
10.1109/TIT.1985.1057103
10.1109/TSG.2013.2245155
10.1109/ISIT.2014.6874901
10.1109/TIT.1986.1057194
10.1017/CBO9781139030687
10.1109/ALLERTON.2014.7028594
10.1109/TIT.2012.2206793
10.1109/TIT.1976.1055638
10.1109/TIT.2009.2027519
10.1109/Allerton.2012.6483336
10.1109/76.905982
10.1109/18.720546
10.1109/TIP.2011.2157515
10.1109/18.720540
10.1109/TIT.1987.1057383
10.1109/TIT.2004.831781
10.1109/ISIT.1994.394874
10.1109/TIT.1976.1055508
10.1109/18.720535
10.1109/TIT.1985.1057118
ContentType Journal Article
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2017
Distributed under a Creative Commons Attribution 4.0 International License
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2017
– notice: Distributed under a Creative Commons Attribution 4.0 International License
DBID 97E
RIA
RIE
AAYXX
CITATION
7SC
7SP
8FD
JQ2
L7M
L~C
L~D
1XC
VOOES
DOI 10.1109/TIT.2017.2688348
DatabaseName IEEE Xplore (IEEE)
IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE Electronic Library (IEL)
CrossRef
Computer and Information Systems Abstracts
Electronics & Communications Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
Hyper Article en Ligne (HAL)
Hyper Article en Ligne (HAL) (Open Access)
DatabaseTitle CrossRef
Technology Research Database
Computer and Information Systems Abstracts – Academic
Electronics & Communications Abstracts
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts Professional
DatabaseTitleList

Technology Research Database
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Computer Science
Mathematics
Statistics
EISSN 1557-9654
EndPage 5227
ExternalDocumentID oai:HAL:hal-01742427v1
10_1109_TIT_2017_2688348
7888517
Genre orig-research
GrantInformation_xml – fundername: MORE (Advanced Mathematical Tools for Complex Network Engineering)
– fundername: ERC
  grantid: 305123
GroupedDBID -~X
.DC
0R~
29I
3EH
4.4
5GY
5VS
6IK
97E
AAJGR
AARMG
AASAJ
AAWTH
ABAZT
ABFSI
ABQJQ
ABVLG
ACGFO
ACGFS
ACGOD
ACIWK
AENEX
AETEA
AETIX
AGQYO
AGSQL
AHBIQ
AI.
AIBXA
AKJIK
AKQYR
ALLEH
ALMA_UNASSIGNED_HOLDINGS
ASUFR
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CS3
DU5
E.L
EBS
EJD
F5P
HZ~
H~9
IAAWW
IBMZZ
ICLAB
IDIHD
IFIPE
IFJZH
IPLJI
JAVBF
LAI
M43
MS~
O9-
OCL
P2P
PQQKQ
RIA
RIE
RNS
RXW
TAE
TN5
VH1
VJK
AAYXX
CITATION
7SC
7SP
8FD
JQ2
L7M
L~C
L~D
RIG
1XC
VOOES
ID FETCH-LOGICAL-c367t-3b55041b045cf4045024e749d4a085e1965e38d14e9541067a7e02a976acc4d43
IEDL.DBID RIE
ISICitedReferencesCount 20
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000405634400028&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0018-9448
IngestDate Tue Oct 14 20:23:18 EDT 2025
Sun Jun 29 14:30:58 EDT 2025
Sat Nov 29 03:31:37 EST 2025
Tue Nov 18 21:35:28 EST 2025
Tue Aug 26 16:43:24 EDT 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 8
Keywords signal detection
asymptotic performance
multiterminal source coding
Data compression
type-II error rate
lossy source coding
distributed detection error exponent
multiterminal detection
central detector
side infomation
discrete spatially dependent observations
error statistics
type-I error rate
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c367t-3b55041b045cf4045024e749d4a085e1965e38d14e9541067a7e02a976acc4d43
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0002-8717-2117
OpenAccessLink https://centralesupelec.hal.science/hal-01742427
PQID 2174326476
PQPubID 36024
PageCount 21
ParticipantIDs proquest_journals_2174326476
ieee_primary_7888517
hal_primary_oai_HAL_hal_01742427v1
crossref_citationtrail_10_1109_TIT_2017_2688348
crossref_primary_10_1109_TIT_2017_2688348
PublicationCentury 2000
PublicationDate 2017-08-01
PublicationDateYYYYMMDD 2017-08-01
PublicationDate_xml – month: 08
  year: 2017
  text: 2017-08-01
  day: 01
PublicationDecade 2010
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle IEEE transactions on information theory
PublicationTitleAbbrev TIT
PublicationYear 2017
Publisher IEEE
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Institute of Electrical and Electronics Engineers
Publisher_xml – name: IEEE
– name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
– name: Institute of Electrical and Electronics Engineers
References ref13
ref12
ref15
ref14
ref11
ref10
ref2
ref1
ref17
ref16
ref19
ref18
lehmann (ref3) 2005
csiszár (ref28) 1981
han (ref6) 1998; 44
ref24
ref23
ref26
ref25
ref20
ref22
ref21
ref27
ref29
ref8
ref7
ref9
ref4
ref5
References_xml – ident: ref21
  doi: 10.1109/TSG.2015.2388545
– ident: ref24
  doi: 10.1109/TIT.2012.2201346
– ident: ref2
  doi: 10.1109/ISIT.2015.7282966
– ident: ref4
  doi: 10.1002/0471200611
– ident: ref5
  doi: 10.1109/TAES.1981.309178
– ident: ref12
  doi: 10.1109/TIT.2008.928951
– ident: ref10
  doi: 10.1109/18.340475
– ident: ref9
  doi: 10.1109/TIT.1985.1057103
– ident: ref22
  doi: 10.1109/TSG.2013.2245155
– ident: ref29
  doi: 10.1109/ISIT.2014.6874901
– year: 2005
  ident: ref3
  article-title: Testing statistical hypotheses
  publication-title: Springer Texts in Statistics
– ident: ref7
  doi: 10.1109/TIT.1986.1057194
– ident: ref27
  doi: 10.1017/CBO9781139030687
– ident: ref1
  doi: 10.1109/ALLERTON.2014.7028594
– ident: ref17
  doi: 10.1109/TIT.2012.2206793
– ident: ref18
  doi: 10.1109/TIT.1976.1055638
– ident: ref11
  doi: 10.1109/TIT.2009.2027519
– ident: ref13
  doi: 10.1109/Allerton.2012.6483336
– ident: ref20
  doi: 10.1109/76.905982
– ident: ref25
  doi: 10.1109/18.720546
– ident: ref19
  doi: 10.1109/TIP.2011.2157515
– volume: 44
  start-page: 2300
  year: 1998
  ident: ref6
  article-title: Statistical inference under multiterminal data compression
  publication-title: IEEE Trans Inf Theory
  doi: 10.1109/18.720540
– ident: ref8
  doi: 10.1109/TIT.1987.1057383
– ident: ref26
  doi: 10.1109/TIT.2004.831781
– ident: ref15
  doi: 10.1109/ISIT.1994.394874
– ident: ref23
  doi: 10.1109/TIT.1976.1055508
– ident: ref16
  doi: 10.1109/18.720535
– ident: ref14
  doi: 10.1109/TIT.1985.1057118
– year: 1981
  ident: ref28
  publication-title: Information Theory Coding Theorems for Discrete Memoryless Systems
SSID ssj0014512
Score 2.4129806
Snippet Consider the problem where a statistician in a two-node system receives rate-limited information from a transmitter about marginal observations of a memoryless...
—Consider the problem where a statistician in a two-node system receives rate-limited information from a transmitter about marginal observations of a...
SourceID hal
proquest
crossref
ieee
SourceType Open Access Repository
Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 5207
SubjectTerms asymptotic performance
central detector
Computer Science
Data compression
Decoding
discrete spatially dependent observations
Distortion
distributed detection
Error analysis
Error detection
error exponent
Error probability
error statistics
Hypotheses
Information Theory
lossy source coding
Mathematics
multiterminal detection
multiterminal source coding
Networking and Internet Architecture
Receivers
Reconstruction
side information
signal detection
Source coding
Statistics
Testing
type-I error rate
type-II error rate
Title Distributed Binary Detection With Lossy Data Compression
URI https://ieeexplore.ieee.org/document/7888517
https://www.proquest.com/docview/2174326476
https://centralesupelec.hal.science/hal-01742427
Volume 63
WOSCitedRecordID wos000405634400028&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVIEE
  databaseName: IEEE Electronic Library (IEL)
  customDbUrl:
  eissn: 1557-9654
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0014512
  issn: 0018-9448
  databaseCode: RIE
  dateStart: 19630101
  isFulltext: true
  titleUrlDefault: https://ieeexplore.ieee.org/
  providerName: IEEE
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8NAEB5s8aAHq1axvgjiRTBtHtvd5OirVCjioWpvYbO7oQVJRdP-fmc2aSgogpcQltmw5MtkZnZnvgG45DrMuEk9V0WoTQw9XFdmsXCzKOqnmiseWPri15F4eoomk_h5A67rWhhjjE0-M126tWf5eq4WtFXWo3Ct74sGNIQQZa1WfWLA-n7JDO6jAmPMsTqS9OLe-HFMOVyiG_AoCqnTz5oJakwpAdJ2VvnxO7Y2ZtD63-p2YafyJZ2bEvw92DD5PrRWfRqcSm33YXuNdLAN0T1x5VKbK6OdW1uO69ybwqZk5c7brJg6I1w2DspCOvS0MlU2P4CXwcP4buhW_RNcFXJRuGGK4QfzU_TaVMbwivbYCBZrJtHRMsQlaMJI-8zEfUZUclIYL5DooEilmGbhITTzeW6OwAkYT2WYZUGgqHJXSjTrIU4UOtPcM3EHeqtXmqiKXJx6XLwnNsjw4gRBSAiEpAKhA1f1jI-SWOMP2QtEqRYjRuzhzSihMZRi6GWIpd-BNmFSS1VwdOB0BWpSqedXYuMwdAUFP_591gls0QLKTL9TaBafC3MGm2pZzL4-z-2X9w39BtJu
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3dS-QwEB_8AvVB7_TE9evK4cuBdfuRJu2jX8su11t8WD3fQpqkKBxVtLt_vzNptwiK4EspYVJCf53OTDLzG4BjbuKS2yLwdYraxNDD9VWZCb9M06QwXPPI0Rff5mI8Tu_ususFOOlqYay1LvnMntKtO8s3j3pKW2V9CteSUCzCcsJYFDbVWt2ZAUvChhs8RBXGqGN-KBlk_cloQllc4jTiaRpTr583RmjxnlIgXW-Vdz9kZ2UGm19b3zfYaL1J76yB_zss2GoLNuedGrxWcbdg_Q3t4Dakl8SWS42urPHOXUGud2lrl5RVef8e6nsvx2XjoKqVR09rkmWrH3AzuJpcDP22g4KvYy5qPy4wAGFhgX6bLhle0SJbwTLDFLpaltgEbZyakNksYUQmp4QNIoUuitKaGRbvwFL1WNld8CLGCxWXZRRpqt1VCg17jBOFKQ0PbNaD_vyVSt3Si1OXi__ShRlBJhEESSDIFoQe_O5mPDXUGp_I_kKUOjHixB6e5ZLGUIqhnyFmYQ-2CZNOqoWjBwdzUGWroC_SRWLoDAq-9_Gsn7A6nPzNZT4a_9mHNVpMk_d3AEv189Qewoqe1Q8vz0fuK3wFGwbVtQ
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Distributed+Binary+Detection+With+Lossy+Data+Compression&rft.jtitle=IEEE+transactions+on+information+theory&rft.au=Katz%2C+Gil&rft.au=Piantanida%2C+Pablo&rft.au=Debbah%2C+Merouane&rft.date=2017-08-01&rft.issn=0018-9448&rft.eissn=1557-9654&rft.volume=63&rft.issue=8&rft.spage=5207&rft.epage=5227&rft_id=info:doi/10.1109%2FTIT.2017.2688348&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_TIT_2017_2688348
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0018-9448&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0018-9448&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0018-9448&client=summon