Decentralized sequential detection
A class of decentralized sequential detection problems is investigated. Under appropriate independence assumptions, it is shown that at each time instant the optimal local strategies are given by threshold tests on the likelihood of ratios. Furthermore, local decisions depend not only on the present...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on information theory 1989-05, Vol.35 (3), p.509-520 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 520 |
|---|---|
| container_issue | 3 |
| container_start_page | 509 |
| container_title | IEEE transactions on information theory |
| container_volume | 35 |
| creator | Hashemi, H.R. Rhodes, I.B. |
| description | A class of decentralized sequential detection problems is investigated. Under appropriate independence assumptions, it is shown that at each time instant the optimal local strategies are given by threshold tests on the likelihood of ratios. Furthermore, local decisions depend not only on the present and past observations, but on the past local decision as well. That is, for each local processor a different threshold exists for every different sequence of past decisions. Examples, computational techniques, discussions of the difficulties at hand, and suggestions for further exploration of the problem are presented.< > |
| doi_str_mv | 10.1109/18.30973 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_miscellaneous_28217188</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>30973</ieee_id><sourcerecordid>28217188</sourcerecordid><originalsourceid>FETCH-LOGICAL-c304t-868ea524c6d71f0027758f10c7f123a5ee71b094ee8d1d3abd4714a2253f715b3</originalsourceid><addsrcrecordid>eNpFkEtLxDAUhYMoWEfBrbtBUNx0zM2jSZcyPmHAja5Dmt5ApNOOSWehv36iHXR1OdyPj8Mh5BzoAoDWt6AXnNaKH5ACpFRlXUlxSApKQZe1EPqYnKT0kaOQwApyeY8O-zHaLnxjO0_4uc0x2G7e4ohuDEN_So687RKe7e-MvD8-vC2fy9Xr08vyblU6TsVY6kqjlUy4qlXgKWVKSe2BOuWBcSsRFTS0Foi6hZbbphUKhGVMcq9ANnxGrifvJg65RRrNOiSHXWd7HLbJMM1AgdYZvJlAF4eUInqziWFt45cBan5GMKDN7wgZvdo7bXK289H2LqR_vlZS0opl7mLiAiL-vSfHDp_NYdE</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>28217188</pqid></control><display><type>article</type><title>Decentralized sequential detection</title><source>IEEE Electronic Library (IEL)</source><creator>Hashemi, H.R. ; Rhodes, I.B.</creator><creatorcontrib>Hashemi, H.R. ; Rhodes, I.B.</creatorcontrib><description>A class of decentralized sequential detection problems is investigated. Under appropriate independence assumptions, it is shown that at each time instant the optimal local strategies are given by threshold tests on the likelihood of ratios. Furthermore, local decisions depend not only on the present and past observations, but on the past local decision as well. That is, for each local processor a different threshold exists for every different sequence of past decisions. Examples, computational techniques, discussions of the difficulties at hand, and suggestions for further exploration of the problem are presented.< ></description><identifier>ISSN: 0018-9448</identifier><identifier>EISSN: 1557-9654</identifier><identifier>DOI: 10.1109/18.30973</identifier><identifier>CODEN: IETTAW</identifier><language>eng</language><publisher>New York, NY: IEEE</publisher><subject>Applied sciences ; Bandwidth ; Decision making ; Decision theory. Utility theory ; Detectors ; Exact sciences and technology ; Face detection ; Object detection ; Operational research and scientific management ; Operational research. Management science ; Reliability ; Statistics ; Testing</subject><ispartof>IEEE transactions on information theory, 1989-05, Vol.35 (3), p.509-520</ispartof><rights>1991 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c304t-868ea524c6d71f0027758f10c7f123a5ee71b094ee8d1d3abd4714a2253f715b3</citedby><cites>FETCH-LOGICAL-c304t-868ea524c6d71f0027758f10c7f123a5ee71b094ee8d1d3abd4714a2253f715b3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/30973$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,777,781,793,27905,27906,54739</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/30973$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=19755062$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Hashemi, H.R.</creatorcontrib><creatorcontrib>Rhodes, I.B.</creatorcontrib><title>Decentralized sequential detection</title><title>IEEE transactions on information theory</title><addtitle>TIT</addtitle><description>A class of decentralized sequential detection problems is investigated. Under appropriate independence assumptions, it is shown that at each time instant the optimal local strategies are given by threshold tests on the likelihood of ratios. Furthermore, local decisions depend not only on the present and past observations, but on the past local decision as well. That is, for each local processor a different threshold exists for every different sequence of past decisions. Examples, computational techniques, discussions of the difficulties at hand, and suggestions for further exploration of the problem are presented.< ></description><subject>Applied sciences</subject><subject>Bandwidth</subject><subject>Decision making</subject><subject>Decision theory. Utility theory</subject><subject>Detectors</subject><subject>Exact sciences and technology</subject><subject>Face detection</subject><subject>Object detection</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><subject>Reliability</subject><subject>Statistics</subject><subject>Testing</subject><issn>0018-9448</issn><issn>1557-9654</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1989</creationdate><recordtype>article</recordtype><recordid>eNpFkEtLxDAUhYMoWEfBrbtBUNx0zM2jSZcyPmHAja5Dmt5ApNOOSWehv36iHXR1OdyPj8Mh5BzoAoDWt6AXnNaKH5ACpFRlXUlxSApKQZe1EPqYnKT0kaOQwApyeY8O-zHaLnxjO0_4uc0x2G7e4ohuDEN_So687RKe7e-MvD8-vC2fy9Xr08vyblU6TsVY6kqjlUy4qlXgKWVKSe2BOuWBcSsRFTS0Foi6hZbbphUKhGVMcq9ANnxGrifvJg65RRrNOiSHXWd7HLbJMM1AgdYZvJlAF4eUInqziWFt45cBan5GMKDN7wgZvdo7bXK289H2LqR_vlZS0opl7mLiAiL-vSfHDp_NYdE</recordid><startdate>19890501</startdate><enddate>19890501</enddate><creator>Hashemi, H.R.</creator><creator>Rhodes, I.B.</creator><general>IEEE</general><general>Institute of Electrical and Electronics Engineers</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>19890501</creationdate><title>Decentralized sequential detection</title><author>Hashemi, H.R. ; Rhodes, I.B.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c304t-868ea524c6d71f0027758f10c7f123a5ee71b094ee8d1d3abd4714a2253f715b3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1989</creationdate><topic>Applied sciences</topic><topic>Bandwidth</topic><topic>Decision making</topic><topic>Decision theory. Utility theory</topic><topic>Detectors</topic><topic>Exact sciences and technology</topic><topic>Face detection</topic><topic>Object detection</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><topic>Reliability</topic><topic>Statistics</topic><topic>Testing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Hashemi, H.R.</creatorcontrib><creatorcontrib>Rhodes, I.B.</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>IEEE transactions on information theory</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Hashemi, H.R.</au><au>Rhodes, I.B.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Decentralized sequential detection</atitle><jtitle>IEEE transactions on information theory</jtitle><stitle>TIT</stitle><date>1989-05-01</date><risdate>1989</risdate><volume>35</volume><issue>3</issue><spage>509</spage><epage>520</epage><pages>509-520</pages><issn>0018-9448</issn><eissn>1557-9654</eissn><coden>IETTAW</coden><abstract>A class of decentralized sequential detection problems is investigated. Under appropriate independence assumptions, it is shown that at each time instant the optimal local strategies are given by threshold tests on the likelihood of ratios. Furthermore, local decisions depend not only on the present and past observations, but on the past local decision as well. That is, for each local processor a different threshold exists for every different sequence of past decisions. Examples, computational techniques, discussions of the difficulties at hand, and suggestions for further exploration of the problem are presented.< ></abstract><cop>New York, NY</cop><pub>IEEE</pub><doi>10.1109/18.30973</doi><tpages>12</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 0018-9448 |
| ispartof | IEEE transactions on information theory, 1989-05, Vol.35 (3), p.509-520 |
| issn | 0018-9448 1557-9654 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_28217188 |
| source | IEEE Electronic Library (IEL) |
| subjects | Applied sciences Bandwidth Decision making Decision theory. Utility theory Detectors Exact sciences and technology Face detection Object detection Operational research and scientific management Operational research. Management science Reliability Statistics Testing |
| title | Decentralized sequential detection |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-19T11%3A49%3A58IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Decentralized%20sequential%20detection&rft.jtitle=IEEE%20transactions%20on%20information%20theory&rft.au=Hashemi,%20H.R.&rft.date=1989-05-01&rft.volume=35&rft.issue=3&rft.spage=509&rft.epage=520&rft.pages=509-520&rft.issn=0018-9448&rft.eissn=1557-9654&rft.coden=IETTAW&rft_id=info:doi/10.1109/18.30973&rft_dat=%3Cproquest_RIE%3E28217188%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=28217188&rft_id=info:pmid/&rft_ieee_id=30973&rfr_iscdi=true |