An efficient implementation method of fractal image compression on dynamically reconfigurable architecture

Hidehisa Nagano, Akihiro Matsuura, Akira Nagoya

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

2 Citations (Scopus)

Abstract

This paper proposes a method for implementing fractal image compression on dynamically reconfigurable architecture. In the encoding of this compression, metric computations among image blocks are the most time consuming. In our method, processing elements (PEs) configured for each image block perform these computations in a pipeline manner. By configuring PEs, we can reduce the number of adders, which are the main computing elements, by half even in the worst case. This reduction increases the number of PEs that work in parallel. In addition, dynamic reconfigurability of hardware is employed to omit useless metric computations. Experimental results show that the resources for implementing the PEs are reduced to 60 to 70% and the omission of useless metric computations reduces the encoding time to 10 to 55%.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages670-678
Number of pages9
Volume1586
ISBN (Print)3540658319, 9783540658313
DOIs
Publication statusPublished - 1999
Externally publishedYes
Event13th International Parallel Processing Symposium, IPPS 1999 Held in Conjunction with the 10th Symposium on Parallel and Distributed Processing, SPDP 1999 - San Juan, United States
Duration: Apr 12 1999Apr 16 1999

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1586
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other13th International Parallel Processing Symposium, IPPS 1999 Held in Conjunction with the 10th Symposium on Parallel and Distributed Processing, SPDP 1999
CountryUnited States
CitySan Juan
Period4/12/994/16/99

Fingerprint

Fractal Image Compression
Reconfigurable architectures
Reconfigurable Architectures
Image compression
Efficient Implementation
Fractals
Processing
Metric
Encoding
Reconfigurability
Adders
Compression
Pipelines
Hardware
Resources
Computing
Experimental Results

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Nagano, H., Matsuura, A., & Nagoya, A. (1999). An efficient implementation method of fractal image compression on dynamically reconfigurable architecture. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1586, pp. 670-678). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1586). Springer Verlag. https://doi.org/10.1007/BFb0097952

An efficient implementation method of fractal image compression on dynamically reconfigurable architecture. / Nagano, Hidehisa; Matsuura, Akihiro; Nagoya, Akira.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1586 Springer Verlag, 1999. p. 670-678 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1586).

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

Nagano, H, Matsuura, A & Nagoya, A 1999, An efficient implementation method of fractal image compression on dynamically reconfigurable architecture. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 1586, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1586, Springer Verlag, pp. 670-678, 13th International Parallel Processing Symposium, IPPS 1999 Held in Conjunction with the 10th Symposium on Parallel and Distributed Processing, SPDP 1999, San Juan, United States, 4/12/99. https://doi.org/10.1007/BFb0097952
Nagano H, Matsuura A, Nagoya A. An efficient implementation method of fractal image compression on dynamically reconfigurable architecture. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1586. Springer Verlag. 1999. p. 670-678. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/BFb0097952
Nagano, Hidehisa ; Matsuura, Akihiro ; Nagoya, Akira. / An efficient implementation method of fractal image compression on dynamically reconfigurable architecture. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1586 Springer Verlag, 1999. pp. 670-678 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{6768e80d8ad24d518cf330697519db11,
title = "An efficient implementation method of fractal image compression on dynamically reconfigurable architecture",
abstract = "This paper proposes a method for implementing fractal image compression on dynamically reconfigurable architecture. In the encoding of this compression, metric computations among image blocks are the most time consuming. In our method, processing elements (PEs) configured for each image block perform these computations in a pipeline manner. By configuring PEs, we can reduce the number of adders, which are the main computing elements, by half even in the worst case. This reduction increases the number of PEs that work in parallel. In addition, dynamic reconfigurability of hardware is employed to omit useless metric computations. Experimental results show that the resources for implementing the PEs are reduced to 60 to 70{\%} and the omission of useless metric computations reduces the encoding time to 10 to 55{\%}.",
author = "Hidehisa Nagano and Akihiro Matsuura and Akira Nagoya",
year = "1999",
doi = "10.1007/BFb0097952",
language = "English",
isbn = "3540658319",
volume = "1586",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "670--678",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - An efficient implementation method of fractal image compression on dynamically reconfigurable architecture

AU - Nagano, Hidehisa

AU - Matsuura, Akihiro

AU - Nagoya, Akira

PY - 1999

Y1 - 1999

N2 - This paper proposes a method for implementing fractal image compression on dynamically reconfigurable architecture. In the encoding of this compression, metric computations among image blocks are the most time consuming. In our method, processing elements (PEs) configured for each image block perform these computations in a pipeline manner. By configuring PEs, we can reduce the number of adders, which are the main computing elements, by half even in the worst case. This reduction increases the number of PEs that work in parallel. In addition, dynamic reconfigurability of hardware is employed to omit useless metric computations. Experimental results show that the resources for implementing the PEs are reduced to 60 to 70% and the omission of useless metric computations reduces the encoding time to 10 to 55%.

AB - This paper proposes a method for implementing fractal image compression on dynamically reconfigurable architecture. In the encoding of this compression, metric computations among image blocks are the most time consuming. In our method, processing elements (PEs) configured for each image block perform these computations in a pipeline manner. By configuring PEs, we can reduce the number of adders, which are the main computing elements, by half even in the worst case. This reduction increases the number of PEs that work in parallel. In addition, dynamic reconfigurability of hardware is employed to omit useless metric computations. Experimental results show that the resources for implementing the PEs are reduced to 60 to 70% and the omission of useless metric computations reduces the encoding time to 10 to 55%.

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

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

U2 - 10.1007/BFb0097952

DO - 10.1007/BFb0097952

M3 - Conference contribution

SN - 3540658319

SN - 9783540658313

VL - 1586

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 670

EP - 678

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

PB - Springer Verlag

ER -