Search NASA⌕ Search

SEARCH · Search NASA

Results for “compact representation”

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.

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

At least 109 records · Page 6

A robust approach to 3D neuron shape representation for quantification and classification

We consider the problem of finding an accurate representation of neuron shapes, extracting sub-cellular features, and classifying neurons based on neuron shapes. In neuroscience research, the skeleton representation is often used as a compact and abstract representation of neuron shapes. However, existing methods are limited to getting and analyzing “curve” skeletons which can only be applied for tubular shapes. This paper presents a 3D neuron morphology analysis method for more general and complex neuron shapes. First, we introduce the concept of skeleton mesh to represent general neuron shapes and propose a novel method for computing mesh representations from 3D surface point clouds. A skeleton graph is then obtained from skeleton mesh and is used to extract sub-cellular features. Finally, an unsupervised learning method is used to embed the skeleton graph for neuron classification. Extensive experiment results are provided and demonstrate the robustness of our method to analyze neuron morphology.

3D neuron morphology↗

Modeling Flow and Transport in Fractured Rock using Machine Learning [Slides]

Fractured systems in the subsurface play a role in many natural and engineered applications such as geologic carbon sequestration, hydraulic fracturing and underground nuclear test detection. Structural information (fracture size, orientation, etc.) plays a key role in governing the dominant physics for these systems but can only be known statistically. Traditional modeling approaches either ignore or idealize structural information at these larger scales because we lack a computational framework that utilizes it in its entirety. The work presented here integrates computational physics, machine learning and graph theory to make a paradigm shift from computationally intensive high-fidelity models to coarse-scale graphs without loss of critical structural information. We exploit the underlying discrete structure of fracture networks in systems considering flow through fractures and fracture propagation. We demonstrate that compact graph representations require significantly fewer degrees of freedom (dof) to capture micro-fracture information and further accelerate these models with Machine Learning.

58 GEOSCIENCES↗

Faster fourier transformation: The algorithm of S. Winograd

The new DFT algorithm of S. Winograd is developed and presented in detail. This is an algorithm which uses about 1/5 of the number of multiplications used by the Cooley-Tukey algorithm and is applicable to any order which is a product of relatively prime factors from the following list: 2,3,4,5,7,8,9,16. The algorithm is presented in terms of a series of tableaus which are convenient, compact, graphical representations of the sequence of arithmetic operations in the corresponding parts of the algorithm. Using these in conjunction with included Tables makes it relatively easy to apply the algorithm and evaluate its performance.

Zohar, S.↗

Extensions of algebraic image operators: An approach to model-based vision

Researchers extend their previous research on a highly structured and compact algebraic representation of grey-level images which can be viewed as fuzzy sets. Addition and multiplication are defined for the set of all grey-level images, which can then be described as polynomials of two variables. Utilizing this new algebraic structure, researchers devised an innovative, efficient edge detection scheme. An accurate method for deriving gradient component information from this edge detector is presented. Based upon this new edge detection system researchers developed a robust method for linear feature extraction by combining the techniques of a Hough transform and a line follower. The major advantage of this feature extractor is its general, object-independent nature. Target attributes, such as line segment lengths, intersections, angles of intersection, and endpoints are derived by the feature extraction algorithm and employed during model matching. The algebraic operators are global operations which are easily reconfigured to operate on any size or shape region. This provides a natural platform from which to pursue dynamic scene analysis. A method for optimizing the linear feature extractor which capitalizes on the spatially reconfiguration nature of the edge detector/gradient component operator is discussed.

Lerner, Bao-Ting↗

Applications of algebraic image operators to model-based vision

A highly structured and compact algebraic representation of grey-level images is expanded. Addition and multiplication are defined for the set of all grey-level images, which can then be described as polynomials of two variables. Utilizing this new algebraic structure, an innovative, efficient edge-detection scheme is devised. A robust method for linear feature extraction is developed by combining the techniques of a Hough transform and a line follower with this new edge detection scheme. The major advantage of this feature extractor is its general, object-independent nature. Target attributes, such as line segment lengths, intersections, angles of intersection, and endpoints are derived by the feature extraction algorithm and employed during model matching. The feature extractor and model matcher are being incorporated into a distributed robot-control system.

Lerner, Bao-Ting↗

Task Analytic Models to Guide Analysis and Design: Use of the Operator Function Model to Represent Pilot-Autoflight System Mode Problems

Task-analytic models structure essential information about operator interaction with complex systems, in this case pilot interaction with the autoflight system. Such models serve two purposes: (1) they allow researchers and practitioners to understand pilots' actions; and (2) they provide a compact, computational representation needed to design 'intelligent' aids, e.g., displays, assistants, and training systems. This paper demonstrates the use of the operator function model to trace the process of mode engagements while a pilot is controlling an aircraft via the, autoflight system. The operator function model is a normative and nondeterministic model of how a well-trained, well-motivated operator manages multiple concurrent activities for effective real-time control. For each function, the model links the pilot's actions with the required information. Using the operator function model, this paper describes several mode engagement scenarios. These scenarios were observed and documented during a field study that focused on mode engagements and mode transitions during normal line operations. Data including time, ATC clearances, altitude, system states, and active modes and sub-modes, engagement of modes, were recorded during sixty-six flights. Using these data, seven prototypical mode engagement scenarios were extracted. One scenario details the decision of the crew to disengage a fully automatic mode in favor of a semi-automatic mode, and the consequences of this action. Another describes a mode error involving updating aircraft speed following the engagement of a speed submode. Other scenarios detail mode confusion at various phases of the flight. This analysis uses the operator function model to identify three aspects of mode engagement: (1) the progress of pilot-aircraft-autoflight system interaction; (2) control/display information required to perform mode management activities; and (3) the potential cause(s) of mode confusion. The goal of this paper is twofold: (1) to demonstrate the use of the operator functio model methodology to describe pilot-system interaction while engaging modes And monitoring the system, and (2) to initiate a discussion of how task-analytic models might inform design processes. While the operator function model is only one type of task-analytic representation, the hypothesis of this paper is that some type of task analytic structure is a prerequisite for the design of effective human-automation interaction.

Degani, Asaf↗

Recognizing Chromospheric Objects via Markov Chain Monte Carlo

The solar chromosphere consists of three classes which contribute differentially to ultraviolet radiation reaching the earth. We describe a data set of solar images, means of segmenting the images into the constituent classes, and a novel high-level representation for compact objects based on a triangulated spatial membership function.

Markov Chain Monte Carlo Solar↗

Representing Solar Active Regions with Triangulations

The solar chromosphere consists of three classes which contribute differently to ultraviolet radiation reaching the earth. We describe a data set of solar images, means of segmenting the images into the constituent classes, and novel high-level representation for compact objects based on a triangulation spatial 'membership function'.

Triangulation chromosphere Markov chain Monte Carl↗

Streaming Compression of Hexahedral Meshes

We describe a method for streaming compression of hexahedral meshes. Given an interleaved stream of vertices and hexahedral our coder incrementally compresses the mesh in the presented order. Our coder is extremely memory efficient when the input stream documents when vertices are referenced for the last time (i.e. when it contains topological finalization tags). Our coder then continuously releases and reuses data structures that no longer contribute to compressing the remainder of the stream. This means in practice that our coder has only a small fraction of the whole mesh in memory at any time. We can therefore compress very large meshes - even meshes that do not file in memory. Compared to traditional, non-streaming approaches that load the entire mesh and globally reorder it during compression, our algorithm trades a less compact compressed representation for significant gains in speed, memory, and I/O efficiency. For example, on the 456k hexahedra 'blade' mesh, our coder is twice as fast and uses 88 times less memory (only 3.1 MB) with the compressed file increasing about 3% in size. We also present the first scheme for predictive compression of properties associated with hexahedral cells.

99 GENERAL AND MISCELLANEOUS↗

Conversion of Resonance Parameters Between Wigner-Eisenbud R-matrix and Transition Matrix Pole Representation

The goal of this research is to develop a numerical code for translation between the current standard, Wigner-Eisenbud R-matrix parameters and a novel pole-representation of cross sections. The method follows Ducru et al. and constructs the conversion between these parametric representations of the scattering and reaction data. This pole representation, which expresses cross sections as a sum of simple poles (and their attendant residues), is examined in the context of the advantages provided by this compact, computationally efficient representation. These advantages include the ability to doppler broaden cross sections on-the-fly as well as a lower memory footprint when generating cross sections, an attractive feature to those interested in parallel GPU based Monte Carlo. Some conversion methods between R-matrix parameters and S-matrix poles have relied on curve fitting techniques. It is unknown weather these numerical methods necessarily preserve certain underlying physics properties of the standard R-matrix cross section model (such as unitarity). The direct conversion studied here aim to preserve such properties. This knowledge is of interest for future work into the generation of resonance parameter sensitivities.

CLUTCH↗

Compact planetary systems perturbed by an inclined companion. I. Vectorial representation of the secular model

The non-resonant secular dynamics of compact planetary systems are modeled by a perturbing function that is usually expanded in eccentricity and absolute inclination with respect to the invariant plane. Here, the expressions are given in a vectorial form which naturally leads to an expansion in eccentricity and mutual inclination. The two approaches are equivalent in most cases, but the vectorial one is specially designed for those cases where an entire quasi-coplanar system tilts to a large degree. Moreover, the vectorial expressions of the Hamiltonian and of the equations of motion are slightly simpler than those given in terms of the usual elliptical elements. We also provide the secular perturbing function in vectorial form expanded in semi-major axis ratio allowing for arbitrary eccentricities and inclinations. The interaction between the equatorial bulge of a central star and its planets is also provided, as is the relativistic periapse precession of any planet induced by the central star. We illustrate the use of this representation to follow the secular oscillations of the terrestrial planets of the solar system and for Kozai cycles which may take place in exoplanetary systems.

79 ASTRONOMY AND ASTROPHYSICS↗

Grouper: A Compact, Streamable Triangle Mesh Data Structure

Here, we present Grouper: an all-in-one compact file format, random-access data structure, and streamable representation for large triangle meshes. Similarly to the recently published SQuad representation, Grouper represents the geometry and connectivity of a mesh by grouping vertices and triangles into fixed-size records, most of which store two adjacent triangles and a shared vertex. Unlike SQuad, however, Grouper interleaves geometry with connectivity and uses a new connectivity representation to ensure that vertices and triangles can be stored in a coherent order that enables memory-efficient sequential stream processing. We also present a linear-time construction algorithm that allows streaming out Grouper meshes using a small memory footprint while preserving the initial ordering of vertices. In this construction, we show how the problem of assigning vertices and triangles to groups reduces to a well-known NP-hard optimization problem, and present a simple yet effective heuristic solution that performs well in practice. Our array-based Grouper representation also doubles as a triangle mesh data structure that allows direct access to vertices and triangles. Storing only about two integer references per triangle-i.e., less than the three vertex references stored with each triangle in a conventional indexed mesh format-Grouper answers both incidence and adjacency queries in amortized constant time. Our compact representation enables data-parallel processing on multicore computers, instant partitioning and fast transmission for distributed processing, as well as efficient out-of-core access. We demonstrate the versatility and performance benefits of Grouper using a suite of example meshes and processing kernels.

97 MATHEMATICS AND COMPUTING↗

Self-supervised learning of spatiotemporal thermal signatures in additive manufacturing using reduced order physics models and transformers

Microstructure control via additive manufacturing has enormous potential as manufacturers, materials scientists, and designers alike seek to exploit novel fabrication technologies to improve component performance. Recent works have demonstrated the feasibility of producing materials with controlled microstructures across various length scales. However, the experimental approach towards exploring the process-structure space can be laborious and costly. This is particularly true if also considering scan pattern optimization which is well suited for processes such as powder bed fusion electron beam melting. In this work we propose an approach for encoding additive manufacturing layer-wise thermal response signatures using self-supervised representation learning. Thermal simulations from a reduced order model are utilized to estimate the spatiotemporal response during printing. A machine learning framework, using video-transformers, is utilized to efficiently distill spatiotemporal patterns into a compact latent space representation. This latent state representation encodes the relevant physics which is then utilized to establish a data-driven process-structure model for an additively manufactured Ni-based superalloy. In conclusion, the proposed methodology could potentially be used towards in-situ process monitoring, scan pattern experimental design, and component qualification.

97 MATHEMATICS AND COMPUTING↗

Pairwise connected tensor network representation of path integrals

It has been recently shown how the tensorial nature of real-time path integrals (PIs) involving the Feynman-Vernon influence functional can be utilized with matrix product states, taking advantage of the finite length of the bath-induced memory. Tensor networks (TNs) promise to provide a unified language to express the structure of a PI. A generalized TN specifically incorporating the pairwise interaction structure of the influence functional and its invariance with respect to the average forward-backward position or the sojourn value in the form of the blip representation is derived and implemented. This pairwise connected TNPI (PC-TNPI) is illustrated through applications to typical spin-boson problems and explorations of the differences caused by the exact form of the spectral density. The storage and performance scalings are reported, showing the compactness of the representation and the efficiency of the contraction process. Finally, taking advantage of the compressed representation, the viability of using PC-TNPI for simulating multistate problems is demonstrated. The PC-TNPI structure can be shown to yield other TN algorithms currently in use. Consequently, it should be possible to use it as a starting point for deriving other optimized procedures.

36 MATERIALS SCIENCE↗

A Representation Fusion Framework for Decoupling Diagnostic Information in Multimodal Learning

Modern medicine increasingly relies on multimodal data, ranging from clinical notes to imaging and genomics, to guide diagnosis and treatment. However, integrating these heterogeneous data sources in a principled and interpretable manner remains a major challenge. We present MODES (Multi-mOdal Disentangled Embedding Space), a representation fusion framework that explicitly separates shared and modality-specific factors of variation, offering a structured latent space for multimodal information that improves both prediction and interpretability. By leveraging pre-trained unimodal foundation models, MODES mitigates the dependency on extensive paired datasets, crucial in data-scarce clinical settings. We introduce a masking strategy that optimizes representation dimensionality by eliminating low-information dimensions, to achieve compact, information-rich representations. Our framework demonstrates superior performance in predicting diagnoses and phenotypes compared to unimodal and conventional fusion models. MODES also enables robust diagnostic inference in missing data scenarios, offering an opportunity toward interpretable and efficient multimodal diagnostics in personalized healthcare.

60 APPLIED LIFE SCIENCES↗

Rapid detection of rare events from in situ X-ray diffraction data using machine learning

High-energy X-ray diffraction methods can non-destructively map the 3D microstructure and associated attributes of metallic polycrystalline engineering materials in their bulk form. These methods are often combined with external stimuli such as thermo-mechanical loading to take snapshots of the evolving microstructure and attributes over time. However, the extreme data volumes and the high costs of traditional data acquisition and reduction approaches pose a barrier to quickly extracting actionable insights and improving the temporal resolution of these snapshots. This article presents a fully automated technique capable of rapidly detecting the onset of plasticity in high-energy X-ray microscopy data. The technique is computationally faster by at least 50 times than the traditional approaches and works for data sets that are up to nine times sparser than a full data set. This new technique leverages self-supervised image representation learning and clustering to transform massive data sets into compact, semantic-rich representations of visually salient characteristics ( e.g. peak shapes). These characteristics can rapidly indicate anomalous events, such as changes in diffraction peak shapes. It is anticipated that this technique will provide just-in-time actionable information to drive smarter experiments that effectively deploy multi-modal X-ray diffraction methods spanning many decades of length scales.

Zheng, Weijian↗

NeRVI: Compressive neural representation of visualization images for communicating volume visualization results

We present NeRVI, a new deep-learning approach that compresses a large collection of visualization images generated from time-varying data for communicating volume visualization results. Based on an image-based implicit neural representation, our approach represents tens of thousands of high-resolution rendering images parametrized by different parameters via a hybrid model of multilayer perceptrons and convolutional neural networks. Here, our model predicts images and corresponding masks, and the masks are utilized for loss computation and network training to capture fine structural details and small components. In conjunction with model quantization and weight encoding, NeRVI yields highly compact compressive neural representations while preserving the image fidelity well. We demonstrate the effectiveness of NeRVI with isosurface rendering and direct volume rendering images generated from multiple data sets and compare NeRVI with other state-of-the-art deep learning-based (InSituNet, SIREN, NeRF, and NeRV) methods. Quantitative and qualitative results show that NeRVI provides an alternative solution that augments domain scientists' ability to manage, represent, and communicate scientific visualization output.

97 MATHEMATICS AND COMPUTING↗

Precedence relationship representations of mechanical assembly sequences

Two types of precedence relationship representations for mechanical assembly sequences are presented: precedence relationships between the establishment of one connection between two parts and the establishment of another connection, and precedence relationships between the establishment of one connection and states of the assembly process. Precedence relationship representations have the advantage of being very compact. The problem with these representations was how to guarantee their correctness and completeness. Two theorems are presented each of which leads to the generation of one type of precedence relationship representation guaranteeing its correctness and completeness for a class of assemblies.

Homendemello, L. S.↗