Binary Images, M −Vectors, and Ambiguity

DOI10.1007/978-3-642-21073-0_23zbMath1330.68332OpenAlexW170199794WikidataQ62046597 ScholiaQ62046597MaRDI QIDQ3003539

K. G. Subramanian, Rosni Abdullah, Atulya K. Nagar, Kalpana Mahalingam

Publication date: 27 May 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21073-0_23

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Formal languages and automata (68Q45)

Related Items (1)

TWO-DIMENSIONAL DIGITIZED PICTURE ARRAYS AND PARIKH MATRICES

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some characterizations of Parikh matrix equivalent binary words
• Subword histories and associated matrices
• Thinning on cell complexes from polygonal tilings
• Plane digitization and related combinatorial problems
• Subword histories and Parikh matrices
• Extending Parikh matrices
• Parikh matrices and amiable words
• MATRIX INDICATORS FOR SUBWORD OCCURRENCES AND AMBIGUITY
• A sharpening of the Parikh mapping
• BINARY AMIABLE WORDS
• ON PARIKH MATRICES, AMBIGUITY, AND PRINTS
• ON PARIKH MATRICES
• SUBWORD OCCURRENCES, PARIKH MATRICES AND LYNDON IMAGES
• Scattered subword complexity of non-primitive words
• DISCRETE TOMOGRAPHIC RECONSTRUCTION OF BINARY IMAGES WITH DISJOINT COMPONENTS USING SHAPE INFORMATION
• On Context-Free Languages

This page was built for publication: Binary Images, M −Vectors, and Ambiguity