Fermat theorem and elliptic color histogram features

Color histograms are widely used for content-based image retrieval. Their advantages are efficiency, and insensitivity to small changes in camera viewpoint. However, a histogram is a coarse characterization of an image, and so images with very different appearances can have similar histograms. This is particularly important for large image databases, in which many images can have similar color histograms. We will show how to find a relationship between histograms and elliptic curves, in order to define a similarity color feature based onto parametric elliptic equations. This equations are directly involved in the Fermat's Last Theorem, thus representing a solution which is interesting in terms of theory and parametric properties.

[1]  Shih-Fu Chang,et al.  Clustering methods for video browsing and annotation , 1996, Electronic Imaging.

[2]  Michael J. Swain,et al.  The capacity of color histogram indexing , 1994, 1994 Proceedings of IEEE Conference on Computer Vision and Pattern Recognition.

[3]  Mehmet Celenk,et al.  A color clustering technique for image segmentation , 1990, Comput. Vis. Graph. Image Process..

[4]  Luigi Cinque,et al.  A Multidimensional Image Browser , 1998, J. Vis. Lang. Comput..

[5]  Luigi Cinque,et al.  Retrieval of Images using Rich-region Descriptions , 2000, J. Vis. Lang. Comput..

[6]  Michael Stonebraker,et al.  Chabot: Retrieval from a Relational Database of Images , 1995, Computer.

[7]  Alex Pentland,et al.  Photobook: Content-based manipulation of image databases , 1996, International Journal of Computer Vision.

[8]  Dragutin Petkovic,et al.  Query by Image and Video Content: The QBIC System , 1995, Computer.

[9]  Toshikazu Kato,et al.  Query by Visual Example - Content based Image Retrieval , 1992, EDBT.