nonnegative matrix factorization is a data analysis tool that aims at representing a set of input data vectors as nonnegative linear combinations of a few nonnegative basis vectors. When dealing with continuous input ...
详细信息
ISBN:
(纸本)9781728108247
nonnegative matrix factorization is a data analysis tool that aims at representing a set of input data vectors as nonnegative linear combinations of a few nonnegative basis vectors. When dealing with continuous input signals, smoothness and accuracy of this representation can often be improved if nonnegative polynomials are used in the basis instead of vectors. However, algorithms using polynomials are usually more computationally demanding than their vector counterparts. In this work, we consider the Hierarchical Alternating Least Squares method, which displays state-of-the art performance on this problem and requires at each iteration to compute projections over the set of nonnegative polynomials. We introduce several heuristic algorithms designed to provide fast approximations of these projections, and show that their use significantly accelerates the resolution of nonnegative matrix factorization problems over polynomial signals without adverse effect on the accuracy of the obtained solutions.
nonnegative matrix factorization has been applied in hyperspectral unmixing, while the accuracy of unmixing is closely related with the local minimizers In this paper, we present a new regularized cost function of non...
详细信息
ISBN:
(纸本)9781728136608
nonnegative matrix factorization has been applied in hyperspectral unmixing, while the accuracy of unmixing is closely related with the local minimizers In this paper, we present a new regularized cost function of nonnegative matrix factorization by fully considering the real data information of the endmember signature. The endmember signatures can be easily found in the United States Geological Survey spectral library. The multiplicative update rules are employed to obtain the factor matrices, because it is easy to implement and often yields good results. We demonstrate the success of regularized nonnegative matrix factorization by applying it on hyperspectral unmixing.
This paper presents a fusion method generating unobservable sharpened hyperspectral remote sensing data with high spatial and spectral resolutions. This method, related to linear spectral unmixing (LSU) techniques, an...
详细信息
ISBN:
(纸本)9781538691540
This paper presents a fusion method generating unobservable sharpened hyperspectral remote sensing data with high spatial and spectral resolutions. This method, related to linear spectral unmixing (LSU) techniques, and based on nonnegative matrix factorization (NMF), introduces Joint-Variables NMF (JVNMF) for fusing observable low spatial resolution hyperspectral and high spatial resolution multispectral data. It optimizes a joint-variables criterion that exploits spatial and spectral degradation models between the two considered images, and therefore considers a reduced number of unknown variables. This approach, called Grd-JVNMF, is a gradient-based method and uses iterative update rules. The proposed method is applied to realistic synthetic and semi-real data, and its effectiveness, in spatial and spectral domains, is evaluated with established performance criteria. Experimental results show that the proposed Grd-JVNMF method yields multi-sharpened hyperspectral data with good spectral and spatial fidelities. These tests also show that the proposed method outperforms tested literature ones.
A multichannel extension of nonnegative matrix factorization (NMF) for audio/music data, called multichannel NMF (MNMF), has been proposed by Sawada et al. ["Multichannel extensions of non-negative matrix factori...
详细信息
ISBN:
(纸本)9781479981311
A multichannel extension of nonnegative matrix factorization (NMF) for audio/music data, called multichannel NMF (MNMF), has been proposed by Sawada et al. ["Multichannel extensions of non-negative matrixfactorization with complex-valued data," IEEE Trans. ASLP, vol. 21, no. 5, pp. 971-982, May 2013]. However, conventional MNMF algorithms have a major drawback of a heavy computational load due to numerous matrix operations, such as matrix inversions and matrix multiplications. Here we propose FastMNMF, accelerated algorithms for the MNMF based on joint diagonalization of matrices. It is well known that, for diagonal matrices, matrix operations reduce to mere scalar operations on diagonal entries. Because of this property, the joint diagonalization results in a significantly reduced computational load compared to conventional MNMF algorithms. This makes the proposed FastMNMF even applicable to a situation with a large database or restricted computational resources.
This paper presents an unmixing based change detection (UBCD) approach based on constrained nonnegative matrix factorization (NMF) for hyperspectral images. UBCD provides not only multi -output change detection, but a...
详细信息
ISBN:
(纸本)9781538691540
This paper presents an unmixing based change detection (UBCD) approach based on constrained nonnegative matrix factorization (NMF) for hyperspectral images. UBCD provides not only multi -output change detection, but also subpixel level information about the nature of the changes that occur in the scene. The proposed method utilizes constrained NMF with the sparsity constraint for the abundances and the minimum volume constraint for the endmembers, reducing the solution space for the matrixfactorization and resulting in enhanced unmixing and change detection performance. The change detection output is obtained in terms of the temporal abundance matrix differences for each endmember. The proposed method is evaluated on synthetic and real multitemporal datasets.
In this paper, we propose a new algorithm integrating pure pixel identification into nonnegative matrix factorization (NMF) model to decompose the mixed pixels existing in hyperspectral imagery. The proposed algorithm...
详细信息
ISBN:
(数字)9781510628298
ISBN:
(纸本)9781510628298
In this paper, we propose a new algorithm integrating pure pixel identification into nonnegative matrix factorization (NMF) model to decompose the mixed pixels existing in hyperspectral imagery. The proposed algorithm employs traditional endmember identification algorithm to search for the pure pixel candidates, and then the principal component analysis is performed on the homogenous pixels which consist of the pure pixel candidates and its neighborhoods to identify the endmembers existing in the real scene. Finally, the known-endmember-based NMF unmixing algorithm is used to generate the other unknown endmembers. The proposed algorithm retains the advantages of both pure pixel identification method and NMF. Experimental results based on simulated and real data sets demonstrate the superiority of the proposed algorithm with respect to other state-of-the-art approaches.
Constrained low rank approximation is a general framework for data analysis, which usually has the advantage of being simple, fast, scalable and domain general. One of the most known constrained low rank approximation...
详细信息
Constrained low rank approximation is a general framework for data analysis, which usually has the advantage of being simple, fast, scalable and domain general. One of the most known constrained low rank approximation methods is nonnegative matrix factorization (NMF). This research studies the design and implementation of several variants of NMF for text, graph and hybrid data analytics. It will address challenges including solving new data analytics problems and improving the scalability of existing NMF algorithms. There are two major types of matrix representation of data: feature-data matrix and similarity matrix. Previous work showed successful application of standard NMF for feature-data matrix to areas such as text mining and image analysis, and Symmetric NMF (SymNMF) for similarity matrix to areas such as graph clustering and community detection. In this work, a divide-and-conquer strategy is applied to both methods to improve their time complexity from cubic growth with respect to the reduced low rank to linear growth, resulting in DC-NMF and HierSymNMF2 methods. Extensive experiments on large scale real world data show improved performance of these two methods. Furthermore, in this work NMF and SymNMF are combined into one formulation called JointNMF, to analyze hybrid data that contains both text content and connection structure information. Typical hybrid data where JointNMF can be applied includes paper/patent data where there are citation connections among content and email data where the sender/receipts relation is represented by a hypergraph and the email content is associated with hypergraph edges. An additional capability of the JointNMF is prediction of unknown network information which is illustrated using several real world problems such as citation recommendations of papers and activity/leader detection in organizations. This dissertation also includes brief discussions of relationship among different variants of NMF.
In this paper, we propose a probabilistic model for analyzing the generalized interval valued matrix, a matrix that has scalar valued elements and bounded/unbounded interval valued elements. We derive a majorization m...
详细信息
ISBN:
(纸本)9781479981311
In this paper, we propose a probabilistic model for analyzing the generalized interval valued matrix, a matrix that has scalar valued elements and bounded/unbounded interval valued elements. We derive a majorization minimization algorithm for parameter estimation and prove that the objective function is monotonically decreasing by the parameter update. An experiment shows that the proposed model well handles interval-valued elements and offers improved performance.
Active learning is a method of analyzing the observed data such that choosing the next observation will give the most information about the variable to be predicted. However, when observations are costly, one needs st...
详细信息
ISBN:
(纸本)9781728119045
Active learning is a method of analyzing the observed data such that choosing the next observation will give the most information about the variable to be predicted. However, when observations are costly, one needs strategies to obtain informative data to arrive at accurate predictions with less data. In this study, we compare various observation sequence selection strategies on the matrix completion problem. We used Gibbs Sampling and Variational Bayes as inference mechanisms on the MovieLens dataset. Our results suggest that the Gibbs sampler coupled with the selection of the element with minimal observations on a row and column is the superior approach for the Bayesian nonnegative matrix factorization (NMF).
This paper proposes two statistical models for the nonnegative matrix factorization (NMF) based on heavy-tailed distributions. In the NMF for acoustic signals, previous works justify the additivity of an observed spec...
详细信息
ISBN:
(纸本)9789082797039
This paper proposes two statistical models for the nonnegative matrix factorization (NMF) based on heavy-tailed distributions. In the NMF for acoustic signals, previous works justify the additivity of an observed spectrogram using the reproductive property of a probability density function. However, the effectiveness of these properties is not clear. Consequently, to construct a model robust to noise, statistical models based on heavy-tailed distributions are recently growing up. In this paper, as heavy-tailed models for the NMF, we introduce statistical models based on the complex Laplace distributions, and call them Laplace-NMF. Moreover, we derive convergence-guaranteed optimization algorithms to estimate parameters. From our formulation, a statistical interpretation of the Itakura-Saito (IS) divergence-based NMF is newly revealed. We confirm the effectiveness of Laplace-NMF in semi-supervised audio denoising.
暂无评论