Translator Disclaimer
26 March 1999 Fast binary and gray-scale mathematical morphology on VLIW media processors
Author Affiliations +
Proceedings Volume 3645, Real-Time Imaging IV; (1999)
Event: Electronic Imaging '99, 1999, San Jose, CA, United States
Mathematical morphology has proven to be useful for solving a variety of image processing problems and plays a key role in certain time-critical machine vision applications. The large computation requirement for morphology poses a challenge for microprocessors to support in real time, and often hardwired solutions such as ASICs and EPLDs have been necessary. This paper present a method to implement binary and gray-scale morphology algorithm sufficiently on programmable VLIW mediaprocessors. Efficiency is gained by (1) mapping the algorithms to the mediaprocessor's parallel processing units, (2) avoiding redundant computations by converting the structuring element into a unique lookup table, and (3) minimizing the I/O overhead by using an on- chip programmable DMA controller. Using our approach, 'C' implementation of gray-scale dilation takes 7.0 ms and binary dilation takes 1.2 ms on a 200 MHz MAP1000 mediaprocessor, and more than 35 times faster than that reported for general-purpose microprocessors. With comparable performance to ASIC implementations and the flexibility of a programmable processor, this real-time image computing with mediaprocessors will be more widely used in machine vision and other imaging applications in the future.
© (1999) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
George York, Ravi Managuli, and Yongmin Kim "Fast binary and gray-scale mathematical morphology on VLIW media processors", Proc. SPIE 3645, Real-Time Imaging IV, (26 March 1999);

Back to Top