{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,8]],"date-time":"2024-05-08T18:10:15Z","timestamp":1715191815868},"reference-count":65,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,4,11]],"date-time":"2013-04-11T00:00:00Z","timestamp":1365638400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int J Comput Vis"],"published-print":{"date-parts":[[2013,9]]},"DOI":"10.1007\/s11263-013-0621-4","type":"journal-article","created":{"date-parts":[[2013,4,10]],"date-time":"2013-04-10T11:41:40Z","timestamp":1365594100000},"page":"241-269","source":"Crossref","is-referenced-by-count":15,"title":["Discrete and Continuous Models for Partitioning Problems"],"prefix":"10.1007","volume":"104","author":[{"given":"Jan","family":"Lellmann","sequence":"first","affiliation":[]},{"given":"Bj\u00f6rn","family":"Lellmann","sequence":"additional","affiliation":[]},{"given":"Florian","family":"Widmann","sequence":"additional","affiliation":[]},{"given":"Christoph","family":"Schn\u00f6rr","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,4,11]]},"reference":[{"key":"621_CR1","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198502456.001.0001","volume-title":"Functions of bounded variation and free discontinuity problems","author":"L Ambrosio","year":"2000","unstructured":"Ambrosio, L., Fusco, N., & Pallara, D. (2000). Functions of bounded variation and free discontinuity problems. Oxford: Clarendon Press."},{"key":"621_CR2","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1109\/TPAMI.2006.12","volume":"28","author":"B Appleton","year":"2006","unstructured":"Appleton, B., & Talbot, H. (2006). Globally minimal surfaces by continuous maximal flows. IEEE Transactions on Pattern Analysis and Machine Intelligence, 28, 106\u2013118.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"621_CR3","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1007\/s11263-010-0406-y","volume":"92","author":"E Bae","year":"2011","unstructured":"Bae, E., Yuan, J., & Tai, X. C. (2011). Global minimization for continuous multiphase partitioning problems using a dual approach. International Journal of Computer Vision, 92, 112\u2013129.","journal-title":"International Journal of Computer Vision"},{"key":"621_CR4","doi-asserted-by":"crossref","unstructured":"Bartal, Y. (1998). On approximating arbitrary metrices by tree metrics. In ACM symposium on theory of computing.","DOI":"10.1145\/276698.276725"},{"key":"621_CR5","volume-title":"Network optimization: Continuous and discrete models","author":"DP Bertsekas","year":"1998","unstructured":"Bertsekas, D. P. (1998). Network optimization: Continuous and discrete models. Belmont, MA: Athena Scientific."},{"key":"621_CR6","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/7132.001.0001","volume-title":"Visual reconstruction","author":"A Blake","year":"1987","unstructured":"Blake, A., & Zisserman, A. (1987). Visual reconstruction. Cambridge: MIT Press."},{"key":"621_CR7","doi-asserted-by":"crossref","unstructured":"Boykov, Y. (2003). Computing geodesics and minimal surfaces via graph cuts. In The international conference on computer vision (pp. 26\u201333).","DOI":"10.1109\/ICCV.2003.1238310"},{"issue":"11","key":"621_CR8","doi-asserted-by":"crossref","first-page":"1222","DOI":"10.1109\/34.969114","volume":"23","author":"Y Boykov","year":"2001","unstructured":"Boykov, Y., Veksler, O., & Zabih, R. (2001). Fast approximate energy minimization via graph cuts. IEEE Transactions on Pattern Analysis and Machine Intelligence, 23(11), 1222\u20131239.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"621_CR9","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198507840.001.0001","volume-title":"Gamma-convergence for beginners","author":"A Braides","year":"2002","unstructured":"Braides, A. (2002). Gamma-convergence for beginners. Oxford: Oxford University Press."},{"key":"621_CR10","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1006\/jcss.1999.1687","volume":"60","author":"G C\u0103linescu","year":"2000","unstructured":"C\u0103linescu, G., Karloff, H., & Rabani, Y. (2000). An improved approximation algorithm for multiway cut. Journal of Computer and System Sciences, 60, 564\u2013574.","journal-title":"Journal of Computer and System Sciences"},{"key":"621_CR11","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1023\/A:1007979827043","volume":"22","author":"V Caselles","year":"1997","unstructured":"Caselles, V., Kimmel, R., & Sapiro, G. (1997). Geodesic active contours. International Journal of Computer Vision, 22, 61\u201379.","journal-title":"International Journal of Computer Vision"},{"key":"621_CR12","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1051\/m2an:1999115","volume":"33","author":"A Chambolle","year":"1999","unstructured":"Chambolle, A. (1999). Finite-differences discretizations of the Mumford\u2013Shah functional. Mod\u00e9lisation Math\u00e9matique et Analyse Num\u00e9rique, 33, 261\u2013288.","journal-title":"Mod\u00e9lisation Math\u00e9matique et Analyse Num\u00e9rique"},{"key":"621_CR13","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1007\/s11263-009-0238-9","volume":"84","author":"A Chambolle","year":"2009","unstructured":"Chambolle, A., & Darbon, J. (2009). On total variation minimization and surface evolution using parametric maximum flows. International Journal of Computer Vision, 84, 288\u2013307.","journal-title":"International Journal of Computer Vision"},{"issue":"1","key":"621_CR14","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1137\/090752754","volume":"4","author":"A Chambolle","year":"2011","unstructured":"Chambolle, A., Levine, S. E., & Lucier, B. J. (2011). An upwind finite-difference method for total variation-based image smoothing. Journal of Imaging Science, 4(1), 277\u2013299.","journal-title":"Journal of Imaging Science"},{"issue":"5","key":"621_CR15","first-page":"1632","volume":"66","author":"TF Chan","year":"2006","unstructured":"Chan, T. F., Esedoglu, S., & Nikolova, M. (2006). Algorithms for finding global minimizers of image segmentation and denoising models. Journal of Applied Mathematics, 66(5), 1632\u20131648.","journal-title":"Journal of Applied Mathematics"},{"issue":"2","key":"621_CR16","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1109\/83.902291","volume":"10","author":"TF Chan","year":"2001","unstructured":"Chan, T. F., & Vese, L. A. (2001). Active contours without edges. IEEE Transactions on Image Processing, 10(2), 266\u2013277.","journal-title":"IEEE Transactions on Image Processing"},{"key":"621_CR17","doi-asserted-by":"crossref","unstructured":"Charikar, M., Chekuri, C., Goel, A., Guha, S., & Plotkin, S. (1998). Approximating a finite metric by a small number of tree metrics. In ACM Foundations on Computer Science (pp. 379\u2013388).","DOI":"10.1109\/SFCS.1998.743488"},{"key":"621_CR18","unstructured":"Combettes, P. L., & Pesquet, J. C. (2010). Proximal splitting methods in signal processing. In Fixed-point algorithms for inverse problems in science and engineering. New York: Springer."},{"issue":"7","key":"621_CR19","doi-asserted-by":"crossref","first-page":"1384","DOI":"10.1109\/TPAMI.2010.200","volume":"33","author":"C Couprie","year":"2011","unstructured":"Couprie, C., Grady, L., Najman, L., & Talbot, H. (2011). Power watersheds: A unifying graph-based optimization framework. IEEE Transactions on Pattern Analysis and Machine Intelligence, 33(7), 1384\u20131399.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"3","key":"621_CR20","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1137\/100799186","volume":"4","author":"C Couprie","year":"2011","unstructured":"Couprie, C., Grady, L., Talbot, H., & Najman, L. (2011). Combinatorial continuous maximum flow. Journal of Imaging Science, 4(3), 905\u2013930.","journal-title":"Journal of Imaging Science"},{"issue":"4","key":"621_CR21","first-page":"864","volume":"23","author":"E Dahlhaus","year":"1994","unstructured":"Dahlhaus, E., Johnson, D. S., Papadimitriou, C. H., & Seymour, P. D. (1994). The complexity of multiterminal cuts. Journal of Computing, 23(4), 864\u2013894.","journal-title":"Journal of Computing"},{"key":"621_CR22","doi-asserted-by":"crossref","unstructured":"Dal Maso G. (1993). An introduction to $$\\Gamma $$ -convergence. Basel: Birkh\u00e4user.","DOI":"10.1007\/978-1-4612-0327-8"},{"key":"621_CR23","first-page":"842","volume":"68","author":"E Giorgi De","year":"1975","unstructured":"De Giorgi, E., & Franzoni, T. (1975). Su un tipo di convergenza variazionale. Atti Accad. Naz. Lincei Rend Cl. Sci. Fis. Mat. Natur., 68, 842\u2013850.","journal-title":"Atti Accad. Naz. Lincei Rend Cl. Sci. Fis. Mat. Natur."},{"key":"621_CR24","unstructured":"Dixit, N., Keriven, R., & Paragios, N. (2005). GPU-cuts: Combinatorial optimisation, graphic processing units and adaptive object extraction. Tech. Rep. 05\u201307, CERTIS, ENPC."},{"key":"621_CR25","doi-asserted-by":"crossref","unstructured":"Esser, E., Zhang, X., & Chan, T. F. (2010). A general framework for a class of first order primal-dual algorithms for convex optimization in imaging science. Journal of Imaging Science, 3, 1015\u20131046.","DOI":"10.1137\/09076934X"},{"issue":"3","key":"621_CR26","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1016\/j.jcss.2004.04.011","volume":"69","author":"J Fakcharoenphol","year":"2004","unstructured":"Fakcharoenphol, J., Rao, S., & Talwar, K. (2004). A tight bound on approximating arbitrary metrics by tree metrics. Journal of Computer and System Sciences, 69(3), 485\u2013497.","journal-title":"Journal of Computer and System Sciences"},{"key":"621_CR27","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3259.001.0001","volume-title":"The geometry of multiple images","author":"O Faugeras","year":"2001","unstructured":"Faugeras, O., & Luong, Q. T. (2001). The geometry of multiple images. Cambridge: MIT Press."},{"key":"621_CR28","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1109\/TPAMI.1984.4767596","volume":"6","author":"S Geman","year":"1984","unstructured":"Geman, S., & Geman, D. (1984). Stochastic relaxation, Gibbs distributions and the Bayesian restoration of images. IEEE Transactions on Pattern Analysis and Machine Intelligence, 6, 721\u2013741.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"621_CR29","doi-asserted-by":"crossref","unstructured":"Gobbino, M., & Mora, M. G. (2001). Finite-difference approximation of free-discontinuity problems. Proceedings of the Royal Society of Edinburgh, 131, 567\u2013595.","DOI":"10.1017\/S0308210500001001"},{"key":"621_CR30","doi-asserted-by":"crossref","unstructured":"Goldluecke, S., & Cremers, D. (2010). Convex relaxation for multilabel problems with product label spaces. In European conference of computer vision (pp. 225\u2013238).","DOI":"10.1007\/978-3-642-15555-0_17"},{"key":"621_CR31","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0304-3975(82)90092-5","volume":"21","author":"LM Goldschlager","year":"1982","unstructured":"Goldschlager, L. M., Shaw, R. A., & Staples, J. (1982). The maximum flow problem is log space complete for P. Theoretical Computer Science, 21, 105\u2013111.","journal-title":"Theoretical Computer Science"},{"key":"621_CR32","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84996-290-2","volume-title":"Discrete calculus: Applied analysis on graphs for computational science","author":"LJ Grady","year":"2010","unstructured":"Grady, L. J., & Polimeni, J. R. (2010). Discrete calculus: Applied analysis on graphs for computational science. New York: Springer."},{"key":"621_CR33","volume-title":"Multiple view geometry in computer vision","author":"R Hartley","year":"2000","unstructured":"Hartley, R., & Zisserman, A. (2000). Multiple view geometry in computer vision. Cambridge: Cambridge University Press."},{"issue":"1","key":"621_CR34","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/BF02980577","volume":"31","author":"E Ising","year":"1925","unstructured":"Ising, E. (1925). Beitrag zur Theorie des Ferromagnetismus. Zeitschrift fur Physik, 31(1), 253\u2013258.","journal-title":"Zeitschrift fur Physik"},{"issue":"4","key":"621_CR35","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF00133570","volume":"1","author":"M Kass","year":"1987","unstructured":"Kass, M., Witkin, A., & Terzopoulos, D. (1987). Snakes: Active contours models. International Journal of Computer Vision, 1(4), 321\u2013331.","journal-title":"International Journal of Computer Vision"},{"key":"621_CR36","doi-asserted-by":"crossref","unstructured":"Kleinberg, J. M., & Tardos, E. (1999). Approximation algorithms for classification problems with pairwise relationships: Metric labeling and Markov random fields. In Foundations of computer science (pp. 14\u201323).","DOI":"10.1109\/SFFCS.1999.814572"},{"key":"621_CR37","unstructured":"Klodt, M., Schoenemann, T., Kolev, K., Schikora, M., & Cremers, D. (2008). An experimental comparison of discrete and continuous shape optimization methods. In European conference of computer vision (pp. 332\u2013345). France: Marseille."},{"key":"621_CR38","volume-title":"Probabilistic graphical models: Principles and techniques","author":"D Koller","year":"2009","unstructured":"Koller, D., & Friedman, N. (2009). Probabilistic graphical models: Principles and techniques. Cambridge, MA: MIT Press."},{"key":"621_CR39","doi-asserted-by":"crossref","unstructured":"Kolmogorov, V., & Boykov, Y. (2005). What metrics can be approximated by geo-cuts, or global optimization of length\/area and flux. International conference on computer vision (Vol. 1, pp. 564\u2013571).","DOI":"10.1109\/ICCV.2005.252"},{"issue":"8","key":"621_CR40","doi-asserted-by":"crossref","first-page":"1436","DOI":"10.1109\/TPAMI.2007.1061","volume":"29","author":"N Komodakis","year":"2007","unstructured":"Komodakis, N., & Tziritas, G. (2007). Approximate labeling via graph cuts based on linear programming. IEEE Transactions on Pattern Analysis and Machine Intelligence, 29(8), 1436\u20131453.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"621_CR41","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198522195.001.0001","volume-title":"Graphical models","author":"S Lauritzen","year":"1996","unstructured":"Lauritzen, S. (1996). Graphical models. Oxford: Oxford University Press."},{"key":"621_CR42","unstructured":"Lellmann, J. (2011). Nonsmooth convex variational approaches to image analysis. Ph.D. thesis, University of Heidelberg."},{"key":"621_CR43","unstructured":"Lellmann, J., Breitenreicher, D., & Schn\u00f6rr, C. (2010). Fast and exact primal-dual iterations for variational problems in computer vision. In European conference on computer vision. LNCS (vol. 6312, pp. 494\u2013505). Berlin: Springer."},{"key":"621_CR44","unstructured":"Lellmann, J., Kappes, J., Yuan, J., Becker, F., & Schn\u00f6rr, C. (2009). Convex multi-class image labeling by simplex-constrained total variation. In Scale space and variable methods. LNCS (Vol. 5567, pp. 150\u2013162). Berlin: Springer."},{"key":"621_CR45","doi-asserted-by":"crossref","unstructured":"Lellmann, J., Lenzen, F., & Schn\u00f6rr, C. (2011). Optimality bounds for a variational relaxation of the image partitioning problem. In Energy minimization methods and applications in computer vision and pattern recognition.","DOI":"10.1007\/978-3-642-23094-3_10"},{"key":"621_CR46","doi-asserted-by":"crossref","unstructured":"Lellmann, J., Lenzen, F., & Schn\u00f6rr, C. (2012). Optimality bounds for a variational relaxation of the image partitioning problem. Journal of Mathematical Imaging and Vision. doi: 10.1007\/s10851-012-0390-7 .","DOI":"10.1007\/s10851-012-0390-7"},{"key":"621_CR47","doi-asserted-by":"crossref","unstructured":"Lellmann, J., & Schn\u00f6rr, C. (2011). Continuous multiclass labeling approaches and algorithms. Journal of Imaging Science, 4(4), 1049\u20131096.","DOI":"10.1137\/100805844"},{"key":"621_CR48","doi-asserted-by":"crossref","unstructured":"Lempitsky, V., Rother, C., & Blake, A. (2007). Logcut\u2014Efficient graph cut optimization for Markov random fields. In European conference on computer vision (pp. 1\u20138).","DOI":"10.1109\/ICCV.2007.4408907"},{"key":"621_CR49","doi-asserted-by":"crossref","unstructured":"Lempitsky, V., Rother, C., Roth, S., & Blake, A. (2010). Fusion moves for Markov random field optimization. IEEE Transactions on Pattern Analysis and Machine Intelligence, 32(8), 1392\u20131405.","DOI":"10.1109\/TPAMI.2009.143"},{"key":"621_CR50","doi-asserted-by":"crossref","unstructured":"Lie, J., Lysaker, M., & Tai, X. C. (2006). A variant of the level set method and applications to image segmentation. Mathematics of Computation, 75, 1155\u20131174.","DOI":"10.1090\/S0025-5718-06-01835-7"},{"key":"621_CR51","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-0567-5","volume-title":"Variational methods in image segmentation","author":"JM Morel","year":"1995","unstructured":"Morel, J. M., & Solimini, S. (1995). Variational methods in image segmentation. Basel: Birkh\u00e4user."},{"key":"621_CR52","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1002\/cpa.3160420503","volume":"42","author":"D Mumford","year":"1989","unstructured":"Mumford, D., & Shah, J. (1989). Optimal approximations by piecewise smooth functions and associated variational problems. Communications on Pure and Applied Mathematics, 42, 577\u2013685.","journal-title":"Communications on Pure and Applied Mathematics"},{"key":"621_CR53","unstructured":"Olsson, C. (2009). Global optimization in computer vision: Convexity, cuts and approximation algorithms. Ph.D. thesis, Lund University."},{"key":"621_CR54","doi-asserted-by":"crossref","unstructured":"Olsson, C., Byr\u00f6d, M., Overgaard, N. C., & Kahl, F. (2009). Extending continuous cuts: Anisotropic metrics and expansion moves. In International conference on computer vision.","DOI":"10.1109\/ICCV.2009.5459206"},{"key":"621_CR55","doi-asserted-by":"crossref","unstructured":"Paragios, N., Chen, Y., & Faugeras, O. (Eds.). (2006). The handbook of mathematical models in computer vision. New York: Springer.","DOI":"10.1007\/0-387-28831-7"},{"key":"621_CR56","doi-asserted-by":"crossref","unstructured":"Pock, T., Chambolle, A., Cremers, D., & Bischof, H. (2009). A convex relaxation approach for computing minimal partitions. In Computer vision on pattern recognition (pp. 810\u2013817).","DOI":"10.1109\/CVPR.2009.5206604"},{"key":"621_CR57","doi-asserted-by":"crossref","unstructured":"Pock, T., Sch\u00f6nemann, T., Graber, G., Bischof, H., & Cremers, D. (2008). A convex formulation of continuous multi-label problems. In European conference on computer vision (Vol. 3, pp. 792\u2013805).","DOI":"10.1007\/978-3-540-88690-7_59"},{"key":"621_CR58","unstructured":"Rickett, J., & Fomel, S. (1999). A second-order fast marching Eikonal solver. Tech. Rep. 100, Standford Exploration Project Report."},{"key":"621_CR59","unstructured":"Scherzer, O., Grasmair, M., Grossauer, H., Haltmeier, M., & Lenzen, F. (2009). Variational Methods in Imaging. Applied Mathematical Sciences (Vol. 167). Berlin: Springer."},{"key":"621_CR60","doi-asserted-by":"crossref","unstructured":"Sinop, A. K., & Grady, L. (2007). A seeded image segmentation framework unifying graph cuts and random walker which yields a new algorithm. In International conference on computer vision (pp. 1\u20138).","DOI":"10.1109\/ICCV.2007.4408927"},{"key":"621_CR61","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF02592050","volume":"26","author":"G Strang","year":"1983","unstructured":"Strang, G. (1983). Maximal flow through a domain. Mathematical Programming, 26, 123\u2013143.","journal-title":"Mathematical Programming"},{"key":"621_CR62","doi-asserted-by":"crossref","unstructured":"Strekalovskiy, E., & Cremers, D. (2011). Total variation for cyclic structures: Convex relaxation and efficient minimization. In Conference on computer vision and pattern recognition (pp. 1905\u20131911).","DOI":"10.1109\/CVPR.2011.5995573"},{"key":"621_CR63","doi-asserted-by":"crossref","unstructured":"Strekalovskiy, E., Goldluecke, B., & Cremers, D. (2011). Tight convex relaxations for vector-valued labeling problems. In International conference on computer vision (pp. 2328\u20132335).","DOI":"10.1109\/ICCV.2011.6126514"},{"key":"621_CR64","doi-asserted-by":"crossref","unstructured":"Trobin, W., Pock, T., Cremers, D., & Bischof, H. (2008). Continuous energy minimization by repeated binary fusion. In European conference on computer vision (Vol. 4, pp. 667\u2013690).","DOI":"10.1007\/978-3-540-88693-8_50"},{"key":"621_CR65","unstructured":"Zach, C., Gallup, D., Frahm, J. M., & Niethammer, M. (2008). Fast global labeling for real-time stereo using multiple plane sweeps. In Vision, modeling, and visualization."}],"container-title":["International Journal of Computer Vision"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11263-013-0621-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11263-013-0621-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11263-013-0621-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,8]],"date-time":"2024-05-08T17:34:06Z","timestamp":1715189646000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11263-013-0621-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4,11]]},"references-count":65,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,9]]}},"alternative-id":["621"],"URL":"https:\/\/doi.org\/10.1007\/s11263-013-0621-4","relation":{},"ISSN":["0920-5691","1573-1405"],"issn-type":[{"value":"0920-5691","type":"print"},{"value":"1573-1405","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,4,11]]}}}