O(1) time algorithms for computing histogram and Hough transform on a cross-bridge reconfigurable array of processors

Journal Article · Sat Apr 01 04:00:00 EST 1995 · IEEE Transactions on Systems, Man, and Cybernetics

DOI:https://doi.org/10.1109/21.370201· OSTI ID:85530

Kao, T; Horng, S; Wang, Y ^[1]

---

1. Natl Taiwan Inst. of Technology, Taipei, Taiwan (China)

Instead of using the base-2 number system, we use a base-m number system to represent the numbers used in the proposed algorithms. Such a strategy can be used to design an O(T) time, T = (log(sub m) N) + 1, prefix sum algorithm for a binary sequence with N-bit on a cross-bridge reconfigurable array of processors using N processors, where the data bus is m-bit wide. Then, this basic operation can be used to compute the histogram of an n x n image with G gray-level value in constant time using G x n x n processors, and compute the Hough transform of an image with N edge pixels and n x n parameter space in constant time using n x n x N processors, respectively. This result is better than the previously known results proposed in the literature. Also, the execution time of the proposed algorithms is tunable by the bus bandwidth. 43 refs.

• OSTI ID: 85530
• Journal Information: IEEE Transactions on Systems, Man, and Cybernetics, Journal Name: IEEE Transactions on Systems, Man, and Cybernetics Journal Issue: 4 Vol. 25; ISSN ISYMAW; ISSN 0018-9472
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
ALGORITHMS
EFFICIENCY
IMAGE PROCESSING
NUMERICAL SOLUTION
PARALLEL PROCESSING