Fast Density Codes for Image Data
| dc.creator | Courrieu, Pierre | |
| dc.date | 2008-04-29 | |
| dc.date | 2008-06-25 | |
| dc.date.accessioned | 2026-07-07T09:46:19Z | |
| dc.date.available | 2026-07-07T09:46:19Z | |
| dc.description | 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. | |
| dc.description | nombre de pages: 9 | |
| dc.identifier | https://arxiv.org/abs/0804.4622 | |
| dc.identifier | http://arxiv.org/abs/0804.4622 | |
| dc.identifier | Neural Information Processing - Letters and Reviews 11, 12 (2007) 247-255 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/163489 | |
| dc.subject | Neural and Evolutionary Computing | |
| dc.title | Fast Density Codes for Image Data | |
| dc.type | text |