Efficient Sparse Recovery With Arctangent Regularization: A Novel Iterative Thresholding Algorithm

Several existing works have revealed the effectiveness of arctangent-type penalties in exploiting sparsity for compressed sensing. However, addressing the subproblems associated with the arctangent penalty incurs considerable computational cost. Aiming to reduce complexity, we derive the closed-form...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on circuits and systems for video technology Jg. 35; H. 6; S. 5367 - 5379
Hauptverfasser:	He, Zihao, Shu, Qianyu, Wen, Jinming, Cheung So, Hing
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York IEEE 01.06.2025 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	Algorithms Approximation algorithms arctangent penalty Compressed sensing Computational efficiency Convergence Convex functions Costs Hyperbolic functions Iterative algorithms Noise Phase transitions Polynomials Recovery Regularization Sensors sparse recovery Tensors thresholding algorithm Vectors
ISSN:	1051-8215, 1558-2205
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Abstract	Several existing works have revealed the effectiveness of arctangent-type penalties in exploiting sparsity for compressed sensing. However, addressing the subproblems associated with the arctangent penalty incurs considerable computational cost. Aiming to reduce complexity, we derive the closed-form proximity operator of an arctangent penalty, which is expressed as hyperbolic functions of sine and cosine in this paper. Accordingly, a computationally-efficient arctangent regularization iterative thresholding (ARIT) algorithm for sparse approximation is proposed. Furthermore, we theoretically prove that under certain conditions, the ARIT algorithm converges to a local minimizer of the arctangent regularization problem with an eventually linear convergence. Extensive experiments are conducted to compare our scheme with conventional iterative thresholding algorithms, demonstrating the former superiority in terms of the probability of successful recovery, rate of support recovery, phase transition, and robustness to noise.
AbstractList	Several existing works have revealed the effectiveness of arctangent-type penalties in exploiting sparsity for compressed sensing. However, addressing the subproblems associated with the arctangent penalty incurs considerable computational cost. Aiming to reduce complexity, we derive the closed-form proximity operator of an arctangent penalty, which is expressed as hyperbolic functions of sine and cosine in this paper. Accordingly, a computationally-efficient arctangent regularization iterative thresholding (ARIT) algorithm for sparse approximation is proposed. Furthermore, we theoretically prove that under certain conditions, the ARIT algorithm converges to a local minimizer of the arctangent regularization problem with an eventually linear convergence. Extensive experiments are conducted to compare our scheme with conventional iterative thresholding algorithms, demonstrating the former superiority in terms of the probability of successful recovery, rate of support recovery, phase transition, and robustness to noise.
Author	Cheung So, Hing Wen, Jinming He, Zihao Shu, Qianyu
Author_xml	– sequence: 1 givenname: Zihao orcidid: 0000-0003-0716-1600 surname: He fullname: He, Zihao email: hezihaojnu@gmail.com organization: Department of Information Science and Technology, Jinan University, Guangzhou, China – sequence: 2 givenname: Qianyu orcidid: 0000-0002-3983-4614 surname: Shu fullname: Shu, Qianyu email: shuqy@sicnu.edu.cn organization: School of Mathematical Sciences, Sichuan Normal University, Chengdu, China – sequence: 3 givenname: Jinming orcidid: 0000-0002-8181-0958 surname: Wen fullname: Wen, Jinming email: jinming.wen@mail.mcgill.ca organization: Department of Information Science and Technology, Jinan University, Guangzhou, China – sequence: 4 givenname: Hing orcidid: 0000-0001-8396-7898 surname: Cheung So fullname: Cheung So, Hing email: hcso@ee.cityu.edu.hk organization: Department of Electrical Engineering, City University of Hong Kong, Hong Kong, SAR, China
BookMark	eNpNkEFLw0AQhRepYFv9A-JhwXPqzmaT3fUWStVCUWijHpdNMklT0qRu0kL99abWgzAww8x7b-AbkUHd1EjILbAJANMP8XT1EU8442LiB1yEobogQwgC5XHOgkE_swA8xSG4IqO23TAGQgk5JMksz8u0xLqjq511LdIlps0B3ZF-lt2aRi7tbF2c7kss9pV15bftyqZ-pBF97YUVnXfo-tUBabx22K6bKivrgkZV0bg-YntNLnNbtXjz18fk_WkWT1-8xdvzfBotvJQL2XmhrxOuUSdMW0wAZJixTGWYKeAgpLA-70tolSub68CCzTKANGSpxDDRqT8m9-fcnWu-9th2ZtPsXd2_ND4HKWWghOhV_KxKXdO2DnOzc-XWuqMBZk4szS9Lc2Jp_lj2pruzqUTEfwYFWoDyfwCsRnNJ
CODEN	ITCTEM
Cites_doi	10.1109/LSP.2015.2406314 10.1109/TSP.2014.2379665 10.1016/j.dsp.2021.103010 10.1109/TIP.2019.2925288 10.1145/1553374.1553417 10.1137/080716542 10.1198/0003130042836 10.1109/TSP.2023.3262184 10.1109/TCSVT.2023.3247944 10.1016/j.jvcir.2012.10.006 10.1109/TIP.2010.2052275 10.1109/TWC.2020.3038407 10.1109/TSP.2010.2046900 10.1109/ICASSP48485.2024.10448179 10.1093/imaiai/iav011 10.1109/JSTSP.2010.2042413 10.1016/j.sigpro.2022.108816 10.1109/18.382009 10.1109/TNNLS.2021.3114400 10.1198/016214501753382273 10.1109/TSP.2014.2298839 10.1109/LSP.2014.2349356 10.1109/TKDE.2022.3185126 10.1007/s10107-024-02068-1 10.1109/TIT.2007.909108 10.1016/j.acha.2009.04.002 10.1109/TIT.2006.871582 10.3390/rs8030187 10.1109/TSP.2020.2978615 10.1109/LSP.2013.2285579 10.1109/TIP.2007.909318 10.1109/TSP.2015.2412915 10.1109/TNNLS.2019.2921404 10.1088/0266-5611/24/3/035020 10.1109/TCSVT.2024.3413992 10.1109/TNNLS.2012.2197412 10.1109/TGRS.2023.3311815 10.1109/TCSVT.2020.2978703 10.1214/09-AOS729 10.1109/TSP.2014.2329274 10.1073/pnas.0909892106 10.1016/j.acha.2007.10.005 10.1088/0266-5611/32/7/075004 10.1109/TSP.2019.2935906 10.1109/TCSVT.2019.2908833 10.1109/TNNLS.2022.3171819 10.1109/TSP.2014.2330349 10.1109/TSP.2020.3016571 10.1007/s00041-008-9045-x 10.1109/TSP.2014.2309076 10.1109/TCSVT.2022.3164241 10.1109/TCYB.2021.3067352 10.1109/TCSVT.2022.3233589 10.1137/070703983 10.1109/TIT.2005.858979 10.1098/rsta.2009.0152
ContentType	Journal Article
Copyright	Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2025
Copyright_xml	– notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2025
DBID	97E RIA RIE AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D
DOI	10.1109/TCSVT.2024.3524668
DatabaseName	IEEE All-Society Periodicals Package (ASPP) 2005–Present 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
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
EISSN	1558-2205
EndPage	5379
ExternalDocumentID	10_1109_TCSVT_2024_3524668 10819418
Genre	orig-research
GrantInformation_xml	– fundername: National Natural Science Foundation of China; NSFC grantid: 12271215; 12326378; 12471441 funderid: 10.13039/501100001809 – fundername: Joint Funds of the National Natural Science Foundation of China grantid: U24A6013; U24A2001 funderid: 10.13039/501100001809
GroupedDBID	-~X 0R~ 29I 4.4 5GY 5VS 6IK 97E AAJGR AARMG AASAJ AAWTH ABAZT ABQJQ ABVLG ACGFO ACGFS ACIWK AENEX AETIX AGQYO AGSQL AHBIQ AI. AIBXA AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 EBS EJD HZ~ H~9 ICLAB IFIPE IFJZH IPLJI JAVBF LAI M43 O9- OCL P2P RIA RIE RNS RXW TAE TN5 VH1 AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D
ID	FETCH-LOGICAL-c247t-639b29e9b09aeb1176d0d8ded8121474a32a32498f8af95a1add11c60c7e6b9c3
IEDL.DBID	RIE
ISICitedReferencesCount	0
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001506717400002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	1051-8215
IngestDate	Tue Nov 18 16:22:33 EST 2025 Sat Nov 29 07:46:28 EST 2025 Wed Aug 27 01:47:16 EDT 2025
IsPeerReviewed	true
IsScholarly	true
Issue	6
Language	English
License	https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html https://doi.org/10.15223/policy-029 https://doi.org/10.15223/policy-037
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c247t-639b29e9b09aeb1176d0d8ded8121474a32a32498f8af95a1add11c60c7e6b9c3
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
ORCID	0000-0002-3983-4614 0000-0001-8396-7898 0000-0003-0716-1600 0000-0002-8181-0958
PQID	3217775844
PQPubID	85433
PageCount	13
ParticipantIDs	proquest_journals_3217775844 ieee_primary_10819418 crossref_primary_10_1109_TCSVT_2024_3524668
PublicationCentury	2000
PublicationDate	2025-06-01
PublicationDateYYYYMMDD	2025-06-01
PublicationDate_xml	– month: 06 year: 2025 text: 2025-06-01 day: 01
PublicationDecade	2020
PublicationPlace	New York
PublicationPlace_xml	– name: New York
PublicationTitle	IEEE transactions on circuits and systems for video technology
PublicationTitleAbbrev	TCSVT
PublicationYear	2025
Publisher	IEEE The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml	– name: IEEE – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References	ref13 ref12 ref56 ref15 ref14 ref53 ref52 ref11 ref55 ref10 ref54 ref17 ref16 ref19 ref18 ref51 ref50 ref46 ref45 ref48 ref47 ref42 ref41 ref44 ref43 ref49 ref8 ref7 ref9 ref4 ref3 ref6 ref5 ref40 ref35 ref34 ref37 ref36 ref31 ref30 ref33 ref32 ref2 ref1 ref39 ref38 ref24 ref23 ref26 ref25 ref20 ref22 ref21 ref28 ref27 ref29
References_xml	– ident: ref34 doi: 10.1109/LSP.2015.2406314 – ident: ref53 doi: 10.1109/TSP.2014.2379665 – ident: ref38 doi: 10.1016/j.dsp.2021.103010 – ident: ref2 doi: 10.1109/TIP.2019.2925288 – ident: ref50 doi: 10.1145/1553374.1553417 – ident: ref8 doi: 10.1137/080716542 – ident: ref41 doi: 10.1198/0003130042836 – ident: ref18 doi: 10.1109/TSP.2023.3262184 – ident: ref29 doi: 10.1109/TCSVT.2023.3247944 – ident: ref52 doi: 10.1016/j.jvcir.2012.10.006 – ident: ref9 doi: 10.1109/TIP.2010.2052275 – ident: ref6 doi: 10.1109/TWC.2020.3038407 – ident: ref43 doi: 10.1109/TSP.2010.2046900 – ident: ref40 doi: 10.1109/ICASSP48485.2024.10448179 – ident: ref56 doi: 10.1093/imaiai/iav011 – ident: ref44 doi: 10.1109/JSTSP.2010.2042413 – ident: ref12 doi: 10.1016/j.sigpro.2022.108816 – ident: ref51 doi: 10.1109/18.382009 – ident: ref21 doi: 10.1109/TNNLS.2021.3114400 – ident: ref13 doi: 10.1198/016214501753382273 – ident: ref32 doi: 10.1109/TSP.2014.2298839 – ident: ref35 doi: 10.1109/LSP.2014.2349356 – ident: ref39 doi: 10.1109/TKDE.2022.3185126 – ident: ref22 doi: 10.1007/s10107-024-02068-1 – ident: ref46 doi: 10.1109/TIT.2007.909108 – ident: ref49 doi: 10.1016/j.acha.2009.04.002 – ident: ref1 doi: 10.1109/TIT.2006.871582 – ident: ref37 doi: 10.3390/rs8030187 – ident: ref11 doi: 10.1109/TSP.2020.2978615 – ident: ref27 doi: 10.1109/LSP.2013.2285579 – ident: ref42 doi: 10.1109/TIP.2007.909318 – ident: ref47 doi: 10.1109/TSP.2015.2412915 – ident: ref26 doi: 10.1109/TNNLS.2019.2921404 – ident: ref14 doi: 10.1088/0266-5611/24/3/035020 – ident: ref23 doi: 10.1109/TCSVT.2024.3413992 – ident: ref15 doi: 10.1109/TNNLS.2012.2197412 – ident: ref36 doi: 10.1109/TGRS.2023.3311815 – ident: ref3 doi: 10.1109/TCSVT.2020.2978703 – ident: ref20 doi: 10.1214/09-AOS729 – ident: ref33 doi: 10.1109/TSP.2014.2329274 – ident: ref54 doi: 10.1073/pnas.0909892106 – ident: ref24 doi: 10.1016/j.acha.2007.10.005 – ident: ref25 doi: 10.1088/0266-5611/32/7/075004 – ident: ref10 doi: 10.1109/TSP.2019.2935906 – ident: ref17 doi: 10.1109/TCSVT.2019.2908833 – ident: ref5 doi: 10.1109/TNNLS.2022.3171819 – ident: ref31 doi: 10.1109/TSP.2014.2330349 – ident: ref48 doi: 10.1109/TSP.2020.3016571 – ident: ref30 doi: 10.1007/s00041-008-9045-x – ident: ref16 doi: 10.1109/TSP.2014.2309076 – ident: ref4 doi: 10.1109/TCSVT.2022.3164241 – ident: ref28 doi: 10.1109/TCYB.2021.3067352 – ident: ref19 doi: 10.1109/TCSVT.2022.3233589 – ident: ref7 doi: 10.1137/070703983 – ident: ref45 doi: 10.1109/TIT.2005.858979 – ident: ref55 doi: 10.1098/rsta.2009.0152
SSID	ssj0014847
Score	2.4698575
Snippet	Several existing works have revealed the effectiveness of arctangent-type penalties in exploiting sparsity for compressed sensing. However, addressing the...
SourceID	proquest crossref ieee
SourceType	Aggregation Database Index Database Publisher
StartPage	5367
SubjectTerms	Algorithms Approximation algorithms arctangent penalty Compressed sensing Computational efficiency Convergence Convex functions Costs Hyperbolic functions Iterative algorithms Noise Phase transitions Polynomials Recovery Regularization Sensors sparse recovery Tensors thresholding algorithm Vectors
Title	Efficient Sparse Recovery With Arctangent Regularization: A Novel Iterative Thresholding Algorithm
URI	https://ieeexplore.ieee.org/document/10819418 https://www.proquest.com/docview/3217775844
Volume	35
WOSCitedRecordID	wos001506717400002&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: 1558-2205 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0014847 issn: 1051-8215 databaseCode: RIE dateStart: 19910101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3fS8MwEA5u-KAP_pw4nZIH36SzadMm8W2MDQUZwubcW0nSVAdzG10n-N97STsZiA9CHwpNSrlL7u7L9e5D6EalwtdSASzJVOpRSUNPGj_yApopiL5NnDmWiPETGwz4ZCKeq2J1VwtjjHE_n5m2vXW5_HSh1_aoDHY4-C9KeA3VGIvLYq2flAHljk0M4gXicXBkmwoZX9yNusPxCLBgQNsQb9DY9lXd8kKOVuWXLXYOpn_4z087QgdVJIk7peqP0Y6Zn6D9rf6Cp0j1XIMImImHS0CwBlu0CYv3C79Oi3eYqwvpiqvggeWkz6uqzHvcwQMYOMOPrusymEQ8Aq2vqmQV7szeFjm84qOBXvq9UffBq0gVPB1QVngQkahAGKF8IcFOExanfspTk4KnJ5RRGQZwUcEzLjMRSQIGkBAd-5qZWAkdnqH6fDE35wiblGRCRqHQEYCSSEsWmZhorgy1XXB4E91uhJwsy94ZicMcvkicShKrkqRSSRM1rFi3RpYSbaLWRjFJtb9WSQhIigHUofTij2mXaC-wVL3uwKSF6kW-NldoV38W01V-7ZbONxzWwtU
linkProvider	IEEE
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3dS8MwED_8AvXBz4nzMw--SbVp0zbxbYiiOIdgnXsrSZrqYG5j6wT_ey9ZJwPxQehDoUkpd8nd_XK9-wGcqVz4WiqEJYXKPSZZ6EnjR17ACoXRt4kLxxLRbiatFu90xFNVrO5qYYwx7uczc2FvXS4_H-iJPSrDHY7-i1G-CMsRY4E_Ldf6SRow7vjEMGKgHkdXNquR8cVlev3cThENBuwCIw4W286qc37IEav8ssbOxdxu_vPjtmCjiiVJY6r8bVgw_R1Yn-swuAvqxrWIwJnkeYgY1hCLN3H5fpHXbvmOc3UpXXkVPrCs9KOqLvOKNEgLB_bIveu7jEaRpKj3cZWuIo3e22CEr_iowcvtTXp951W0Cp4OWFJ6GJOoQBihfCHRUtMkzv2c5yZHX09ZwmQY4MUEL7gsRCQpmkBKdezrxMRK6HAPlvqDvtkHYnJaCBmFQkcISyItk8jEVHNlmO2Dw-twPhNyNpx2z8gc6vBF5lSSWZVklUrqULNinRs5lWgdjmaKyaodNs5CxFIJgh3GDv6Ydgqrd-ljM2vetx4OYS2wxL3u-OQIlsrRxBzDiv4su-PRiVtG32pVxhw
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=Efficient+Sparse+Recovery+With+Arctangent+Regularization%3A+A+Novel+Iterative+Thresholding+Algorithm&rft.jtitle=IEEE+transactions+on+circuits+and+systems+for+video+technology&rft.au=He%2C+Zihao&rft.au=Shu%2C+Qianyu&rft.au=Wen%2C+Jinming&rft.au=Cheung+So%2C+Hing&rft.date=2025-06-01&rft.issn=1051-8215&rft.eissn=1558-2205&rft.volume=35&rft.issue=6&rft.spage=5367&rft.epage=5379&rft_id=info:doi/10.1109%2FTCSVT.2024.3524668&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_TCSVT_2024_3524668
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1051-8215&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1051-8215&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1051-8215&client=summon