Histogramming on a reconfigurable mesh computer

Jing Fu Jenq; Sartaj Sahni

Histogramming on a reconfigurable mesh computer

Jing Fu Jenq, Sartaj Sahni

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

17 Scopus citations

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≤N². B is the number of gray scale values. Histogram modification is done in O(√N) time by an N×N RMESH.

Original language	English
Title of host publication	Proceedings of the International Conference on Parallel Processing
Publisher	Publ by IEEE
Pages	425-432
Number of pages	8
ISBN (Print)	0818626720
State	Published - 1 Dec 1992
Event	Proceedings of the 6th International Parallel Processing Symposium - Beverly Hills, CA, USA Duration: 23 Mar 1992 → 26 Mar 1992

Publication series

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

Other

Other	Proceedings of the 6th International Parallel Processing Symposium
City	Beverly Hills, CA, USA
Period	23/03/92 → 26/03/92

Fingerprint Dive into the research topics of 'Histogramming on a reconfigurable mesh computer'. Together they form a unique fingerprint.

Cite this

@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 = "Jenq, {Jing Fu} and Sartaj Sahni",

year = "1992",

month = dec,

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",

note = "null ; Conference date: 23-03-1992 Through 26-03-1992",

}

TY - GEN

T1 - Histogramming on a reconfigurable mesh computer

AU - Jenq, Jing Fu

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

AN - SCOPUS:0026989610

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

Y2 - 23 March 1992 through 26 March 1992

ER -