Image retrieval based on multiview constrained nonnegative matrix factorization and Gaussian mixture model spectral clustering method (Q1792972)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Image retrieval based on multiview constrained nonnegative matrix factorization and Gaussian mixture model spectral clustering method |
scientific article; zbMATH DE number 6953041
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Image retrieval based on multiview constrained nonnegative matrix factorization and Gaussian mixture model spectral clustering method |
scientific article; zbMATH DE number 6953041 |
Statements
Image retrieval based on multiview constrained nonnegative matrix factorization and Gaussian mixture model spectral clustering method (English)
0 references
12 October 2018
0 references
Summary: Content-based image retrieval has recently become an important research topic and has been widely used for managing images from repertories. In this article, we address an efficient technique, called MNGS, which integrates multiview constrained nonnegative matrix factorization (NMF) and Gaussian mixture model- (GMM-) based spectral clustering for image retrieval. In the proposed methodology, the multiview NMF scheme provides competitive sparse representations of underlying images through decomposition of a similarity-preserving matrix that is formed by fusing multiple features from different visual aspects. In particular, the proposed method merges manifold constraints into the standard NMF objective function to impose an orthogonality constraint on the basis matrix and satisfy the structure preservation requirement of the coefficient matrix. To manipulate the clustering method on sparse representations, this paper has developed a GMM-based spectral clustering method in which the Gaussian components are regrouped in spectral space, which significantly improves the retrieval effectiveness. In this way, image retrieval of the whole database translates to a nearest-neighbour search in the cluster containing the query image. Simultaneously, this study investigates the proof of convergence of the objective function and the analysis of the computational complexity. Experimental results on three standard image datasets reveal the advantages that can be achieved with the proposed retrieval scheme.
0 references
0 references