Storage and management of similar images
Autor(a) principal: | |
---|---|
Data de Publicação: | 2000 |
Outros Autores: | , |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Journal of the Brazilian Computer Society |
Texto Completo: | http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0104-65002000000100003 |
Resumo: | Numerical images are becoming more and more important and an increasing emphasis on multimedia applications has resulted in large volumes of images. However, images need a large memory space to be stored, so their efficient storage and retrieval generate challenges to the database community. This paper proposes a new algorithm for an efficient storage of sets of images. It is based on a version approach used in databases. It shows how to store and operate on similar images; two images are defined as similar if the quad-trees encoding them have only few different nodes. A data structure called Generic Quad-Tree (GQT) is proposed. It optimizes the memory space required to store similar images and allows an efficient navigation among them. An Image Tree stores the ancestors and descendants of an image, like a version hierarchy. Using the Image Tree, the Generic Quad-Tree allows an image to share common parts with its ancestors and descendants. The GQT approach and some algorithms for reading, modifying or removing images from the Generic Quad-Tree are described. Examples using black and white images and gray scale images are presented. |
id |
UFRGS-28_5b77e7b8b61a2111ef4a85f15e195b53 |
---|---|
oai_identifier_str |
oai:scielo:S0104-65002000000100003 |
network_acronym_str |
UFRGS-28 |
network_name_str |
Journal of the Brazilian Computer Society |
repository_id_str |
|
spelling |
Storage and management of similar imagesGeneric Quad-Treeoperations on quad-treesimage representationimage comparisonoptimization of memory spaceimage processing applicationNumerical images are becoming more and more important and an increasing emphasis on multimedia applications has resulted in large volumes of images. However, images need a large memory space to be stored, so their efficient storage and retrieval generate challenges to the database community. This paper proposes a new algorithm for an efficient storage of sets of images. It is based on a version approach used in databases. It shows how to store and operate on similar images; two images are defined as similar if the quad-trees encoding them have only few different nodes. A data structure called Generic Quad-Tree (GQT) is proposed. It optimizes the memory space required to store similar images and allows an efficient navigation among them. An Image Tree stores the ancestors and descendants of an image, like a version hierarchy. Using the Image Tree, the Generic Quad-Tree allows an image to share common parts with its ancestors and descendants. The GQT approach and some algorithms for reading, modifying or removing images from the Generic Quad-Tree are described. Examples using black and white images and gray scale images are presented.Sociedade Brasileira de Computação2000-01-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersiontext/htmlhttp://old.scielo.br/scielo.php?script=sci_arttext&pid=S0104-65002000000100003Journal of the Brazilian Computer Society v.6 n.3 2000reponame:Journal of the Brazilian Computer Societyinstname:Sociedade Brasileira de Computação (SBC)instacron:UFRGS10.1590/S0104-65002000000100003info:eu-repo/semantics/openAccessJomier,GenevièveManouvrier,MaudeRukoz,Martaeng2000-08-01T00:00:00Zoai:scielo:S0104-65002000000100003Revistahttps://journal-bcs.springeropen.com/PUBhttps://old.scielo.br/oai/scielo-oai.phpjbcs@icmc.sc.usp.br1678-48040104-6500opendoar:2000-08-01T00:00Journal of the Brazilian Computer Society - Sociedade Brasileira de Computação (SBC)false |
dc.title.none.fl_str_mv |
Storage and management of similar images |
title |
Storage and management of similar images |
spellingShingle |
Storage and management of similar images Jomier,Geneviève Generic Quad-Tree operations on quad-trees image representation image comparison optimization of memory space image processing application |
title_short |
Storage and management of similar images |
title_full |
Storage and management of similar images |
title_fullStr |
Storage and management of similar images |
title_full_unstemmed |
Storage and management of similar images |
title_sort |
Storage and management of similar images |
author |
Jomier,Geneviève |
author_facet |
Jomier,Geneviève Manouvrier,Maude Rukoz,Marta |
author_role |
author |
author2 |
Manouvrier,Maude Rukoz,Marta |
author2_role |
author author |
dc.contributor.author.fl_str_mv |
Jomier,Geneviève Manouvrier,Maude Rukoz,Marta |
dc.subject.por.fl_str_mv |
Generic Quad-Tree operations on quad-trees image representation image comparison optimization of memory space image processing application |
topic |
Generic Quad-Tree operations on quad-trees image representation image comparison optimization of memory space image processing application |
description |
Numerical images are becoming more and more important and an increasing emphasis on multimedia applications has resulted in large volumes of images. However, images need a large memory space to be stored, so their efficient storage and retrieval generate challenges to the database community. This paper proposes a new algorithm for an efficient storage of sets of images. It is based on a version approach used in databases. It shows how to store and operate on similar images; two images are defined as similar if the quad-trees encoding them have only few different nodes. A data structure called Generic Quad-Tree (GQT) is proposed. It optimizes the memory space required to store similar images and allows an efficient navigation among them. An Image Tree stores the ancestors and descendants of an image, like a version hierarchy. Using the Image Tree, the Generic Quad-Tree allows an image to share common parts with its ancestors and descendants. The GQT approach and some algorithms for reading, modifying or removing images from the Generic Quad-Tree are described. Examples using black and white images and gray scale images are presented. |
publishDate |
2000 |
dc.date.none.fl_str_mv |
2000-01-01 |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0104-65002000000100003 |
url |
http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0104-65002000000100003 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
10.1590/S0104-65002000000100003 |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
text/html |
dc.publisher.none.fl_str_mv |
Sociedade Brasileira de Computação |
publisher.none.fl_str_mv |
Sociedade Brasileira de Computação |
dc.source.none.fl_str_mv |
Journal of the Brazilian Computer Society v.6 n.3 2000 reponame:Journal of the Brazilian Computer Society instname:Sociedade Brasileira de Computação (SBC) instacron:UFRGS |
instname_str |
Sociedade Brasileira de Computação (SBC) |
instacron_str |
UFRGS |
institution |
UFRGS |
reponame_str |
Journal of the Brazilian Computer Society |
collection |
Journal of the Brazilian Computer Society |
repository.name.fl_str_mv |
Journal of the Brazilian Computer Society - Sociedade Brasileira de Computação (SBC) |
repository.mail.fl_str_mv |
jbcs@icmc.sc.usp.br |
_version_ |
1754734669542195200 |