The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
A Riemannian Framework for Tensor Computing
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Diffusion tensor imaging: Concepts and applications
Le Bihan, D., Mangin, J., Poupon, C., Clark, C. A., Pappata, S., Molko, N., & Chabriat, H. (2001) · Journal of Magnetic Resonance Imaging · doi:10.1002/jmri.1076 · Cited by 3,547
Probability, Convexity, and Harmonic Maps with Small Image I: Uniqueness and Fine Existence
Kendall, W. S. (1990) · Proceedings of the London Mathematical Society · doi:10.1112/plms/s3-61.2.371 · Cited by 281
Cited by
A fast diffeomorphic image registration algorithm
Ashburner, J. (2007) · NeuroImage · doi:10.1016/j.neuroimage.2007.07.007 · Cited by 8,122
Log-Euclidean metrics for fast and simple calculus on diffusion tensors
Arsigny, V., Fillard, P., Pennec, X., & Ayache, N. (2006) · Magnetic Resonance in Medicine · doi:10.1002/mrm.20965 · Cited by 1,113
Self-citationFree water elimination and mapping from diffusion MRI
Pasternak, O., Sochen, N., Gur, Y., Intrator, N., & Assaf, Y. (2009) · Magnetic Resonance in Medicine · doi:10.1002/mrm.22055 · Cited by 1,092
Geometric Means in a Novel Vector Space Structure on Symmetric Positive‐Definite Matrices
Arsigny, V., Fillard, P., Pennec, X., & Ayache, N. (2007) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/050637996 · Cited by 819
Self-citationStochastic Gradient Descent on Riemannian Manifolds
Bonnabel, S. (2013) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2013.2254619 · Cited by 540
Metadata
- Authors
- Pennec, X., Fillard, P., & Ayache, N.
- Venue
- International Journal of Computer Vision
- Published
- 2006-01
- Volume
- 66
- Issue
- 1
- Pages
- 41-66
- ISSN
- 0920-5691 (ISSN-L)
- 1573-1405
- OpenAlex
- W1983496390
- Cited by
- 1,550
- References
- 2
- FWCI
- 15.75
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A Riemannian Framework for Tensor Computing. https://app.cochat.ai/papers/10.1007/s11263-005-3222-z
- The paper
- Pennec, X., Fillard, P., & Ayache, N. (2006). A Riemannian Framework for Tensor Computing. International Journal of Computer Vision. https://doi.org/10.1007/s11263-005-3222-z
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
