Is the Coordinated Clusters Representation an analog of the Local Binary Pattern?

both the local binary pattern (lbp) and the coordinated clusters representation (ccr) are two methods used successfully in the classification and segmentation of images. they look very similar at first sight. in this work we analyze the principles of the two methods and show that the methods are not reducible to each other. topologically they are as different as a sphere and a torus. in extracting of image features, the lbp uses a specific technique of binarization of images with the local threshold, defined by the central pixel of a local binary pattern of an image. then, the central pixel is excluded of each local binary pattern. as a consequence, the mathematical basis of the lbp method is more limited than that of the ccr. in particular, the scanning window of the lbp has always an odd dimensions, while the ccr has no this restriction. the ccr uses a binarization as a preprocessing of images, so that a global or a local threshold can be used for that purpose. we show that a classification based on the ccr of images is potentially more versatile, even though the high performance of both methods was demonstrated in various applications.