• français
    • English
  • English 
    • français
    • English
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.
BIRD Home

Browse

This CollectionBy Issue DateAuthorsTitlesSubjectsJournals BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesSubjectsJournals

My Account

Login

Statistics

View Usage Statistics

Quadtree representations for storage and manipulation of clusters of images

Thumbnail
View/Open
publi41.pdf (265.3Kb)
Date
2002
Dewey
Organisation des données
Sujet
Classification of approaches; Operations on image quadtrees; Similarity of quadtrees; Hierarchical and linear quadtree
Journal issue
Image and Vision Computing
Volume
20
Number
7
Publication date
2002
Article pages
513--527
Publisher
Elsevier
DOI
http://dx.doi.org/10.1016/S0262-8856(02)00027-6
URI
https://basepub.dauphine.fr/handle/123456789/2919
Collections
  • LAMSADE : Publications
Metadata
Show full item record
Author
Manouvrier, Maude
989 Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Jomier, Geneviève
989 Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Rukoz, Marta
989 Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Type
Article accepté pour publication ou publié
Abstract (EN)
This article gives an overview of different approaches proposed for the storage and manipulation of clusters of images. Clustering images consists of grouping together images having a defined relationship. In this article, images are represented by quadtrees implemented in a hierarchical or linear way. The discussion, presented at the end of the article, allows selecting a quadtree-based representation well adapted to a specific area of application or to the characteristics of the manipulated images.

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Content on this site is licensed under a Creative Commons 2.0 France (CC BY-NC-ND 2.0) license.