{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T14:17:52Z","timestamp":1760710672533,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":16,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811651878"},{"type":"electronic","value":"9789811651885"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-981-16-5188-5_45","type":"book-chapter","created":{"date-parts":[[2021,8,19]],"date-time":"2021-08-19T23:04:52Z","timestamp":1629414292000},"page":"633-644","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A New Total Variation Denoising Algorithm for Piecewise Constant Signals Based on Non-convex Penalty"],"prefix":"10.1007","author":[{"given":"Donghao","family":"Lv","sequence":"first","affiliation":[]},{"given":"Weihua","family":"Cao","sequence":"additional","affiliation":[]},{"given":"Wenkai","family":"Hu","sequence":"additional","affiliation":[]},{"given":"Min","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,8,20]]},"reference":[{"issue":"2135","key":"45_CR1","doi-asserted-by":"publisher","first-page":"3088","DOI":"10.1098\/rspa.2010.0671","volume":"467","author":"MA Little","year":"2011","unstructured":"Little, M.A., Jones, N.S.: Generalized methods and solvers for noise removal from piecewise constant signals: Part I - background theory. Proc. R. Soc. A. 467(2135), 3088\u20133114 (2011)","journal-title":"Proc. R. Soc. A."},{"issue":"14","key":"45_CR2","doi-asserted-by":"publisher","first-page":"3654","DOI":"10.1109\/TSP.2014.2329263","volume":"62","author":"M Storath","year":"2014","unstructured":"Storath, M., Weinmann, A., Demaret, L.: Jump-sparse and sparse recovery using potts functionals. IEEE Trans. Signal Process. 62(14), 3654\u20133666 (2014)","journal-title":"IEEE Trans. Sig. Process."},{"issue":"11","key":"45_CR3","doi-asserted-by":"publisher","first-page":"1054","DOI":"10.1109\/LSP.2013.2278339","volume":"20","author":"L Condat","year":"2013","unstructured":"Condat, L.: A direct algorithm for 1-D total variation denoising. IEEE Signal Process. Lett. 20(11), 1054\u20131057 (2013)","journal-title":"IEEE Sig. Process. Lett."},{"key":"45_CR4","doi-asserted-by":"crossref","unstructured":"Du, H., Liu, Y.: Minmax-concave total variation denoising. Signal Image Video P. 12, 1027\u20131034 (2018)","DOI":"10.1007\/s11760-018-1248-2"},{"key":"45_CR5","first-page":"1","volume":"61","author":"H Pan","year":"2018","unstructured":"Pan, H., Jing, Z., Qiao, L., Li, M.: Visible and infrared image fusion using $$l_0$$-generalized total variation model. Sci. China Inf. Sci. 61, 049103 (2018)","journal-title":"Sci. China Inf. Sci."},{"issue":"9","key":"45_CR6","doi-asserted-by":"publisher","first-page":"1913","DOI":"10.1007\/s11432-010-4039-0","volume":"53","author":"M Li","year":"2010","unstructured":"Li, M.: A fast algorithm for color image enhancement with total variation regularization. Sci. China Inf. Sci. 53(9), 1913\u20131916 (2010)","journal-title":"Sci. China Inf. Sci."},{"issue":"1\u20134","key":"45_CR7","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/0167-2789(92)90242-F","volume":"60","author":"LI Rudin","year":"1992","unstructured":"Rudin, L.I., Osher, S., Fatemi, E.: Nonlinear total variation based noise removal algorithms. Physica D: Nonlinear Phenomena 60(1\u20134), 259\u2013268 (1992)","journal-title":"Physica D"},{"issue":"2","key":"45_CR8","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s10851-016-0655-7","volume":"56","author":"A Lanza","year":"2016","unstructured":"Lanza, A., Morigi, S., Sgallari, F.: Convex image denoising via nonconvex regularization with parameter selection. J. Math. Imaging Vis. 56(2), 195\u2013220 (2016)","journal-title":"J. Math. Imaging Vis."},{"key":"45_CR9","doi-asserted-by":"publisher","unstructured":"Luo, X., Wang, X., Suo, Z., Li, Z.: Efficient InSAR phase noise reduction via total variation regularization. Science China Information Sciences 58(8), 1\u201313 (2015). https:\/\/doi.org\/10.1007\/s11432-014-5244-z","DOI":"10.1007\/s11432-014-5244-z"},{"key":"45_CR10","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1007\/s10851-019-00937-5","volume":"62","author":"I Selesnick","year":"2020","unstructured":"Selesnick, I., Lanza, A., Morigi, S., Sgallari, F.: Non-convex total variation regularization for convex denoising of signals. J. Math. Imaging Vis. 62, 825\u2013841 (2020)","journal-title":"J. Math. Imaging Vis."},{"issue":"2","key":"45_CR11","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1109\/LSP.2017.2647948","volume":"24","author":"I Selesnick","year":"2017","unstructured":"Selesnick, I.: Total variation denoising via the moreau envelope. IEEE Signal Process. Lett. 24(2), 216\u2013220 (2017)","journal-title":"IEEE Sig. Process. Lett."},{"issue":"2","key":"45_CR12","doi-asserted-by":"publisher","first-page":"1555004","DOI":"10.1142\/S0218001415550046","volume":"29","author":"X Zhang","year":"2018","unstructured":"Zhang, X., Xu, C., Li, M., Sun, X.: Sparse and low-rank coupling image segmentation model via nonconvex regularization. Int. J. Pattern Recog. Artif. Intell. 29(2), 1555004 (2018)","journal-title":"Int. J. Pattern Recogn. Artif. Intell."},{"issue":"4","key":"45_CR13","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1002\/ima.22275","volume":"28","author":"Y Liu","year":"2018","unstructured":"Liu, Y., Du, H., Wang, Z., Mei, W.: Convex MR brain imagereconstruction via non-convex total variation minimization. Int. J. Imag. Syst. Technol. 28(4), 246\u2013253 (2018)","journal-title":"Int. J. Imaging Syst. Technol."},{"issue":"4","key":"45_CR14","first-page":"69","volume":"21","author":"J Yang","year":"2017","unstructured":"Yang, J.: An algorithmic review for total variation regularizeddata fitting problems in image processing. Oper. Res. Trans. 21(4), 69\u201383 (2017)","journal-title":"Oper. Res. Trans."},{"issue":"12","key":"45_CR15","doi-asserted-by":"publisher","first-page":"3073","DOI":"10.1109\/TIP.2010.2052275","volume":"19","author":"M Nikolova","year":"2010","unstructured":"Nikolova, M., Ng, M.K., Tam, C.: Fast nonconvex nonsmooth minimization methods for image restoration and reconstruction. IEEE Trans. Image Process. 19(12), 3073\u20133088 (2010)","journal-title":"IEEE Trans. Image Process."},{"key":"45_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-9467-7","volume-title":"Convex Analysis and Monotone Operator Theory in Hilbert Spaces","author":"HH Bauschke","year":"2011","unstructured":"Bauschke, H.H., Combettes, P.L.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces. Springer, New York (2011). https:\/\/doi.org\/10.1007\/978-1-4419-9467-7"}],"container-title":["Communications in Computer and Information Science","Neural Computing for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-16-5188-5_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,19]],"date-time":"2021-08-19T23:18:47Z","timestamp":1629415127000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-16-5188-5_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9789811651878","9789811651885"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-981-16-5188-5_45","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"20 August 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NCAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Neural Computing for Advanced Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guangzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 August 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 August 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ncaa2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/dl2link.com\/ncaa2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"144","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"54","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.07","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.62","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}