Abstract
A novel scheme has been devised to represent binary images as minimized Boolean functions. The blocks corresponding to the essential prime implicants are stored as ternary numbers. The scheme has been shown to be simple and very much storage-saving. Based on this new scheme, the present paper describes the formulæ, computational techniques and algorithms of various set operations (viz. intersection, union, complement) and geometric operations (viz. area and centroid) on binary images. The computational complexities of the algorithms are also discussed.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
