Convergence of Slice-Based Block Coordinate Descent Algorithm for Convolutional Sparse Coding
Convolutional sparse coding (CSC) models are becoming increasingly popular in the signal and image processing communities in recent years. Several research studies have addressed the basis pursuit (BP) problem of the CSC model, including the recently proposed local block coordinate descent (LoBCoD)...
Uloženo v:
| Vydáno v: | Mathematical problems in engineering Ročník 2020; číslo 2020; s. 1 - 8 |
|---|---|
| Hlavní autoři: | , , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Cairo, Egypt
Hindawi Publishing Corporation
2020
Hindawi John Wiley & Sons, Inc |
| Témata: | |
| ISSN: | 1024-123X, 1563-5147 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | Convolutional sparse coding (CSC) models are becoming increasingly popular in the signal and image processing communities in recent years. Several research studies have addressed the basis pursuit (BP) problem of the CSC model, including the recently proposed local block coordinate descent (LoBCoD) algorithm. This algorithm adopts slice-based local processing ideas and splits the global sparse vector into local vector needles that are locally computed in the original domain to obtain the encoding. However, a convergence theorem for the LoBCoD algorithm has not been given previously. This paper presents a convergence theorem for the LoBCoD algorithm which proves that the LoBCoD algorithm will converge to its global optimum at a rate of O1/k. A slice-based multilayer local block coordinate descent (ML-LoBCoD) algorithm is proposed which is motivated by the multilayer basis pursuit (ML-BP) problem and the LoBCoD algorithm. We prove that the ML-LoBCoD algorithm is guaranteed to converge to the optimal solution at a rate O1/k. Preliminary numerical experiments demonstrate the better performance of the proposed ML-LoBCoD algorithm compared to the LoBCoD algorithm for the BP problem, and the loss function value is also lower for ML-LoBCoD than LoBCoD. |
|---|---|
| AbstractList | Convolutional sparse coding (CSC) models are becoming increasingly popular in the signal and image processing communities in recent years. Several research studies have addressed the basis pursuit (BP) problem of the CSC model, including the recently proposed local block coordinate descent (LoBCoD) algorithm. This algorithm adopts slice-based local processing ideas and splits the global sparse vector into local vector needles that are locally computed in the original domain to obtain the encoding. However, a convergence theorem for the LoBCoD algorithm has not been given previously. This paper presents a convergence theorem for the LoBCoD algorithm which proves that the LoBCoD algorithm will converge to its global optimum at a rate of O1/k. A slice-based multilayer local block coordinate descent (ML-LoBCoD) algorithm is proposed which is motivated by the multilayer basis pursuit (ML-BP) problem and the LoBCoD algorithm. We prove that the ML-LoBCoD algorithm is guaranteed to converge to the optimal solution at a rate O1/k. Preliminary numerical experiments demonstrate the better performance of the proposed ML-LoBCoD algorithm compared to the LoBCoD algorithm for the BP problem, and the loss function value is also lower for ML-LoBCoD than LoBCoD. Convolutional sparse coding (CSC) models are becoming increasingly popular in the signal and image processing communities in recent years. Several research studies have addressed the basis pursuit (BP) problem of the CSC model, including the recently proposed local block coordinate descent (LoBCoD) algorithm. This algorithm adopts slice-based local processing ideas and splits the global sparse vector into local vector needles that are locally computed in the original domain to obtain the encoding. However, a convergence theorem for the LoBCoD algorithm has not been given previously. This paper presents a convergence theorem for the LoBCoD algorithm which proves that the LoBCoD algorithm will converge to its global optimum at a rate of O 1 / k . A slice-based multilayer local block coordinate descent (ML-LoBCoD) algorithm is proposed which is motivated by the multilayer basis pursuit (ML-BP) problem and the LoBCoD algorithm. We prove that the ML-LoBCoD algorithm is guaranteed to converge to the optimal solution at a rate O 1 / k . Preliminary numerical experiments demonstrate the better performance of the proposed ML-LoBCoD algorithm compared to the LoBCoD algorithm for the BP problem, and the loss function value is also lower for ML-LoBCoD than LoBCoD. |
| Author | Yu, Hui Li, Jing Wang, Jin-Jia Wei, Xiao |
| Author_xml | – sequence: 1 fullname: Wang, Jin-Jia – sequence: 2 fullname: Wei, Xiao – sequence: 3 fullname: Yu, Hui – sequence: 4 fullname: Li, Jing |
| BookMark | eNqF0M9LwzAUB_AgCm7Tm2cJeNS6vCbpj-NWf8LAwxS8SInpy9bZJTPpFP97Ozrw6CmP8Hk_-A7JoXUWCTkDdg0g5ThmMRsLnqQS5AEZgEx4JEGkh13NYhFBzF-PyTCEFWMxSMgG5K1w9gv9Aq1G6gydN7XGaKoCVnTaOP1BC-d8VVvVIr3BoNG2dNIsnK_b5Zoa5-lugmu2be2sauh8o3zA7rPrWZyQI6OagKf7d0Re7m6fi4do9nT_WExmkeaQthEwhomBDBMOKseUSQVSvcsc81wriShSk3DkzBgVY1WpRGLKs1Rokccq43xELvq5G-8-txjacuW2vjsnlLHoVkjBuejUVa-0dyF4NOXG12vlf0pg5S7AchdguQ-w45c9X9a2Ut_1f_q819gZNOpPQy4h5fwXGKh7Vg |
| Cites_doi | 10.1109/tsp.2018.2846226 10.1007/s11228-011-0187-7 10.9781/ijimai.2018.08.003 10.1155/2019/5615243 10.1137/1.9781611974997 10.9781/ijimai.2019.05.003 10.1023/a:1017501703105 10.1109/TPAMI.2019.2904255 10.1109/ACCESS.2020.2974479 10.1109/tsp.2017.2733447 10.1137/120887679 10.1109/JPROC.2010.2044470 |
| ContentType | Journal Article |
| Copyright | Copyright © 2020 Jing Li et al. Copyright © 2020 Jing Li et al. This is an open access article distributed under the Creative Commons Attribution License (the “License”), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. http://creativecommons.org/licenses/by/4.0 |
| Copyright_xml | – notice: Copyright © 2020 Jing Li et al. – notice: Copyright © 2020 Jing Li et al. This is an open access article distributed under the Creative Commons Attribution License (the “License”), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. http://creativecommons.org/licenses/by/4.0 |
| DBID | ADJCN AHFXO RHU RHW RHX AAYXX CITATION 7TB 8FD 8FE 8FG ABJCF ABUWG AFKRA ARAPS AZQEC BENPR BGLVJ CCPQU CWDGH DWQXO FR3 GNUQQ HCIFZ JQ2 K7- KR7 L6V M7S P5Z P62 PHGZM PHGZT PIMPY PKEHL PQEST PQGLB PQQKQ PQUKI PRINS PTHSS |
| DOI | 10.1155/2020/4367515 |
| DatabaseName | الدوريات العلمية والإحصائية - e-Marefa Academic and Statistical Periodicals معرفة - المحتوى العربي الأكاديمي المتكامل - e-Marefa Academic Complete Hindawi Publishing Complete Hindawi Publishing Subscription Journals Hindawi Publishing Open Access CrossRef Mechanical & Transportation Engineering Abstracts Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection Materials Science & Engineering Collection ProQuest Central (Alumni) ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection ProQuest Central Essentials - QC ProQuest Central ProQuest Technology Collection ProQuest One Community College Middle East & Africa Database (ProQuest) ProQuest Central Korea Engineering Research Database ProQuest Central Student SciTech Premium Collection (via ProQuest) ProQuest Computer Science Collection Computer Science Database Civil Engineering Abstracts ProQuest Engineering Collection Engineering Database Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection Proquest Central Premium ProQuest One Academic (New) ProQuest Publicly Available Content Database ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China Engineering Collection |
| DatabaseTitle | CrossRef Publicly Available Content Database Computer Science Database ProQuest Central Student Technology Collection Technology Research Database ProQuest One Academic Middle East (New) Mechanical & Transportation Engineering Abstracts ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College ProQuest Central China ProQuest Central ProQuest One Applied & Life Sciences ProQuest Engineering Collection Middle East & Africa Database ProQuest Central Korea ProQuest Central (New) Engineering Collection Advanced Technologies & Aerospace Collection Civil Engineering Abstracts Engineering Database ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest SciTech Collection Advanced Technologies & Aerospace Database ProQuest One Academic UKI Edition Materials Science & Engineering Collection Engineering Research Database ProQuest One Academic ProQuest One Academic (New) |
| DatabaseTitleList | Publicly Available Content Database CrossRef |
| Database_xml | – sequence: 1 dbid: RHX name: Hindawi Publishing Open Access url: http://www.hindawi.com/journals/ sourceTypes: Publisher – sequence: 2 dbid: PIMPY name: ProQuest Publicly Available Content Database url: http://search.proquest.com/publiccontent sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Applied Sciences |
| EISSN | 1563-5147 |
| Editor | Torres, Javier Martinez |
| Editor_xml | – sequence: 1 givenname: Javier Martinez surname: Torres fullname: Torres, Javier Martinez |
| EndPage | 8 |
| ExternalDocumentID | 10_1155_2020_4367515 1195173 |
| GrantInformation_xml | – fundername: Special Projects on Basic Research Cooperation of Beijing, Tianjin and Hebei grantid: 19JCZDJC65600Z; F2019203583 – fundername: National Natural Science Foundation of China grantid: 61473339 |
| GroupedDBID | -~9 0R~ 188 24P 29M 2UF 2WC 4.4 5GY 5VS 8FE 8FG 8R4 8R5 AAFWJ AAMMB ABJCF ABUWG ACCMX ACIPV ACIWK ADBBV ADJCN AEFGJ AENEX AFFNX AFKRA AGXDD AHFXO AIDQK AIDYY ALMA_UNASSIGNED_HOLDINGS ARAPS BCNDV BENPR BGLVJ BPHCQ C1A CAG CCPQU COF CS3 CWDGH E3Z EBS EJD H13 HCIFZ IL9 IPNFZ K6V K7- KQ8 L6V M7S OK1 OVT P2P P62 PHGZM PHGZT PIMPY PQGLB PQQKQ PROAC PTHSS PUEGO Q2X REM RHU RIG RNS TR2 UGNYK XSB YQT 3V. AAJEY ABDBF AINHJ ESX GROUPED_DOAJ I-F IAO IEA IOF ISR ITC MK~ M~E RHW RHX TUS ~8M AAYXX AFFHD ALUQN CITATION 7TB 8FD AZQEC DWQXO FR3 GNUQQ JQ2 KR7 PKEHL PQEST PQUKI PRINS |
| ID | FETCH-LOGICAL-c317t-100e6f18e631a9e705a15ab59e99ca5ee47f63e30ffa2edda65e73874c492a833 |
| IEDL.DBID | RHX |
| ISICitedReferencesCount | 0 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000561243100005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1024-123X |
| IngestDate | Fri Jul 25 10:11:52 EDT 2025 Sat Nov 29 03:30:30 EST 2025 Sun Jun 02 18:50:59 EDT 2024 Thu Sep 25 15:15:56 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2020 |
| Language | English |
| License | This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. http://creativecommons.org/licenses/by/4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c317t-100e6f18e631a9e705a15ab59e99ca5ee47f63e30ffa2edda65e73874c492a833 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0000-0002-2210-5570 |
| OpenAccessLink | https://dx.doi.org/10.1155/2020/4367515 |
| PQID | 2431754334 |
| PQPubID | 237775 |
| PageCount | 8 |
| ParticipantIDs | proquest_journals_2431754334 crossref_primary_10_1155_2020_4367515 hindawi_primary_10_1155_2020_4367515 emarefa_primary_1195173 |
| PublicationCentury | 2000 |
| PublicationDate | 2020-00-00 |
| PublicationDateYYYYMMDD | 2020-01-01 |
| PublicationDate_xml | – year: 2020 text: 2020-00-00 |
| PublicationDecade | 2020 |
| PublicationPlace | Cairo, Egypt |
| PublicationPlace_xml | – name: Cairo, Egypt – name: New York |
| PublicationTitle | Mathematical problems in engineering |
| PublicationYear | 2020 |
| Publisher | Hindawi Publishing Corporation Hindawi John Wiley & Sons, Inc |
| Publisher_xml | – name: Hindawi Publishing Corporation – name: Hindawi – name: John Wiley & Sons, Inc |
| References | 11 13 14 15 16 17 (12) 2017; 18 1 2 3 4 5 10 |
| References_xml | – ident: 10 doi: 10.1109/tsp.2018.2846226 – ident: 15 doi: 10.1007/s11228-011-0187-7 – ident: 2 doi: 10.9781/ijimai.2018.08.003 – ident: 1 doi: 10.1155/2019/5615243 – volume: 18 start-page: 2887 issue: 1 year: 2017 ident: 12 publication-title: The Journal of Machine Learning Research – ident: 16 doi: 10.1137/1.9781611974997 – ident: 4 doi: 10.9781/ijimai.2019.05.003 – ident: 14 doi: 10.1023/a:1017501703105 – ident: 11 doi: 10.1109/TPAMI.2019.2904255 – ident: 17 doi: 10.1109/ACCESS.2020.2974479 – ident: 5 doi: 10.1109/tsp.2017.2733447 – ident: 13 doi: 10.1137/120887679 – ident: 3 doi: 10.1109/JPROC.2010.2044470 |
| SSID | ssj0021518 |
| Score | 2.1838949 |
| Snippet | Convolutional sparse coding (CSC) models are becoming increasingly popular in the signal and image processing communities in recent years. Several research... |
| SourceID | proquest crossref hindawi emarefa |
| SourceType | Aggregation Database Index Database Publisher |
| StartPage | 1 |
| SubjectTerms | Algorithms Coding Convergence Descent Dictionaries Image processing Mathematical problems Methods Multilayers Needles Optimization Signal processing Theorems Variables |
| SummonAdditionalLinks | – databaseName: Engineering Database dbid: M7S link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3fT8IwEG4UJfFF_C2Kpg_4uLCt67Y-GUCJD4aYoIYXs5TtJkRgyKb--163TkxM9MG3plvaZtfed9_tekdI044l-NyPjBGiv-FYYBp-yDwDmYDwWMxDyO9WPd56_b4_HIo77XBLdVhlqRNzRR0lofKRt-wc6RzGnMvFq6GqRqm_q7qExjrZUFkSrDx0b_BFuLCnuApnq9x8bFgGvnOuOL_Zchiay6og7jdIqsJMYgNxqjpWrPhj8kNL59DTq_130TtkWxudtF3skl2yBvM9UtMGKNXHO90nT10Vg55fxwSaxHQwRTVidBDoItpB1Huh3QTJ6mSOBiq9KhJB0fb0GafMxjOK9i9VI-jdjDMOFsibATsVQh6Qh971fffG0PUXjBCXnaGGNsGNLR9cZkkBnsmlxeWICxAilBzA8WKXATPjWNoQRdLl4DHfc0JH2NJn7JBU5skcjgl1eQRMjvBDABIebPo8EnzEwBIxAmRUJxelCIJFkWYjyOkJ54ESVaBFVSdHWj6r1yw0Ej1WJ00trz8GaJSSCvRpTYOVmE5-f3xKttRghQumQSrZ8g3OyGb4nk3S5Xm--T4B-QPeoQ priority: 102 providerName: ProQuest |
| Title | Convergence of Slice-Based Block Coordinate Descent Algorithm for Convolutional Sparse Coding |
| URI | https://search.emarefa.net/detail/BIM-1195173 https://dx.doi.org/10.1155/2020/4367515 https://www.proquest.com/docview/2431754334 |
| Volume | 2020 |
| WOSCitedRecordID | wos000561243100005&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: PRVPQU databaseName: Advanced Technologies & Aerospace Database customDbUrl: eissn: 1563-5147 dateEnd: 20250131 omitProxy: false ssIdentifier: ssj0021518 issn: 1024-123X databaseCode: P5Z dateStart: 20080101 isFulltext: true titleUrlDefault: https://search.proquest.com/hightechjournals providerName: ProQuest – providerCode: PRVPQU databaseName: Computer Science Database customDbUrl: eissn: 1563-5147 dateEnd: 20250131 omitProxy: false ssIdentifier: ssj0021518 issn: 1024-123X databaseCode: K7- dateStart: 20080101 isFulltext: true titleUrlDefault: http://search.proquest.com/compscijour providerName: ProQuest – providerCode: PRVPQU databaseName: Engineering Database customDbUrl: eissn: 1563-5147 dateEnd: 20250131 omitProxy: false ssIdentifier: ssj0021518 issn: 1024-123X databaseCode: M7S dateStart: 20080101 isFulltext: true titleUrlDefault: http://search.proquest.com providerName: ProQuest – providerCode: PRVPQU databaseName: Middle East & Africa Database (ProQuest) customDbUrl: eissn: 1563-5147 dateEnd: 20250131 omitProxy: false ssIdentifier: ssj0021518 issn: 1024-123X databaseCode: CWDGH dateStart: 20080101 isFulltext: true titleUrlDefault: https://search.proquest.com/middleeastafrica providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 1563-5147 dateEnd: 20250131 omitProxy: false ssIdentifier: ssj0021518 issn: 1024-123X databaseCode: BENPR dateStart: 20080101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Publicly Available Content Database customDbUrl: eissn: 1563-5147 dateEnd: 20250131 omitProxy: false ssIdentifier: ssj0021518 issn: 1024-123X databaseCode: PIMPY dateStart: 20080101 isFulltext: true titleUrlDefault: http://search.proquest.com/publiccontent providerName: ProQuest – providerCode: PRVWIB databaseName: Wiley Online Library Open Access customDbUrl: eissn: 1563-5147 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0021518 issn: 1024-123X databaseCode: 24P dateStart: 19950101 isFulltext: true titleUrlDefault: https://authorservices.wiley.com/open-science/open-access/browse-journals.html providerName: Wiley-Blackwell |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3JTsMwEB2xSlzYl7JUPsAxIonjOD7SAgIBVUQBFSQUucmEVkCL2gK_zzhxQcABLpGzTaLx8t5zPBOAXT_XGIkoc9qE_k7goetEKZcOKQEleS5SLGKrbs5loxG1Wiq2SZKGvz_hE9oZee7uB5yYrQkmnyTLRpSftD51FYFWGfHmmxR8vDVe3_7j3m_IM4vPmgoER7MdI37fu78G4wJhjhdh3lJDdlDW5RJMYG8ZFixNZLYTDlfgvm5WihdBk8j6OWs-UWd3agRHGasRNj2yep8kZbdHNJIdluma2MHTQ3_QHXWeGbFUZizYNkdPbL6QukU6aHBsFa6Pj67qJ479S4KTEvaPaBx1Mcy9CEPuaYXSFdoTui0UKpVqgRjIPOTI3TzXPmaZDgVKHskgDZSvI87XYKrX7-EGsFBkyHWb8wBJllAxEpkSbY6eygnGsgrsjT2YvJTJMJJCRAiRGE8n1tMVWLfu_brMIyoneQV2rbv_MLA9rovE9qlh4hdcJ6C32_yflS2YM7vlhMk2TI0Gr7gDM-nbqDscVGG6dtSIL6sweSadqlnz2aRtLO7oTHx6Ed9Wi1b2Af3Fw-k |
| linkProvider | Hindawi Publishing |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1RT9swED4hGIIXGBuMbh3zAzxaJHEcxw9ognYI1FIhwaa-TJmbXEYFtKUpQ_tT-42cEwcmIY0nHvYWOdEltj_fd3fx-QC2g9xgLOOMD4j9eeijx-NUKE6egFYilymWuVXfuqrXi_t9fToHf-pcGLutstaJpaLOxqmNke8GJdOFQoSfJzfcVo2yf1frEhoVLDr4-45ctmLvuE3zuxMEh1_OW0fcVRXgKUmYkd7xMMr9GCPhG43Kk8aXZiA1ap0aiRiqPBIovDw3AWaZiSQqEaswDXVgYhsAJZW_EFKTXVcdxR8cPGLPKvUusGcBin690V5KG2PwdkNB5rktwPsXBS7itaEL4sXFC-uF3w2fsEJJdYer_9sgvYYVZ1Sz_WoVrMEcjt7AqjOwmVNfxVv43rJ77Mt0U2TjnJ1dkZrkB0TkGTsgVr9krTF99HBEBjhrVwddsf2rn9TF2cU1I_ueWQlutdIbzyZmWiA1WgtgHb6-SCc3YH40HuEmsEhmKMyABh7JoaPLWGZaDgT6OicDIGvATj3lyaQ6RiQp3S8pEwuNxEGjAe8cHh4f88kIVqIB2w4fzwho1shInDYqkkdYvP_37U-wdHR-0k26x73OB1i2gqtwUxPmZ9Nb_Aiv0l-zYTHdKoHP4MdLg-geQYM7uQ |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3fT9swED4hGBMvwH5BGWx-gMeoSRzH8QNC0K4aAlWVGFM1acrc5DwqoC1NAfGv8dftnDhjEtJ44oG3KIkucfz5vrvLnQ9gOzQaE5Hk3oDY34sC9L0k49IjT0BJbkSGZW3V92PZ7Sb9vurNwX1dC2PTKmudWCrqfJzZGHkzLJku4jxqGpcW0Wt39iZXnu0gZf-01u00Kogc4d0tuW_F7mGb5nonDDtfvrW-eq7DgJeRtBnpIB9jEyQY80ArlL7QgdADoVCpTAvESJqYI_eN0SHmuY4FSp7IKItUqBMbDCX1vyDJx7TphD3x46-zR0xaleGFdl9A3q-T7oWw8Qa_GXEy1W0z3n_ocBEvNR0QRy6eWY_8dviIIUra66y85A-2CsvO2Gb71ep4A3M4egsrzvBmTq0V7-Bny-bel2WoyMaGnVyQ-vQOiOBzdkBsf85aY3rp4YgMc9auNsBi-xe_aYizs0tGdj-zEtwqpieeTPS0QDppLYP3cPosg_wA86PxCNeBxSJHrgc0CUiOHh0mIldiwDFQhgyDvAE79fSnk2p7kbR0y4RILUxSB5MGrDlsPNwWkHEseQO2HVaeELBZoyR1WqpIHyCy8f_Ln-E1YSc9PuwefYQlK7eKQm3C_Gx6jVvwKruZDYvpp3INMPj13Bj6A__wRN0 |
| 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=Convergence+of+Slice-Based+Block+Coordinate+Descent+Algorithm+for+Convolutional+Sparse+Coding&rft.jtitle=Mathematical+problems+in+engineering&rft.au=Li%2C+Jing&rft.au=Yu%2C+Hui&rft.au=Wei%2C+Xiao&rft.au=Wang%2C+Jinjia&rft.date=2020&rft.pub=Hindawi&rft.issn=1024-123X&rft.eissn=1563-5147&rft.volume=2020&rft_id=info:doi/10.1155%2F2020%2F4367515&rft.externalDocID=10_1155_2020_4367515 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1024-123X&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1024-123X&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1024-123X&client=summon |