Consistent Discretization and Minimization of the L1 Norm on Manifolds

09/18/2016
by   Alex Bronstein, et al.
0

The L1 norm has been tremendously popular in signal and image processing in the past two decades due to its sparsity-promoting properties. More recently, its generalization to non-Euclidean domains has been found useful in shape analysis applications. For example, in conjunction with the minimization of the Dirichlet energy, it was shown to produce a compactly supported quasi-harmonic orthonormal basis, dubbed as compressed manifold modes. The continuous L1 norm on the manifold is often replaced by the vector l1 norm applied to sampled functions. We show that such an approach is incorrect in the sense that it does not consistently discretize the continuous norm and warn against its sensitivity to the specific sampling. We propose two alternative discretizations resulting in an iteratively-reweighed l2 norm. We demonstrate the proposed strategy on the compressed modes problem, which reduces to a sequence of simple eigendecomposition problems not requiring non-convex optimization on Stiefel manifolds and producing more stable and accurate results.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/11/2022

Delaunay-like Triangulation of Smooth Orientable Submanifolds by L1-Norm Minimization

In this paper, we focus on one particular instance of the shape reconstr...
research
02/22/2013

Sparse Signal Estimation by Maximally Sparse Convex Optimization

This paper addresses the problem of sparsity penalized least squares for...
research
04/24/2013

Comparison of several reweighted l1-algorithms for solving cardinality minimization problems

Reweighted l1-algorithms have attracted a lot of attention in the field ...
research
01/04/2021

Minimizing L1 over L2 norms on the gradient

In this paper, we study the L1/L2 minimization on the gradient for imagi...
research
01/23/2011

Reproducing Kernel Banach Spaces with the l1 Norm

Targeting at sparse learning, we construct Banach spaces B of functions ...
research
10/06/2016

Efficient L1-Norm Principal-Component Analysis via Bit Flipping

It was shown recently that the K L1-norm principal components (L1-PCs) o...
research
12/14/2020

On the Treatment of Optimization Problems with L1 Penalty Terms via Multiobjective Continuation

We present a novel algorithm that allows us to gain detailed insight int...

Please sign up or login with your details

Forgot password? Click here to reset