Skip to Main content Skip to Navigation
Journal articles

Fast Density Codes for Image Data

Abstract : Recently, a new method for encoding data sets in the form of "Density Codes" was proposed in the literature (Courrieu, 2006). This method allows to compare sets of points belonging to every multidimensional space, and to build shape spaces invariant to a wide variety of affine and non-affine transformations. However, this general method does not take advantage of the special properties of image data, resulting in a quite slow encoding process that makes this tool practically unusable for processing large image databases with conventional computers. This paper proposes a very simple variant of the density code method that directly works on the image function, which is thousands times faster than the original Parzen window based method, without loss of its useful properties.
Document type :
Journal articles
Complete list of metadata

Cited literature [6 references]  Display  Hide  Download
Contributor : Pierre Courrieu Connect in order to contact the contributor
Submitted on : Saturday, June 21, 2008 - 1:52:56 PM
Last modification on : Tuesday, October 19, 2021 - 10:58:48 PM
Long-term archiving on: : Tuesday, September 21, 2010 - 5:22:12 PM


Files produced by the author(s)


  • HAL Id : hal-00276335, version 2
  • ARXIV : 0804.4622



Pierre Courrieu. Fast Density Codes for Image Data. Neural Information Processing - Letters and Reviews, KAIST Press, 2007, 11 (12), pp.247-255. ⟨hal-00276335v2⟩



Record views


Files downloads