Selective Change-Driven Image Processing: A Speeding-Up Strategy

Authors:
Jose A. Boluda;Francisco Vegara;Fernando Pardo;Pedro Zuccarello
Affiliations:
Departament d'Informàtica, Universitat de València, Burjassot, Spain 46100;Institut de Robòtica, Universitat de València, València, Spain 46890;Departament d'Informàtica, Universitat de València, Burjassot, Spain 46100;Departament d'Informàtica, Universitat de València, Burjassot, Spain 46100
Venue:
CIARP '09 Proceedings of the 14th Iberoamerican Conference on Pattern Recognition: Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications
Year:
2009

Citing 6
Cited 0

Processor Architecture: From Dataflow to Superscalar and Beyond

Processor Architecture: From Dataflow to Superscalar and Beyond
A new motion detection algorithm based on Σ-Δ background estimation

Pattern Recognition Letters
On the Advantages of Asynchronous Pixel Reading and Processing for High-Speed Motion Estimation

ISVC '08 Proceedings of the 4th International Symposium on Advances in Visual Computing
Accurate optical flow computation under non-uniform brightness variations

Computer Vision and Image Understanding
Speeding-up differential motion detection algorithms using a change-driven data flow processing strategy

CAIP'07 Proceedings of the 12th international conference on Computer analysis of images and patterns
FPGA-based real-time optical-flow system

IEEE Transactions on Circuits and Systems for Video Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

Biologically inspired schemes are a source for the improvement of visual systems. Real-time implementation of image processing algorithms is constrained by the large amount of data to be processed. Full image processing is many times unnecessary since there are many pixels that suffer a small change or not suffer any change at all. A strategy based on delivering and processing pixels, instead of processing the complete frame, is presented. The pixels that have suffered higher changes in each frame, ordered by the absolute value of its change, are read-out and processed. Two examples are shown: a morphological motion detection algorithm and the Horn and Schunck optical flow algorithm. Results show that the implementation of this strategy achieves execution time speed-up while keeping results comparable to original approaches.