Answers are grounded in this paper and cite their sources.
Robust registration of a sequence of brain images is critical for tasks such as three-dimensional (3D) reconstruction, time-series alignment, and common coordinate mapping. Here, we propose a robust registration algorithm based on the majorization-minimization (MM) optimization principle. This algorithm produces both 3D reconstructed images and transformation parameters for one diffeomorphism and one rigid transformation per two-dimensional (2D) sequential image. To achieve the strong robustness necessary for working with heterogeneous images in a high-throughput setting, we minimize a loss that is quadratic for small errors and almost constant for large errors, making it even more robust than [Formula: see text] and Huber losses. We motivate this choice and demonstrate that it can be effectively implemented in an MM algorithm. We then test our algorithm on simulated images with a known gold standard and on two different modalities of microscopy images.
No takes yet. Share an insight, caveat, or question.
Zhou et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: