{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T04:29:42Z","timestamp":1761971382483,"version":"build-2065373602"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,6,7]],"date-time":"2012-06-07T00:00:00Z","timestamp":1339027200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sign Process Syst"],"published-print":{"date-parts":[[2013,4]]},"DOI":"10.1007\/s11265-012-0671-9","type":"journal-article","created":{"date-parts":[[2012,6,6]],"date-time":"2012-06-06T00:08:02Z","timestamp":1338941282000},"page":"1-20","source":"Crossref","is-referenced-by-count":16,"title":["A Simple Compressive Sensing Algorithm for Parallel Many-Core Architectures"],"prefix":"10.1007","volume":"71","author":[{"given":"Alexandre","family":"Borghi","sequence":"first","affiliation":[]},{"given":"J\u00e9r\u00f4me","family":"Darbon","sequence":"additional","affiliation":[]},{"given":"Sylvain","family":"Peyronnet","sequence":"additional","affiliation":[]},{"given":"Tony F.","family":"Chan","sequence":"additional","affiliation":[]},{"given":"Stanley","family":"Osher","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,6,7]]},"reference":[{"key":"671_CR1","unstructured":"Al-Kiswany, S., Gharaibeh, A., Santos-Neto, E., Yuan, G., & Ripeanu, M. (2008). StoreGPU: Exploiting graphics processing units to accelerate distributed storage systems. In: Proceedings of the 17th international symposium on high performance distributed computing (HPDC) (pp. 165\u2013174)."},{"issue":"3","key":"671_CR2","first-page":"151","volume":"17","author":"M Andrecut","year":"2009","unstructured":"Andrecut, M. (2009). Fast GPU implementation of sparse signal recovery from random projections. Engineering Letters, 17(3), 151\u2013158.","journal-title":"Engineering Letters"},{"key":"671_CR3","unstructured":"Bader, D.\u00a0A., & Agarwal, V. (2007). FFTC: Fastest fourier transform for the IBM cell broadband engine. In: S.\u00a0Aluru, M.\u00a0Parashar, R.\u00a0Badrinath, & V.\u00a0K. Prasanna (Eds.), HiPC, Lecture of Notes in Computer Science (Vol. 4873, pp. 172\u2013184). Springer."},{"key":"671_CR4","unstructured":"Bajwa, W.\u00a0U., Haupt, J.\u00a0D., Raz, G.\u00a0M., Wright, S.\u00a0J., & Nowak, R.\u00a0D. (2007). Toeplitz-structured compressed sensing matrices. In: Proceedings of the 14th IEEE\/SP workshop on Statistical Signal Processing (SSP) (pp. 294\u2013298)."},{"key":"671_CR5","unstructured":"Bernstein, D.\u00a0J. (2007). The tangent FFT. In: S.\u00a0Boztas & H.\u00a0Feng Lu (Eds.), Lecture notes in computer science, applied algebra, algebraic algorithms and error-correcting codes (Vol. 4851, pp. 291\u2013300). Springer."},{"key":"671_CR6","unstructured":"Bertsekas, D. (1996). Constrained optimization and lagrange multiplier methods. Athena Scientific."},{"issue":"12","key":"671_CR7","doi-asserted-by":"crossref","first-page":"2992","DOI":"10.1109\/TIP.2007.909319","volume":"16","author":"J Bioucas-Dias","year":"2007","unstructured":"Bioucas-Dias, J., & Figueiredo, M. (2007). A new TwIST: Two-step iterative shrinkage\/thresholding algorithms for image restoration. IEEE Transactions on Image Processing, 16(12), 2992\u20133004.","journal-title":"IEEE Transactions on Image Processing"},{"issue":"2","key":"671_CR8","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1137\/060663556","volume":"30","author":"K Bredies","year":"2008","unstructured":"Bredies, K., & Lorenz, D.\u00a0A. (2008). Iterated hard shrinkage for minimization problems with sparsity constraints. SIAM Journal on Scientific Computing, 30(2), 657\u2013683.","journal-title":"SIAM Journal on Scientific Computing"},{"key":"671_CR9","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/s10208-004-0162-x","volume":"6","author":"E Cand\u00e8s","year":"2006","unstructured":"Cand\u00e8s, E., & Romberg, J. (2006). Quantitative robust uncertainty principles and optimally sparse decompositions. Foundations of Computational Mathematics, 6, 227\u2013254.","journal-title":"Foundations of Computational Mathematics"},{"issue":"2","key":"671_CR10","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1109\/TIT.2005.862083","volume":"52","author":"E Cand\u00e8s","year":"2006","unstructured":"Cand\u00e8s, E., Romberg, J., & Tao, T. (2006). Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. IEEE Transactions on Information Theory, 52(2), 489\u2013509.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"12","key":"671_CR11","doi-asserted-by":"crossref","first-page":"5406","DOI":"10.1109\/TIT.2006.885507","volume":"52","author":"E Cand\u00e8s","year":"2006","unstructured":"Cand\u00e8s, E., & Tao, T. (2006). Near optimal signal recovery from random projections: universal encoding strategies?. IEEE Transactions on Information Theory, 52(12), 5406\u20135426.","journal-title":"IEEE Transactions on Information Theory"},{"key":"671_CR12","unstructured":"Cevher, V., Sankaranarayanan, A., Duarte, M.\u00a0F., Reddy, D., Baraniuk, R.\u00a0G., & Chellappa, R. (2008). Compressive sensing for background subtraction. In: Proceedings of the 10th European Conference on Computer Vision (ECCV) (Vol. 5303, pp. 155\u2013168)."},{"key":"671_CR13","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1109\/83.661182","volume":"7","author":"A Chambolle","year":"1998","unstructured":"Chambolle, A., DeVore, R.\u00a0A., Lee, N.-Y., & Lucier, B.\u00a0J. (1998). Nonlinear wavelet image processing: variational problems, compression, and noise removal through wavelet shrinkage. IEEE Transactions on Image Processing, 7, 319\u2013335.","journal-title":"IEEE Transactions on Image Processing"},{"issue":"4","key":"671_CR14","doi-asserted-by":"crossref","first-page":"1351","DOI":"10.1137\/060669498","volume":"18","author":"P Combettes","year":"2007","unstructured":"Combettes, P., & Pesquet, J.-C. (2007). Proximal thresholding algorithm for minimization over orthonormal bases. SIAM Journal on Optimization, 18(4), 1351\u20131376.","journal-title":"SIAM Journal on Optimization"},{"issue":"1","key":"671_CR15","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1109\/99.660313","volume":"5","author":"L Dagum","year":"1998","unstructured":"Dagum, L., & Menon, R. (1998). OpenMP: An industry standard API for shared-memory programming. IEEE Computational Science and Engineering, 5(1), 46\u201355.","journal-title":"IEEE Computational Science and Engineering"},{"issue":"11","key":"671_CR16","doi-asserted-by":"crossref","first-page":"1413","DOI":"10.1002\/cpa.20042","volume":"57","author":"I Daubechies","year":"2004","unstructured":"Daubechies, I., Defrise, M., & Mol, C.\u00a0D. (2004). An iterative thresholding algorithm for linear inverse problems with a sparsity constraint. Communications in Pure and Applied Mathematics, 57(11), 1413\u20131457.","journal-title":"Communications in Pure and Applied Mathematics"},{"issue":"23","key":"671_CR17","doi-asserted-by":"crossref","first-page":"918","DOI":"10.1016\/j.jco.2007.04.002","volume":"4\u20136","author":"RA DeVore","year":"2007","unstructured":"DeVore, R.\u00a0A. (2007). Deterministic constructions of compressed sensing matrices. Journal of Complexity, 4\u20136(23), 918\u2013925.","journal-title":"Journal of Complexity"},{"issue":"2","key":"671_CR18","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1109\/40.848475","volume":"20","author":"K Diefendorff","year":"2000","unstructured":"Diefendorff, K., Dubey, P., Hochsprung, R., & Scale, H. (2000). Altivec extension to PowerPC accelerates media processing. IEEE Micro, 20(2), 85\u201395.","journal-title":"IEEE Micro"},{"key":"671_CR19","unstructured":"Donoho, D., Tsaig, Y., Drori, I., & Starck, J.-L. (2006). Sparse solution of underdetermined linear equations by stagewise orthogonal matching pursuit. Tech. rep."},{"issue":"4","key":"671_CR20","doi-asserted-by":"crossref","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","volume":"52","author":"DL Donoho","year":"2006","unstructured":"Donoho, D.\u00a0L. (2006). Compressed sensing. IEEE Transactions on Information Theory, 52(4), 1289\u20131306.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"12","key":"671_CR21","first-page":"2992","volume":"16","author":"F-X Dupe","year":"2008","unstructured":"Dupe, F.-X., Fadili, J., & Starck, J.-L. (2008). A proximal iteration for deconvolving poisson noisy images using sparse representations. IEEE Transactions on Image Processing, 16(12), 2992\u20133004.","journal-title":"IEEE Transactions on Image Processing"},{"key":"671_CR22","unstructured":"Hale, W.\u00a0Y. E.\u00a0T., & Zhang, Y. (2007). A fixed-point continuation method for l1-regularized minimization with applications to compressed sensing. Tech. rep., Rice University."},{"key":"671_CR23","doi-asserted-by":"crossref","first-page":"5559","DOI":"10.1109\/TIT.2006.885522","volume":"52","author":"M Elad","year":"2006","unstructured":"Elad, M. (2006). Why simple shrinkage is still relevant for redundant representation? IEEE Transactions on Information Theory, 52, 5559\u20135569.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"11\u201312","key":"671_CR24","doi-asserted-by":"crossref","first-page":"660","DOI":"10.1016\/j.cpc.2007.02.107","volume":"176","author":"GD Fabritiis","year":"2007","unstructured":"Fabritiis, G.\u00a0D. (2007). Performance of the cell processor for biomolecular simulations. Computer Physics Communications, 176(11\u201312), 660\u2013664.","journal-title":"Computer Physics Communications"},{"issue":"8","key":"671_CR25","doi-asserted-by":"crossref","first-page":"906","DOI":"10.1109\/TIP.2003.814255","volume":"12","author":"M Figueiredo","year":"2003","unstructured":"Figueiredo, M., & Nowak, R. (2003). An EM algorithm for wavelet-based image restoration. IEEE Transactions on Image Processing, 12(8), 906\u2013916.","journal-title":"IEEE Transactions on Image Processing"},{"issue":"3","key":"671_CR26","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1109\/JSTSP.2007.910281","volume":"1","author":"M Figueiredo","year":"2007","unstructured":"Figueiredo, M., Nowak, R., & Wright, S. (2007). Gradient projection for sparse reconstruction: Application to compressed sensing and other inverse problems. IEEE Journal of Selected Topics in Signal Processing, 1(3), 586\u2013598.","journal-title":"IEEE Journal of Selected Topics in Signal Processing"},{"key":"671_CR27","unstructured":"Frigo, M., & Johnson, S. (1998). FFTW: an adaptive software architecture for the FFT. In: Proceedings of the IEEE international conference on acoustics, speech and signal processing (Vol. 3, pp. 1381\u20131384)."},{"key":"671_CR28","unstructured":"Gilbert, A.\u00a0C., Strauss, M.\u00a0J., Tropp, J.\u00a0A., & Vershynin, R. (2006). Algorithmic linear dimension reduction in the l 1 norm for sparse vectors. In: Proceedings of the 44th Annual Allerton Conference on Communication, Control and Computing (pp. 1411\u20131418)."},{"key":"671_CR29","unstructured":"Goldstein, T., & Osher, S. (2008). The split Bregman method for l1 regularized problems. Tech. Rep. CAM 08-29, UCLA."},{"key":"671_CR30","doi-asserted-by":"crossref","unstructured":"Griesse, R., & Lorenz, D.\u00a0A. (2008). A semismooth Newton method for Tikhonov functionals with sparsity constraints. Inverse Problems, 24(3).","DOI":"10.1088\/0266-5611\/24\/3\/035007"},{"key":"671_CR31","unstructured":"Hegde, C., Wakin, M., & Baraniuk, R. (2007). Random projections for manifold learning. In: Neural Information Processing Systems (NIPS)."},{"key":"671_CR32","volume-title":"Convex analysis and minimization algorithms","author":"J-B Hiriart-Urruty","year":"1996","unstructured":"Hiriart-Urruty, J.-B., & Lemar\u00e9chal, C. (1996). Convex analysis and minimization algorithms. Springer, Heidelberg, two volumes\u20142nd printing."},{"issue":"4","key":"671_CR33","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1109\/JSTSP.2007.910971","volume":"1","author":"S-J Kim","year":"2007","unstructured":"Kim, S.-J., Koh, K., Lustig, M., Boyd, S., & Gorinevsky, D. (2007). An interior-point method for large-scale l 1-regularized least squares. IEEE Journal of Selected Topics in Signal Processing, 1(4), 606\u2013617.","journal-title":"IEEE Journal of Selected Topics in Signal Processing"},{"issue":"10","key":"671_CR34","doi-asserted-by":"crossref","first-page":"1371","DOI":"10.1002\/cpe.1164","volume":"19","author":"J Kurzak","year":"2007","unstructured":"Kurzak, J., & Dongarra, J. (2007). Implementation of mixed-precision in solving systems of linear equations on the CELL processor. Concurrency and Computation: Practice and Experience, 19(10), 1371\u20131385.","journal-title":"Concurrency and Computation: Practice and Experience"},{"issue":"2","key":"671_CR35","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1137\/S1052623494267127","volume":"7","author":"C Lemar\u00e9chal","year":"1997","unstructured":"Lemar\u00e9chal, C., & Sagastiz\u00e1bal, C. (1997). Practical aspects of the Moreau-Yosida regularization: theoretical preliminaries. SIAM Journal on Optimization, 7(2), 367\u2013385.","journal-title":"SIAM Journal on Optimization"},{"key":"671_CR36","unstructured":"Lieberman, M.\u00a0D., Sankaranarayanan, J., & Samet, H. (2008). A fast similarity join algorithm using graphics processing units. In: Proceedings of the IEEE international conference on data engineering (ICDE) (pp. 1111\u20131120)."},{"issue":"6","key":"671_CR37","doi-asserted-by":"crossref","first-page":"1182","DOI":"10.1002\/mrm.21391","volume":"58","author":"M Lustig","year":"2007","unstructured":"Lustig, M., Donoho, D., & Pauly, J.\u00a0M. (2007). Sparse MRI: the application of compressed sensing for rapid MR imaging. Magnetic Resonance in Medicine, 58(6), 1182\u20131195.","journal-title":"Magnetic Resonance in Medicine"},{"key":"671_CR38","unstructured":"Mairal, J., Bach, F., Ponce, J., Sapiro, G., & Zisserman, A. (2008). Discriminative learned dictionaries for local image analysis. In: IEEE Conf. on computer vision and pattern recognition (CVPR) (pp. 23\u201328)."},{"key":"671_CR39","first-page":"273","volume":"93","author":"J Moreau","year":"1965","unstructured":"Moreau, J. (1965). Proximit\u00e9 et dualit\u00e9 dans un espace hilbertien. Bulletin de la S.M.F., 93, 273\u2013299.","journal-title":"Bulletin de la S.M.F."},{"issue":"2","key":"671_CR40","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1145\/1365490.1365500","volume":"6","author":"J Nickolls","year":"2008","unstructured":"Nickolls, J., Buck, I., Garland, M., & Skadron, K. (2008). Scalable parallel programming with CUDA. Queue, 6(2), 40\u201353.","journal-title":"Queue"},{"issue":"9","key":"671_CR41","doi-asserted-by":"crossref","first-page":"1204","DOI":"10.1109\/83.784433","volume":"8","author":"M Nikolova","year":"1999","unstructured":"Nikolova, M. (1999). Markovian reconstruction using a GNC approach. IEEE Transactions on Image Processing, 8(9), 1204\u20131220.","journal-title":"IEEE Transactions on Image Processing"},{"issue":"4","key":"671_CR42","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1109\/83.663502","volume":"8","author":"M Nikolova","year":"1998","unstructured":"Nikolova, M., Idier, J., & Mohammad-Djafari, A. (1998). Inversion of large-support ill-posed linear operators using a piecewise Gaussian MRF. IEEE Transactions on Image Processing, 8(4), 571\u2013585.","journal-title":"IEEE Transactions on Image Processing"},{"issue":"1","key":"671_CR43","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1137\/070692285","volume":"1","author":"M Nikolova","year":"2008","unstructured":"Nikolova, M., Ng, M.\u00a0K., Zhang, S.\u00a0Q., & Ching, W.\u00a0K. (2008). Efficient reconstruction of piecewise constant images using nonsmooth nonconvex minimization. SIAM Journal on Imaging Sciences, 1(1), 2\u201325.","journal-title":"SIAM Journal on Imaging Sciences"},{"key":"671_CR44","unstructured":"Nowak, R., & Figueiredo, M. (2001). Fast wavelet-based image deconvolution using the em algorithm. In: Proceedings of the 35th Asilomar conference on signals, systems, and computers (pp. 371\u2013275)."},{"issue":"3","key":"671_CR45","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/s10766-008-0072-7","volume":"36","author":"K O\u2019Brien","year":"2008","unstructured":"O\u2019Brien, K., O\u2019Brien, K.\u00a0M., Sura, Z., Chen, T., & Zhang, T. (2008). Supporting OpenMP on cell. International Journal of Parallel Programming, 36(3), 289\u2013311.","journal-title":"International Journal of Parallel Programming"},{"issue":"1","key":"671_CR46","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1111\/j.1467-8659.2007.01012.x","volume":"26","author":"JD Owens","year":"2007","unstructured":"Owens, J.\u00a0D., Luebke, D., Govindaraju, N., Harris, M., Kruger, J., Lefohn, A.\u00a0E., et al. (2007). A survey of general-purpose computation on graphics hardware. Computer Graphics Forum, 26(1), 80\u2013113.","journal-title":"Computer Graphics Forum"},{"key":"671_CR47","unstructured":"Pham, D., Asano, S., Bolliger, M., Day, M.\u00a0N., Hofstee, H.\u00a0P., Johns, C., et al. (2005). The design and implementation of a first-generation CELL processor. In: Proceedings of the solid-state circuits conference (pp. 184\u2013185)."},{"key":"671_CR48","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1399504.1360617","volume-title":"ACM SIGGRAPH 2008 papers","author":"L Seiler","year":"2008","unstructured":"Seiler, L., Carmean, D., Sprangle, E., Forsyth, T., Abrash, M., Dubey, P., et al. (2008). Larrabee: a many-core x86 architecture for visual computing. In: ACM SIGGRAPH 2008 papers (pp. 1\u201315). New York, NY, USA: ACM."},{"key":"671_CR49","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","volume":"58","author":"R Tibshirani","year":"2006","unstructured":"Tibshirani, R. (2006). Regression shrinkage and selection via the lasso. Journal of the Royal Statistical Society Series B, 58, 267\u2013288.","journal-title":"Journal of the Royal Statistical Society Series B"},{"issue":"3","key":"671_CR50","doi-asserted-by":"crossref","first-page":"1030","DOI":"10.1109\/TIT.2005.864420","volume":"51","author":"J Tropp","year":"2006","unstructured":"Tropp, J. (2006). Just relax: Convex programming methods for identifying sparse signals. IEEE Transactions on Information Theory, 51(3), 1030\u20131051.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"10","key":"671_CR51","doi-asserted-by":"crossref","first-page":"2231","DOI":"10.1109\/TIT.2004.834793","volume":"50","author":"JA Tropp","year":"2004","unstructured":"Tropp, J.\u00a0A. (2004). Greed is good: algorithmic results for sparse approximation. IEEE Transactions on Information Theory, 50(10), 2231\u20132242.","journal-title":"IEEE Transactions on Information Theory"},{"key":"671_CR52","doi-asserted-by":"crossref","unstructured":"Williams, S., Carter, J., Oliker, L., Shalf, J., & Yelick, K. (2008). Lattice Boltzmann simulation optimization on leading multicore platforms. In IEEE international parallel and distributed processing symposium (pp. 1\u201314).","DOI":"10.1109\/IPDPS.2008.4536295"},{"key":"671_CR53","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1145\/1128022.1128027","volume-title":"Proceedings of the 3rd conference on computing frontiers (CF)","author":"S Williams","year":"2006","unstructured":"Williams, S., Shalf, J., Oliker, L., Kamil, S., Husbands, P., & Yelick, K. (2006). The potential of the cell processor for scientific computing. In: Proceedings of the 3rd conference on computing frontiers (CF) (pp. 9\u201320). New York, NY, USA: ACM."},{"issue":"2","key":"671_CR54","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1109\/TPAMI.2008.79","volume":"31","author":"J Wright","year":"2009","unstructured":"Wright, J., Yang, A., Ganesh, A., Sastry, S., & Ma, Y. (2009). Robust face recognition via sparse representation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 31(2), 210\u2013227.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"1","key":"671_CR55","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1137\/070703983","volume":"1","author":"W Yin","year":"2008","unstructured":"Yin, W., Osher, S., Goldfarb, D., & Darbon, J. (2008). Bregman iterative algorithms for l1-minimization with applications to compressed sensing. SIAM Journal on Imaging Sciences, 1(1), 143\u2013168.","journal-title":"SIAM Journal on Imaging Sciences"},{"key":"671_CR56","doi-asserted-by":"crossref","unstructured":"Yosida, K. (1965). Functional analysis. Springer.","DOI":"10.1007\/978-3-662-25762-3"}],"container-title":["Journal of Signal Processing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11265-012-0671-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11265-012-0671-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11265-012-0671-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,29]],"date-time":"2025-03-29T10:51:04Z","timestamp":1743245464000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11265-012-0671-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,7]]},"references-count":56,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,4]]}},"alternative-id":["671"],"URL":"https:\/\/doi.org\/10.1007\/s11265-012-0671-9","relation":{},"ISSN":["1939-8018","1939-8115"],"issn-type":[{"type":"print","value":"1939-8018"},{"type":"electronic","value":"1939-8115"}],"subject":[],"published":{"date-parts":[[2012,6,7]]}}}