Short And Squeezed: Accelerating The Computation Of Antisparse Representations With Safe Squeezing

This video program is a part of the Premium package:

Short And Squeezed: Accelerating The Computation Of Antisparse Representations With Safe Squeezing


  • IEEE MemberUS $11.00
  • Society MemberUS $0.00
  • IEEE Student MemberUS $11.00
  • Non-IEEE MemberUS $15.00
Purchase

Short And Squeezed: Accelerating The Computation Of Antisparse Representations With Safe Squeezing

0 views
  • Share
Create Account or Sign In to post comments
Antisparse coding aims at spreading the information uniformly over representation coefficients and can be expressed as the solution of an $ell_infty$-norm regularized problem. In this paper, we propose a new methodology, coined ``safe squeezing'', accel
Antisparse coding aims at spreading the information uniformly over representation coefficients and can be expressed as the solution of an $ell_infty$-norm regularized problem. In this paper, we propose a new methodology, coined ``safe squeezing'', accel