Related Experiment Video
Updated: Jun 15, 2026

Four-Dimensional CT Analysis Using Sequential 3D-3D Registration
Published on: November 23, 2019
Group-wise Point-set registration using a novel CDF-based Havrda-Charvát Divergence
Ting Chen1, Baba C Vemuri, Anand Rangarajan
1T. Chen, B. C. Vemuri and A. Rangarajan are with Department of CISE, University of Florida, Gainesville, FL 32601. S. J. Eisenschenk is with Department of Neurology, University of Florida.
This study introduces a new method for aligning point sets without needing to match individual points. The novel CDF-HC divergence offers a more efficient and accurate approach to group-wise registration and atlas construction.
Area of Science:
- Medical image analysis
- Computational geometry
- Information theory
Background:
- Group-wise registration aligns multiple datasets.
- Unknown correspondence poses a significant challenge.
- Existing methods can be computationally intensive and less accurate.
Purpose of the Study:
- To develop a novel and robust technique for group-wise registration of point sets with unknown correspondence.
- To introduce a new divergence measure for quantifying dissimilarities between cumulative distribution functions (CDFs).
- To enable unbiased point-set atlas construction without pre-established correspondences.
Main Methods:
- Definition of Havrda-Charvát (HC) entropy for CDFs, termed HC Cumulative Residual Entropy (HC-CRE).
- Proposal of CDF-HC divergence, a generalized and computationally efficient alternative to CDF-JS divergence.
- Derivation of a closed-form analytic gradient for efficient quasi-Newton optimization.
Main Results:
- The CDF-HC divergence is simpler to implement and more computationally efficient than previous methods.
- The derived analytic gradient facilitates efficient optimization of non-rigid registration parameters.
- Experimental results demonstrate superior efficiency, accuracy, and robustness compared to existing algorithms.
Conclusions:
- The proposed CDF-HC registration algorithm is highly effective for group-wise point set alignment.
- This technique facilitates unbiased atlas construction, overcoming the limitation of unknown correspondences.
- The method offers significant improvements in performance metrics over prior art in point set registration.
Related Concept Videos
Divergence Theorem in 3D Space
Divergence and Stokes' Theorems
Curl and Divergence of Vector Fields
Divergence and Curl
Routh-Hurwitz Criterion II
The first scenario occurs when a singular zero appears in the first column of the Routh table. This situation creates a division by zero issues. To resolve this, a small positive or negative number, denoted as epsilon (∈), is substituted for the zero. The stability analysis proceeds by assuming a sign for ∈. If ∈ is positive, any sign change in the first column of the Routh...
Routh-Hurwitz Criterion I
To apply the Routh-Hurwitz criterion, a Routh table is constructed. The table's rows are labeled with powers of the complex frequency variable s, starting from the...

