Graph colouring based image similarity

Region based segmentation approaches have been applied to several different problems in computer vision, like image classification, image registration, image retrieval, objects recognition, video indexing etc. The attraction of this algorithm is independent of the user defined seed point. The generality of region based segmentation of real-world problems in the light of regions has made it popular for large range of images. However in the prior methods, the computational effort increases as the complexity of the problem increases. This paper is based on an efficient graph theoretical approach. A maximal planar graph is constructed from the region segmented image. Primary advantage of this approach is one can naively analyze the resulting graph and determine the number and position of a particular object in the region of interest. The images are matched (with N points) in O(N2 log N) and segment a given image of N pixels in O(N log N).