Sparse Representation Using Multidimensional Mixed-Norm Penalty With Application to Sound Field Decomposition - 2018


A sparse representation methodology for multidimensional signals is proposed. In typically used group-sparse representation algorithms, the sparsity is imposed only on a single dimension and therefore the signals in the opposite dimensions are solved in the least-sq.-error sense. However, multidimensional signals can be sparse in multiple dimensions. For example, in acoustic array processing, additionally to the sparsity of the spatial distribution of acoustic sources, acoustic source signals can conjointly be sparse in the time-frequency domain. We outline a multidimensional mixed-norm penalty, which allows the sparsity to be controlled in each dimension. The majorization-minimization approach is applied to derive the optimization algorithm. The proposed algorithm has the benefits of a wide selection for the sparsity-controlling parameters, a little cost of adjusting the balancing parameters, and a coffee computational price compared with current methods. Numerical experiments indicate that the proposed methodology is also effective for application to sound field decomposition.

Did you like this research project?

To get this research project Guidelines, Training and Code... Click Here

PROJECT TITLE : Flipping Free Conditions and Their Application in Sparse Network Localization ABSTRACT: An essential challenge involves determining the topology of a network based on the distances between its nodes. When there
PROJECT TITLE : Foresee Urban Sparse Traffic Accidents: A Spatiotemporal Multi-Granularity Perspective ABSTRACT: Due to the rapid pace of urbanization, car accidents have evolved into a significant threat to both health and development.
PROJECT TITLE : GraphSAGE-Based Traffic Speed Forecasting for Segment Network With Sparse Data ABSTRACT: The ability to accurately anticipate the flow of traffic is an essential component of intelligent traffic management systems.
PROJECT TITLE : Robust Rank-Constrained Sparse Learning: A Graph-Based Framework for Single View and Multiview Clustering ABSTRACT: Graph-based clustering is an approach that seeks to partition data in accordance with a similarity
PROJECT TITLE : Regularization on Augmented Data to Diversify Sparse Representation for Robust Image Classification ABSTRACT: The process of image classification is an essential part of today's computer vision systems. Due to

Ready to Complete Your Academic MTech Project Work In Affordable Price ?

Project Enquiry