Kählerian Information Geometry for Signal Processing
نویسندگان
چکیده
منابع مشابه
Kählerian Information Geometry for Signal Processing
We prove the correspondence between the information geometry of a signal filter and a Kähler manifold. The information geometry of a minimum-phase linear system with a finite complex cepstrum norm is a Kähler manifold. The square of the complex cepstrum norm of the signal filter corresponds to the Kähler potential. The Hermitian structure of the Kähler manifold is explicitly emergent if and onl...
متن کاملGeometric Shrinkage Priors for Kählerian Signal Filters
We construct geometric shrinkage priors for Kählerian signal filters. Based on the characteristics of Kähler manifold, an algorithm for finding the superharmonic priors is introduced. The algorithm is efficient and robust to obtain the Komaki priors. Several ansätze for the priors are also suggested. In particular, the ansätze related to Kähler potential are geometrically intrinsic priors to th...
متن کاملApplications of Information Geometry to Audio Signal Processing
In this talk, we present some applications of information geometry to audio signal processing. We seek a comprehensive framework that allows to quantify, process and represent the information contained in audio signals. In digital audio, a sound signal is generally encoded as a waveform, and a common problematic is to extract relevant information about the signal by computing sound features fro...
متن کاملA Series of Kählerian Invariants and Their Applications to Kählerian Geometry
We introduce a series of invariants on Kähler manifolds and prove a series of general inequalities involving these invariants for Kähler submanifolds in complex space forms. We also determine Kähler submanifolds in complex space forms which satisfy the equality cases of these inequalities. MSC 2000: 53C40, 53C42 (primary); 53C55 (secondary)
متن کاملParleda: a Library for Parallel Processing in Computational Geometry Applications
ParLeda is a software library that provides the basic primitives needed for parallel implementation of computational geometry applications. It can also be used in implementing a parallel application that uses geometric data structures. The parallel model that we use is based on a new heterogeneous parallel model named HBSP, which is based on BSP and is introduced here. ParLeda uses two main lib...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Entropy
سال: 2015
ISSN: 1099-4300
DOI: 10.3390/e17041581