逆KLダイバージェンスを用いたガウス混合分布の削減
Gaussian Mixture Reduction Using Reverse Kullback-Leibler Divergence
KLダイバージェンスに基づき混合成分の統合だけでなく枝刈りも行える貪欲な混合削減アルゴリズムを提案し、計算効率化の近似を導出して既存手法と比較した論文。
著者: Tohid Ardeshiri, Umut Orguner, Emre Özkan
分類: stat.ML, cs.CV, cs.LG, cs.RO, cs.SY, eess.SY
原文アブストラクト
We propose a greedy mixture reduction algorithm which is capable of pruning mixture components as well as merging them based on the Kullback-Leibler divergence (KLD). The algorithm is distinct from the well-known Runnalls' KLD based method since it is not restricted to merging operations. The capability of pruning (in addition to merging) gives the algorithm the ability of preserving the peaks of the original mixture during the reduction. Analytical approximations are derived to circumvent the computational intractability of the KLD which results in a computationally efficient method. The proposed algorithm is compared with Runnalls' and Williams' methods in two numerical examples, using both simulated and real world data. The results indicate that the performance and computational complexity of the proposed approach make it an efficient alternative to existing mixture reduction methods.
関連論文
- 条件付きマルコフ系列のモデル設計と表現確率モデル
