Disney Research


Evaluation and FPGA Implementation of Sparse Linear Solvers for Video Processing Applications-Image
Discrete-grid problems in video processing. Left: image structure with grid positions i and unknowns fi. Right: the corresponding matrix system Af = b. Constraints are represented by the black bars and black rectangles.

Sparse linear systems are commonly used in video processing applications, such as edge-aware filtering or video retargeting. Due to the 2D nature of images, the involved problem sizes are large and thus solving such systems is computationally challenging. In this work, we address sparse linear solvers for real-time video applications. We investigate several solver techniques, discuss hardware trade-offs, and provide FPGA architectures and implementation results of a Cholesky direct solver and of an iterative BiCGSTAB solver. The FPGA implementations solve 32K32K matrices at up to 50 fps and outperform software implementations by at least one order of magnitude.

Copyright Notice

The documents contained in these directories are included by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a non-commercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author’s copyright. These works may not be reposted without the explicit permission of the copyright holder.