SEMINAIRE DU 2 JUIN 2016 – 15H @ LTCI – C49
On fast transform optimization
We study a strategy to optimize sparse convolution kernels leaving on the edges of a tree. They define a fast transform and target atoms prescribed by the user. The so-constructed (deep) optimization problem is smooth but might be strongly non-convex. Experiments shows that fast transforms can be optimized and opens many perspectives.