Abstract
Mateescu et al (2001) introduced the notion of Parikh matrix of a word as an extension of the well-known concept of Parikh vector of a word. The Parikh matrix provides more numerical information about a word than given by the Parikh vector. Here we introduce the notion of M −vector of a binary word which allows us to have a linear notation in the form of a unique vector representation of the Parikh matrix of the binary word. We then extend this notion of M −vector to a binary image treating it as a binary array over a two-symbol alphabet. This is done by considering the M −vectors of the words in the rows and columns of the array. Among the properties associated with a Parikh matrix, M −ambiguity or simply ambiguity of a word is one which has been investigated extensively in the literature. Here M −ambiguity of a binary array is defined in terms of its M −vector and we obtain conditions for M −ambiguity of a binary array.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Atanasiu, A.: Binary amiable words. Intern. J. Found. Comput. Sci. 18, 387–400 (2007)
Atanasiu, A., Martin-Vide, A.C., Mateescu, A.: On the injectivity of the Parikh matrix mapping. Fund. Inform. 46, 1–11 (2001)
Atanasiu, A., Atanasiu, R., Petre, I.: Parikh matrices and amiable words. Theor. Comput. Sci. 390, 102–109 (2008)
Balázs, P.: Discrete tomographic reconstruction of binary images with disjoint components using shape information. Int. J. Shape Modeling 14(2), 189–207 (2008)
Brimkov, V.E., Barneva, R.P.: Plane digitization and related combinatorial problems. Discrete Appl. Math. 147, 169–186 (2005)
Brimkov, V.E., Barneva, R.P.: Combinatorial approach to image analysis. Discrete Appl. Math. 157(16), 3359–3361 (2009)
Fazekas, S.Z., Nagy, B.: Scattered subword complexity of non-primitive words. J. Automata, Languages and Combinatorics 13, 233–247 (2008)
Fosse, S., Richomme, G.: Some characterizations of Parikh matrix equivalent binary words. Inf. Process. Letters 92, 77–82 (2004)
Gara, M., Tasi, T.S., Balázs, P.: Learning connectedness and convexity of binary images from their projections. Pure Math. Appl. 20, 27–48 (2009)
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. 5359, pp. 1137–1146. Springer, Heidelberg (2008)
Mateescu, A., Salomaa, A.: Matrix indicators for subword occurrences and ambiguity. Int. J. Found. Comput. Sci. 15, 277–292 (2004)
Mateescu, A., Salomaa, A., Yu, S.: Subword histories and Parikh matrices. J. Comp. System Sci. 68, 1–21 (2004)
Mateescu, A., Salomaa, A., Salomaa, K., Yu, S.: A Sharpening of the Parikh Mapping. Theoret. Informatics Appl. 35, 551–564 (2001)
Parikh, R.J.: On context-free languages. J. Assoc. Comput. Mach. 13, 570–581 (1966)
Salomaa, A.: Formal Languages. Academic Press, New York (1973)
Salomaa, A.: Subword histories and associated matrices. Theor. Comput. Sci. 407, 233–247 (2008)
Salomaa, A.: On the injectivity of Parikh matrix mappings. Fundam. Inf. 64, 391–404 (2005)
Salomaa, A., Yu, S.: Subword occurrences, Parikh matrices and Lyndon images. Int. J. Found. Comput. sci. 21, 91–111 (2010)
Serbanuta, T.F.: Extending Parikh matrices. Theor. Comput. Sci. 310, 233–246 (2004)
Serbanuta, V.N., Serbanuta, T.F.: Injectivity of the Parikh matrix mappings revisited. Fundam. Inf. 73, 265–283 (2006)
Serbanuta, V.N.: On Parikh Matrices, Ambiguity, and Prints, Intern. J. Found. Comput. Sci. 20, 151–165 (2009)
Subramanian, K.G., Miin Huey, A., Nagar, A.K.: On Parikh Matrices. Int. J. Found. Comput. Sci. 20(2), 211–219 (2009)
Subramanian, K.G., Isawasan, P., Abdullah, R.: Construction of a Binary Image with some prescribed Numerical Information (submitted for publication)
Wiederhold, P., Morales, S.: Thinning on cell complexes from polygonal tilings. Discrete Appl. Math. 157(16), 3424–3434 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Subramanian, K.G., Mahalingam, K., Abdullah, R., Nagar, A.K. (2011). Binary Images, M −Vectors, and Ambiguity. In: Aggarwal, J.K., Barneva, R.P., Brimkov, V.E., Koroutchev, K.N., Korutcheva, E.R. (eds) Combinatorial Image Analysis. IWCIA 2011. Lecture Notes in Computer Science, vol 6636. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21073-0_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-21073-0_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21072-3
Online ISBN: 978-3-642-21073-0
eBook Packages: Computer ScienceComputer Science (R0)