Embedding Prior Knowledge Within Compressed Sensing by Neural Networks
In the compressed sensing framework, different algorithms have been proposed for sparse signal recovery from an incomplete set of linear measurements. The most known can be classified into two categories: ℓ 1 norm minimization-based algorithms and ℓ 0 pseudo-norm minimization with greedy matching pu...
Saved in:
| Published in: | IEEE transactions on neural networks Vol. 22; no. 10; pp. 1638 - 1649 |
|---|---|
| Main Authors: | , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
New York, NY
IEEE
01.10.2011
Institute of Electrical and Electronics Engineers |
| Subjects: | |
| ISSN: | 1045-9227, 1941-0093, 1941-0093 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | In the compressed sensing framework, different algorithms have been proposed for sparse signal recovery from an incomplete set of linear measurements. The most known can be classified into two categories: ℓ 1 norm minimization-based algorithms and ℓ 0 pseudo-norm minimization with greedy matching pursuit algorithms. In this paper, we propose a modified matching pursuit algorithm based on the orthogonal matching pursuit (OMP). The idea is to replace the correlation step of the OMP, with a neural network. Simulation results show that in the case of random sparse signal reconstruction, the proposed method performs as well as the OMP. Complexity overhead, for training and then integrating the network in the sparse signal recovery is thus not justified in this case. However, if the signal has an added structure, it is learned and incorporated in the proposed new OMP. We consider three structures: first, the sparse signal is positive, second the positions of the non zero coefficients of the sparse signal follow a certain spatial probability density function, the third case is a combination of both. Simulation results show that, for these signals of interest, the probability of exact recovery with our modified OMP increases significantly. Comparisons with ℓ 1 based reconstructions are also performed. We thus present a framework to reconstruct sparse signals with added structure by embedding, through neural network training, additional knowledge to the decoding process in order to have better performance in the recovery of sparse signals of interest. |
|---|---|
| AbstractList | In the compressed sensing framework, different algorithms have been proposed for sparse signal recovery from an incomplete set of linear measurements. The most known can be classified into two categories: ℓ 1 norm minimization-based algorithms and ℓ 0 pseudo-norm minimization with greedy matching pursuit algorithms. In this paper, we propose a modified matching pursuit algorithm based on the orthogonal matching pursuit (OMP). The idea is to replace the correlation step of the OMP, with a neural network. Simulation results show that in the case of random sparse signal reconstruction, the proposed method performs as well as the OMP. Complexity overhead, for training and then integrating the network in the sparse signal recovery is thus not justified in this case. However, if the signal has an added structure, it is learned and incorporated in the proposed new OMP. We consider three structures: first, the sparse signal is positive, second the positions of the non zero coefficients of the sparse signal follow a certain spatial probability density function, the third case is a combination of both. Simulation results show that, for these signals of interest, the probability of exact recovery with our modified OMP increases significantly. Comparisons with ℓ 1 based reconstructions are also performed. We thus present a framework to reconstruct sparse signals with added structure by embedding, through neural network training, additional knowledge to the decoding process in order to have better performance in the recovery of sparse signals of interest. In the compressed sensing framework, different algorithms have been proposed for sparse signal recovery from an incomplete set of linear measurements. The most known can be classified into two categories: [ell] 1 norm minimization-based algorithms and [ell] 0 pseudo-norm minimization with greedy matching pursuit algorithms. In this paper, we propose a modified matching pursuit algorithm based on the orthogonal matching pursuit (OMP). The idea is to replace the correlation step of the OMP, with a neural network. Simulation results show that in the case of random sparse signal reconstruction, the proposed method performs as well as the OMP. Complexity overhead, for training and then integrating the network in the sparse signal recovery is thus not justified in this case. However, if the signal has an added structure, it is learned and incorporated in the proposed new OMP. We consider three structures: first, the sparse signal is positive, second the positions of the non zero coefficients of the sparse signal follow a certain spatial probability density function, the third case is a combination of both. Simulation results show that, for these signals of interest, the probability of exact recovery with our modified OMP increases significantly. Comparisons with [ell] 1 based reconstructions are also performed. We thus present a framework to reconstruct sparse signals with added structure by embedding, through neural network training, additional knowledge to the decoding process in order to have better performance in the recovery of sparse signals of interest. In the compressed sensing framework, different algorithms have been proposed for sparse signal recovery from an incomplete set of linear measurements. The most known can be classified into two categories: l(1) norm minimization-based algorithms and l(0) pseudo-norm minimization with greedy matching pursuit algorithms. In this paper, we propose a modified matching pursuit algorithm based on the orthogonal matching pursuit (OMP). The idea is to replace the correlation step of the OMP, with a neural network. Simulation results show that in the case of random sparse signal reconstruction, the proposed method performs as well as the OMP. Complexity overhead, for training and then integrating the network in the sparse signal recovery is thus not justified in this case. However, if the signal has an added structure, it is learned and incorporated in the proposed new OMP. We consider three structures: first, the sparse signal is positive, second the positions of the non zero coefficients of the sparse signal follow a certain spatial probability density function, the third case is a combination of both. Simulation results show that, for these signals of interest, the probability of exact recovery with our modified OMP increases significantly. Comparisons with l(1) based reconstructions are also performed. We thus present a framework to reconstruct sparse signals with added structure by embedding, through neural network training, additional knowledge to the decoding process in order to have better performance in the recovery of sparse signals of interest.In the compressed sensing framework, different algorithms have been proposed for sparse signal recovery from an incomplete set of linear measurements. The most known can be classified into two categories: l(1) norm minimization-based algorithms and l(0) pseudo-norm minimization with greedy matching pursuit algorithms. In this paper, we propose a modified matching pursuit algorithm based on the orthogonal matching pursuit (OMP). The idea is to replace the correlation step of the OMP, with a neural network. Simulation results show that in the case of random sparse signal reconstruction, the proposed method performs as well as the OMP. Complexity overhead, for training and then integrating the network in the sparse signal recovery is thus not justified in this case. However, if the signal has an added structure, it is learned and incorporated in the proposed new OMP. We consider three structures: first, the sparse signal is positive, second the positions of the non zero coefficients of the sparse signal follow a certain spatial probability density function, the third case is a combination of both. Simulation results show that, for these signals of interest, the probability of exact recovery with our modified OMP increases significantly. Comparisons with l(1) based reconstructions are also performed. We thus present a framework to reconstruct sparse signals with added structure by embedding, through neural network training, additional knowledge to the decoding process in order to have better performance in the recovery of sparse signals of interest. In the compressed sensing framework, different algorithms have been proposed for sparse signal recovery from an incomplete set of linear measurements. The most known can be classified into two categories: l(1) norm minimization-based algorithms and l(0) pseudo-norm minimization with greedy matching pursuit algorithms. In this paper, we propose a modified matching pursuit algorithm based on the orthogonal matching pursuit (OMP). The idea is to replace the correlation step of the OMP, with a neural network. Simulation results show that in the case of random sparse signal reconstruction, the proposed method performs as well as the OMP. Complexity overhead, for training and then integrating the network in the sparse signal recovery is thus not justified in this case. However, if the signal has an added structure, it is learned and incorporated in the proposed new OMP. We consider three structures: first, the sparse signal is positive, second the positions of the non zero coefficients of the sparse signal follow a certain spatial probability density function, the third case is a combination of both. Simulation results show that, for these signals of interest, the probability of exact recovery with our modified OMP increases significantly. Comparisons with l(1) based reconstructions are also performed. We thus present a framework to reconstruct sparse signals with added structure by embedding, through neural network training, additional knowledge to the decoding process in order to have better performance in the recovery of sparse signals of interest. |
| Author | Diab, C. Merhej, D. Prost, R. Khalil, M. |
| Author_xml | – sequence: 1 givenname: D. surname: Merhej fullname: Merhej, D. email: dany.merhej@creatis.insa-lyon.fr organization: CREATIS Lab., Univ. de Lyon, Villeurbanne, France – sequence: 2 givenname: C. surname: Diab fullname: Diab, C. email: cdiab@cnam.fr organization: Inst. of Appl. & Econ. Sci., Hamra, Lebanon – sequence: 3 givenname: M. surname: Khalil fullname: Khalil, M. email: m.khalil@ul.edu.lb organization: Azm Center for Res. in Biotechnol., Lebanese Univ., Tripoli, Lebanon – sequence: 4 givenname: R. surname: Prost fullname: Prost, R. email: remy.prost@creatis.insa-lyon.fr organization: CREATIS Lab., Univ. de Lyon, Villeurbanne, France |
| BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=24628460$$DView record in Pascal Francis https://www.ncbi.nlm.nih.gov/pubmed/21900075$$D View this record in MEDLINE/PubMed |
| BookMark | eNqFkkFv1DAQhS3UirYLdyQklAuilywztuPER7RqKaLaIlHEMXLiSTEkztbOquq_x9EuReqhvczM4Xszmnlzwg786ImxNwhLRNAfr9frJQfEJUclK4QX7Bi1xBxAi4NUgyxyzXl5xE5i_A2AsgD1kh1x1ABQFsfs_GxoyFrnb7JvwY0h--rHu57sDWU_3fTL-Ww1DptAMZLNvpOPM9ncZ2vaBtOnNN2N4U98xQ4700d6vc8L9uP87Hp1kV9eff6y-nSZt1LClHNbtCQ63onGVo1WxHnRKi1NWRhZlYCNbkhhwytZlLbqsCorrhrbShJWAIgF-7Druwnj7ZbiVA8uttT3xtO4jbXmSgiEFJ8jK62EllXCF-z0SRJViRKhEHPTd3t02wxk601wgwn39b97JuD9HjCxNX0XjG9d_M9JlVZT8x6w49owxhioe0AQ6tnaOllbz9bWe2uTRD2StG4ykxv9FIzrnxK-3QkdET3MUelH0meIv1GmrUM |
| CODEN | ITNNEP |
| CitedBy_id | crossref_primary_10_1063_5_0216197 crossref_primary_10_1007_s13042_021_01337_1 crossref_primary_10_1016_j_sigpro_2016_07_006 crossref_primary_10_1109_TNNLS_2012_2197412 crossref_primary_10_12677_AIRR_2023_123018 crossref_primary_10_1109_JIOT_2020_3021724 crossref_primary_10_1109_TIM_2013_2278577 crossref_primary_10_1007_s00034_018_0869_6 crossref_primary_10_1109_TSP_2016_2557301 crossref_primary_10_3934_jimo_2025071 crossref_primary_10_1007_s10462_022_10259_5 crossref_primary_10_1016_j_dsp_2019_05_014 crossref_primary_10_3390_rs13214429 crossref_primary_10_1109_JSEN_2021_3080120 crossref_primary_10_1109_TNNLS_2016_2600243 crossref_primary_10_1016_j_hcc_2023_100125 crossref_primary_10_1109_TSP_2012_2231076 |
| Cites_doi | 10.1016/0893-6080(89)90020-8 10.1109/TIT.2008.929920 10.1109/TIT.2010.2040894 10.1007/s00041-008-9045-x 10.1109/TIT.2007.909108 10.1109/JPROC.2010.2045630 10.1016/j.crma.2008.03.014 10.1090/S0894-0347-08-00610-3 10.1002/cpa.20132 10.1088/0266-5611/23/3/008 10.1109/MSP.2007.914730 10.1109/TIT.2004.834793 10.1109/JSTSP.2010.2042412 10.1109/TNN.2009.2032182 10.1109/TIT.2006.885507 10.1051/0004-6361/201014535 10.1109/TIT.2009.2016006 10.1016/j.acha.2008.07.002 10.1109/TIT.2005.858979 |
| ContentType | Journal Article |
| Copyright | 2015 INIST-CNRS 2011 IEEE |
| Copyright_xml | – notice: 2015 INIST-CNRS – notice: 2011 IEEE |
| DBID | 97E RIA RIE AAYXX CITATION IQODW CGR CUY CVF ECM EIF NPM 7SC 7SP 8FD F28 FR3 JQ2 L7M L~C L~D 7X8 7QO P64 |
| DOI | 10.1109/TNN.2011.2164810 |
| DatabaseName | IEEE All-Society Periodicals Package (ASPP) 2005–Present IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef Pascal-Francis Medline MEDLINE MEDLINE (Ovid) MEDLINE MEDLINE PubMed Computer and Information Systems Abstracts Electronics & Communications Abstracts Technology Research Database ANTE: Abstracts in New Technology & Engineering Engineering Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional MEDLINE - Academic Biotechnology Research Abstracts Biotechnology and BioEngineering Abstracts |
| DatabaseTitle | CrossRef MEDLINE Medline Complete MEDLINE with Full Text PubMed MEDLINE (Ovid) Technology Research Database Computer and Information Systems Abstracts – Academic Electronics & Communications Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Engineering Research Database Advanced Technologies Database with Aerospace ANTE: Abstracts in New Technology & Engineering Computer and Information Systems Abstracts Professional MEDLINE - Academic Biotechnology Research Abstracts Biotechnology and BioEngineering Abstracts |
| DatabaseTitleList | Engineering Research Database Technology Research Database MEDLINE - Academic MEDLINE |
| Database_xml | – sequence: 1 dbid: NPM name: PubMed url: http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed sourceTypes: Index Database – sequence: 2 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher – sequence: 3 dbid: 7X8 name: MEDLINE - Academic url: https://search.proquest.com/medline sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Anatomy & Physiology Computer Science Applied Sciences |
| EISSN | 1941-0093 |
| EndPage | 1649 |
| ExternalDocumentID | 21900075 24628460 10_1109_TNN_2011_2164810 6009227 |
| Genre | orig-research Research Support, Non-U.S. Gov't Journal Article |
| GroupedDBID | --- -~X .DC 0R~ 29I 4.4 53G 5GY 5VS 6IK 97E AAJGR AASAJ AAWTH ABAZT ABJNI ABQJQ ABVLG ACGFS AETIX AGQYO AGSQL AHBIQ AI. AIBXA ALLEH ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 EBS EJD F5P HZ~ H~9 ICLAB IFIPE IFJZH IPLJI JAVBF LAI M43 MS~ O9- OCL P2P RIA RIE RNS S10 TAE TN5 VH1 AAYXX CITATION IQODW RIG CGR CUY CVF ECM EIF NPM 7SC 7SP 8FD F28 FR3 JQ2 L7M L~C L~D 7X8 7QO P64 |
| ID | FETCH-LOGICAL-c440t-2d5ce3f2f3bd8b96e225c694a75a48701b9be61b28457d8f187826bdc4e3d3003 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 21 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000295584100011&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1045-9227 1941-0093 |
| IngestDate | Tue Oct 07 09:43:04 EDT 2025 Fri Sep 05 12:28:16 EDT 2025 Fri Sep 05 00:45:37 EDT 2025 Mon Jul 21 06:06:06 EDT 2025 Mon Jul 21 09:14:18 EDT 2025 Sat Nov 29 03:59:25 EST 2025 Tue Nov 18 22:53:29 EST 2025 Wed Aug 27 02:52:17 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | true |
| Issue | 10 |
| Keywords | Random signal Probabilistic approach neural networks Minimization Decoding Case based reasoning Neural network orthogonal matching pursuit Inverse problem Restoration Greedy algorithm Probability density function Signal reconstruction Compressed sensing |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html CC BY 4.0 2011 IEEE |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c440t-2d5ce3f2f3bd8b96e225c694a75a48701b9be61b28457d8f187826bdc4e3d3003 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
| PMID | 21900075 |
| PQID | 1671410536 |
| PQPubID | 23500 |
| PageCount | 12 |
| ParticipantIDs | proquest_miscellaneous_1671410536 proquest_miscellaneous_926331026 crossref_citationtrail_10_1109_TNN_2011_2164810 ieee_primary_6009227 pubmed_primary_21900075 proquest_miscellaneous_896394863 crossref_primary_10_1109_TNN_2011_2164810 pascalfrancis_primary_24628460 |
| PublicationCentury | 2000 |
| PublicationDate | 2011-10-01 |
| PublicationDateYYYYMMDD | 2011-10-01 |
| PublicationDate_xml | – month: 10 year: 2011 text: 2011-10-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | New York, NY |
| PublicationPlace_xml | – name: New York, NY – name: United States |
| PublicationTitle | IEEE transactions on neural networks |
| PublicationTitleAbbrev | TNN |
| PublicationTitleAlternate | IEEE Trans Neural Netw |
| PublicationYear | 2011 |
| Publisher | IEEE Institute of Electrical and Electronics Engineers |
| Publisher_xml | – name: IEEE – name: Institute of Electrical and Electronics Engineers |
| References | ref13 ref12 haykin (ref16) 1999 ref15 ref14 ref20 ref22 ref2 ref1 ref17 ref19 ref8 ref7 poglitsch (ref23) 2010; 518 ref9 needell (ref11) 2010; 4 ref4 donoho (ref10) 2006 ref3 ref6 ref5 grant (ref21) 2010 donoho (ref18) 0 |
| References_xml | – ident: ref17 doi: 10.1016/0893-6080(89)90020-8 – year: 0 ident: ref18 publication-title: Sparselab – year: 2010 ident: ref21 publication-title: CVX Matlab Software for Disciplined Convex Programming Version 1 21 – ident: ref20 doi: 10.1109/TIT.2008.929920 – ident: ref14 doi: 10.1109/TIT.2010.2040894 – ident: ref7 doi: 10.1007/s00041-008-9045-x – ident: ref9 doi: 10.1109/TIT.2007.909108 – ident: ref22 doi: 10.1109/JPROC.2010.2045630 – ident: ref4 doi: 10.1016/j.crma.2008.03.014 – ident: ref1 doi: 10.1090/S0894-0347-08-00610-3 – ident: ref5 doi: 10.1002/cpa.20132 – ident: ref6 doi: 10.1088/0266-5611/23/3/008 – ident: ref19 doi: 10.1109/MSP.2007.914730 – ident: ref8 doi: 10.1109/TIT.2004.834793 – year: 1999 ident: ref16 publication-title: Neural Networks A Comprehensive Foundation – volume: 4 start-page: 310 year: 2010 ident: ref11 article-title: Signal recovery from incomplete and inaccurate measurements via regularized orthogonal matching pursuit publication-title: IEEE J Sel Topics Signal Process doi: 10.1109/JSTSP.2010.2042412 – year: 2006 ident: ref10 publication-title: Sparse Solution of Underdetermined Linear Equations by Stagewise Orthogonal Matching Pursuit – ident: ref15 doi: 10.1109/TNN.2009.2032182 – ident: ref2 doi: 10.1109/TIT.2006.885507 – volume: 518 start-page: l2-1 year: 2010 ident: ref23 article-title: The photodetector array camera and spectrometer (PACS) on the herschel space observatory publication-title: Astron Astrophys doi: 10.1051/0004-6361/201014535 – ident: ref13 doi: 10.1109/TIT.2009.2016006 – ident: ref12 doi: 10.1016/j.acha.2008.07.002 – ident: ref3 doi: 10.1109/TIT.2005.858979 |
| SSID | ssj0014506 |
| Score | 2.158067 |
| Snippet | In the compressed sensing framework, different algorithms have been proposed for sparse signal recovery from an incomplete set of linear measurements. The most... |
| SourceID | proquest pubmed pascalfrancis crossref ieee |
| SourceType | Aggregation Database Index Database Enrichment Source Publisher |
| StartPage | 1638 |
| SubjectTerms | Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Artificial Intelligence Compressed Compressed sensing Computer science; control theory; systems Computer simulation Computer systems performance. Reliability Connectionism. Neural networks Correlation Data Compression - methods Decoding Exact sciences and technology Greedy algorithms Humans Indexes Matching Matching pursuit algorithms Models, Neurological Neural networks Neural Networks (Computer) Neurons orthogonal matching pursuit Recovery Signal processing Software Software Design Theoretical computing Training |
| Title | Embedding Prior Knowledge Within Compressed Sensing by Neural Networks |
| URI | https://ieeexplore.ieee.org/document/6009227 https://www.ncbi.nlm.nih.gov/pubmed/21900075 https://www.proquest.com/docview/1671410536 https://www.proquest.com/docview/896394863 https://www.proquest.com/docview/926331026 |
| Volume | 22 |
| WOSCitedRecordID | wos000295584100011&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: 1941-0093 dateEnd: 20111231 omitProxy: false ssIdentifier: ssj0014506 issn: 1045-9227 databaseCode: RIE dateStart: 19900101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3raxQxEB_a4gf9YOudj1N7RBBBcL3dJJvHx1J6CMpSsOJ9WzaPpQd2T-4h9L93kn1owRP6bWEnS9hfJjOTmfwG4K3TNLNU-yTHCCjhlTOJ4Y4ndS69DSa1qmLXki-yKNRioS8P4MNwF8Z7H4vP_MfwGHP5bmV34ahsJgJDEJWHcCilaO9qDRkDnsc-mhhd5EkQ6lOSqZ5dFUXL1UkxNlBZGgmAdbSWd6xRbK8SiiOrDf6fum1ssd_zjBZofny_uZ_A487TJGft0ngCB74ZwfiswSj75pa8I7H2Mx6qj-C4b-5AOl0fwaO_mArHML-4Md4FO0cu18vVmnzuz-LI9-X2etmQ8IVIRO7I11AUj5LmlgTuD5xE0Rabb57Ct_nF1fmnpGvBkFjO021CXW49q2nNjFNGC4_qb4XmlcwrDHXSzGjjRWbQyOXSqTpT6HEI4yz3zDHcMZ7BUbNq_AsgKVPc1kZKnzmOO0FVM2mskHWowLDCTmDWQ1Hajp88tMn4UcY4JdUl4lgGHMsOxwm8H0b8bLk5_iM7DpgMch0cE5jeQXt4T8OdXS5w3Jse_hIVL2RTqsavdpsyEzLWyDIxAbJHRuH2prkSbL-IpoKhi03xK8_b1fVnDt0iffnvub-Ch7QvSMxew9F2vfOn8MD-2i436ynqyEJNo478BuF-CfY |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1baxQxFD7UKqgPVnetbtUaQQTB6c4kmWTyWKRLpetQcMW-DZPL0IV2VvYi9N_3JHPRgiv4NjAnQ5gvOZeck_MBvLeKJoYqF6UYAUW8tDrS3PKoSqUz3qSWZWAtmco8zy4u1PkOfOrvwjjnQvGZO_KPIZdvF2bjj8rGwncIovIe3PfMWe1trT5nwNPApInxRRp5sS4pGavxLM-bbp0Uo4MsiUMLYBXs5R17FAhWfHlkucI_VDXUFtt9z2CDJnv_N_un8KT1NclxsziewY6rBzA8rjHOvr4hH0io_gzH6gPY6-gdSLvbB_D4j16FQ5icXGtnvaUj58v5YknOutM48mO-vpzXxH8htCK35Jsvi0dJfUN89w-cRN6Um6-ew_fJyezzadSSMESG83gdUZsaxypaMW0zrYRDBWCE4qVMSwx24kQr7USi0cyl0mZVkqHPIbQ13DHLUGfsw269qN1LIDHLuKm0lC6xHHVBWTGpjZCVr8Ewwoxg3EFRmLZDuSfKuCpCpBKrAnEsPI5Fi-MIPvYjfjbdOf4hO_SY9HItHCM4vIN2_576W7tc4Lh3HfwFbj2fTylrt9isikTIUCXLxAjIFpkMFZzimWDbRRQVDJ1sil950ayu33NoF-nB3-f-Fh6ezr5Oi-mX_OwVPKJdeWLyGnbXy417Aw_Mr_V8tTwMO-UWmVIMVw |
| 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=Embedding+Prior+Knowledge+Within+Compressed+Sensing+by+Neural+Networks&rft.jtitle=IEEE+transactions+on+neural+networks&rft.au=Merhej%2C+Dany&rft.au=Diab%2C+Chaouki&rft.au=Khalil%2C+Mohamad&rft.au=Prost%2C+Remy&rft.date=2011-10-01&rft.issn=1045-9227&rft.eissn=1941-0093&rft.volume=22&rft.issue=10&rft.spage=1638&rft.epage=1649&rft_id=info:doi/10.1109%2FTNN.2011.2164810&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1045-9227&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1045-9227&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1045-9227&client=summon |