### 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^{2}. 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

### Cite this

*Proceedings of the International Conference on Parallel Processing*(pp. 425-432). (Proceedings of the International Conference on Parallel Processing). Publ by IEEE.

}

*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.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-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 -