Abstract | ||
---|---|---|
The Nonnegative Matrix Factorization is an unsupervised maching learning technique that finds a representation of measured data in terms of two low-rank factors. It has recently gained popularity in various applications as a feature selection and dimension reduction tool, e.g. text mining, signal processing, and image processing. Thus, the nonnegative matrix factorization is an increasingly important tool in big data analysis as data continues to grow not only in size but also in complexity. In this paper, we advance the NMF analysis in the case of the convolution. That is, the two factors have the clear roles of convolution kernel and signal. Specifically, for the case of the point-spread function, atoms are the weights that describe the kernel. Using proper atoms, we develop a method for the blind deconvolution based on an NMF representation so that we obtain an estimate of the signal and the kernel. In addition, with Magnetic Resonance Imaging (MRI). Specifically, we extend the idea of the two factors to the Fourier transform and develop a coordinate-descent method in order to determine phases. |
Year | DOI | Venue |
---|---|---|
2015 | 10.1109/BIBM.2015.7359923 | IEEE International Conference on Bioinformatics and Biomedicine |
Field | DocType | ISSN |
Kernel (linear algebra),Dimensionality reduction,Pattern recognition,Blind deconvolution,Convolution,Computer science,Deconvolution,Artificial intelligence,Non-negative matrix factorization,Kernel (image processing),Overlap–add method,Machine learning | Conference | 2156-1125 |
Citations | PageRank | References |
0 | 0.34 | 1 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Kazufumi Ito | 1 | 833 | 103.58 |
Amanda K. Landi | 2 | 0 | 0.34 |