English
Related papers

Related papers: Learning Sparse Visual Representations with Leaky …

200 papers

Conventional algorithms for sparse signal recovery and sparse representation rely on $l_1$-norm regularized variational methods. However, when applied to the reconstruction of $\textit{sparse images}$, i.e., images where only a few pixels…

Computer Vision and Pattern Recognition · Computer Science 2016-05-09 Sohil Shah , Tom Goldstein , Christoph Studer

For recovering 3D object poses from 2D images, a prevalent method is to pre-train an over-complete dictionary $\mathcal D=\{B_i\}_i^D$ of 3D basis poses. During testing, the detected 2D pose $Y$ is matched to dictionary by $Y \approx \sum_i…

Computer Vision and Pattern Recognition · Computer Science 2019-01-01 Jianqiao Wangni , Dahua Lin , Ji Liu , Kostas Daniilidis , Jianbo Shi

In representation learning (RL), how to make the learned representations easy to interpret and less overfitted to training data are two important but challenging issues. To address these problems, we study a new type of regulariza- tion…

Machine Learning · Computer Science 2017-11-28 Pengtao Xie , Hongbao Zhang , Eric P. Xing

This paper proposes a precise signal recovery method with multilayered non-convex regularization, enhancing sparsity/low-rankness for high-dimensional signals including images and videos. In optimization-based signal recovery, multilayered…

Signal Processing · Electrical Eng. & Systems 2024-09-24 Akari Katsuma , Seisuke Kyochi , Shunsuke Ono , Ivan Selesnick

The 1-norm was proven to be a good convex regularizer for the recovery of sparse vectors from under-determined linear measurements. It has been shown that with an appropriate measurement operator, a number of measurements of the order of…

Information Theory · Computer Science 2018-12-05 Yann Traonmilin , Samuel Vaiter

Learning sparse models from data is an important task in all those frameworks where relevant information should be identified within a large dataset. This can be achieved by formulating and solving suitable sparsity promoting optimization…

Optimization and Control · Mathematics 2025-02-18 V. Cerone , S. M. Fosson , D. Regruto , A. Salam

We propose to learn non-convex regularizers with a prescribed upper bound on their weak-convexity modulus. Such regularizers give rise to variational denoisers that minimize a convex energy. They rely on few parameters (less than 15,000)…

Image and Video Processing · Electrical Eng. & Systems 2023-12-21 Alexis Goujon , Sebastian Neumayer , Michael Unser

While deep neural networks (DNNs) have proven to be efficient for numerous tasks, they come at a high memory and computation cost, thus making them impractical on resource-limited devices. However, these networks are known to contain a…

Neural and Evolutionary Computing · Computer Science 2020-07-21 Anthony Berthelier , Yongzhe Yan , Thierry Chateau , Christophe Blanc , Stefan Duffner , Christophe Garcia

This work addresses the robust reconstruction problem of a sparse signal from compressed measurements. We propose a robust formulation for sparse reconstruction which employs the $\ell_1$-norm as the loss function for the residual error and…

Information Theory · Computer Science 2017-03-30 Fei Wen , Yuan Yang , Ling Pei , Wenxian Yu , Peilin Liu

Compressed Sensing using $\ell_1$ regularization is among the most powerful and popular sparsification technique in many applications, but why has it not been used to obtain sparse deep learning model such as convolutional neural network…

Machine Learning · Computer Science 2021-10-06 Juncai He , Xiaodong Jia , Jinchao Xu , Lian Zhang , Liang Zhao

Convex $\ell_1$ regularization using an infinite dictionary of neurons has been suggested for constructing neural networks with desired approximation guarantees, but can be affected by an arbitrary amount of over-parametrization. This can…

Optimization and Control · Mathematics 2022-06-01 Konstantin Pieper , Armenak Petrosyan

Inverse problems and regularization theory is a central theme in contemporary signal processing, where the goal is to reconstruct an unknown signal from partial indirect, and possibly noisy, measurements of it. A now standard method for…

Optimization and Control · Mathematics 2014-12-09 Samuel Vaiter , Gabriel Peyré , Jalal M. Fadili

Sparse estimation methods are aimed at using or obtaining parsimonious representations of data or models. While naturally cast as a combinatorial optimization problem, variable or feature selection admits a convex relaxation through the…

Machine Learning · Computer Science 2012-04-23 Francis Bach , Rodolphe Jenatton , Julien Mairal , Guillaume Obozinski

Nonlocal image representation or group sparsity has attracted considerable interest in various low-level vision tasks and has led to several state-of-the-art image denoising techniques, such as BM3D, LSSC. In the past, convex optimization…

Computer Vision and Pattern Recognition · Computer Science 2017-11-22 Qiong Wang , Xinggan Zhang , Yu Wu , Lan Tang , Zhiyuan Zha

Proper regularization is critical for speeding up training, improving generalization performance, and learning compact models that are cost efficient. We propose and analyze regularized gradient descent algorithms for learning shallow…

Machine Learning · Computer Science 2018-06-08 Samet Oymak

Feature selection in learning to rank has recently emerged as a crucial issue. Whereas several preprocessing approaches have been proposed, only a few works have been focused on integrating the feature selection into the learning process.…

Machine Learning · Computer Science 2015-07-03 Léa Laporte , Rémi Flamary , Stephane Canu , Sébastien Déjean , Josiane Mothe

In-network distributed estimation of sparse parameter vectors via diffusion LMS strategies has been studied and investigated in recent years. In all the existing works, some convex regularization approach has been used at each node of the…

Machine Learning · Computer Science 2016-11-15 Bijit Kumar Das , Mrityunjoy Chakraborty , Jerónimo Arenas-García

In the past decade, sparse and low-rank recovery have drawn much attention in many areas such as signal/image processing, statistics, bioinformatics and machine learning. To achieve sparsity and/or low-rankness inducing, the $\ell_1$ norm…

Information Theory · Computer Science 2019-06-07 Fei Wen , Lei Chu , Peilin Liu , Robert C. Qiu

Patch-based sparse representation modeling has shown great potential in image compressive sensing (CS) reconstruction. However, this model usually suffers from some limits, such as dictionary learning with great computational complexity,…

Computer Vision and Pattern Recognition · Computer Science 2017-08-18 Zhiyuan Zha , Xinggan Zhang , Qiong Wang , Lan Tang , Xin Liu

This paper considers the problem of signal denoising using a sparse tight-frame analysis prior. The L1 norm has been extensively used as a regularizer to promote sparsity; however, it tends to under-estimate non-zero values of the…

Computer Vision and Pattern Recognition · Computer Science 2015-09-11 Ankit Parekh , Ivan W. Selesnick
‹ Prev 1 2 3 10 Next ›