{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:43:16Z","timestamp":1725583396161},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642210723"},{"type":"electronic","value":"9783642210730"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21073-0_23","type":"book-chapter","created":{"date-parts":[[2011,5,14]],"date-time":"2011-05-14T02:52:18Z","timestamp":1305341538000},"page":"248-260","source":"Crossref","is-referenced-by-count":2,"title":["Binary Images, M\u2009\u2212Vectors, and Ambiguity"],"prefix":"10.1007","author":[{"given":"K. G.","family":"Subramanian","sequence":"first","affiliation":[]},{"given":"Kalpana","family":"Mahalingam","sequence":"additional","affiliation":[]},{"given":"Rosni","family":"Abdullah","sequence":"additional","affiliation":[]},{"given":"Atulya K.","family":"Nagar","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1142\/S0129054107004735","volume":"18","author":"A. Atanasiu","year":"2007","unstructured":"Atanasiu, A.: Binary amiable words. Intern. J. Found. Comput. Sci.\u00a018, 387\u2013400 (2007)","journal-title":"Intern. J. Found. Comput. Sci."},{"key":"23_CR2","first-page":"1","volume":"46","author":"A. Atanasiu","year":"2001","unstructured":"Atanasiu, A., Martin-Vide, A.C., Mateescu, A.: On the injectivity of the Parikh matrix mapping. Fund. Inform.\u00a046, 1\u201311 (2001)","journal-title":"Fund. Inform."},{"key":"23_CR3","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/j.tcs.2007.10.022","volume":"390","author":"A. Atanasiu","year":"2008","unstructured":"Atanasiu, A., Atanasiu, R., Petre, I.: Parikh matrices and amiable words. Theor. Comput. Sci.\u00a0390, 102\u2013109 (2008)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"23_CR4","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1142\/S0218654308001142","volume":"14","author":"P. Bal\u00e1zs","year":"2008","unstructured":"Bal\u00e1zs, P.: Discrete tomographic reconstruction of binary images with disjoint components using shape information. Int. J. Shape Modeling\u00a014(2), 189\u2013207 (2008)","journal-title":"Int. J. Shape Modeling"},{"key":"23_CR5","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.dam.2004.09.010","volume":"147","author":"V.E. Brimkov","year":"2005","unstructured":"Brimkov, V.E., Barneva, R.P.: Plane digitization and related combinatorial problems. Discrete Appl. Math.\u00a0147, 169\u2013186 (2005)","journal-title":"Discrete Appl. Math."},{"issue":"16","key":"23_CR6","doi-asserted-by":"publisher","first-page":"3359","DOI":"10.1016\/j.dam.2009.06.030","volume":"157","author":"V.E. Brimkov","year":"2009","unstructured":"Brimkov, V.E., Barneva, R.P.: Combinatorial approach to image analysis. Discrete Appl. Math.\u00a0157(16), 3359\u20133361 (2009)","journal-title":"Discrete Appl. Math."},{"key":"23_CR7","first-page":"233","volume":"13","author":"S.Z. Fazekas","year":"2008","unstructured":"Fazekas, S.Z., Nagy, B.: Scattered subword complexity of non-primitive words. J. Automata, Languages and Combinatorics\u00a013, 233\u2013247 (2008)","journal-title":"J. Automata, Languages and Combinatorics"},{"key":"23_CR8","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.ipl.2004.06.011","volume":"92","author":"S. Fosse","year":"2004","unstructured":"Fosse, S., Richomme, G.: Some characterizations of Parikh matrix equivalent binary words. Inf. Process. Letters\u00a092, 77\u201382 (2004)","journal-title":"Inf. Process. Letters"},{"key":"23_CR9","first-page":"27","volume":"20","author":"M. Gara","year":"2009","unstructured":"Gara, M., Tasi, T.S., Bal\u00e1zs, P.: Learning connectedness and convexity of binary images from their projections. Pure Math. Appl.\u00a020, 27\u201348 (2009)","journal-title":"Pure Math. Appl."},{"key":"23_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1137","DOI":"10.1007\/978-3-540-89646-3_113","volume-title":"Advances in Visual Computing","author":"V. Masilamani","year":"2008","unstructured":"Masilamani, V., Krithivasan, K., Subramanian, K.G., Miin Huey, A.: Efficient Algorithms for Reconstruction of 2D-Arrays from Extended Parikh Images. In: Bebis, G., Boyle, R., Parvin, B., Koracin, D., Remagnino, P., Porikli, F., Peters, J., Klosowski, J., Arns, L., Chun, Y.K., Rhyne, T.-M., Monroe, L. (eds.) ISVC 2008, Part II. LNCS, vol.\u00a05359, pp. 1137\u20131146. Springer, Heidelberg (2008)"},{"key":"23_CR11","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1142\/S0129054104002418","volume":"15","author":"A. Mateescu","year":"2004","unstructured":"Mateescu, A., Salomaa, A.: Matrix indicators for subword occurrences and ambiguity. Int. J. Found. Comput. Sci.\u00a015, 277\u2013292 (2004)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"23_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jcss.2003.04.001","volume":"68","author":"A. Mateescu","year":"2004","unstructured":"Mateescu, A., Salomaa, A., Yu, S.: Subword histories and Parikh matrices. J. Comp. System Sci.\u00a068, 1\u201321 (2004)","journal-title":"J. Comp. System Sci."},{"key":"23_CR13","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1051\/ita:2001131","volume":"35","author":"A. Mateescu","year":"2001","unstructured":"Mateescu, A., Salomaa, A., Salomaa, K., Yu, S.: A Sharpening of the Parikh Mapping. Theoret. Informatics Appl.\u00a035, 551\u2013564 (2001)","journal-title":"Theoret. Informatics Appl."},{"key":"23_CR14","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1145\/321356.321364","volume":"13","author":"R.J. Parikh","year":"1966","unstructured":"Parikh, R.J.: On context-free languages. J. Assoc. Comput. Mach.\u00a013, 570\u2013581 (1966)","journal-title":"J. Assoc. Comput. Mach."},{"key":"23_CR15","volume-title":"Formal Languages","author":"A. Salomaa","year":"1973","unstructured":"Salomaa, A.: Formal Languages. Academic Press, New York (1973)"},{"key":"23_CR16","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/j.tcs.2008.05.023","volume":"407","author":"A. Salomaa","year":"2008","unstructured":"Salomaa, A.: Subword histories and associated matrices. Theor. Comput. Sci.\u00a0407, 233\u2013247 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"23_CR17","first-page":"391","volume":"64","author":"A. Salomaa","year":"2005","unstructured":"Salomaa, A.: On the injectivity of Parikh matrix mappings. Fundam. Inf.\u00a064, 391\u2013404 (2005)","journal-title":"Fundam. Inf."},{"key":"23_CR18","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1142\/S0129054110007155","volume":"21","author":"A. Salomaa","year":"2010","unstructured":"Salomaa, A., Yu, S.: Subword occurrences, Parikh matrices and Lyndon images. Int. J. Found. Comput. sci.\u00a021, 91\u2013111 (2010)","journal-title":"Int. J. Found. Comput. sci."},{"key":"23_CR19","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/S0304-3975(03)00396-7","volume":"310","author":"T.F. Serbanuta","year":"2004","unstructured":"Serbanuta, T.F.: Extending Parikh matrices. Theor. Comput. Sci.\u00a0310, 233\u2013246 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"23_CR20","first-page":"265","volume":"73","author":"V.N. Serbanuta","year":"2006","unstructured":"Serbanuta, V.N., Serbanuta, T.F.: Injectivity of the Parikh matrix mappings revisited. Fundam. Inf.\u00a073, 265\u2013283 (2006)","journal-title":"Fundam. Inf."},{"key":"23_CR21","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1142\/S0129054109006498","volume":"20","author":"V.N. Serbanuta","year":"2009","unstructured":"Serbanuta, V.N.: On Parikh Matrices, Ambiguity, and Prints, Intern. J. Found. Comput. Sci.\u00a020, 151\u2013165 (2009)","journal-title":"J. Found. Comput. Sci."},{"issue":"2","key":"23_CR22","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1142\/S0129054109006528","volume":"20","author":"K.G. Subramanian","year":"2009","unstructured":"Subramanian, K.G., Miin Huey, A., Nagar, A.K.: On Parikh Matrices. Int. J. Found. Comput. Sci.\u00a020(2), 211\u2013219 (2009)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"23_CR23","unstructured":"Subramanian, K.G., Isawasan, P., Abdullah, R.: Construction of a Binary Image with some prescribed Numerical Information (submitted for publication)"},{"issue":"16","key":"23_CR24","doi-asserted-by":"publisher","first-page":"3424","DOI":"10.1016\/j.dam.2009.04.016","volume":"157","author":"P. Wiederhold","year":"2009","unstructured":"Wiederhold, P., Morales, S.: Thinning on cell complexes from polygonal tilings. Discrete Appl. Math.\u00a0157(16), 3424\u20133434 (2009)","journal-title":"Discrete Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Image Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21073-0_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,10,10]],"date-time":"2018-10-10T04:48:57Z","timestamp":1539146937000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21073-0_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642210723","9783642210730"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21073-0_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}