Towards a median signal detector through the total Bregman divergence and its robustness analysis
A novel family of geometric signal detectors are proposed through medians of the total Bregman divergence (TBD), which are shown advantageous over the conventional methods and their mean counterparts. By interpreting the observation data as Hermitian positive-definite matrices, their mean or median play an essential role in signal detection. As is difficult to be solved analytically, we propose numerical solutions through Riemannian gradient descent algorithms or fixed-point algorithms. Beside detection performance, robustness of a detector to outliers is also of vital importance, which can often be analyzed via the influence functions. Introducing an orthogonal basis for Hermitian matrices, we are able to compute the corresponding influence functions analytically and exactly by solving a linear system, which is transformed from the governing matrix equation. Numerical simulations show that the TBD medians are more robust than their mean counterparts.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Target Detection within Nonhomogeneous Clutter via Total Bregman Divergence-Based Matrix Information Geometry Detectors
Information divergences are commonly used to measure the dissimilarity of two elements on a statistical manifold. Differentiable manifolds endowed with different divergences may possess different geometric properties, wh…
MIG Median Detectors with Manifold Filter
In this paper, we propose a class of median-based matrix information geometry (MIG) detectors with a manifold filter and apply them to signal detection in nonhomogeneous environments. As customary, the sample data is ass…
Optimal interval clustering: Application to Bregman clustering and statistical mixture learning
We present a generic dynamic programming method to compute the optimal clustering of $n$ scalar elements into $k$ pairwise disjoint intervals. This case includes 1D Euclidean $k$-means, $k$-medoids, $k$-medians, $k$-cent…
ClusteringModel SelectionMulti-dimensional signal approximation with sparse structured priors using split Bregman iterations
This paper addresses the structurally-constrained sparse decomposition of multi-dimensional signals onto overcomplete families of vectors, called dictionaries. The contribution of the paper is threefold. Firstly, a gener…
Understanding the bias-variance tradeoff of Bregman divergences
This paper builds upon the work of Pfau (2013), which generalized the bias variance tradeoff to any Bregman divergence loss function. Pfau (2013) showed that for Bregman divergences, the bias and variances are defined wi…
Prediction