摘要：In the scheme for representing binary images (Sarkar 1996), an image is considered as a map of a Boolean function which is minimized to obtain the prime implicants to represent the image. Such a scheme was shown to achieve a drastic saving of storage compared to Linear Quadtrees and Interpolation-based Binary Trees. In this paper we present the procedures for mirroring an image with respect to any coordinate axis, labelling its connected components and finding its topological properties. The computational complexities of the algorithms are also discussed.
关键词：Connected components labelling; Mirroring; Euler number; Minimized Boolean function
