SEARCH · Search NASA

Results for “translational invariance”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 19 records

All sources NASA NTRS DOE OSTI

NASA NTRS1997

Scope and applications of translation invariant wavelets to image registration

The first part of this article introduces the notion of translation invariance in wavelets and discusses several wavelets that have this property. The second part discusses the possible applications of such wavelets to image registration. In the case of registration of affinely transformed images, we would conclude that the notion of translation invariance is not really necessary. What is needed is affine invariance and one way to do this is via the method of moment invariants. Wavelets or, in general, pyramid processing can then be combined with the method of moment invariants to reduce the computational load.

Chettri, Samir↗

DOE OSTI2024

Solving a class of infinite-dimensional tensor eigenvalue problems by translational invariant tensor ring approximations

Here, we examine a method for solving an infinite-dimensional tensor eigenvalue problem Hx = λx, where the infinite-dimensional symmetric matrix H exhibits a translational invariant structure. We provide a formulation of this type of problem from a numerical linear algebra point of view and describe how a power method applied to e -Ht is used to obtain an approximation to the desired eigenvector. This infinite-dimensional eigenvector is represented in a compact way by a translational invariant infinite Tensor Ring (iTR). Low rank approximation is used to keep the cost of subsequent power iterations bounded while preserving the iTR structure of the approximate eigenvector. We show how the averaged Rayleigh quotient of an iTR eigenvector approximation can be efficiently computed and introduce a projected residual to monitor its convergence. In the numerical examples, we illustrate that the norm of this projected iTR residual can also be used to automatically modify the time step to ensure accurate and rapid convergence of the power method.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1999

An Application of Rotation- and Translation-Invariant Overcomplete Wavelets to the Registration of Remotely Sensed Imagery

A wavelet-based image registration approach has previously been proposed by the authors. In this work, wavelet coefficient maxima obtained from an orthogonal wavelet decomposition using Daubechies filters were utilized to register images in a multi-resolution fashion. Tested on several remote sensing datasets, this method gave very encouraging results. Despite the lack of translation-invariance of these filters, we showed that when using cross-correlation as a feature matching technique, features of size larger than twice the size of the filters are correctly registered by using the low-frequency subbands of the Daubechies wavelet decomposition. Nevertheless, high-frequency subbands are still sensitive to translation effects. In this work, we are considering a rotation- and translation-invariant representation developed by E. Simoncelli and integrate it in our image registration scheme. The two types of filters, Daubechies and Simoncelli filters, are then being compared from a registration point of view, utilizing synthetic data as well as data from the Landsat/ Thematic Mapper (TM) and from the NOAA Advanced Very High Resolution Radiometer (AVHRR).

LeMoigne, Jacqueline↗

NASA NTRS1999

An Application of Rotation- and Translation-Invariant Overcomplete Wavelets to the registration of Remotely Sensed Imagery

LeMoigne, Jacqueline↗

NASA NTRS1987

Optical generation of a circular harmonic filter for rotation and translation invariant optical pattern recognition

A new method to generate a circular harmonic filter with both rotation and translation invariance is described, which is based on a phase-shifted double-exposure (PSDE) technique. An expression for the peak correlation intensity at the origin for the correlation plane as a function of target orientation for the PSDE filter is derived. Experimental results confirming the theoretical predictions are provided.

Cheng, Yeou-Yen↗

DOE OSTI2026

Translation-Invariant Quantum Algorithms for Ordered Search are Optimal

Ordered search is the task of finding an item in an ordered list using comparison queries. The best exact classical algorithm for this fundamental problem uses [log 2 n] queries for a list of length n. Quantum computers can achieve a constant-factor speedup, but the best possible coefficient of log 2 n for exact quantum algorithms is only known to lie between (ln2)/π ≈ 0.221 and 4/log 2 605 ≈ 0.4333. We consider a special class of translation-invariant algorithms with no workspace, introduced by Farhi, Goldstone, Gutmann, and Sipser, that has been used to find the best known upper bounds. First, we show that any bounded-error, k-query quantum algorithm for ordered search can be implemented by a k-query algorithm in this special class. Second, we use linear programming to show that the best exact 5-query quantum algorithm can search a list of length 7265, giving an ordered search algorithm that asymptotically uses 5 log 7265 n ≈ 0.390 log 2 n quantum queries.

Translation-invariant quantum algorithms↗

DOE OSTI2024

Filling constraints on translation invariant dipole conserving systems

Systems with conserved dipole moment have drawn considerable interest in light of their realization in recent experiments on tilted optical lattices. Here, an important question for such systems is delineating the conditions under which they admit a unique gapped ground state that is consistent with all symmetries. Here, we study one-dimensional translation-invariant lattices that conserve U(1) charge and Z L dipole moment, where discreteness of the dipole symmetry is enforced by periodic boundary conditions, with L the system size. We show that in these systems, a symmetric, gapped, and non-degenerate ground state requires not only integer charge filling, but also a fixed value of the dipole filling, while other fractional dipole fillings enforce either a gapless or symmetry-breaking ground state. In contrast with prior results in the literature, we find that the dipole filling constraint depends both on the charge filling as well as the system size, emphasizing the subtle interplay of dipole symmetry with boundary conditions. We support our results with numerical simulations and exact results.

1-dimensional systems↗

DOE OSTI2025

How does ion temperature gradient turbulence depend on magnetic geometry? Insights from data and machine learning

Magnetic geometry has a significant effect on the level of turbulent transport in fusion plasmas. Here, we model and analyse this dependence using multiple machine learning methods and a dataset of >200 000 nonlinear gyrokinetic simulations of ion-temperature-gradient turbulence in diverse non-axisymmetric geometries. The dataset is generated using a large collection of both optimised and randomly generated stellarator equilibria. At fixed gradients and other input parameters, the turbulent heat flux varies between geometries by several orders of magnitude. Trends are apparent among the configurations with particularly high or particularly low heat flux. Regression and classification techniques from machine learning are then applied to extract patterns in the dataset. Due to a symmetry of the gyrokinetic equation, the heat flux and regressions thereof should be invariant to translations of the raw features in the parallel coordinate, similar to translation invariance in computer vision applications. Multiple regression models including convolutional neural networks (CNNs) and decision trees can achieve reasonable predictive power for the heat flux in held-out test configurations, with highest accuracy for the CNNs. Using Spearman correlation, sequential feature selection and Shapley values to measure feature importance, it is consistently found that the most important geometric lever on the heat flux is the flux surface compression in regions of bad curvature. The second most important geometric feature relates to the magnitude of geodesic curvature. These two features align remarkably with surrogates that have been proposed based on theory, while the methods here allow a natural extension to more features for increased accuracy. The dataset, released with this publication, may also be used to test other proposed surrogates, and we find that many previously published proxies do correlate well with both the heat flux and stability boundary.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2024

Celestial leaf amplitudes

Celestial amplitudes may be decomposed as weighted integrals of AdS 3 -Witten diagrams associated to each leaf of a hyperbolic foliation of spacetime. We show, for the Kleinian three-point MHV amplitude, that each leaf subamplitude is smooth except for the expected light-cone singularities. Moreover, we find that the full translationally-invariant celestial amplitude is simply the residue of the pole in the leaf amplitude at the point where the total conformal weights of the gluons equals three. This full celestial amplitude vanishes up to light-cone contact terms, as required by spacetime translation invariance, and reduces to the expression previously derived by Mellin transformation of the Parke-Taylor formula.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2024

Ab initio leading order effective potential for elastic proton scattering based on the symmetry-adapted no-core shell model

Calculating microscopic optical potentials for elastic scattering at intermediate energies from light nuclei in an ab initio fashion within the Watson expansion has been established within the last few years. Based on the Watson expansion of the multiple scattering series, we employ a nonlocal translationally invariant nuclear density derived within the symmetry-adapted no-core shell model (SA-NCSM) framework from a chiral next-to-next-to-leading order (NNLO) nucleon-nucleon interaction and the very same interaction for a consistent full-folding calculation of the effective (optical) potential for nucleon-nucleus scattering for medium-heavy nuclei. The leading order effective (optical) folding potential is computed by integrating over a translationally invariant SA-NCSM one-body scalar density, spin-projected momentum distribution, and the Wolfenstein amplitudes 𝐴, 𝐶, and 𝑀. The resulting nonlocal potentials serve as input for a momentum space Lippmann-Schwinger equation. In the SA-NCSM, the model space is systematically up-selected using Sp⁡(3,ℝ) symmetry considerations. For the light nucleus of 6 He, we establish a systematic selection scheme in the SA-NCSM for scattering observables. Then, we apply this scheme to calculations of scattering observables, such as differential cross sections, analyzing powers, and spin rotation functions for elastic proton scattering from 20 Ne and 40 Ca in the energy regime between 65 and 200 MeV, and compare to available data. Furthermore, our calculations show that the leading order effective nucleon-nucleus potential in the Watson expansion of multiple scattering theory obtained from an up-selected SA-NCSM model space describes 40 Ca elastic scattering observables reasonably well to about 60 degrees in the center-of-mass frame, which coincides roughly with the validity of the NNLO chiral interaction used to calculate both the nucleon-nucleon amplitudes and the one-body scalar and spin nuclear densities.

Ab initio calculations↗

NASA NTRS1990

Connectivity strategies for higher-order neural networks applied to pattern recognition

Different strategies for non-fully connected HONNs (higher-order neural networks) are discussed, showing that by using such strategies an input field of 128 x 128 pixels can be attained while still achieving in-plane rotation and translation-invariant recognition. These techniques allow HONNs to be used with the larger input scenes required for practical pattern-recognition applications. The number of interconnections that must be stored has been reduced by a factor of approximately 200,000 in a T/C case and about 2000 in a Space Shuttle/F-18 case by using regional connectivity. Third-order networks have been simulated using several connection strategies. The method found to work best is regional connectivity. The main advantages of this strategy are the following: (1) it considers features of various scales within the image and thus gets a better sample of what the image looks like; (2) it is invariant to shape-preserving geometric transformations, such as translation and rotation; (3) the connections are predetermined so that no extra computations are necessary during run time; and (4) it does not require any extra storage for recording which connections were formed.

Spirkovska, Lilly↗

DOE OSTI2024

Physics and chemistry from parsimonious representations: image analysis via invariant variational autoencoders

Electron, optical, and scanning probe microscopy methods are generating ever increasing volume of image data containing information on atomic and mesoscale structures and functionalities. This necessitates the development of the machine learning methods for discovery of physical and chemical phenomena from the data, such as manifestations of symmetry breaking phenomena in electron and scanning tunneling microscopy images, or variability of the nanoparticles. Variational autoencoders (VAEs) are emerging as a powerful paradigm for the unsupervised data analysis, allowing to disentangle the factors of variability and discover optimal parsimonious representation. Here, we summarize recent developments in VAEs, covering the basic principles and intuition behind the VAEs. The invariant VAEs are introduced as an approach to accommodate scale and translation invariances present in imaging data and separate known factors of variations from the ones to be discovered. We further describe the opportunities enabled by the control over VAE architecture, including conditional, semi-supervised, and joint VAEs. Several case studies of VAE applications for toy models and experimental datasets in Scanning Transmission Electron Microscopy are discussed, emphasizing the deep connection between VAE and basic physical principles. Python codes and datasets discussed in this article are available at https://github.com/saimani5/VAE-tutorials and can be used by researchers as an application guide when applying these to their own datasets.

36 MATERIALS SCIENCE↗

DOE OSTI2025

Operator dynamics in Floquet many-body systems

We study operator dynamics in many-body quantum systems, focusing on generic features of systems that are ergodic, spatially extended, and lack conserved densities. Quantum circuits of various types provide simple models for such systems. We focus on Floquet quantum circuits, comparing their behavior with what has been found previously for circuits that are random in time. Floquet circuits, which have discrete time-translation symmetry, represent an intermediate case between circuits that are random in time and lack any symmetry, and systems with a time-independent Hamiltonian and continuous time-translation invariance. By making this comparison, one of our aims is to identify signatures of time-translation symmetry in Floquet operator dynamics. To characterize behavior we examine a variety of quantities in solvable models and numerically: operator autocorrelation functions; the partial spectral form factor; the out-of-time-order correlator (OTOC); and the paths in operator space that make the dominant contributions to the ensemble-averaged autocorrelation functions. Our most striking result is that ensemble-averaged autocorrelation functions show behavior that is distinctively different in Floquet systems compared to systems in which successive time-steps are independent. Specifically, while average autocorrelation functions decay on a microscopic timescale for circuits that are random in time, in Floquet systems they have a late-time tail with a duration that grows parametrically with the size of the operator support. In the simplest models this tail is separated from the initial decay by a minimum, so that the average autocorrelation function has an intermediate-time peak. The existence of these tails provides a way to understand deviations of the spectral form factor from random matrix behavior at times shorter than the Thouless time. In contrast to this feature in autocorrelation functions, we find no new aspects to the behavior of OTOCs for Floquet models compared to random-in-time circuits. We show that this difference between averaged autocorrelation functions and OTOCs can be understood in terms of the paths in operator space that contribute to the two quantities: paths for the former retain a limited support at late times, while paths for the latter are dominated by operator spreading. Published by the American Physical Society 2025

Yoshimura, Takato (ORCID:0000000309159846)↗

NASA NTRS1990

Learning receptor positions from imperfectly known motions

An algorithm is described for learning image interpolation functions for sensor arrays whose sensor positions are somewhat disordered. The learning is based on failures of translation invariance, so it does not require knowledge of the images being presented to the visual system. Previously reported implementations of the method assumed the visual system to have precise knowledge of the translations. It is demonstrated that translation estimates computed from the imperfectly interpolated images can have enough accuracy to allow the learning process to converge to a correct interpolation.

Ahumada, Albert J., Jr.↗

DOE OSTI2026

Infinite matrix product states for (1 + 1)-dimensional gauge theories

We present a matrix product operator construction that allows us to represent the lattice Hamiltonians of (abelian or non-abelian) gauge theories in a local and manifestly translation-invariant form. In particular, we use symmetric matrix product states and introduce link-enhanced matrix product operators (LEMPOs) that can act on both the physical and virtual spaces of the matrix product states. This construction allows us to study Hamiltonian lattice gauge theories on infinite lattices. As examples, we show how to implement this method to study the massless and massive one-flavor Schwinger model and adjoint QCD 2 .

confinement↗

DOE OSTI2025

Exact Ground State of Interacting Electrons in Magic Angle Graphene

One of the most remarkable theoretical findings in magic angle twisted bilayer graphene (TBG) is the emergence of ferromagnetic Slater determinants as exact ground states for the interacting Hamiltonian at the chiral limit. This discovery provides an explanation for the correlated insulating phase which has been experimentally observed at half filling. This work is the first mathematical study of interacting models in magic angle graphene systems. These include not only TBG but also TBG-like systems featuring four flat bands per valley, and twisted trilayer graphene systems with equal twist angles. We identify symmetries of the chiral limit of the Bistritzer-MacDonald Hamiltonian that are responsible for characterizing the Hartree-Fock ground states as zero energy many-body ground states. Furthermore, for a general class of Hamiltonian, we establish criteria that the ferromagnetic Slater determinants are the unique ground states within the class of uniformly half-filled, translation invariant Slater determinants. We then demonstrate that these criteria can be explicitly verified for TBG and TBG-like systems at the chiral limit, using properties of Jacobi-θ$${\theta }$$ and Weierstrass-℘$${\wp }$$ functions.

Becker, Simon↗

DOE OSTI2025

Architectures and random properties of symplectic quantum circuits

Parametrized and random unitary (or orthogonal) n-qubit circuits play a central role in quantum information. As such, one could naturally assume that circuits implementing symplectic transformations would attract similar attention. However, this is not the case, as $\mathbb{SP}(d/2)$—the group of d × d unitary symplectic matrices—has thus far been overlooked. In this work, we aim at starting to fill this gap. We begin by presenting a universal set of generators $\mathcal{G}$ for the symplectic algebra $\mathfrak{sp}(d/2)$, consisting of one- and two-qubit Pauli operators acting on neighboring sites in a one-dimensional lattice. Here, we uncover two critical differences between such set, and equivalent ones for unitary and orthogonal circuits. Namely, we find that the operators in $\mathcal{G}$ cannot generate arbitrary local symplectic unitaries and that they are not translationally invariant. We then review the Schur–Weyl duality between the symplectic group and the Brauer algebra, and use tools from Weingarten calculus to prove that Pauli measurements at the output of Haar random symplectic circuits can converge to Gaussian processes. As a by-product, such analysis provides us with concentration bounds for Pauli measurements in circuits that form t-designs over $\mathbb{SP}(d/2)$. To finish, we present tensor-network tools to analyze shallow random symplectic circuits, and we use these to numerically show that computational-basis measurements anti-concentrate at logarithmic depth.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2025

From disorganized data to emergent dynamic models: Questionnaires to partial differential equations

Starting with sets of disorganized observations of spatially varying and temporally evolving systems, obtained at different (also disorganized) sets of parameters, we demonstrate the data-driven derivation of parameter dependent, evolutionary partial differential equation (PDE) models capable of generating the data. This tensor type of data is reminiscent of shuffled (multidimensional) puzzle tiles. The independent variables for the evolution equations (their “space” and “time”) as well as their effective parameters are all emergent , i.e. determined in a data-driven way from our disorganized observations of behavior in them. We use a diffusion map based questionnaire approach to build a smooth parametrization of our emergent space/time/parameter space for the data. This approach iteratively processes the data by successively observing them on the “space,” the “time” and the “parameter” axes of a tensor. Once the data become organized, we use machine learning (here, neural networks) to approximate the operators governing the evolution equations in this emergent space. Our illustrative examples are based (i) on a simple advection–diffusion model; (ii) on a previously developed vertex-plus-signaling model of Drosophila embryonic development; and (iii) on two complex dynamic network models (one neuronal and one coupled oscillator model) for which no obvious smooth embedding geometry is known a priori. This allows us to discuss features of the process like symmetry breaking, translational invariance, and autonomousness of the emergent PDE model, as well as its interpretability.

generative models↗