language-iconOld Web
English
Sign In

Sparse approximation

Sparse Approximation (also known as Sparse Representation) theory deals with sparse solutions for systems of linear equations. Techniques for finding these solutions and exploiting them in applications have found wide use in image processing, signal processing, machine learning, medical imaging, and more. Sparse Approximation (also known as Sparse Representation) theory deals with sparse solutions for systems of linear equations. Techniques for finding these solutions and exploiting them in applications have found wide use in image processing, signal processing, machine learning, medical imaging, and more. Consider a linear system of equations x = D α {displaystyle x=Dalpha } , where D {displaystyle D} is an underdetermined m × p {displaystyle m imes p} matrix ( m < p ) {displaystyle (m

[ "Algorithm", "Machine learning", "Artificial intelligence", "Pattern recognition", "sparse constraint", "sparse model", "Sparse PCA", "sparse coefficient", "dictionary learning" ]
Parent Topic
Child Topic
    No Parent Topic
Baidu
map