Histogramming on a reconfigurable mesh computer

John Jenq, Sartaj Sahni

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

17 Citations (Scopus)

Abstract

We develop reconfigurable mesh (RMESH) algorithms for window broadcasting, data shifts, and consecutive sum. These are then used to develop efficient algorithms to compute the histogram of an image and to perform histogram modification. The histogram of an N×N image is computed by an N×N RMESH in O(√B log√B(N/√B) for B<N, O(√N) for B = N, and O(√B) for N<B≤N2. B is the number of gray scale values. Histogram modification is done in O(√N) time by an N×N RMESH.

Original languageEnglish
Title of host publicationProceedings of the International Conference on Parallel Processing
PublisherPubl by IEEE
Pages425-432
Number of pages8
ISBN (Print)0818626720
StatePublished - 1 Dec 1992
EventProceedings of the 6th International Parallel Processing Symposium - Beverly Hills, CA, USA
Duration: 23 Mar 199226 Mar 1992

Publication series

NameProceedings of the International Conference on Parallel Processing
ISSN (Print)0190-3918

Other

OtherProceedings of the 6th International Parallel Processing Symposium
CityBeverly Hills, CA, USA
Period23/03/9226/03/92

Fingerprint

Reconfigurable Mesh
Histogram
Broadcasting
Data Broadcasting
Consecutive
Efficient Algorithms

Cite this

Jenq, J., & Sahni, S. (1992). Histogramming on a reconfigurable mesh computer. In Proceedings of the International Conference on Parallel Processing (pp. 425-432). (Proceedings of the International Conference on Parallel Processing). Publ by IEEE.
Jenq, John ; Sahni, Sartaj. / Histogramming on a reconfigurable mesh computer. Proceedings of the International Conference on Parallel Processing. Publ by IEEE, 1992. pp. 425-432 (Proceedings of the International Conference on Parallel Processing).
@inproceedings{9c0893b44242472281f63fb43f7c283d,
title = "Histogramming on a reconfigurable mesh computer",
abstract = "We develop reconfigurable mesh (RMESH) algorithms for window broadcasting, data shifts, and consecutive sum. These are then used to develop efficient algorithms to compute the histogram of an image and to perform histogram modification. The histogram of an N×N image is computed by an N×N RMESH in O(√B log√B(N/√B) for B<N, O(√N) for B = N, and O(√B) for N<B≤N2. B is the number of gray scale values. Histogram modification is done in O(√N) time by an N×N RMESH.",
author = "John Jenq and Sartaj Sahni",
year = "1992",
month = "12",
day = "1",
language = "English",
isbn = "0818626720",
series = "Proceedings of the International Conference on Parallel Processing",
publisher = "Publ by IEEE",
pages = "425--432",
booktitle = "Proceedings of the International Conference on Parallel Processing",

}

Jenq, J & Sahni, S 1992, Histogramming on a reconfigurable mesh computer. in Proceedings of the International Conference on Parallel Processing. Proceedings of the International Conference on Parallel Processing, Publ by IEEE, pp. 425-432, Proceedings of the 6th International Parallel Processing Symposium, Beverly Hills, CA, USA, 23/03/92.

Histogramming on a reconfigurable mesh computer. / Jenq, John; Sahni, Sartaj.

Proceedings of the International Conference on Parallel Processing. Publ by IEEE, 1992. p. 425-432 (Proceedings of the International Conference on Parallel Processing).

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

TY - GEN

T1 - Histogramming on a reconfigurable mesh computer

AU - Jenq, John

AU - Sahni, Sartaj

PY - 1992/12/1

Y1 - 1992/12/1

N2 - We develop reconfigurable mesh (RMESH) algorithms for window broadcasting, data shifts, and consecutive sum. These are then used to develop efficient algorithms to compute the histogram of an image and to perform histogram modification. The histogram of an N×N image is computed by an N×N RMESH in O(√B log√B(N/√B) for B<N, O(√N) for B = N, and O(√B) for N<B≤N2. B is the number of gray scale values. Histogram modification is done in O(√N) time by an N×N RMESH.

AB - We develop reconfigurable mesh (RMESH) algorithms for window broadcasting, data shifts, and consecutive sum. These are then used to develop efficient algorithms to compute the histogram of an image and to perform histogram modification. The histogram of an N×N image is computed by an N×N RMESH in O(√B log√B(N/√B) for B<N, O(√N) for B = N, and O(√B) for N<B≤N2. B is the number of gray scale values. Histogram modification is done in O(√N) time by an N×N RMESH.

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

M3 - Conference contribution

SN - 0818626720

T3 - Proceedings of the International Conference on Parallel Processing

SP - 425

EP - 432

BT - Proceedings of the International Conference on Parallel Processing

PB - Publ by IEEE

ER -

Jenq J, Sahni S. Histogramming on a reconfigurable mesh computer. In Proceedings of the International Conference on Parallel Processing. Publ by IEEE. 1992. p. 425-432. (Proceedings of the International Conference on Parallel Processing).