標(biāo)題: Titlebook: Geometric Science of Information; First International Frank Nielsen,Frédéric Barbaresco Conference proceedings 2013 Springer-Verlag Berlin [打印本頁(yè)] 作者: 猛烈抨擊 時(shí)間: 2025-3-21 19:46
書目名稱Geometric Science of Information影響因子(影響力)
書目名稱Geometric Science of Information影響因子(影響力)學(xué)科排名
書目名稱Geometric Science of Information網(wǎng)絡(luò)公開度
書目名稱Geometric Science of Information網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Geometric Science of Information被引頻次
書目名稱Geometric Science of Information被引頻次學(xué)科排名
書目名稱Geometric Science of Information年度引用
書目名稱Geometric Science of Information年度引用學(xué)科排名
書目名稱Geometric Science of Information讀者反饋
書目名稱Geometric Science of Information讀者反饋學(xué)科排名
作者: athlete’s-foot 時(shí)間: 2025-3-22 00:08 作者: conception 時(shí)間: 2025-3-22 01:38 作者: PSA-velocity 時(shí)間: 2025-3-22 05:58
https://doi.org/10.1007/978-1-349-09265-9 image. However, Schild’s Ladder may be inefficient in case of time series of multiple time points, in which the computation of the geodesic diagonals is required several times. In this paper we propose a new algorithm, the Pole Ladder, in which one diagonal of the parallelogram is the baseline-to-r作者: sphincter 時(shí)間: 2025-3-22 10:36
https://doi.org/10.1007/978-1-349-10473-4ow that we can decrease the number of model parameters (from the number of voxels down to hundreds) with only minimal decrease in model accuracy. The reduction in model parameters has the potential to improve the power of ensuing statistical analysis, which faces the challenging problem of high dime作者: 編輯才信任 時(shí)間: 2025-3-22 14:12 作者: 編輯才信任 時(shí)間: 2025-3-22 18:00 作者: 表示問 時(shí)間: 2025-3-22 22:05
Parallel Transport with Pole Ladder: Application to Deformations of Time Series of Images image. However, Schild’s Ladder may be inefficient in case of time series of multiple time points, in which the computation of the geodesic diagonals is required several times. In this paper we propose a new algorithm, the Pole Ladder, in which one diagonal of the parallelogram is the baseline-to-r作者: 領(lǐng)巾 時(shí)間: 2025-3-23 03:13 作者: PANT 時(shí)間: 2025-3-23 06:23 作者: 機(jī)制 時(shí)間: 2025-3-23 10:30
Information Geometry and Its Applications: Survey It defines a Riemannian metric uniquely, which is the Fisher information metric. Moreover, a family of dually coupled affine connections are introduced. Mathematically, this is a study of a triple (.), where . is a manifold, . is a Riemannian metric, and . is a third-order symmetric tensor. Informa作者: Phonophobia 時(shí)間: 2025-3-23 15:14
Information-Geometric Optimization: The Interest of Information Theory for Discrete and Continuous Oe about the function. Information geometry provides a systematic method, IGO (information-geometric optimization) to easily build optimization algorithms having nice properties; in particular it minimizes the influence of arbitrary choices such as how the space of solutions is represented. In some s作者: 蟄伏 時(shí)間: 2025-3-23 19:01 作者: 緊張過度 時(shí)間: 2025-3-23 22:45
Bi-invariant Means on Lie Groups with Cartan-Schouten Connectionsvariant metric provide a nice setting as the Lie group becomes a geodesically complete Riemannian manifold, thus also metrically complete. However, this Riemannian approach is fully consistent with the group operations only if a bi-invariant metric exists.作者: Amplify 時(shí)間: 2025-3-24 05:38
Parallel Transport with Pole Ladder: Application to Deformations of Time Series of Images can be modeled by using deformations resulting from the non-rigid registration of follow-up images. The comparison of longitudinal trajectories is therefore the transport of longitudinal deformations in a common reference frame. We previously showed that the Schild’s Ladder is an efficient and simp作者: 征服 時(shí)間: 2025-3-24 07:52
Horizontal Dimensionality Reduction and Iterated Frame Bundle Developmentand centered analysis distorts inter-point distances in the presence of curvature. In this paper, we define a dimensionality reduction procedure for data in Riemannian manifolds that moves the analysis from a center point to local distance measurements. . measures distances relative to lower-order h作者: AGONY 時(shí)間: 2025-3-24 10:50 作者: 盡忠 時(shí)間: 2025-3-24 18:15 作者: 壯觀的游行 時(shí)間: 2025-3-24 21:13 作者: Ointment 時(shí)間: 2025-3-25 01:27 作者: NADIR 時(shí)間: 2025-3-25 04:29 作者: conformity 時(shí)間: 2025-3-25 11:12 作者: gusher 時(shí)間: 2025-3-25 13:02 作者: 庇護(hù) 時(shí)間: 2025-3-25 17:53
https://doi.org/10.1007/978-1-349-10476-5A Riemannian metric . on a flat manifold . with flat connection . is called a . if it is locally expressed by the Hessian of local functions . with respect to the affine coordinate systems, that is, . = . Such pair (.), ., and . are called a ., a ., and a ., respectively [S7].作者: 職業(yè)拳擊手 時(shí)間: 2025-3-25 22:18
https://doi.org/10.1057/9780230307186We introduce a new Riemannian Fourier transform for color image processing. The construction involves spin characters and spin representations of complex Clifford algebras. Examples of applications to low-pass filtering are presented.作者: 貪婪性 時(shí)間: 2025-3-26 01:01
Geometry of Hessian StructuresA Riemannian metric . on a flat manifold . with flat connection . is called a . if it is locally expressed by the Hessian of local functions . with respect to the affine coordinate systems, that is, . = . Such pair (.), ., and . are called a ., a ., and a ., respectively [S7].作者: 土坯 時(shí)間: 2025-3-26 06:50 作者: NOMAD 時(shí)間: 2025-3-26 10:22 作者: 朝圣者 時(shí)間: 2025-3-26 14:55 作者: 善于騙人 時(shí)間: 2025-3-26 17:02
Frank Nielsen,Frédéric BarbarescoFast track conference proceedings.Unique visibility.State of the art research作者: 鍵琴 時(shí)間: 2025-3-26 22:42 作者: 障礙 時(shí)間: 2025-3-27 03:36 作者: 結(jié)束 時(shí)間: 2025-3-27 08:21
Lesson Eleven Using the Merge Feature,e about the function. Information geometry provides a systematic method, IGO (information-geometric optimization) to easily build optimization algorithms having nice properties; in particular it minimizes the influence of arbitrary choices such as how the space of solutions is represented. In some s作者: 思想流動(dòng) 時(shí)間: 2025-3-27 11:34 作者: EXALT 時(shí)間: 2025-3-27 15:12 作者: 溺愛 時(shí)間: 2025-3-27 17:45 作者: CLAY 時(shí)間: 2025-3-28 00:20 作者: BORE 時(shí)間: 2025-3-28 06:08 作者: 嫌惡 時(shí)間: 2025-3-28 07:23 作者: Trabeculoplasty 時(shí)間: 2025-3-28 11:57
Using the Past to Chart Future Pathways?,t can lead to very computationally expensive algorithms in the case of large databases. We present an iterative method which quickly provides a centroid of the population in shape space. This centroid can be used as a rough template estimate or as initialization for template estimation methods.作者: Rustproof 時(shí)間: 2025-3-28 17:04
https://doi.org/10.1007/978-3-030-97427-5escribe a general setting and some general result to reduce the study of a shape optimization problem to a finite dimensional problem of integration of a special type of vector field. We show a practical problem where this approach leads to efficient algorithms.作者: 毛細(xì)血管 時(shí)間: 2025-3-28 22:18
,The Mis-named ‘Chinese Garden’ in Ninfa,ducing a data-driven way of identifying anatomical regions of interest. We propose a probabilistic model of the geometrical variability and describe individual patients as noisy deformations of a random spatial structure (modeled as regions) from a common template. The random regions are generated u作者: cornucopia 時(shí)間: 2025-3-29 02:47
Young Whan Kihl,Lawrence E. Grinterthe geometry of the cluster in the feature space should be considered. We introduce the Spherically Invariant Random Vector (SIRV) representation, which is based on scale-space decomposition, for the modeling of spatial dependencies characterizing the texture image. From the specific properties of t作者: Parley 時(shí)間: 2025-3-29 06:46
East Asian Economic Regionalismerived from HARDI. We employ the framework of large deformation diffeomorphic metric mapping and assume that the HARDI atlas is generated from a known hyperatlas through a flow of diffeomorphisms. We represent the shape prior of the HARDI atlas and the diffeomorphic transformation of individual obse作者: 享樂主義者 時(shí)間: 2025-3-29 10:43 作者: 咽下 時(shí)間: 2025-3-29 11:46 作者: 弄臟 時(shí)間: 2025-3-29 17:49 作者: obsession 時(shí)間: 2025-3-29 22:58 作者: microscopic 時(shí)間: 2025-3-30 00:20 作者: Heart-Attack 時(shí)間: 2025-3-30 05:16 作者: Granular 時(shí)間: 2025-3-30 08:49
