The k-Language Classification, a Proposed New Theory for Image Classification and Clustering at Pixel Level
1 Student at Doctoral Program, Computer Science, Gadjah Mada University, Yogyakarta, Indonesia
2 Lecturer at Computer Science Departement, Gadjah Mada University, Yogyakarta, Indonesia
Published online: 28 March 2014
This theory attempted to explore the possibility of using regular language further in image analysis, departing from the use of string to represent the region in the image. But we are not trying to show an alternative idea about how to generate a string region, where there are many different ways how the image or region produces strings representing, in this paper we propose a way how to generate regular language or group of languages which performs both classify the set of strings generated by a group of a number of image regions. Researchers began by showing a proof that there is always a regular language that accepts a set of strings that produced the image, and then use the language to perform the classification. Research then expanded to the pixel level, on whether the regular language can be used for clustering pixels in the image, the researchers propose a systematic solution of this question. As a tool used to explore regular language is deterministic finite automata. On the end part before conclusion of this paper, we add revision version of this theory. There is another point of view to revision version, added for make this method more precision and more powerfull from before.
Key words: pixel / region / image / regular language / deterministic finite automata
© Owned by the authors, published by EDP Sciences, 2014
This is an Open Access article distributed under the terms of the Creative Commons Attribution License 2.0, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.