This site uses cookies to deliver our services and to ensure you get the best experience. By continuing to use this site, you consent to our use of cookies and acknowledge that you have read and understand our Privacy Policy, Cookie Policy, and Terms
A fast block matching algorithm in the feature domain was proposed by Fok and Au which achieves a computation reduction factor of N/2 with search block size of N
: This work tries to reuse programmable communication resources like a Network-on-Chip (NoC) in the acceleration of image applications. We show a mathematical model for the computa...
In this paper we propose a set of algorithms that combine the anisotropic smoothing using the heat kernel with the outlier rejection capability of robust statistics. The proposed ...