Browsing and placement of multiresolution images on parallel disks

Sunil Prabhakar, Divyakant Agrawal, Amr El Abbadi, Ambuj Singh, Terence Smith

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

With rapid advances in computer and communication technologies, there is an increasing demand to build and maintain large image repositories. In order to reduce the demands on I/O and network resources, multiresolution representations are being proposed for the storage organization of images. Image decomposition techniques such as wavelets can be used to provide these multiresolution images. The original image is represented by several coefficients, one of them with visual similarity to the original image, but at a lower resolution. These visually similar coefficients can be thought of as thumbnails or icons of the original image. This paper addresses the problem of storing these multiresolution coefficients on disks so that thumbnail browsing as well as image reconstruction can be performed efficiently. Several strategies are evaluated to store the image coefficients on parallel disks. These strategies can be classified into two broad classes depending on whether the access pattern of the images is used in the placement. Disk simulation is used to evaluate the performance of these strategies. Simulation results are validated with results from experiments with real disks and are found to be in good agreement. The results indicate that significant performance improvements can be achieved with as few as four disks by placing image coefficients based upon browsing access patterns.

Original languageEnglish
Title of host publicationProceedings of the Annual Workshop on I/O in Parallel and Distributed Systems, IOPADS
Place of PublicationNew York, NY, United States
PublisherACM
Pages102-113
Number of pages12
Publication statusPublished - 1 Dec 1997
Externally publishedYes
EventProceedings of the 1997 5th Workshop on I/O in Parallel and Distributed Systems - San Jose, CA, USA
Duration: 17 Nov 199717 Nov 1997

Other

OtherProceedings of the 1997 5th Workshop on I/O in Parallel and Distributed Systems
CitySan Jose, CA, USA
Period17/11/9717/11/97

Fingerprint

Image reconstruction
Decomposition
Communication
Experiments

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Prabhakar, S., Agrawal, D., El Abbadi, A., Singh, A., & Smith, T. (1997). Browsing and placement of multiresolution images on parallel disks. In Proceedings of the Annual Workshop on I/O in Parallel and Distributed Systems, IOPADS (pp. 102-113). New York, NY, United States: ACM.

Browsing and placement of multiresolution images on parallel disks. / Prabhakar, Sunil; Agrawal, Divyakant; El Abbadi, Amr; Singh, Ambuj; Smith, Terence.

Proceedings of the Annual Workshop on I/O in Parallel and Distributed Systems, IOPADS. New York, NY, United States : ACM, 1997. p. 102-113.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Prabhakar, S, Agrawal, D, El Abbadi, A, Singh, A & Smith, T 1997, Browsing and placement of multiresolution images on parallel disks. in Proceedings of the Annual Workshop on I/O in Parallel and Distributed Systems, IOPADS. ACM, New York, NY, United States, pp. 102-113, Proceedings of the 1997 5th Workshop on I/O in Parallel and Distributed Systems, San Jose, CA, USA, 17/11/97.
Prabhakar S, Agrawal D, El Abbadi A, Singh A, Smith T. Browsing and placement of multiresolution images on parallel disks. In Proceedings of the Annual Workshop on I/O in Parallel and Distributed Systems, IOPADS. New York, NY, United States: ACM. 1997. p. 102-113
Prabhakar, Sunil ; Agrawal, Divyakant ; El Abbadi, Amr ; Singh, Ambuj ; Smith, Terence. / Browsing and placement of multiresolution images on parallel disks. Proceedings of the Annual Workshop on I/O in Parallel and Distributed Systems, IOPADS. New York, NY, United States : ACM, 1997. pp. 102-113
@inproceedings{01a2959e52144bb4b908823ee989bd3d,
title = "Browsing and placement of multiresolution images on parallel disks",
abstract = "With rapid advances in computer and communication technologies, there is an increasing demand to build and maintain large image repositories. In order to reduce the demands on I/O and network resources, multiresolution representations are being proposed for the storage organization of images. Image decomposition techniques such as wavelets can be used to provide these multiresolution images. The original image is represented by several coefficients, one of them with visual similarity to the original image, but at a lower resolution. These visually similar coefficients can be thought of as thumbnails or icons of the original image. This paper addresses the problem of storing these multiresolution coefficients on disks so that thumbnail browsing as well as image reconstruction can be performed efficiently. Several strategies are evaluated to store the image coefficients on parallel disks. These strategies can be classified into two broad classes depending on whether the access pattern of the images is used in the placement. Disk simulation is used to evaluate the performance of these strategies. Simulation results are validated with results from experiments with real disks and are found to be in good agreement. The results indicate that significant performance improvements can be achieved with as few as four disks by placing image coefficients based upon browsing access patterns.",
author = "Sunil Prabhakar and Divyakant Agrawal and {El Abbadi}, Amr and Ambuj Singh and Terence Smith",
year = "1997",
month = "12",
day = "1",
language = "English",
pages = "102--113",
booktitle = "Proceedings of the Annual Workshop on I/O in Parallel and Distributed Systems, IOPADS",
publisher = "ACM",

}

TY - GEN

T1 - Browsing and placement of multiresolution images on parallel disks

AU - Prabhakar, Sunil

AU - Agrawal, Divyakant

AU - El Abbadi, Amr

AU - Singh, Ambuj

AU - Smith, Terence

PY - 1997/12/1

Y1 - 1997/12/1

N2 - With rapid advances in computer and communication technologies, there is an increasing demand to build and maintain large image repositories. In order to reduce the demands on I/O and network resources, multiresolution representations are being proposed for the storage organization of images. Image decomposition techniques such as wavelets can be used to provide these multiresolution images. The original image is represented by several coefficients, one of them with visual similarity to the original image, but at a lower resolution. These visually similar coefficients can be thought of as thumbnails or icons of the original image. This paper addresses the problem of storing these multiresolution coefficients on disks so that thumbnail browsing as well as image reconstruction can be performed efficiently. Several strategies are evaluated to store the image coefficients on parallel disks. These strategies can be classified into two broad classes depending on whether the access pattern of the images is used in the placement. Disk simulation is used to evaluate the performance of these strategies. Simulation results are validated with results from experiments with real disks and are found to be in good agreement. The results indicate that significant performance improvements can be achieved with as few as four disks by placing image coefficients based upon browsing access patterns.

AB - With rapid advances in computer and communication technologies, there is an increasing demand to build and maintain large image repositories. In order to reduce the demands on I/O and network resources, multiresolution representations are being proposed for the storage organization of images. Image decomposition techniques such as wavelets can be used to provide these multiresolution images. The original image is represented by several coefficients, one of them with visual similarity to the original image, but at a lower resolution. These visually similar coefficients can be thought of as thumbnails or icons of the original image. This paper addresses the problem of storing these multiresolution coefficients on disks so that thumbnail browsing as well as image reconstruction can be performed efficiently. Several strategies are evaluated to store the image coefficients on parallel disks. These strategies can be classified into two broad classes depending on whether the access pattern of the images is used in the placement. Disk simulation is used to evaluate the performance of these strategies. Simulation results are validated with results from experiments with real disks and are found to be in good agreement. The results indicate that significant performance improvements can be achieved with as few as four disks by placing image coefficients based upon browsing access patterns.

UR - http://www.scopus.com/inward/record.url?scp=0031339603&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0031339603&partnerID=8YFLogxK

M3 - Conference contribution

SP - 102

EP - 113

BT - Proceedings of the Annual Workshop on I/O in Parallel and Distributed Systems, IOPADS

PB - ACM

CY - New York, NY, United States

ER -