{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T00:10:14Z","timestamp":1771632614422,"version":"3.50.1"},"reference-count":49,"publisher":"Cambridge University Press (CUP)","issue":"7","license":[{"start":{"date-parts":[[2022,2,2]],"date-time":"2022-02-02T00:00:00Z","timestamp":1643760000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Robotica"],"published-print":{"date-parts":[[2022,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>People search can be reformulated as submodular maximization problems to achieve solutions with theoretical guarantees. However, the number of submodular function outcome is<jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S0263574721001661_inline1.png\"\/><jats:tex-math>$2^N$<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>from<jats:italic>N<\/jats:italic>sets. Compressing functions via nonlinear Fourier transform and spraying out sets are two ways to overcome this issue. This research proposed the submodular deep compressed sensing of convolutional sparse coding (SDCS-CSC) and applied the Topological Fourier Sparse Set (TFSS) algorithms to solve people search problems. The TFSS is based on topological and compressed sensing techniques, while the CSC is based on DCS techniques. Both algorithms enable an unmanned aerial vehicle to search for the people in environments. Experiments demonstrate that the algorithms can search for the people more efficiently than the benchmark approaches. This research also suggests how to select CSC or TFSS algorithms for different search problems.<\/jats:p>","DOI":"10.1017\/s0263574721001661","type":"journal-article","created":{"date-parts":[[2022,2,2]],"date-time":"2022-02-02T09:02:33Z","timestamp":1643792553000},"page":"2320-2348","source":"Crossref","is-referenced-by-count":2,"title":["People search via deep compressed sensing techniques"],"prefix":"10.1017","volume":"40","author":[{"given":"Bing-Xian","family":"Lu","sequence":"first","affiliation":[]},{"given":"Yu-Chung","family":"Tsai","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7818-5821","authenticated-orcid":false,"given":"Kuo-Shih","family":"Tseng","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2022,2,2]]},"reference":[{"key":"S0263574721001661_ref2","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"},{"key":"S0263574721001661_ref34","doi-asserted-by":"crossref","unstructured":"[34] Ramaithitima, R. , Whitzer, M. , Bhattacharya, S. and Kumar, V. , \u201cSensor Coverage Robot Swarms using Local Sensing without Metric Information,\u201d IEEE International Conference on Robotics and Automation,Seattle (2015) pp. 3408\u20133415.","DOI":"10.1109\/ICRA.2015.7139670"},{"key":"S0263574721001661_ref18","doi-asserted-by":"publisher","DOI":"10.1038\/nature14236"},{"key":"S0263574721001661_ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-006-1276-5"},{"key":"S0263574721001661_ref44","first-page":"132","article-title":"Analysis of search decision making using probabilistic search strategies","volume":"28","author":"Chung","year":"2012","journal-title":"Robot."},{"key":"S0263574721001661_ref16","doi-asserted-by":"crossref","unstructured":"[16] Tseng, K.-S. and Mettler, B. , \u201cNear-Optimal Probabilistic Search Using Spatial Fourier Sparse Set,\u201d Autonomous Robots.42, 329\u2013351 (2017).","DOI":"10.1007\/s10514-017-9616-2"},{"key":"S0263574721001661_ref15","doi-asserted-by":"crossref","unstructured":"[15] Balcan, M.-F. and Harvey, N. J. A. , \u201cLearning Submodular Functions,\u201d Proceedings of the 43rd Annual ACM Symposium on Theory of Computing, San Jose (2011) pp. 793\u2013802.","DOI":"10.1145\/1993636.1993741"},{"key":"S0263574721001661_ref13","doi-asserted-by":"publisher","DOI":"10.1109\/SSRR.2019.8848962"},{"key":"S0263574721001661_ref40","first-page":"2887","article-title":"Convolutional neural networks analyzed via convolutional sparse coding","volume":"18","author":"Papyan","year":"2017","journal-title":"J. Mach. Learn. Res."},{"key":"S0263574721001661_ref26","unstructured":"[26] Gregor, K. and LeCun, Y. , \u201cLearning Fast Approximations of Sparse Coding,\u201d Proceedings of the 27th International Conference on Machine Learning,Haifa (2010) pp. 399\u2013406."},{"key":"S0263574721001661_ref48","doi-asserted-by":"publisher","DOI":"10.1109\/IRC.2020.00030"},{"key":"S0263574721001661_ref41","first-page":"4090","article-title":"Multilayer convolutional sparse modeling: Pursuit and dictionary learning","volume":"66","author":"Sulam","year":"2018","journal-title":"Process."},{"key":"S0263574721001661_ref31","first-page":"578","article-title":"Persistent homology for path planning in uncertain environments","volume":"31","author":"Bhattacharya","year":"2015","journal-title":"Robot."},{"key":"S0263574721001661_ref47","doi-asserted-by":"crossref","unstructured":"[47] Tseng, K.-S. and Mettler, B. , \u201cAnalysis of Coordination Patterns between Gaze and Control in Human Spatial Search,\u201d 2nd IFAC Conference on Cyber-Physical and Human-Systems,Miami (2018) pp. 264\u2013271.","DOI":"10.1016\/j.ifacol.2019.01.041"},{"key":"S0263574721001661_ref39","first-page":"5687","article-title":"Working locally thinking globally: Theoretical guarantees for convolutional sparse coding","volume":"65","author":"Papyan","year":"2017","journal-title":"Process."},{"key":"S0263574721001661_ref14","doi-asserted-by":"crossref","unstructured":"[14] Hollinger, G. , Choudhuri, C. , Mitra, U. and Sukhatme, G. S. , \u201cSquared Error Distortion Metrics for Motion Planning in Robotic Sensor Networks,\u201d Proceedings International Workshop Wireless Networking for Unmanned Autonomous Vehicles, Atlanta\u00a0(2013) pp. 1426\u20131431.","DOI":"10.1109\/GLOCOMW.2013.6825195"},{"key":"S0263574721001661_ref12","first-page":"1426","article-title":"Proofs and Experiments in Scalable, Near-Optimal Search by Multiple Robots","author":"H","year":"2008","journal-title":"Robotics: Science and Systems,"},{"key":"S0263574721001661_ref38","doi-asserted-by":"publisher","DOI":"10.3390\/s20092591"},{"key":"S0263574721001661_ref28","doi-asserted-by":"crossref","unstructured":"[28] Zhang, J. and Ghanem, B. , \u201cIsta-net: Interpretable Optimization-Inspired Deep Network for Image Compressive Sensing,\u201d IEEE Conference on Computer Vision and Pattern Recognition,Salt Lake City (2018) pp. 1828\u20131837.","DOI":"10.1109\/CVPR.2018.00196"},{"key":"S0263574721001661_ref5","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973068.59"},{"key":"S0263574721001661_ref36","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2007.4286571"},{"key":"S0263574721001661_ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s10514-015-9521-5"},{"key":"S0263574721001661_ref25","unstructured":"[25] Baraniuk, R. G. , Mousavi, A. and , A. B. Patel , \u201cA Deep Learning Approach to Structured Signal Recovery,\u201d Annual Allerton Conference on Communication, Control, and Computing (Allerton),Urbana (2015) pp. 1336\u20131343."},{"key":"S0263574721001661_ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2019.05.006"},{"key":"S0263574721001661_ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10514-021-09982-9"},{"key":"S0263574721001661_ref35","unstructured":"[35] Lu, B.-X. , \u201c3D map exploration and search using topological fourier sparse set,\u201d Master thesis, National Central University (2020)."},{"key":"S0263574721001661_ref29","doi-asserted-by":"publisher","DOI":"10.3390\/s20092591"},{"key":"S0263574721001661_ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2010.5509808"},{"key":"S0263574721001661_ref11","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2013.IX.051"},{"key":"S0263574721001661_ref9","doi-asserted-by":"publisher","DOI":"10.1287\/opre.34.2.324"},{"key":"S0263574721001661_ref1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"key":"S0263574721001661_ref23","unstructured":"[23] Canh, T. N. and Jeon, B. , \u201cMulti-scale deep compressive sensing network,\u201d CoRR, abs\/1809.05717 (2016)."},{"key":"S0263574721001661_ref37","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","article-title":"Regression shrinkage and selection via the lasso","volume":"58","author":"Tibshirani","year":"1996","journal-title":"J. Roy. Stat. Soc. B"},{"key":"S0263574721001661_ref21","doi-asserted-by":"crossref","unstructured":"[21] Kulkarni, K. , Lohit, S. , Turaga, P. , Kerviche, R. and Ashok, A. , \u201cReconnet: Non-Iterative Reconstruction of Images from Compressively Sensed Measurements,\u201d IEEE Conference on Computer Vision and Pattern Recognition (CVPR),Las Vegas (2016) pp. 449\u2013458.","DOI":"10.1109\/CVPR.2016.55"},{"key":"S0263574721001661_ref46","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2981978"},{"key":"S0263574721001661_ref33","doi-asserted-by":"publisher","DOI":"10.1177\/0278364906072252"},{"key":"S0263574721001661_ref8","unstructured":"[8] Stone, L. D. , \u201cThe theory of optimal search,\u201d Oper. Res. Soc. Amer. (1975)."},{"key":"S0263574721001661_ref45","unstructured":"[45] Tseng, K.-S. and Mettler, B. , \u201cHuman planning and coordination in spatial search problems,\u201d 1st IFAC Conference on Cyber-Physical and Human-Systems, Florianopolis (2016)."},{"key":"S0263574721001661_ref49","unstructured":"[49] Wulfmeier, M. , Ondruska, P. and Posner, I. , \u201cMaximum entropy deep inverse reinforcement learning,\u201d arxiv. (2015)."},{"key":"S0263574721001661_ref3","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(99)00031-9"},{"key":"S0263574721001661_ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-4-431-55879-8_2"},{"key":"S0263574721001661_ref6","unstructured":"[6] Stobbe, P. and Krause, A. , \u201cLearning Fourier Sparse Set Functions,\u201d Proceedings of the Fifteenth International Conference on Artificial Intelligence and Statistics,Canary Islands (2012) pp. 1125\u20131133."},{"key":"S0263574721001661_ref43","doi-asserted-by":"publisher","DOI":"10.1017\/9781316671665"},{"key":"S0263574721001661_ref17","first-page":"1097","article-title":"\u201cImagenet Classification with Deep Convolutional Neural Networks,\u201d","volume":"1","author":"Sutskever","year":"2012","journal-title":"International Conference on Neural Information Processing Systems"},{"key":"S0263574721001661_ref19","first-page":"1","article-title":"Block-Based Compressed Sensing of Images via Deep Learning","author":"Adler","year":"2017","journal-title":"IEEE International Workshop on Multimedia Signal Processing"},{"key":"S0263574721001661_ref20","doi-asserted-by":"crossref","unstructured":"[20] Shi, W. , Jiang, F. , Zhang, S. and Zhao, D. , \u201cDeep Networks for Compressed Image Sensing,\u201d IEEE International Conference on Multimedia and Expo (ICME),Hong Kong\u00a0(2017) pp. 877\u2013882.","DOI":"10.1109\/ICME.2017.8019428"},{"key":"S0263574721001661_ref4","doi-asserted-by":"crossref","unstructured":"[4] Zhang, H. and Vorobeychik, Y. , \u201cSubmodular Optimization with Routing Constraints,\u201d AAAI Conference on Artificial Intelligence,Arizona\u00a0(2016).","DOI":"10.1609\/aaai.v30i1.10066"},{"key":"S0263574721001661_ref27","first-page":"3113","article-title":"Trainable ista for sparse signal recovery","volume":"67","author":"Ito","year":"2019","journal-title":"Process."},{"key":"S0263574721001661_ref24","doi-asserted-by":"crossref","unstructured":"[24] Mousavi, A. and Baraniuk, R. , \u201cLearning to Invert: Signal Recovery via Deep Convolutional Networks,\u201d IEEE International Conference on Acoustics, Speech and Signal Processing,New Orleans (2017) pp. 2272\u20132276.","DOI":"10.1109\/ICASSP.2017.7952561"}],"container-title":["Robotica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0263574721001661","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,17]],"date-time":"2024-09-17T19:34:38Z","timestamp":1726601678000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0263574721001661\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,2]]},"references-count":49,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["S0263574721001661"],"URL":"https:\/\/doi.org\/10.1017\/s0263574721001661","relation":{},"ISSN":["0263-5747","1469-8668"],"issn-type":[{"value":"0263-5747","type":"print"},{"value":"1469-8668","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,2,2]]}}}