Geometric consistency is, usually, considered as a postprocessing step to filter matched sets of local features in order to discard outliers. In this work, it is used to propose an adaptive feature that describes the geometric dispersion of keypoints. It is based on a distribution computed by a nonparametric estimator so that no assumption is made about the data. We investigated and discussed the invariance properties of our descriptor under the most common two- and three-dimensional transformations. Then, we applied it to flower recognition. The classification is performed using the precomputed kernel of support vector machines classifier. Indeed, a similarity computing framework that uses the Kullback–Leibler divergence is presented. Furthermore, a customized layout for each flower image is designed to describe and compare separately the boundary and the central area of flowers. Experimentations made on the Oxford flower-17 dataset prove the efficiency of our method in terms of classification accuracy and computational complexity. The limits of our descriptor are also discussed on a 10-class subset of the Oxford flower-102 dataset.