کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
525855 869031 2013 11 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Multi-resolutive sparse approximations of d-dimensional data
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر چشم انداز کامپیوتر و تشخیص الگو
پیش نمایش صفحه اول مقاله
Multi-resolutive sparse approximations of d-dimensional data
چکیده انگلیسی

This paper proposes an iterative computation of sparse representations of functions defined on RdRd, which exploits a formulation of the sparsification problem equivalent to Support Vector Machine and based on Tikhonov regularization. Through this equivalent formulation, the sparsification reduces to an approximation problem with a Tikhonov regularizer, which selects the null coefficients of the resulting approximation. The proposed multi-resolutive sparsification achieves a different resolution in the approximation of the input data through a hierarchy of nested approximation spaces. The idea behind our approach is to combine a smooth and strictly convex approximation of the l1-norm with Tikhonov regularization and iterative solvers of linear/non-linear equations. Firstly, the iterative sparsification scheme is introduced in a Reproducing Kernel Hilbert Space with respect to its native norm. Then, the sparsification is generalized to arbitrary function spaces using the least-squares norm and radial basis functions. Finally, the discrete sparsification is derived using the eigendecomposition and the spectral properties of sparse matrices; in this case, the computational cost is O(nlogn), with n number of input points. Assuming that the data is supported on a (d − 1)-dimensional manifold, we derive a variant of the sparsification scheme that guarantees the smoothness of the solution in the ambient and intrinsic space by using spectral graph theory and manifold learning techniques. Finally, we discuss the multi-resolutive approximation of d-dimensional data such as signals, images, and 3D shapes.


► Novel iterative computation of sparse approximations of functions through Tikhonov regularization.
► The multi-resolutive sparsification applies to both continuous and discrete data.
► The sparsification generates a hierarchy of nested approximation spaces.
► The computation is efficient, stable, and based on a global procedure.
► For manifolds, the sparse approximation is smooth in the ambient and intrinsic space.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computer Vision and Image Understanding - Volume 117, Issue 4, April 2013, Pages 418–428
نویسندگان
,