2007 IEEE Conference on Computer Vision and Pattern Recognition 2007
DOI: 10.1109/cvpr.2007.383188
|View full text |Cite
|
Sign up to set email alerts
|

Riemannian Analysis of Probability Density Functions with Applications in Vision

Abstract: Applications in computer vision involve statistically analyzing an important class of constrained, nonnegative functions, including probability density functions (in texture analysis), dynamic time-warping functions (in activity analysis), and re-parametrization or non-rigid registration functions (in shape analysis of curves). For this one needs to impose a Riemannian

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
161
0

Year Published

2008
2008
2024
2024

Publication Types

Select...
4
4
2

Relationship

1
9

Authors

Journals

citations
Cited by 163 publications
(161 citation statements)
references
References 14 publications
(18 reference statements)
0
161
0
Order By: Relevance
“…We addressed this by taking the square root of the ODF: the Riemannian manifold for the square root of a PDF is isomorphic to a unit sphere and there are closed form expressions defining the geodesic distance, exponential and inverse exponential mappings [9]. The interpolated square-rooted ODF (sqrt-ODF)ϕ at point (x, y, z) was then constructed by finding the weighted Karcher mean of its 8 diagonal neighbors ϕ i in 3D at lattice points (x i , y i , z i ), which minimizes the square sum of the geodesic distance d: (2) Here w i is the trilinear interpolation weight defined as…”
Section: Hardi Processing and Registrationmentioning
confidence: 99%
“…We addressed this by taking the square root of the ODF: the Riemannian manifold for the square root of a PDF is isomorphic to a unit sphere and there are closed form expressions defining the geodesic distance, exponential and inverse exponential mappings [9]. The interpolated square-rooted ODF (sqrt-ODF)ϕ at point (x, y, z) was then constructed by finding the weighted Karcher mean of its 8 diagonal neighbors ϕ i in 3D at lattice points (x i , y i , z i ), which minimizes the square sum of the geodesic distance d: (2) Here w i is the trilinear interpolation weight defined as…”
Section: Hardi Processing and Registrationmentioning
confidence: 99%
“…Methods that map a histogram/density to a sphere (e.g., [35]) have such geometry but suffer from two issues. First, they do not respect the ordering of the bins or the real line.…”
Section: Related Workmentioning
confidence: 99%
“…Observe that the Cauchy-Schwarz escort distributions are the square root density representations [26] of distributions.…”
Section: Fact 5 (Hed As a Skew Bhattacharyya Divergence) The Hölder mentioning
confidence: 99%