在正定空间中计算壳和中心点
Computing Hulls And Centerpoints In Positive Definite Space
摘要:
本文给出了正定空间中矩阵集合的近似壳和近似中心点的计算算法。在许多应用中,所考虑的数据不是欧几里德空间中的点,而是正定的(p.d.)。矩阵这些应用包括大脑中的扩散张量成像,机械工程中的弹性分析,以及机器学习中的核映射理论。我们的工作围绕着一个horoball的概念:一个球的极限固定在一个点,其半径达到无穷大。horoball具有许多(虽然不是全部)半空间的性质;特别是,它们缺乏一个强分离定理,两个horoball可以完全分割空间。尽管如此,我们表明,我们可以计算一个近似的“horoball壳”,严格包含实际的凸包。这个近似壳也保留了测地线的范围,这是独立值的结果:一个直接的推论是我们可以近似地解决正定空间中的直径和宽度等问题。我们还使用horoball显示存在性和计算近似的鲁棒中心点在正定空间,通过horoball等价的深度的概念。
英文摘要:
In this paper, we present algorithms for computing approximate hulls and centerpoints for collections of matrices in positive definite space. There are many applications where the data under consideration, rather than being points in a Euclidean space, are positive definite (p.d.) matrices. These applications include diffusion tensor imaging in the brain, elasticity analysis in mechanical engineering, and the theory of kernel maps in machine learning. Our work centers around the notion of a horoball: the limit of a ball fixed at one point whose radius goes to infinity. Horoballs possess many (though not all) of the properties of halfspaces; in particular, they lack a strong separation theorem where two horoballs can completely partition the space. In spite of this, we show that we can compute an approximate "horoball hull" that strictly contains the actual convex hull. This approximate hull also preserves geodesic extents, which is a result of independent value: an immediate corollary is that we can approximately solve problems like the diameter and width in positive definite space. We also use horoballs to show existence of and compute approximate robust centerpoints in positive definite space, via the horoball-equivalent of the notion of depth.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。