Bo Wei
ABSTRACT
Sparse approximation has now become a buzzword for classification in numerous research domains. We propose a distributed sparse approximation method based on l1 minimization for frog sound classification, which is tailored to the resource constrained wireless sensor networks. Our pilot study demonstrates that l1 minimization can run on wireless sensor nodes producing satisfactory classification accuracy.
- M. Figueiredo, R. Nowak, and S. Wright. Gradient projection for sparse reconstruction: Application to compressed sensing and other inverse problems. Selected Topics in Signal Processing, IEEE Journal of, 1(4):587--596, 2008.Google Scholar
- J. Wright, A. Yang, A. Ganesh, S. Sastry, and Y. Ma. Robust face recognition via sparse representation. Pattern Analysis and Machine Intelligence, IEEE Transactions on, 31(2):210--227, 2009. Google ScholarDigital Library
Index Terms
- Distributed sparse approximation for frog sound classification
Recommendations
Sparse reconstruction by separable approximation
Finding sparse approximate solutions to large under-determined linear systems of equations is a common problem in signal/image processing and statistics. Basis pursuit, the least absolute shrinkage and selection operator (LASSO), wavelet-based ...
Sparse deconvolution of higher order tensor for fiber orientation distribution estimation
HighlightsWe model a regularization of HOT with an l1 penalization not on coefficient vector but directly on the FOD.A weighted regularization scheme is developed to iteratively solve the problem.Our method allows HOTs to obtain increasingly clean and ...
Sparse Approximation using $\ell_1-\ell_2$ Minimization and Its Application to Stochastic Collocation
We discuss the properties of sparse approximation using $\ell_1-\ell_2$ minimization. We present several theoretical estimates regarding its recoverability for both sparse and nonsparse signals. We then apply the method to sparse orthogonal polynomial ...
Comments