This work deals with efficient atom selection procedure in
a continuous dictionary, as required for instance in a Frank-
Wolfe approach within a BLASSO problem for the onedimensional
deconvolution problem. We show that efficient
maximization of a correlation between any given vector and
an atom sweeping a continuous dictionary can be performed
through a particular piece-wise linear approximation of dictionaries:
the polar approximation. We finally identify the
polar approximation as being optimal in a mean square error
sense for dictionaries with raised-cosine Toeplitz kernels.
Index Terms— Sparse representation, Continuous dictionary,
BLASSO, SVD
https://ieeexplore.ieee.org/document/8683402