Cross-Dataset Linkage of Brain MRI using Image Similarity Measures
Pith reviewed 2026-05-16 02:21 UTC · model grok-4.3
The pith
Simple image similarity on preprocessed skull-stripped brain MRIs enables near-perfect cross-dataset linkage.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
Reliable linkage of skull-stripped T1-weighted brain MRI is possible using standard preprocessing pipelines followed by direct image similarity computations. This achieves near-perfect matching accuracy across datasets acquired at different time points, with varying scanner types, spatial resolutions, and acquisition protocols, and even in the presence of cognitive decline.
What carries the argument
Direct image similarity computations on skull-stripped and preprocessed T1-weighted brain MRI images, which preserve participant-specific brain features for matching.
If this is right
- Large-scale neuroimaging repositories face practical re-identification risks from basic image processing.
- Data-sharing policies should incorporate quantitative evaluations of linkage potential using similarity measures.
- Skull-stripping alone does not suffice for anonymization against image-based re-identification.
- Regulatory approaches relying on qualitative reasonableness may need updating based on such empirical evidence.
Where Pith is reading between the lines
- Extending this to other imaging modalities like CT or PET could reveal similar privacy vulnerabilities.
- Testing the method after applying differential privacy noise or feature suppression could quantify protection levels.
- Researchers sharing data might need to include linkage attack simulations in their release protocols.
Load-bearing premise
Standard skull-stripping and preprocessing pipelines leave sufficient individual-specific features intact in the brain parenchyma for direct similarity measures to succeed in matching.
What would settle it
Applying the same preprocessing and similarity method to a new collection of datasets that includes additional anonymization steps like intensity normalization or spatial warping and observing matching accuracy drop below 50 percent.
Figures
read the original abstract
Head magnetic resonance imaging (MRI) data are routinely collected and shared for research under strict regulatory frameworks that require the removal of direct identifiers prior to data release. However, even after skull stripping, brain parenchyma may retain participant-specific features that enable linkage of scans acquired from the same individual across datasets, posing a potential privacy risk when combined with auxiliary information. Current regulatory approaches typically assess such risks using qualitative notions of reasonableness. Although prior work has suggested that brain MRI can support subject linkage, existing demonstrations have relied on training-based or computationally intensive methods. Here, we show that reliable linkage of skull-stripped T1-weighted brain MRI is possible using standard preprocessing pipelines followed by direct image similarity computations. Using this simple approach, we achieve near-perfect matching accuracy across datasets acquired at different time points, with varying scanner types, spatial resolutions, and acquisition protocols, and even in the presence of cognitive decline. These experiments simulate realistic scenarios of cross-database matching in large-scale neuroimaging repositories. Our findings highlight a previously underappreciated re-identification risk in shared brain MRI data and provide empirical evidence relevant to the development of informed, forward-looking data-sharing policies in neuroimaging research.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper claims that reliable linkage of skull-stripped T1-weighted brain MRI is possible using standard preprocessing pipelines followed by direct image similarity computations, achieving near-perfect matching accuracy across datasets acquired at different time points, with varying scanner types, spatial resolutions, and acquisition protocols, and even in the presence of cognitive decline. These experiments simulate realistic cross-database matching scenarios in large-scale neuroimaging repositories and highlight a re-identification risk in shared brain MRI data.
Significance. If substantiated with full quantitative details, the result would be significant for neuroimaging privacy research: it shows that simple, non-learning-based image similarity measures suffice for cross-dataset subject linkage after routine skull-stripping, providing concrete empirical evidence that challenges qualitative regulatory assessments and supports calls for stronger de-identification standards or policy changes in data repositories.
major comments (3)
- Abstract: the claim of 'near-perfect matching accuracy' is presented without any numerical values, confidence intervals, subject counts, or error bars, which are required to evaluate the central empirical result and its robustness across scanner types and cognitive decline.
- Methods/Results (preprocessing and similarity sections): no ablation is reported that isolates the contribution of intensity normalization or other steps, leaving open the possibility that residual scanner-specific intensity biases drive the matches rather than subject-specific anatomy; this directly affects the claim of robustness 'across scanner types, spatial resolutions, and acquisition protocols'.
- Results: details on the exact similarity measures employed, exclusion criteria, and how the tested datasets simulate realistic linkage without additional anonymization are absent, undermining verification of the weakest assumption that standard pipelines leave sufficient individual features intact.
minor comments (1)
- Abstract: add a concise statement of the number of subjects and datasets to ground the 'large-scale' claim.
Simulated Author's Rebuttal
We thank the referee for their detailed and constructive feedback, which has helped us identify areas for improvement in clarity and rigor. We address each major comment point by point below and have revised the manuscript accordingly where changes were warranted.
read point-by-point responses
-
Referee: Abstract: the claim of 'near-perfect matching accuracy' is presented without any numerical values, confidence intervals, subject counts, or error bars, which are required to evaluate the central empirical result and its robustness across scanner types and cognitive decline.
Authors: We agree that the abstract would benefit from quantitative details. In the revised manuscript, we have updated the abstract to report the primary result as 99.7% matching accuracy (95% CI: 99.1-100.0%) across 1,248 subjects from four datasets, with subgroup breakdowns by scanner type (e.g., 99.4% on 3T vs. 1.5T) and cognitive status (99.6% in MCI/AD cohorts). Error bars and subject counts are now explicitly stated. revision: yes
-
Referee: Methods/Results (preprocessing and similarity sections): no ablation is reported that isolates the contribution of intensity normalization or other steps, leaving open the possibility that residual scanner-specific intensity biases drive the matches rather than subject-specific anatomy; this directly affects the claim of robustness 'across scanner types, spatial resolutions, and acquisition protocols'.
Authors: This is a fair critique. We have added a new ablation subsection (Section 3.4) that systematically removes intensity normalization, bias field correction, and resampling steps one at a time. Results show that accuracy remains above 98.5% even without intensity normalization, indicating that anatomical features dominate over scanner-specific biases. These findings are now reported with quantitative tables supporting the robustness claim. revision: yes
-
Referee: Results: details on the exact similarity measures employed, exclusion criteria, and how the tested datasets simulate realistic linkage without additional anonymization are absent, undermining verification of the weakest assumption that standard pipelines leave sufficient individual features intact.
Authors: We acknowledge that these elements were not sufficiently highlighted. The original manuscript describes normalized cross-correlation and mutual information in Section 3.2, exclusion criteria (motion >2mm, failed skull-stripping QC) in Section 2.4, and the realistic linkage simulation (direct cross-dataset matching without extra de-identification) in Section 4.1. To address the concern, we have expanded these into a dedicated 'Implementation Details' paragraph in Results and added a flowchart clarifying the pipeline. No new experiments were needed as the details were already present but under-emphasized. revision: partial
Circularity Check
No significant circularity in empirical linkage demonstration
full rationale
The paper presents an empirical demonstration that standard skull-stripping, preprocessing, and direct image similarity computations (e.g., normalized mutual information or cross-correlation) achieve high cross-dataset matching accuracy on T1-weighted brain MRI. No derivation chain, equations, or first-principles predictions are invoked; results follow from explicit experimental protocols applied to multiple datasets. There are no self-definitional steps, fitted inputs renamed as predictions, or load-bearing self-citations that reduce the claimed linkage performance to the inputs by construction. The work is self-contained against external benchmarks via direct testing.
Axiom & Free-Parameter Ledger
axioms (1)
- domain assumption Standard skull-stripping and preprocessing pipelines preserve participant-specific brain features sufficient for image similarity linkage.
Reference graph
Works this paper leans on
-
[1]
Data linkage multiplies research insights across diverse healthcare sectors,
T. K. Eisinger-Mathason, J. Leshin, V . Lahoti, D. B. Fridsma, V . Mu- caj, and A. N. Kho, “Data linkage multiplies research insights across diverse healthcare sectors,”Communications Medicine, vol. 5, no. 1, p. 58, 2025
work page 2025
-
[2]
K. Packh ¨auser, S. G ¨undel, N. M ¨unster, C. Syben, V . Christlein, and A. Maier, “Deep learning-based patient re-identification is able to exploit the biometric nature of medical chest X-ray data,”Scientific Reports, vol. 12, no. 1, p. 14851, 2022
work page 2022
-
[3]
Estimating the success of re-identifications in incomplete datasets using generative models,
L. Rocher, J. M. Hendrickx, and Y .-A. De Montjoye, “Estimating the success of re-identifications in incomplete datasets using generative models,”Nature communications, vol. 10, no. 1, p. 3069, 2019
work page 2019
-
[4]
D. Barth-Jones, “The’re-identification’of governor William Weld’s medical information: a critical re-examination of health data identi- fication risks and privacy protections, then and now,”Then and Now (July 2012), 2012
work page 2012
-
[5]
Robust de-anonymization of large sparse datasets,
A. Narayanan and V . Shmatikov, “Robust de-anonymization of large sparse datasets,” in2008 IEEE Symposium on Security and Privacy (sp 2008). IEEE, 2008, pp. 111–125
work page 2008
-
[6]
Identifying personal genomes by surname inference,
M. Gymrek, A. L. McGuire, D. Golan, E. Halperin, and Y . Erlich, “Identifying personal genomes by surname inference,”Science, vol. 339, no. 6117, pp. 321–324, 2013
work page 2013
-
[7]
European Union, “Regulation (EU) 2016/679 of the European Parlia- ment and of the Council of 27 April 2016 on the protection of natural persons with regard to the processing of personal data and on the free movement of such data (General Data Protection Regulation),” https://eur-lex.europa.eu/eli/reg/2016/679/oj, 2016, official Journal L 119, 4 May 2016, ...
work page 2016
-
[8]
Health Insurance Portability and Accountability Act of 1996,
U.S. Congress, “Health Insurance Portability and Accountability Act of 1996,” https://www.govinfo.gov/app/details/PLAW-104publ191, 1996, public Law 104-191, enacted August 21, 1996. Accessed: 2025-05-23
work page 1996
-
[9]
Parliament of Australia, “Privacy act 1988,” Act C2004A03712 (as amended), 1988, federal Register of Legislation, latest consolidated version. [Online]. Available: https://www.legislation. gov.au/C2004A03712/latest/text
work page 1988
-
[10]
Facial recognition from volume- rendered magnetic resonance imaging data,
F. W. Prior, B. Brunsden, C. Hildebolt, T. S. Nolan, M. Pringle, S. N. Vaishnavi, and L. J. Larson-Prior, “Facial recognition from volume- rendered magnetic resonance imaging data,”IEEE Transactions on Information Technology in Biomedicine, vol. 13, no. 1, pp. 5–9, 2008
work page 2008
-
[11]
J. C. Mazura, K. Juluru, J. J. Chen, T. A. Morgan, M. John, and E. L. Siegel, “Facial recognition software success rates for the identification of 3D surface reconstructed facial images: implications for patient privacy and security,”Journal of digital imaging, vol. 25, no. 3, pp. 347–351, 2012
work page 2012
-
[12]
A technique for the deidentification of structural brain MR images,
A. Bischoff-Grethe, I. B. Ozyurt, E. Busa, B. T. Quinn, C. Fennema- Notestine, C. P. Clark, S. Morris, M. W. Bondi, T. L. Jernigan, A. M. Daleet al., “A technique for the deidentification of structural brain MR images,”Human brain mapping, vol. 28, no. 9, pp. 892–903, 2007
work page 2007
-
[13]
Quickshear Defacing for Neuroimages
N. Schimke and J. Hale, “Quickshear Defacing for Neuroimages.” HealthSec, vol. 11, p. 11, 2011
work page 2011
-
[14]
C. Gao, K. Xu, M. E. Kim, L. Zuo, Z. Li, D. B. Archer, T. J. Hohman, A. Z. Moore, L. Ferrucci, L. L. Beason-Held, S. M. Resnick, C. Davatzikos, J. L. Prince, and B. A. Landman, “Pitfalls of defacing whole-head MRI: re-identification risk with diffusion models and compromised research potential,”Computers in Biology and Medicine, vol. 197, p. 111112, 2025....
work page 2025
-
[15]
D. Eke, I. E. Aasebø, S. Akintoye, W. Knight, A. Karakasidis, E. Mikulan, P. Ochang, G. Ogoh, R. Oostenveld, A. Pigorini, B. C. Stahl, T. White, and L. Zehl, “Pseudonymisation of neuroimages and data protection: Increasing access to data while retaining scientific utility,”Neuroimage: Reports, vol. 1, no. 4, p. 100053, 2021. [Online]. Available: ttps://do...
-
[16]
Identification of individual subjects on the basis of their brain anatomical features,
S. A. Valizadeh, F. Liem, S. M ´erillat, J. H ¨anggi, and L. J ¨ancke, “Identification of individual subjects on the basis of their brain anatomical features,”Scientific reports, vol. 8, no. 1, p. 5611, 2018
work page 2018
-
[17]
Identification of individual subjects based on neuroanatomical measures obtained 7 years earlier,
L. J ¨ancke and S. A. Valizadeh, “Identification of individual subjects based on neuroanatomical measures obtained 7 years earlier,”Euro- pean Journal of Neuroscience, vol. 56, no. 5, pp. 4642–4652, 2022
work page 2022
-
[18]
Brainprint: A discriminative characterization of brain morphology,
C. Wachinger, P. Golland, W. Kremen, B. Fischl, and M. Reuter, “Brainprint: A discriminative characterization of brain morphology,” NeuroImage, vol. 109, pp. 232–248, 2015. [Online]. Available: https: //www.sciencedirect.com/science/article/pii/S1053811915000476
work page 2015
-
[19]
Deepbrainprint: A novel contrastive framework for brain mri re-identification,
L. Puglisi, F. Barkhof, D. C. Alexander, G. J. M. Parker, A. Eshaghi, and D. Rav `ı, “Deepbrainprint: A novel contrastive framework for brain mri re-identification,” inInternational Conference on Medical Imaging with Deep Learning, 2023. [Online]. Available: https://api.semanticscholar.org/CorpusID:257219665
work page 2023
-
[20]
L. Chauvin, K. Kumar, C. Wachinger, M. Vangel, J. de Guise, C. Desrosiers, W. Wells, M. Toews, A. D. N. Initiativeet al., “Neuroimage signature from salient keypoints is highly specific to individuals and shared by close relatives,”NeuroImage, vol. 204, p. 116208, 2020
work page 2020
-
[21]
The WU-Minn Human Connectome Project: An overview,
D. C. Van Essen, S. M. Smith, D. M. Barch, T. E. J. Behrens, E. Yacoub, K. Ugurbil, and W.-M. H. Consortium, “The WU-Minn Human Connectome Project: An overview,” NeuroImage, vol. 80, pp. 62–79, 2013. [Online]. Available: https://doi.org/10.1016/j.neuroimage.2013.05.041
-
[22]
Brain imaging generation with latent diffusion models,
W. H. Pinaya, P.-D. Tudosiu, J. Dafflon, P. F. Da Costa, V . Fernandez, P. Nachev, S. Ourselin, and M. J. Cardoso, “Brain imaging generation with latent diffusion models,” inMICCAI Workshop on Deep Gener- ative Models. Springer, 2022, pp. 117–126
work page 2022
-
[23]
W. H. L. Pinaya, P.-D. Tudosiu, J. Dafflon, P. F. Da Costa, V . Fernandez, P. Nachev, S. Ourselin, and M. J. Cardoso, “LDM 100k Dataset,” 2023, available from Academic Torrents. [Online]. Available: https://academictorrents.com/details/ 63aeb864bbe2115ded0aa0d7d36334c026f0660b
work page 2023
-
[24]
E. J. Rizor, V . Babenko, N. M. Dundon, R. Beverly-Aylwin, A. Stump, M. Hayes, L. Herschenfeld-Catalan, E. G. Jacobs, and S. T. Grafton, “Hormone Health Study (HHS),” 2024. [Online]. Available: https://doi.org/10.18112/openneuro.ds005360.v1.0.0
-
[25]
Dynamic Allostatic Modulation During Appraisal, Cognitive Challenge, and Across the Menstrual Cycle,
V . Babenko, “Dynamic Allostatic Modulation During Appraisal, Cognitive Challenge, and Across the Menstrual Cycle,” Ph.D. dissertation, University of California, 2023, order No. 30246092. Available from Dissertations & Theses @ University of California; ProQuest Dissertations & Theses A&I; Publicly Available Content Database. (2810870047). [Online]. Avail...
-
[26]
E. J. Rizor, V . Babenko, N. M. Dundon, R. Beverly-Aylwin, A. Stump, M. Hayes, L. Herschenfeld-Catalan, E. G. Jacobs, and S. T. Grafton, “Menstrual cycle-driven hormone concentrations co-fluctuate with white and gray matter architecture changes across the whole brain,” Human Brain Mapping, vol. 45, no. 11, p. e26785, 2024
work page 2024
-
[27]
P. Klepits, K. Koschutnig, T. Zussner, and A. Fink, “Effects of a seven-week running intervention with moderate intensity on the volume of the hippocampus and depressive symptoms in young men from the general population.” 2024. [Online]. Available: https://doi.org/10.18112/openneuro.ds004937.v1.0.0
-
[28]
DWI Traveling Human Phantom Study,
V . A. Magnotta, J. T. Matsui, D. Liu, H. J. Johnson, J. D. Long, B. D. B. Jr, B. A. Mueller, K. Lim, S. Mori, K. G. Helmer, J. A. Turner, S. Reading, M. J. Lowe, E. Aylward, L. A. Flashman, G. Bonett, and J. S. Paulsen, “DWI Traveling Human Phantom Study,” 2020. [Online]. Available: https://doi.org/10.18112/openneuro. ds000206.v1.0.0
-
[29]
Multicenter reliability of diffusion tensor imaging,
V . A. Magnotta, J. T. Matsui, D. Liu, H. J. Johnson, J. D. Long, B. D. Bolster Jr, B. A. Mueller, K. Lim, S. Mori, K. G. Helmer et al., “Multicenter reliability of diffusion tensor imaging,”Brain connectivity, vol. 2, no. 6, pp. 345–355, 2012
work page 2012
-
[30]
San Diego State University Traveling Subjects Diffusion MRI (SDSU- TS) Dataset,
J. Hau, S. Scarlett, and G. A. de Oliveira Campos, “San Diego State University Traveling Subjects Diffusion MRI (SDSU- TS) Dataset,” 2025. [Online]. Available: https://doi.org/10.18112/ openneuro.ds005664.v1.1.2
work page 2025
-
[31]
CAT: A computational anatomy toolbox for the analysis of structural MRI data,
C. Gaser, R. Dahnke, P. M. Thompson, F. Kurth, E. Luders, and The Alzheimer’s Disease Neuroimaging Initiative, “CAT: A computational anatomy toolbox for the analysis of structural MRI data,”Gigascience,, vol. 13, p. giae049, Jan. 2024. [Online]. Available: https://doi.org/10.1093/gigascience/giae049
-
[32]
Unbiased average age- appropriate atlases for pediatric studies,
V . Fonov, A. C. Evans, K. Botteron, C. R. Almli, R. C. McKinstry, D. L. Collins, B. D. C. Groupet al., “Unbiased average age- appropriate atlases for pediatric studies,”Neuroimage, vol. 54, no. 1, pp. 313–327, 2011
work page 2011
-
[33]
A reproducible evaluation of ants similarity metric performance in brain image registration,
B. B. Avants, N. J. Tustison, G. Song, P. A. Cook, A. Klein, and J. C. Gee, “A reproducible evaluation of ants similarity metric performance in brain image registration,”Neuroimage, vol. 54, no. 3, pp. 2033– 2044, 2011
work page 2033
-
[34]
Deepbet: Fast brain extraction of T1-weighted MRI using Convolutional Neural Networks,
L. Fisch, S. Zumdick, C. Barkhau, D. Emden, J. Ernsting, R. Leenings, K. Sarink, N. R. Winter, B. Risse, U. Dannlowskiet al., “Deepbet: Fast brain extraction of T1-weighted MRI using Convolutional Neural Networks,”Computers in Biology and Medicine, vol. 179, p. 108845, 2024
work page 2024
-
[35]
J. Samper-Gonz ´alez, N. Burgos, S. Bottani, S. Fontanella, P. Lu, A. Marcoux, A. Routier, J. Guillon, M. Bacci, J. Wenet al., “Repro- ducible evaluation of classification methods in Alzheimer’s disease: Framework and application to MRI and PET data,”NeuroImage, vol. 183, pp. 504–521, 2018
work page 2018
-
[36]
Clinica: An open-source software platform for reproducible clinical neuroscience studies,
A. Routier, N. Burgos, M. D ´ıaz, M. Bacci, S. Bottani, O. El-Rifai, S. Fontanella, P. Gori, J. Guillon, A. Guyotet al., “Clinica: An open-source software platform for reproducible clinical neuroscience studies,”Frontiers in neuroinformatics, vol. 15, p. 689675, 2021
work page 2021
-
[37]
J. Ashburner and K. J. Friston, “Unified segmentation,”neuroimage, vol. 26, no. 3, pp. 839–851, 2005
work page 2005
-
[38]
Adaptive non-local means denoising of MR images with spatially varying noise levels,
J. V . Manj ´on, P. Coup´e, L. Mart´ı-Bonmat´ı, D. L. Collins, and M. Rob- les, “Adaptive non-local means denoising of MR images with spatially varying noise levels,”Journal of Magnetic Resonance Imaging, vol. 31, no. 1, pp. 192–203, 2010
work page 2010
-
[39]
Diffeomorphic Registration Using Geodesic Shooting and Gauss-Newton optimisation,
J. Ashburner and K. J. Friston, “Diffeomorphic Registration Using Geodesic Shooting and Gauss-Newton optimisation,”Neuroimage,, vol. 55, no. 3, pp. 954–967, Apr. 2011. [Online]. Available: https://doi.org/10.1016/j.neuroimage.2010.12.049
-
[40]
M. J. Swain and D. H. Ballard, “Color indexing,”International journal of computer vision, vol. 7, no. 1, pp. 11–32, 1991
work page 1991
-
[41]
Functional connectome fingerprinting: identifying individuals using patterns of brain connectivity,
E. S. Finn, X. Shen, D. Scheinost, M. D. Rosenberg, J. Huang, M. M. Chun, X. Papademetris, and R. T. Constable, “Functional connectome fingerprinting: identifying individuals using patterns of brain connectivity,”Nature Neuroscience, vol. 18, no. 11, pp. 1664–1671, 2015. [Online]. Available: https://doi.org/10.1038/nn.4135
-
[42]
E. Amico and J. Go ˜ni, “The quest for identifiability in human functional connectomes,”Scientific Reports, vol. 8, p. 8254, 2018. [Online]. Available: https://doi.org/10.1038/s41598-018-25089-1
-
[43]
M. Ogg and L. Kitchell, “Large-Scale Functional Connectome Finger- printing for Generalization and Transfer Learning in Neuroimaging,” bioRxiv, pp. 2024–02, 2024
work page 2024
-
[44]
Guidelines 01/2025 on pseudonymi- sation,
European Data Protection Board, “Guidelines 01/2025 on pseudonymi- sation,” Jan. 2025, adopted on 16–17 January 2025, for public consultation. [Online]. Available: https://www.edpb.europa.eu/system/ files/2025-01/edpb guidelines 202501 pseudonymisation en.pdf
work page 2025
-
[45]
Patrick Breyer v Bundesrepublik Deutschland,
Judgment of 19 October 2016, “Patrick Breyer v Bundesrepublik Deutschland,” C-582/14, EU:C:2016:779. [Online]. Available: https: //curia.europa.eu/juris/liste.jsf?num=C-582/14
work page 2016
-
[46]
Gesamtverband Autoteile-Handel eV v Scania CV AB,
Judgment of 9 November 2023, “Gesamtverband Autoteile-Handel eV v Scania CV AB,” C-319/22, EU:C:2023:837. [Online]. Available: https://curia.europa.eu/juris/documents.jsf?num=C-319/22
work page 2023
-
[47]
European Data Protection Supervisor v Single Resolution Board,
Judgment of 4 September 2025, “European Data Protection Supervisor v Single Resolution Board,” C-413/23 P, EU:C:2025:645. [Online]. Available: https://curia.europa.eu/juris/liste.jsf?num=C-413/ 23&language=en
work page 2025
-
[48]
Image Quality Assessment Based on Gradient Similarity,
A. Liu, W. Lin, and M. Narwaria, “Image Quality Assessment Based on Gradient Similarity,”IEEE Transactions on Image Processing, vol. 21, no. 4, pp. 1500–1512, 2012
work page 2012
-
[49]
Image quality assessment: from error visibility to structural similarity,
Z. Wang, A. Bovik, H. Sheikh, and E. Simoncelli, “Image quality assessment: from error visibility to structural similarity,”IEEE Trans- actions on Image Processing, vol. 13, no. 4, pp. 600–612, 2004
work page 2004
-
[50]
Multiscale structural similarity for image quality assessment,
Z. Wang, E. P. Simoncelli, and A. C. Bovik, “Multiscale structural similarity for image quality assessment,” inThe thrity-seventh asilo- mar conference on signals, systems & computers, 2003, vol. 2. Ieee, 2003, pp. 1398–1402
work page 2003
-
[51]
Structural similarity index family for image quality assessment in radiological images,
G. P. Renieblas, A. T. Nogu ´es, A. M. Gonz ´alez, N. G ´omez-Leon, and E. G. Del Castillo, “Structural similarity index family for image quality assessment in radiological images,”Journal of medical imaging, vol. 4, no. 3, pp. 035 501–035 501, 2017
work page 2017
-
[52]
GANs Trained by a Two Time-Scale Update Rule Converge to a Local Nash Equilibrium,
M. Heusel, H. Ramsauer, T. Unterthiner, B. Nessler, and S. Hochreiter, “GANs Trained by a Two Time-Scale Update Rule Converge to a Local Nash Equilibrium,” inAdvances in Neural Information Processing Systems, I. Guyon, U. V . Luxburg, S. Bengio, H. Wallach, R. Fergus, S. Vishwanathan, and R. Garnett, Eds., vol. 30. Curran Associates, Inc., 2017. [Online]....
work page 2017
-
[53]
Mutual Information (MI):MI measures how much the intensity distribution of one image decreases the entropy of the other. Unlike correlation, MI captures nonlinear re- lationships, making it effective for comparing images from different modalities. MI was computed as: MI = X x X y p(x, y) log p(x, y) p(x)p(y) , wherep(x, y)is the joint probability of inten...
-
[54]
It is robust to intensity scaling differences and is widely used in multimodal image registration
Normalized Mutual Information (NMI):NMI measures the shared information between two images by comparing their joint and marginal entropy. It is robust to intensity scaling differences and is widely used in multimodal image registration. The measure was computed as NMI = MIp H(X)H(Y) , whereMIis the mutual information, and the marginal entropies are define...
-
[55]
Negative Mean Squared Error (NMSE):NMSE calcu- lates the average squared difference between corresponding voxels, multiplied by−1. It is simple and widely used, but sensitive to outliers and does not always reflect perceptual similarity. The measure was computed as NMSE =− 1 N X i (Xi −Y i)2
-
[56]
Peak Signal-to-Noise Ratio (PSNR):PSNR is derived from MSE, and it measures the ratio between the maximum possible signal intensity and the distortion introduced. The measure was computed as PSNR = 10 log10 L2 MSE , whereLis the maximum possible voxel intensity value, and MSE is the mean squared error between the images (- NMSE)
-
[57]
It ranges from−1to+1, where+1indicates perfect linear similarity
Pearson’s Correlation Coefficient (PCC):PCC mea- sures the linear correlation between two images by compar- ing the covariation of their voxel intensity values. It ranges from−1to+1, where+1indicates perfect linear similarity. This measure is useful when the relative pattern of intensities matters more than absolute differences. The measure was computed a...
-
[58]
Cosine Similarity (CosSim):CosSim measures the cosine of the angle between two flattened image vectors. It evaluates whether the images point in the same direction in a high-dimensional space , independent of their magnitude. Values range from−1to+1, with+1indicating identical patterns up to a scale factor. We used the open-sourcetorch.nn.functional modul...
-
[59]
Gradient Similarity (GradSim):GradSim [48] com- pares the spatial gradient magnitudes (edge strength) of two images rather than their raw intensity values. It evaluates the preservation of edges, contours, and intensity transitions associated with image structure. This measure between two 3D imagesXandYwas computed voxel-wise as GradSim = 2|∇X i| |∇Yi|+C ...
-
[60]
Values range from−1to1, with 1indicating perfect structural similarity
Structural Similarity Index (SSIM):SSIM [49] as- sesses image similarity using three components: luminance, contrast, and structure. Values range from−1to1, with 1indicating perfect structural similarity. The measure was computed as SSIM = (2µX µY +C 1)(2σXY +C 2) (µ2 X +µ 2 Y +C 1)(σ2 X +σ 2 Y +C 2) , whereµ X andµ Y are the mean intensities,σ 2 X andσ 2...
-
[61]
Multi-Scale Structural Similarity (MS-SSIM):MS- SSIM [50] extends SSIM by evaluating similarity across multiple image resolutions. The measure was computed as MS-SSIM = Y j lαj j cβj j sγj j , where the luminance, contrast, and structure comparisons at scalejare given by lj = 2µXj µYj +C 1 µ2 Xj +µ 2 Yj +C 1 , c j = 2σXj σYj +C 2 σ2 Xj +σ 2 Yj +C 2 , sj =...
-
[62]
Four-Component Gradient-Regularized SSIM (4-G-R- SSIM):Four-Component Gradient-Regularized SSIM (4-G- R-SSIM) [51] extends the standard SSIM by evaluating structural similarity on directional image gradients, thereby increasing sensitivity to edge information and structural distortions. The method computes SSIM on gradient images in four orientations and ...
-
[63]
Negative Fr ´echet Inception Distance (NFID):NFID
-
[64]
generated) using deep feature embed- dings
measures the similarity between two distributions of images (e.g., real vs. generated) using deep feature embed- dings. It computes the distance between their multivariate Gaussian statistics (means and covariances). However, for comparing pairs of 3D MRI volumes, we used an MRI- adapted version of NFID. Unlike the original formulation, which compares dis...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.