Difference between revisions of "Accelerator for Spatio-Temporal Video Filtering"
From iis-projects
(2 intermediate revisions by 2 users not shown) | |||
Line 8: | Line 8: | ||
In this project, we would like to implement the core parts of an efficient STEA filtering algorithm which has recently been developed in collaboration with [http://www.disneyresearch.com/research-labs/disney-research-zurich Disney Research Zurich]. | In this project, we would like to implement the core parts of an efficient STEA filtering algorithm which has recently been developed in collaboration with [http://www.disneyresearch.com/research-labs/disney-research-zurich Disney Research Zurich]. | ||
− | ===Status: | + | ===Status: In Progress=== |
: Scope: Semester or Master Thesis | : Scope: Semester or Master Thesis | ||
: Looking for 1-2 Interested Students | : Looking for 1-2 Interested Students | ||
Line 52: | Line 52: | ||
[[#top|↑ top]] | [[#top|↑ top]] | ||
− | [[Category:Image and Video Processing]] [[Category:Digital]] [[Category:Research]] [[Category:Master Thesis]] [[Category:Semester Thesis | + | [[Category:Image and Video Processing]] [[Category:Digital]] [[Category:Research]] [[Category:Master Thesis]] [[Category:Semester Thesis]] [[Category:Hot]] [[Category:Completed]] [[Category:ASIC]][[Category:FPGA]] [[Category:FPGA]] [[Category:2016]] |
Latest revision as of 12:40, 1 June 2017
Contents
Short Description
There are many image and video processing algorithms (e.g. calculation of Optical-Flow, or Image Domain Warps) that are usually solved using large optimization problems. The solution of such large optimization problems in real-time is difficult and sometimes even unfeasible. However, the mathematical structure of some of these problems allows us to approximate their solution by using non-linear filtering in the spatial and temporal domain. These filters scale better in terms of computational complexity than the corresponding optimization problems, and therefore would allow to perform certain video processing steps more efficiently.
In this project, we would like to implement the core parts of an efficient STEA filtering algorithm which has recently been developed in collaboration with Disney Research Zurich.
Status: In Progress
- Scope: Semester or Master Thesis
- Looking for 1-2 Interested Students
- Supervisors: Michael Schaffner, Lukas Cavigelli
Prerequisites
- VLSI I
- Introductory course in computer vision (optional)
- Interest in computer graphics / computer vision
- Matlab, VHDL and C++
Character
- 10% Theory & Literature Study
- 20% Evaluations
- 70% Hw Architecture & ASIC Implementation