Skip to content
AI Atlas
PaperActive

Symmetry-aware super-resolution of crystal orientation maps via invariant latent-space learning

arxiv.org/abs/2609.10898

quality89

Updated 2 h ago · first seen 11 Sept 2026

paper_01M294FQ9QFDZ89DFD35S3VYP2

Published
11 Sept 2026
T1 · 2 h ago
arXiv
2609.10898
T1 · 2 h ago
Category
cs.CV
T1 · 2 h ago

As of

Rewind the record: see this entity's attributes exactly as AI Atlas knew them on a given day.

Claim history

10 claims · 9 properties

Official pageofficial_url1

Claim history for Official page
ValueValid from → toStatusSourceConfidenceExtractor
https://arxiv.org/abs/2609.10898currentcurrentarXiv (Atom API + RSS)T1highdeterministic

Abstractabstract1

Claim history for Abstract
ValueValid from → toStatusSourceConfidenceExtractor
Crystal-orientation maps are physical fields defined only up to crystal symmetry; electron backscatter diffraction (EBSD) resolves them experimentally, but acquisition-time constraints limit spatial resolution. Unlike conventional images, EBSD data lie on the quotient space $\mathrm{SO}(3)/G$, where $G$ is the crystal-symmetry group. Standard Euclidean interpolation can therefore mix symmetry-equivalent representations and blur grain boundaries. We introduce the Symmetry-Group-Aware Super-Resolution Attention Network (SG-SRAN), which incorporates crystal symmetry and boundary preservation by design. A frozen, locally isometric encoder maps equivalent orientations to a common latent representation in which Euclidean distance approximates misorientation. Super-resolution is performed in this space, with each high-resolution token restricted to a feature-consistent local support to prevent cross-boundary mixing. A dictionary-based decoder then recovers valid orientations. Across FCC and HCP benchmarks, SG-SRAN matches 15-16 million parameter backbones using only 27-49k trainable parameters, while achieving the lowest p68 errors, highest inverse-pole-figure fidelity, and zero-shot transfer to unseen alloys.currentcurrentarXiv (Atom API + RSS)T1highdeterministic

Arxiv announce typearxiv_announce_type2

Claim history for Arxiv announce type
ValueValid from → toStatusSourceConfidenceExtractor
newcurrentcurrentarXiv (Atom API + RSS)T1highdeterministic
crosssupersededarXiv (Atom API + RSS)T1highdeterministic

arXiv idarxiv_id1

Claim history for arXiv id
ValueValid from → toStatusSourceConfidenceExtractor
2609.10898currentcurrentarXiv (Atom API + RSS)T1highdeterministic

Authorsauthors1

Claim history for Authors
ValueValid from → toStatusSourceConfidenceExtractor
Umang Garg, Warren Zamudio, McLean P. Echlin, Samantha H. Daly, Tresa M. Pollock, B. S. ManjunathcurrentcurrentarXiv (Atom API + RSS)T1highdeterministic

Categoriescategories1

Claim history for Categories
ValueValid from → toStatusSourceConfidenceExtractor
cs.CV, cond-mat.mtrl-sci, cs.LGcurrentcurrentarXiv (Atom API + RSS)T1highdeterministic

PDFpdf_url1

Claim history for PDF
ValueValid from → toStatusSourceConfidenceExtractor
https://arxiv.org/pdf/2609.10898currentcurrentarXiv (Atom API + RSS)T1highdeterministic

Primary categoryprimary_category1

Claim history for Primary category
ValueValid from → toStatusSourceConfidenceExtractor
cs.CVcurrentcurrentarXiv (Atom API + RSS)T1highdeterministic

Publishedpublished_at1

Claim history for Published
ValueValid from → toStatusSourceConfidenceExtractor
11 Sept 2026currentcurrentarXiv (Atom API + RSS)T1highdeterministic

Claims are temporal and append-only: a new observation closes the previous claim (valid_to) instead of overwriting it. Conflicting claims from different sources are kept side by side and flagged — never averaged. Methodology →