Evaluation and FPGA Implementation of Sparse Linear Solvers for Video Processing Applications

 

In this work, we address sparse linear solvers for real-time video applications.

August 1, 2013
IEEE Transactions on Circuits and Systems for Video Technology (TCSVT) 2013

 

Authors

Pierre Greisen (Disney Research)

Marian Runo (ETH Zurich)

Patrice Guillet (ETH Zurich)

Simon Heinzle (Disney Research)

Aljoscha Smolic (Disney Research)

Hubert Kaeslin (ETH Zurich)

Markus Gross (Disney Research/ETH Zurich)

Evaluation and FPGA Implementation of Sparse Linear Solvers for Video Processing Applications

Abstract

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