Author:
Hertrich Johannes,Nguyen Dang-Phuong-Lan,Aujol Jean-Francois,Bernard Dominique,Berthoumieu Yannick,Saadaldin Abdellatif,Steidl Gabriele
Abstract
<p style='text-indent:20px;'>Despite the rapid development of computational hardware, the treatment of large and high dimensional data sets is still a challenging problem. The contribution of this paper to the topic is twofold. First, we propose a Gaussian mixture model in conjunction with a reduction of the dimensionality of the data in each component of the model by principal component analysis, which we call PCA-GMM. To learn the (low dimensional) parameters of the mixture model we propose an EM algorithm whose M-step requires the solution of constrained optimization problems. Fortunately, these constrained problems do not depend on the usually large number of samples and can be solved efficiently by an (inertial) proximal alternating linearized minimization algorithm. Second, we apply our PCA-GMM for the superresolution of 2D and 3D material images based on the approach of Sandeep and Jacob. Numerical results confirm the moderate influence of the dimensionality reduction on the overall superresolution result.</p>
Publisher
American Institute of Mathematical Sciences (AIMS)
Subject
Control and Optimization,Discrete Mathematics and Combinatorics,Modeling and Simulation,Analysis,Control and Optimization,Discrete Mathematics and Combinatorics,Modelling and Simulation,Analysis
Reference32 articles.
1. H. Attouch, J. Bolte.On the convergence of the proximal algorithm for nonsmooth functions involving analytic features, Math. Program., 116 (2009), 5-16.
2. J. Bolte, S. Sabach, M. Teboulle.Proximal alternating linearized minimization for nonconvex and nonsmooth problems, Math. Program., 146 (2014), 459-494.
3. C. Bouveyron, S. Girard, C. Schmid.High-dimensional data clustering, Comput. Statist. Data Anal., 52 (2007), 502-519.
4. C. L. Byrne, The EM Algorithm: Theory, Applications and Related Methods, Lecture Notes, University of Massachusetts, 2017.
5. S. Chrétien, A. O. Hero.Kullback proximal algorithms for maximum-likelihood estimation, IEEE Trans. Inform. Theory, 46 (2000), 1800-1810.
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献