In this paper, we propose a Group-Sparse Representation-based method with applications to Face Recognition (GSR-FR). The novel sparse representation variational model includes a non-convex sparsity-inducing penalty and a robust non-convex loss function. The penalty encourages group sparsity by using an approximation of the ℓ 0 -quasinorm, and the loss function is chosen to make the algorithm robust to noise, occlusions, and disguises. The solution of the nontrivial non-convex optimization problem is efficiently obtained by a majorization-minimization strategy combined with forward-backward splitting, which, in particular, reduces the solution to a sequence of easier convex optimization sub-problems. Extensive experiments on widely used face databases show the potentiality of the proposed model and demonstrate that the GSR-FR algorithm is competitive with the state-of-the-art methods based on sparse representation, especially for very low dimensional feature spaces.
1 January 2012 in Applied and Computational Harmonic Analysis
Boundary functions for wavelets on a finite interval are often constructed as linear combinations of boundary-crossing scaling functions. An alternative approach is based on linear algebra techniques for truncating the infinite matrix of the DiscreteWavelet Transform to a finite one. In this article we show how an algorithm of Madych for scalar wavelets can be generalized to multiwavelets, given an extra assumption. We then develop a new algorithm that does not require this additional condition. Finally, we apply results from a previous paper to resolve the non-uniqueness of the algorithm by imposing regularity conditions (including approximation orders) on the boundary functions.
The Kaczmarz algorithm is an iterative method for solving systems of linear equations. We introduce a randomized Kaczmarz algorithm for solving systems of linear equations in a distributed environment, i.e., the equations within the system are distributed over multiple nodes within a network. The modification we introduce is designed for a network with a tree structure that allows for passage of solution estimates between the nodes in the network. We demonstrate that the algorithm converges to the solution, or the solution of minimal norm, when the system is consistent. We also prove convergence rates of the randomized algorithm that depend on the spectral data of the coefficient matrix and the random control probability distribution. In addition, we demonstrate that the randomized algorithm can be used to identify anomalies in the system of equations when the measurements are perturbed by large, sparse noise.
30 November 2023 in Journal of Computational and Applied Mathematics