New hardware memory management architecture for fast neighborhood access based on graph analysis

摘要

A large number of image processing algorithms are based on neighborhood operations, meaning that several pixels must be accessed for one pixel value computation. This memory overhead is the bottleneck of many image processing systems. Some well known pipeline structures help to reduce his overhead When predictable scanning schemes are used. Unfortunately, it Truns out that they cannot cope with unpredictable image scanning Which has proved to be very efficient in the implementation of cer- Tain operators.