Fey D, Loos A (2008)
Publication Type: Conference contribution
Publication year: 2008
Edited Volumes: Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems
Pages Range: 182-187
Conference Proceedings Title: Intern. Conf. on Parallel and Distributed Computing and Systems
Event location: Orlando, Florida, USA
The paper presents a novel distributed and parallel algorithm for the fast detection of objects' centroids which is well-suited for an implementation in a vision chip. The algorithm is based on the Organic Computing concept of Marching Pixels (MPs). MPs present a kind of virtual hardware agents which are crawling in a pixel field to fulfill specific tasks. The MP algorithm is based on the iterative processing of moments that can be mapped very well to the distributed and parallel approach of MPs. Compared to previous MP algorithms we developed before, the presented algorithm works in a stronger emergent way leading to a higher processing performance. In the paper we present in detail the mathematical background of the distributed algorithm. The algorithm was mapped on a fine-grain parallel architecture which was synthesized for an FPGA and an ASIC. The ASIC synthesis proofs the potential of the approach for future smart mega pixel CMOS camera chips allowing processing rates up to one thousand frames per second.
APA:
Fey, D., & Loos, A. (2008). A new marching pixels algorithm for application-specific vision chips for fast detection of objects' centroids. In Intern. Conf. on Parallel and Distributed Computing and Systems (pp. 182-187). Orlando, Florida, USA.
MLA:
Fey, Dietmar, and Andreas Loos. "A new marching pixels algorithm for application-specific vision chips for fast detection of objects' centroids." Proceedings of the (PDCS 2008), Orlando, Florida, USA 2008. 182-187.
BibTeX: Download