Sparse solutions to linear inverse problems with multiple measurement vectors
We address the problem of finding sparse solutions to an underdetermined system of equations when there are multiple measurement vectors having the same, but unknown, sparsity structure. The single measurement sparse solution problem has been extensively studied in the past. Although known to be NP-...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on signal processing 2005-07, Vol.53 (7), p.2477-2488 |
|---|---|
| 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 | 2488 |
|---|---|
| container_issue | 7 |
| container_start_page | 2477 |
| container_title | IEEE transactions on signal processing |
| container_volume | 53 |
| creator | Cotter, S.F. Rao, B.D. Kjersti Engan Kreutz-Delgado, K. |
| description | We address the problem of finding sparse solutions to an underdetermined system of equations when there are multiple measurement vectors having the same, but unknown, sparsity structure. The single measurement sparse solution problem has been extensively studied in the past. Although known to be NP-hard, many single-measurement suboptimal algorithms have been formulated that have found utility in many different applications. Here, we consider in depth the extension of two classes of algorithms-Matching Pursuit (MP) and FOCal Underdetermined System Solver (FOCUSS)-to the multiple measurement case so that they may be used in applications such as neuromagnetic imaging, where multiple measurement vectors are available, and solutions with a common sparsity structure must be computed. Cost functions appropriate to the multiple measurement problem are developed, and algorithms are derived based on their minimization. A simulation study is conducted on a test-case dictionary to show how the utilization of more than one measurement vector improves the performance of the MP and FOCUSS classes of algorithm, and their performances are compared. |
| doi_str_mv | 10.1109/TSP.2005.849172 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_pascalfrancis_primary_16918084</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1453780</ieee_id><sourcerecordid>28089527</sourcerecordid><originalsourceid>FETCH-LOGICAL-c427t-db0e9e83e5be34aaf30036b65a2f11cd31abadaa12bc01fd3afa4220e277eff43</originalsourceid><addsrcrecordid>eNp9kUtLxTAQhYso-Fy7cFMEddXr5NEmXYr4AkVBBXdh2jvBSNpek1bx35vLFQQXrmbgfHM4w8myfQYzxqA-fXp8mHGAcqZlzRRfy7ZYLVkBUlXraYdSFKVWL5vZdoxvAEzKutrK7h4XGCLlcfDT6IY-5uOQe9cThtz1H7TUFmFoPHUx_3Tja95NfnQLT3lHGKdAHfVj_kHtOIS4m21Y9JH2fuZO9nx58XR-XdzeX92cn90WreRqLOYNUE1aUNmQkIhWAIiqqUrklrF2Lhg2OEdkvGmB2blAi5JzIK4UWSvFTnay8k3R3ieKo-lcbMl77GmYotF1xUGyiify-F-Sa9B1yVUCD_-Ab8MU-vSF0VXNBNeqStDpCmrDEGMgaxbBdRi-DAOzbMGkFsyyBbNqIV0c_dhibNHbgH3r4u9Zsk4Jlh8drDhHRL-yLIXSIL4BxaiRpQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>869132876</pqid></control><display><type>article</type><title>Sparse solutions to linear inverse problems with multiple measurement vectors</title><source>IEEE Electronic Library (IEL)</source><creator>Cotter, S.F. ; Rao, B.D. ; Kjersti Engan ; Kreutz-Delgado, K.</creator><creatorcontrib>Cotter, S.F. ; Rao, B.D. ; Kjersti Engan ; Kreutz-Delgado, K.</creatorcontrib><description>We address the problem of finding sparse solutions to an underdetermined system of equations when there are multiple measurement vectors having the same, but unknown, sparsity structure. The single measurement sparse solution problem has been extensively studied in the past. Although known to be NP-hard, many single-measurement suboptimal algorithms have been formulated that have found utility in many different applications. Here, we consider in depth the extension of two classes of algorithms-Matching Pursuit (MP) and FOCal Underdetermined System Solver (FOCUSS)-to the multiple measurement case so that they may be used in applications such as neuromagnetic imaging, where multiple measurement vectors are available, and solutions with a common sparsity structure must be computed. Cost functions appropriate to the multiple measurement problem are developed, and algorithms are derived based on their minimization. A simulation study is conducted on a test-case dictionary to show how the utilization of more than one measurement vector improves the performance of the MP and FOCUSS classes of algorithm, and their performances are compared.</description><identifier>ISSN: 1053-587X</identifier><identifier>EISSN: 1941-0476</identifier><identifier>DOI: 10.1109/TSP.2005.849172</identifier><identifier>CODEN: ITPRED</identifier><language>eng</language><publisher>New York, NY: IEEE</publisher><subject>Algorithms ; Applied sciences ; Computational modeling ; Computer simulation ; Cost function ; Dictionaries ; Equations ; Exact sciences and technology ; Focusing ; Image processing ; Imaging ; Information, signal and communications theory ; Inverse problems ; Mathematical analysis ; Mathematical models ; Minimization methods ; Pursuit algorithms ; Signal processing ; Sparsity ; Studies ; Telecommunications and information theory ; Testing ; Vectors ; Vectors (mathematics)</subject><ispartof>IEEE transactions on signal processing, 2005-07, Vol.53 (7), p.2477-2488</ispartof><rights>2005 INIST-CNRS</rights><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2005</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c427t-db0e9e83e5be34aaf30036b65a2f11cd31abadaa12bc01fd3afa4220e277eff43</citedby><cites>FETCH-LOGICAL-c427t-db0e9e83e5be34aaf30036b65a2f11cd31abadaa12bc01fd3afa4220e277eff43</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1453780$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27922,27923,54756</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1453780$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=16918084$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Cotter, S.F.</creatorcontrib><creatorcontrib>Rao, B.D.</creatorcontrib><creatorcontrib>Kjersti Engan</creatorcontrib><creatorcontrib>Kreutz-Delgado, K.</creatorcontrib><title>Sparse solutions to linear inverse problems with multiple measurement vectors</title><title>IEEE transactions on signal processing</title><addtitle>TSP</addtitle><description>We address the problem of finding sparse solutions to an underdetermined system of equations when there are multiple measurement vectors having the same, but unknown, sparsity structure. The single measurement sparse solution problem has been extensively studied in the past. Although known to be NP-hard, many single-measurement suboptimal algorithms have been formulated that have found utility in many different applications. Here, we consider in depth the extension of two classes of algorithms-Matching Pursuit (MP) and FOCal Underdetermined System Solver (FOCUSS)-to the multiple measurement case so that they may be used in applications such as neuromagnetic imaging, where multiple measurement vectors are available, and solutions with a common sparsity structure must be computed. Cost functions appropriate to the multiple measurement problem are developed, and algorithms are derived based on their minimization. A simulation study is conducted on a test-case dictionary to show how the utilization of more than one measurement vector improves the performance of the MP and FOCUSS classes of algorithm, and their performances are compared.</description><subject>Algorithms</subject><subject>Applied sciences</subject><subject>Computational modeling</subject><subject>Computer simulation</subject><subject>Cost function</subject><subject>Dictionaries</subject><subject>Equations</subject><subject>Exact sciences and technology</subject><subject>Focusing</subject><subject>Image processing</subject><subject>Imaging</subject><subject>Information, signal and communications theory</subject><subject>Inverse problems</subject><subject>Mathematical analysis</subject><subject>Mathematical models</subject><subject>Minimization methods</subject><subject>Pursuit algorithms</subject><subject>Signal processing</subject><subject>Sparsity</subject><subject>Studies</subject><subject>Telecommunications and information theory</subject><subject>Testing</subject><subject>Vectors</subject><subject>Vectors (mathematics)</subject><issn>1053-587X</issn><issn>1941-0476</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2005</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNp9kUtLxTAQhYso-Fy7cFMEddXr5NEmXYr4AkVBBXdh2jvBSNpek1bx35vLFQQXrmbgfHM4w8myfQYzxqA-fXp8mHGAcqZlzRRfy7ZYLVkBUlXraYdSFKVWL5vZdoxvAEzKutrK7h4XGCLlcfDT6IY-5uOQe9cThtz1H7TUFmFoPHUx_3Tja95NfnQLT3lHGKdAHfVj_kHtOIS4m21Y9JH2fuZO9nx58XR-XdzeX92cn90WreRqLOYNUE1aUNmQkIhWAIiqqUrklrF2Lhg2OEdkvGmB2blAi5JzIK4UWSvFTnay8k3R3ieKo-lcbMl77GmYotF1xUGyiify-F-Sa9B1yVUCD_-Ab8MU-vSF0VXNBNeqStDpCmrDEGMgaxbBdRi-DAOzbMGkFsyyBbNqIV0c_dhibNHbgH3r4u9Zsk4Jlh8drDhHRL-yLIXSIL4BxaiRpQ</recordid><startdate>20050701</startdate><enddate>20050701</enddate><creator>Cotter, S.F.</creator><creator>Rao, B.D.</creator><creator>Kjersti Engan</creator><creator>Kreutz-Delgado, K.</creator><general>IEEE</general><general>Institute of Electrical and Electronics Engineers</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>F28</scope><scope>FR3</scope></search><sort><creationdate>20050701</creationdate><title>Sparse solutions to linear inverse problems with multiple measurement vectors</title><author>Cotter, S.F. ; Rao, B.D. ; Kjersti Engan ; Kreutz-Delgado, K.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c427t-db0e9e83e5be34aaf30036b65a2f11cd31abadaa12bc01fd3afa4220e277eff43</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Algorithms</topic><topic>Applied sciences</topic><topic>Computational modeling</topic><topic>Computer simulation</topic><topic>Cost function</topic><topic>Dictionaries</topic><topic>Equations</topic><topic>Exact sciences and technology</topic><topic>Focusing</topic><topic>Image processing</topic><topic>Imaging</topic><topic>Information, signal and communications theory</topic><topic>Inverse problems</topic><topic>Mathematical analysis</topic><topic>Mathematical models</topic><topic>Minimization methods</topic><topic>Pursuit algorithms</topic><topic>Signal processing</topic><topic>Sparsity</topic><topic>Studies</topic><topic>Telecommunications and information theory</topic><topic>Testing</topic><topic>Vectors</topic><topic>Vectors (mathematics)</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Cotter, S.F.</creatorcontrib><creatorcontrib>Rao, B.D.</creatorcontrib><creatorcontrib>Kjersti Engan</creatorcontrib><creatorcontrib>Kreutz-Delgado, K.</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005–Present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications 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><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><jtitle>IEEE transactions on signal processing</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Cotter, S.F.</au><au>Rao, B.D.</au><au>Kjersti Engan</au><au>Kreutz-Delgado, K.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Sparse solutions to linear inverse problems with multiple measurement vectors</atitle><jtitle>IEEE transactions on signal processing</jtitle><stitle>TSP</stitle><date>2005-07-01</date><risdate>2005</risdate><volume>53</volume><issue>7</issue><spage>2477</spage><epage>2488</epage><pages>2477-2488</pages><issn>1053-587X</issn><eissn>1941-0476</eissn><coden>ITPRED</coden><abstract>We address the problem of finding sparse solutions to an underdetermined system of equations when there are multiple measurement vectors having the same, but unknown, sparsity structure. The single measurement sparse solution problem has been extensively studied in the past. Although known to be NP-hard, many single-measurement suboptimal algorithms have been formulated that have found utility in many different applications. Here, we consider in depth the extension of two classes of algorithms-Matching Pursuit (MP) and FOCal Underdetermined System Solver (FOCUSS)-to the multiple measurement case so that they may be used in applications such as neuromagnetic imaging, where multiple measurement vectors are available, and solutions with a common sparsity structure must be computed. Cost functions appropriate to the multiple measurement problem are developed, and algorithms are derived based on their minimization. A simulation study is conducted on a test-case dictionary to show how the utilization of more than one measurement vector improves the performance of the MP and FOCUSS classes of algorithm, and their performances are compared.</abstract><cop>New York, NY</cop><pub>IEEE</pub><doi>10.1109/TSP.2005.849172</doi><tpages>12</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1053-587X |
| ispartof | IEEE transactions on signal processing, 2005-07, Vol.53 (7), p.2477-2488 |
| issn | 1053-587X 1941-0476 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_16918084 |
| source | IEEE Electronic Library (IEL) |
| subjects | Algorithms Applied sciences Computational modeling Computer simulation Cost function Dictionaries Equations Exact sciences and technology Focusing Image processing Imaging Information, signal and communications theory Inverse problems Mathematical analysis Mathematical models Minimization methods Pursuit algorithms Signal processing Sparsity Studies Telecommunications and information theory Testing Vectors Vectors (mathematics) |
| title | Sparse solutions to linear inverse problems with multiple measurement vectors |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-14T08%3A43%3A56IST&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=Sparse%20solutions%20to%20linear%20inverse%20problems%20with%20multiple%20measurement%20vectors&rft.jtitle=IEEE%20transactions%20on%20signal%20processing&rft.au=Cotter,%20S.F.&rft.date=2005-07-01&rft.volume=53&rft.issue=7&rft.spage=2477&rft.epage=2488&rft.pages=2477-2488&rft.issn=1053-587X&rft.eissn=1941-0476&rft.coden=ITPRED&rft_id=info:doi/10.1109/TSP.2005.849172&rft_dat=%3Cproquest_RIE%3E28089527%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=869132876&rft_id=info:pmid/&rft_ieee_id=1453780&rfr_iscdi=true |