{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T18:33:14Z","timestamp":1773772394461,"version":"3.50.1"},"reference-count":22,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"10","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. &amp; Syst."],"published-print":{"date-parts":[[2016]]},"DOI":"10.1587\/transinf.2015edp7438","type":"journal-article","created":{"date-parts":[[2016,9,30]],"date-time":"2016-09-30T22:22:39Z","timestamp":1475274159000},"page":"2566-2573","source":"Crossref","is-referenced-by-count":8,"title":["HISTORY: An Efficient and Robust Algorithm for Noisy 1-Bit Compressed Sensing"],"prefix":"10.1587","volume":"E99.D","author":[{"given":"Biao","family":"SUN","sequence":"first","affiliation":[{"name":"School of Electrical Engineering and Automation, Tianjin University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hui","family":"FENG","sequence":"additional","affiliation":[{"name":"School of Electrical Engineering and Automation, Tianjin University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinxin","family":"XU","sequence":"additional","affiliation":[{"name":"Microsystems Technology Center, Information Science Academy of China Electronics Technology Group Corporation"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] E.J. Candes and T. Tao, \u201cNear-optimal signal recovery from random projections: Universal encoding strategies?,\u201d IEEE Trans. Inform. Theory, vol.52, no.12, pp.5406-5425, 2006.","DOI":"10.1109\/TIT.2006.885507"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] D.L. Donoho, \u201cCompressed sensing,\u201d IEEE Trans. Inform. Theory, vol.52, no.4, pp.1289-1306, 2006.","DOI":"10.1109\/TIT.2006.871582"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] E.J. Cand\u00e8s, J. Romberg, and T. Tao, \u201cRobust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information,\u201d IEEE Trans. Inform. Theory, vol.52, no.2, pp.489-509, 2006.","DOI":"10.1109\/TIT.2005.862083"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] E.J. Cand\u00e8s, \u201cThe restricted isometry property and its implications for compressed sensing,\u201d CR Math., vol.346, no.9, pp.589-592, 2008.","DOI":"10.1016\/j.crma.2008.03.014"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] P.T. Boufounos and R.G. Baraniuk, \u201c1-bit compressive sensing,\u201d Proc. 42nd Annual Conf. Information Sciences and Systems (CISS), Princeton, USA, pp.16-21, 2008.","DOI":"10.1109\/CISS.2008.4558487"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] P.T. Boufounos, \u201cReconstruction of sparse signals from distorted randomized measurements,\u201d Proc. IEEE International Conf. Acoustics Speech and Signal Processing (ICASSP), Dallas, USA, pp.3998-4001, 2010.","DOI":"10.1109\/ICASSP.2010.5495766"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] P.T. Boufounos, \u201cGreedy sparse signal reconstruction from sign measurements,\u201d Proc. 43rd Asilomar Conference on Signals, Systems and Computers, Asilomar, USA, pp.1305-1309, 2009.","DOI":"10.1109\/ACSSC.2009.5469926"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] A. Gupta, R. Nowak, and B. Recht, \u201cSample complexity for 1-bit compressed sensing and sparse classification,\u201d Proc. IEEE International Symposium on Information Theory (ISIT), Austin, USA, pp.1553-1557, 2010.","DOI":"10.1109\/ISIT.2010.5513510"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] J.N. Laska, Z. Wen, W. Yin, and R.G. Baraniuk, \u201cTrust, but verify: Fast and accurate signal recovery from 1-bit compressive measurements,\u201d IEEE Trans. Signal Proces., vol.59, no.11, pp.5289-5301, 2011.","DOI":"10.1109\/TSP.2011.2162324"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] T. Zhou and D. Tao, \u201c1-bit hamming compressed sensing,\u201d Proc. IEEE International Symposium on Information Theory (ISIT), Cambridge, USA, pp.1862-1866, 2012.","DOI":"10.1109\/ISIT.2012.6283603"},{"key":"11","unstructured":"[11] B. Sun and J. Jiang, \u201cInvestigation of sign spectrum sensing method,\u201d Acta Phys Sin-ch Ed, vol.11, no.32, 110701, 2011."},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] B. Sun, Q. Chen, X. Xu, L. Zhang, and J. Jiang, \u201cA fast and accurate two-stage algorithm for 1-bit compressive sensing,\u201d IEICE Trans. Inf. &amp; Syst., vol.E96.D, no.1, pp.120-123, 2013.","DOI":"10.1587\/transinf.E96.D.120"},{"key":"13","unstructured":"[13] S. Gopi, P. Netrapalli, P. Jain, and A. Nori, \u201cOne-bit compressed sensing: Provable support and vector recovery,\u201d Proc. 30th International Conf. Machine Learning (ICML), Atlanta, USA, pp.154-162, 2013."},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] L. Jacques, J.N. Laska, P.T. Boufounos, and R.G. Baraniuk, \u201cRobust 1-bit compressive sensing via binary stable embeddings of sparse vectors,\u201d IEEE Trans. Inform. Theory, vol.59, no.4, pp.2082-2102, 2013.","DOI":"10.1109\/TIT.2012.2234823"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] Y. Plan and R. Vershynin, \u201cOne-bit compressed sensing by linear programming,\u201d Commun. Pur. Appl. Math., vol.66, no.8, pp.1275-1297, 2013.","DOI":"10.1002\/cpa.21442"},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] M. Yan, Y. Yang, and S. Osher, \u201cRobust 1-bit compressive sensing using adaptive outlier pursuit,\u201d IEEE Trans. Signal Proces., vol.60, no.7, pp.3868-3875, 2012.","DOI":"10.1109\/TSP.2012.2193397"},{"key":"17","doi-asserted-by":"crossref","unstructured":"[17] Y. Plan and R. Vershynin, \u201cRobust 1-bit compressed sensing and sparse logistic regression: A convex programming approach,\u201d IEEE Trans. Inform. Theory, vol.59, no.1, pp.482-494, 2013.","DOI":"10.1109\/TIT.2012.2207945"},{"key":"18","doi-asserted-by":"crossref","unstructured":"[18] A. Ai, A. Lapanowski, Y. Plan, and R. Vershynin, \u201cOne-bit compressed sensing with non-gaussian measurements,\u201d Linear. Algebra. Appl., vol.441, pp.222-239, 2014.","DOI":"10.1016\/j.laa.2013.04.002"},{"key":"19","unstructured":"[19] L. Zhang, J. Yi, and R. Jin, \u201cEfficient algorithms for robust one-bit compressive sensing,\u201d Proc. 31st International Conf. Machine Learning (ICML), Beijing, China, pp.820-828, 2014."},{"key":"20","doi-asserted-by":"crossref","unstructured":"[20] L.N. Trefethen and D. Bau, Numerical linear algebra, SIAM, Philadelphia, 1997.","DOI":"10.1137\/1.9780898719574"},{"key":"21","unstructured":"[21] P. Li, \u201cOne scan 1-bit compressed sensing,\u201d 19th International Conference on Artificial Intelligence and Statistics, Cadiz, Spain, pp.1517-1523, 2016."},{"key":"22","doi-asserted-by":"crossref","unstructured":"[22] Y. Ma, D. Baron, D. Needell, \u201cTwo-Part Reconstruction with Noisy-Sudocodes,\u201d IEEE Trans. Signal Process., vol.62, no.23, pp.6323-6334, 2014.","DOI":"10.1109\/TSP.2014.2362892"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E99.D\/10\/E99.D_2015EDP7438\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,14]],"date-time":"2019-09-14T05:07:47Z","timestamp":1568437667000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E99.D\/10\/E99.D_2015EDP7438\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"references-count":22,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2016]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2015edp7438","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}