By Topic

An ω-automata approach to the representation of bilevel images

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Yih-Kai Lin ; Dept. of Electr. Eng., Nat. Taiwan Univ., Taipei, Taiwan ; Hsu-Chun Yen

We use ω-automata (i.e., automata over infinite words) as a device for representing bilevel images. A major advantage of our approach, as opposed to using the conventional finite automata, lies in that ω-automata are capable of representing image objects of zero size, such as lines and points. To demonstrate the feasibility of our approach, we also show how a number of image processing operations, including shift, flip, rotation, complement, boundary, difference, union, intersection, and size, can be effectively carried out in the framework of ω-automata. In particular, the size of an image represented by an ω-automaton is measured based on the theory of Markov chains. In comparison with other automata-based image representation schemes reported in the literature, our approach is capable of supporting a richer set of operations, which can be performed on the automata directly and easily.

Published in:

IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics)  (Volume:33 ,  Issue: 3 )