{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T04:59:02Z","timestamp":1761713942637,"version":"build-2065373602"},"reference-count":27,"publisher":"Institution of Engineering and Technology (IET)","issue":"2","license":[{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":["ietresearch.onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["IET Signal Processing"],"published-print":{"date-parts":[[2019,4]]},"abstract":"<jats:p>\n                    Many practical problems in the real world can be formulated as the non\u2010negative\n                    <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"graphic\/sil2bf00709-math-0001.png\" xlink:title=\"urn:x-wiley:17519675:media:sil2bf00709:sil2bf00709-math-0001\"\/>\n                    \u2010minimisation problems, which seek the sparsest non\u2010negative signals to underdetermined linear equations. They have been widely applied in signal and image processing, machine learning, pattern recognition and computer vision. Unfortunately, this non\u2010negative\n                    <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"graphic\/sil2bf00709-math-0002.png\" xlink:title=\"urn:x-wiley:17519675:media:sil2bf00709:sil2bf00709-math-0002\"\/>\n                    \u2010minimisation problem is non\u2010deterministic polynomial hard (NP\u2010hard) because of the discrete and discontinuous nature of the\n                    <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"graphic\/sil2bf00709-math-0003.png\" xlink:title=\"urn:x-wiley:17519675:media:sil2bf00709:sil2bf00709-math-0003\"\/>\n                    \u2010norm. Inspired by the good performances of the fraction function in the authors\u2019 former work, in this paper, the authors replace the\n                    <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"graphic\/sil2bf00709-math-0004.png\" xlink:title=\"urn:x-wiley:17519675:media:sil2bf00709:sil2bf00709-math-0004\"\/>\n                    \u2010norm with the non\u2010convex fraction function and study the minimisation problem of the fraction function in recovering the sparse non\u2010negative signal from an underdetermined linear equation. They discuss the equivalence between non\u2010negative\n                    <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"graphic\/sil2bf00709-math-0005.png\" xlink:title=\"urn:x-wiley:17519675:media:sil2bf00709:sil2bf00709-math-0005\"\/>\n                    \u2010minimisation problem and non\u2010negative fraction function minimisation problem, and the equivalence between non\u2010negative fraction function minimisation problem and regularised non\u2010negative fraction function minimisation problem. It is proved that the optimal solution to the non\u2010negative\n                    <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"graphic\/sil2bf00709-math-0006.png\" xlink:title=\"urn:x-wiley:17519675:media:sil2bf00709:sil2bf00709-math-0006\"\/>\n                    \u2010minimisation problem could be approximately obtained by solving their regularised non\u2010negative fraction function minimisation problem if some specific conditions are satisfied. Then, they propose a non\u2010negative iterative thresholding algorithm to solve their regularised non\u2010negative fraction function minimisation problem. At last, numerical experiments on some sparse non\u2010negative signal recovery problems are reported.\n                  <\/jats:p>","DOI":"10.1049\/iet-spr.2018.5056","type":"journal-article","created":{"date-parts":[[2018,8,30]],"date-time":"2018-08-30T22:41:58Z","timestamp":1535668918000},"page":"125-132","update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Sparse non\u2010negative signal reconstruction using fraction function penalty"],"prefix":"10.1049","volume":"13","author":[{"given":"Angang","family":"Cui","sequence":"first","affiliation":[{"name":"School of Mathematics and Statistics Xi'an Jiaotong University Xi'an 710049 People's Republic of China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jigen","family":"Peng","sequence":"additional","affiliation":[{"name":"School of Mathematics and Information Science Guangzhou University Guangzhou 510006 People's Republic of China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haiyang","family":"Li","sequence":"additional","affiliation":[{"name":"School of Mathematics and Information Science Guangzhou University Guangzhou 510006 People's Republic of China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Meng","family":"Wen","sequence":"additional","affiliation":[{"name":"School of Science Xi'an Polytechnic University Xi'an 710048 People's Republic of China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"265","published-online":{"date-parts":[[2019,4]]},"reference":[{"key":"e_1_2_8_2_2","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0502269102"},{"key":"e_1_2_8_3_2","doi-asserted-by":"publisher","DOI":"10.1137\/040615043"},{"key":"e_1_2_8_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.929920"},{"key":"e_1_2_8_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-009-9221-z"},{"key":"e_1_2_8_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2010.2082536"},{"key":"e_1_2_8_7_2","unstructured":"\u00d3Grady P.D. Rickard S.T.:\u2018Recovery of non\u2010negative signals from compressively samples observations via non\u2010negative quadratic programming\u2019. Available at URLhttps:\/\/www.researchgate.net\/publication\/252320106 accessed 2009"},{"key":"e_1_2_8_8_2","doi-asserted-by":"crossref","unstructured":"Vo N. Moran B. Challa S.: \u2018Non\u2010negative\u2010least\u2010square classifier for face recognition\u2019.Proc. Sixth Int. Symp. Neural Networks: Advances Neural Networks China 2009 vol.5553 pp.449\u2013456","DOI":"10.1007\/978-3-642-01513-7_49"},{"key":"e_1_2_8_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2010.2089624"},{"key":"e_1_2_8_10_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018361916442"},{"key":"e_1_2_8_11_2","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.11.3.217"},{"key":"e_1_2_8_12_2","doi-asserted-by":"crossref","unstructured":"He R. Zheng W.S. Hu B.G.et al: \u2018Non\u2010negative sparse coding for discriminative semi\u2010supervised learning\u2019.Proc. IEEE Conf. Computer Vision and Pattern Recognition (CVPR) USA 2011 vol.42 (7) pp.2849\u20132856","DOI":"10.1109\/CVPR.2011.5995487"},{"key":"e_1_2_8_13_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-99789-1_13"},{"key":"e_1_2_8_14_2","doi-asserted-by":"publisher","DOI":"10.1080\/02331939908844431"},{"key":"e_1_2_8_15_2","doi-asserted-by":"crossref","unstructured":"Szlam A. Guo Z.H. Osher S.: \u2018A split Bregman method for non\u2010negative sparsity penalized least squares with applications to hyperspectral demixing\u2019.Proc. 2010 IEEE 17th Int. Conf. Image Processing 2010 pp.1917\u20131920","DOI":"10.1109\/ICIP.2010.5651881"},{"key":"e_1_2_8_16_2","doi-asserted-by":"publisher","DOI":"10.1137\/060657704"},{"key":"e_1_2_8_17_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-7011-4"},{"key":"e_1_2_8_18_2","unstructured":"Theodoridis S. Kopsinis Y. Slavakis K.:\u2018Sparsity\u2010aware learning and compressed sensing: an overview\u2019. Available at URLhttps:\/\/arxiv.org\/pdf\/1211.5231 accessed 2012"},{"key":"e_1_2_8_19_2","doi-asserted-by":"publisher","DOI":"10.1007\/s40305-014-0043-1"},{"key":"e_1_2_8_20_2","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0502269102"},{"key":"e_1_2_8_21_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2013.2281030"},{"key":"e_1_2_8_22_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1009-2"},{"key":"e_1_2_8_23_2","unstructured":"Li H.Y. Zhang Q. Cui A.G.et al: \u2018Minimization of fraction function penalty in compressed sensing\u2019. Available at URLhttps:\/\/arxiv.org\/pdf\/1705.06048 accessed 2017"},{"key":"e_1_2_8_24_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2017.12.048"},{"key":"e_1_2_8_25_2","doi-asserted-by":"publisher","DOI":"10.1109\/34.120331"},{"key":"e_1_2_8_26_2","doi-asserted-by":"publisher","DOI":"10.1137\/S0036139997327794"},{"key":"e_1_2_8_27_2","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176344136"},{"key":"e_1_2_8_28_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-8176-4948-7"}],"container-title":["IET Signal Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1049\/iet-spr.2018.5056","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full-xml\/10.1049\/iet-spr.2018.5056","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/ietresearch.onlinelibrary.wiley.com\/doi\/pdf\/10.1049\/iet-spr.2018.5056","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T23:39:48Z","timestamp":1761694788000},"score":1,"resource":{"primary":{"URL":"https:\/\/ietresearch.onlinelibrary.wiley.com\/doi\/10.1049\/iet-spr.2018.5056"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,4]]}},"alternative-id":["10.1049\/iet-spr.2018.5056"],"URL":"https:\/\/doi.org\/10.1049\/iet-spr.2018.5056","archive":["Portico"],"relation":{},"ISSN":["1751-9675"],"issn-type":[{"type":"print","value":"1751-9675"}],"subject":[],"published":{"date-parts":[[2019,4]]},"assertion":[{"value":"2018-03-31","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-08-07","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-04-01","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}