Search NASA⌕ Search

SEARCH · Search NASA

Results for “multiple views”

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 19 records

Multiple-view, multiple-selection visualization of simulation geometry in CMS

Fireworks, the event-display program of CMS, was extended with an advanced geometry visualization package. ROOT's TGeo geometry is used as internal representation, shared among several geometry views. Each view is represented by a GUI list-tree widget, implemented as a flat vector to allow for fast searching, selection, and filtering by material type, node name, and shape type. Display of logical and physical volumes is supported. Color, transparency, and visibility flags can be modified for each node or for a selection of nodes. Further operations, like opening of a new view or changing of the root node, can be performed via a context menu. Node selection and graphical properties determined by the list-tree view can be visualized in any 3D graphics view of Fireworks. As each 3D view can display any number of geometry views, a user is free to combine different geometry-view selections within the same 3D view. Node-selection by proximity to a given point is possible. A visual clipping box can be set for each geometry view to limit geometry drawing into a specified region. Visualization of geometric overlaps, as detected by TGeo, is also supported. The geometry visualization package is used for detailed inspection and display of simulation geometry with or without the event data. It also serves as a tool for geometry debugging and inspection, facilitating development of geometries for CMS detector upgrades and for SLHC.

Bauerdick, L. A.T.↗

Prong Segmentation using Point Set Transformers in Multiple View Neutrino Detectors

NOvA is a long-baseline neutrino experiment studying neutrino oscillations by detecting neutrinos from the NuMI beam at Fermilab. Its physics analysis relies on accurate prong segmentation, which involves matching each hit to its source particle and identifying the particle type. This task has commonly been addressed using a combination of traditional clustering algorithms and convolutional neural networks (CNNs). However, NOvA’s detector design presents data as two sparse and decoupled 2D images (XZ and YZ views) rather than a native 3D representation, posing a significant challenge for traditional CNN-based models. In this talk, we propose a novel neural network based on the Point Set Transformer. By treating detector hits as sparse point clouds and implementing a cross-view attention mechanism, our model enables efficient information mixing between both views. Evaluated on NOvA simulated data, our model achieves superior accuracy while requiring significantly fewer computational resources compared to other models. Furthermore, the model demonstrates great performance when applied to Liquid Argon Time Projection Chamber (LArTPC) data, which shows its potential as a universal prong segmentation algorithm for multiple view neutrino detectors.

Liu, Jiaxi [UC, Irvine]↗

Multiple-view spectrally resolved x-ray imaging observations of polar-direct-drive implosions on OMEGA

We present spatially, temporally, and spectrally resolved narrow- and broad-band x-ray images of polar-direct-drive (PDD) implosions on OMEGA. These self-emission images were obtained during the deceleration phase and bang time using several multiple monochromatic x-ray imaging instruments fielded along two or three quasi-orthogonal lines-of-sight, including equatorial and polar views. The instruments recorded images based on K-shell lines from a titanium tracer located in the shell as well as continuum emission. These observations constitute the first such data obtained for PDD implosions. The image data show features attributed to laser imprinting and zero-order hydrodynamics. Equatorial-view images show a “double bun” structure that is consistent with synthetic images obtained from post-processing 2D and 3D radiation-hydrodynamic simulations of the experiment. Polar-view images show a pentagonal, petal pattern that correlates with the PDD laser illumination used on OMEGA, thus revealing a 3D aspect of PDD OMEGA implosions not previously observed. Differences are noted with respect to a PDD experiment performed at National Ignition Facility.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

A ten-inch manipulator (TIM) based fast-electron spectrometer with multiple viewing angles (OU-ESM)

The measurement of angularly resolved energy distributions of MeV electrons is vital for gaining a better understanding of the interaction of ultra-intense laser pulses with plasma, especially for fast-ignition laser-fusion research. It is also important when evaluating the production of suprathermal (several 10-keV) electrons through laser-plasma instabilities in conventional hot-spot-ignition and shock-ignition research. For these purposes, we developed a ten-inch manipulator-based multichannel electron spectrometer — the Osaka University electron spectrometer (OU-ESM) — that combines angular resolution with high-energy resolution. The OU-ESM consists of five small electron spectrometers set at every 5°, with an energy range from ~40 keV to ~40 MeV. A low-magnetic-field option provides a higher spectral resolution for an energy range of up to ~5 MeV. We successfully gained angularly resolved electron spectra for various experiments on the OMEGA and OMEGA EP Laser Systems.

47 OTHER INSTRUMENTATION↗

Vehicular Re-Identification from Uncontrolled Multiple Views

Vehicle re-identification (re-ID) across disparate sensing modalities remains a fundamental challenge for transportation research. In this work, we introduce a deep multi-view vehicle re-ID framework that leverages Siamese networks to compare pairs of vehicle images and produce matching scores, enabling robust association across drastically different viewpoints such as those from UAVs, surveillance cameras, and ground sensors. The model exploits convolutional neural networks to learn features that remain discriminative under changes in angle, distance, and illumination, supporting more generalizable re-ID performance. As part of this effort, we also developed an automated pipeline to synchronize roadside and UAV video streams, producing a multi-perspective dataset that complements preexisting real collections and a synthetic dataset generated in this study. Together, these contributions advance the capability to re-identify vehicles across wide viewing baselines; establish a foundation for scalable, reproducible research in vehicle re-ID; and open pathways for future applications, such as inferring routine behaviors, movement patterns, and daily habits of the individual associated with the vehicle.

convolutional neural networks↗

Section 180(c) Policy Implementation Exercise: Multiple Views - 17383

The Department of Energy (DOE) Office of Nuclear Energy's Office of Integrated Waste Management (formerly the Nuclear Fuels Storage and Transportation Planning Project) recently completed a two-year Section 180(c) Proposed Policy Implementation Exercise (the Exercise) with volunteers from eight states and one Native American Tribe. Under Section 180(c) of the Nuclear Waste Policy Act of 1982, as amended (NWPA), DOE is responsible for providing technical and financial assistance to states and Tribes for training of local public safety officials through whose jurisdictions the Secretary of Energy plans to transport spent nuclear fuel (SNF) or high-level radioactive waste to a NWPA-authorized facility. In the 2000's, DOE staff worked closely with state and tribal representatives to develop a revised proposed policy to implement Section 180(c), including grants for assessment and planning activities, as well as grants for training public safety officials. This revised proposed policy was published in a Federal Register Notice in 2008 (2008 FRN) (73 Federal Register 64933, Oct. 31, 2008). The purpose of the Exercise was to evaluate the efficacy of DOE's 2008 revised proposed policy for implementing Section 180(c), and identify outstanding issues to be resolved. DOE presented an interim update on the Exercise at the 2016 Waste Management Symposium and the Exercise concluded in June 2016. This paper describes the remaining activities of the Exercise that occurred since the 2016 Waste Management Symposium, and presents the perspectives of one state and one Tribal participant in the Exercise as well as DOE's perspective. The paper concludes with a discussion of the lessons learned from the Exercise, what steps are next, and how the Exercise may inform and improve future consultations between DOE and state, tribal, and local public safety officials. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Heterogeneous Point Set Transformers for Segmentation of Multiple View Particle Detectors

NOvA is a long-baseline neutrino oscillation experiment that detects neutrino particles from the NuMI beam at Fermilab. Before data from this experiment can be used in analyses, raw hits in the detector must be matched to their source particles, and the type of each particle must be identified. This task has commonly been done using a mix of traditional clustering approaches and convolutional neural networks (CNNs). Due to the construction of the detector, the data is presented as two sparse 2D images: an XZ and a YZ view of the detector, rather than a 3D representation. We propose a point set neural network that operates on the sparse matrices with an operation that mixes information from both views. Our model uses less than 10% of the memory required using previous methods while achieving a 96.8% AUC score, a higher score than obtained when both views are processed independently (85.4%).

Robles, Edgar E. [UC, Irvine (main)]↗

Leveraging Interaction History for Intelligent Configuration of Multiple Coordinated Views in Visualization Tools

Visualization tools can take advantage of multiple coordinated views to support analysis of large, multidimensional data sets. Effective design of such views and layouts can be challenging, but understanding users analysis strategies can inform design improvements. We outline an approach for intelligent design configuration of visualization tools with multiple coordinated views, and we discuss a proposed software framework to support the approach. The proposed software framework could capture and learn from user interaction data to automate new compositions of views and widgets. Such a framework could reduce the time needed for meta analysis of the visualization use and lead to more effective visualization design.

infovis↗

Data Locality Enhancement of Dynamic Simulations for Exascale Computing (Final Report)

The development of modern processors exhibits two trends that complicate the optimizations of modern software. The first is the increasing sensitivity of processors' throughput to irregularities in computation. With more processors produced through a massive integration of simple cores, future systems will increasingly favor regular data-level parallel computations, but deviate from the needs of applications with complex patterns. Some evidences are already shown on Graphic Processing Units (GPU): Irregular data accesses (e.g., indirect references A[D[i]]) and conditional branches are limiting many GPU applications' performance at a level an order of magnitude lower than the peak of GPU. The second hardware trend is the growing gap between memory bandwidth and the aggregate speed—that is, the sum of all cores' computing power—of a Chip Multiprocessor (CMP). Despite the capped growth of the peak CPU speed, the aggregate speed of a CMP keeps increasing as more cores get into a single chip. It is expected that by 2018, node concurrency in an exascale system will increase by hundreds of times, whereas, memory bandwidth will expand by only 10 to 20 times. Consequently, data movement and storage is expected to consume more than 70% of the total system power. Bridging this gap is difficult; the complexities of modern CMP memory hierarchy make it even harder: Data cache becomes shared among computing units, and the sharing is often non-uniform—whether two computing units share a cache depends on their proximity and the level of the cache. On the recent IBM Power7 architecture, for instance, four hardware contexts (or SMT threads) in a core share the entire memory hierarchy, all cores in one chip share an on-chip L3 cache, and cores across chips share L3 and main memory through off-chip connections. These two trends complicate the translation of computing power into performance, especially for a program with either intensive data accesses or complex patterns in data accesses or control flow paths. Unfortunately, both attributes present and will persist in a class of important applications. For instance, many scientific simulations deal with a large volume of data. And meanwhile, as most real-world processes are non-uniform and evolving (e.g., the evolution of a galaxy or the process of a drug injection), both the computations and data accesses of these programs tend to be irregular and dynamically changing. Currently, the lack of support to these applications on modern CMP severely limits their performance. On GPU, as our recent study shows and other studies echo, performance enhancement of a factor of integers is possible when memory accesses or control flows are streamlined for a set of GPU applications. On multicore CPU, our studies show that traditional locality enhancement, for being oblivious to the new features of multicore memory hierarchy, may even cause large slowdown to data-intensive dynamic applications. The severity of the issues is expected to worsen as the two hardware trends continue. Some recent studies try to match software with the trends, but in a limited scope or manner. For irregularities on GPU, most studies focus on irregularities analyzable through static analysis (e.g., data accesses in regular loops). Dynamic irregularities are harder to address because the needed analysis and transformations typically have to happen at run time. Some other research resorts to hardware extensions, an actual adoption of which is unclear for the entailed space cost and complexity. For data locality, recent years have seen some exploitations of the new memory hierarchy on multicore for performance, but most of them are on process or thread scheduling, rather than program transformations. Our recent study reveals that program-level transformations may magnify the scheduling benefits by a factor of seven, concluding that program-level transformation should play a central role for data locality enhancement on modern CMP. But research in this direction has been sparse, and most have focused on data layout or cache performance modeling, rather than program transformations to match with the new memory hierarchy features. Overall, it is still an open question how to bridge the gap between dynamic computations and the two prominent properties of modern processors. The goal of this project is to develop a set of techniques and software tools to enhance the matching between memory accesses in dynamic simulations and the prominent features of modern and future CMP, alleviating the memory performance issues for petascale and exascale computing. This report summarizes the discoveries and products produced throughout this project. It includes free launch, a new software approach to overcoming the shortcomings of both methods; coherence-free multiview, an approach that allows multiple views of a single data object to co-exist on GPU memory during a GPU kernel execution; algorithmic optimizations to data analytics problems, especially those that involve lots of distance calculations. Supporting dynamic parallelism is important for GPU to benefit a broad range of applications. There are currently two fundamental ways for programs to exploit dynamic parallelism on GPU: a software-based approach with software-managed worklists, and a hardware-based approach through dynamic subkernel launches. Neither is satisfactory. The former is complicated to program and is often subject to some load imbalance; the latter suffers large runtime overhead. In this work, we propose free launch, a new software approach to overcoming the shortcomings of both methods. It allows programmers to use subkernel launches to express dynamic parallelism. It employs a novel compiler-based code transformation named subkernel launch removal to replace the subkernel launches with the reuse of parent threads. Coupled with an adaptive task assignment mechanism, the transformation reassigns the tasks in the subkernels to the parent threads with a good load balance. The technique requires no hardware extensions, immediately deployable on existing GPUs. It keeps the programming convenience of the subkernel launch-based approach while avoiding its large runtime overhead. Meanwhile, its superior load balancing makes it outperform manual worklist-based techniques by 3X on average. The work was published at the 48th Annual IEEE/ACM International Symposium on Microarchitecture (Micro'2015). A Graphic Processing Unit (GPU) system is typically equipped with many types of memory (e.g., global, constant, texture, shared, cache). Data placement determines what data are placed on which type of memory, essential for GPU memory performance. Prior optimizations of data placement always require a single view of a data object on memory, which limits the optimization effectiveness. In this work, we propose coherence-free multiview, an approach that allows multiple views of a single data object to co-exist on GPU memory during a GPU kernel execution. We demonstrate that under certain conditions, the multiple views can remain incoherent while facilitating enhanced data placement. We present a theorem and some compiler support to ensure the soundness of the usage of coherence-free multiview. We further develop reference-discerning data placement, a new way to enhance data placements on GPU. It enables more flexible data placements by using coherence-free multiview to leverage the slack in coherence requirement of some GPU programs. Experiments on three types of GPU systems show that, with less than 200KB space cost, the new data placement technique can provide a 1.6X average (up to 4.27X) speedup. In addition, we have examined algorithmic optimizations to data analytics problems, especially those that involve lots of distance calculations. Computing distances among data points is an essential part of many important algorithms in data analytics, graph analysis, and other domains. In each of these domains, developers have spent significant manual effort optimizing algorithms, often through novel applications of the triangle equality, in order to minimize the number of distance computations in the algorithms. In this work, we observe that many algorithms across these domains can be generalized as an instance of a generic distance-related abstraction. Based on this abstraction, we derive seven principles for correctly applying the triangular inequality to optimize distance-related algorithms. Guided by the findings, we develop Triangular OPtimizer (TOP), the first software framework that is able to automatically produce optimized algorithms that either matches or outperforms manually designed algorithms for solving distance-related problems. TOP achieves up to 237x speedups and 2.5X on average. The work has been published at the 32nd International Conference on Machine Learning (ICML'15) and the 41st International Conference on Very Large Data Bases (VLDB'15).

42 ENGINEERING↗

Collaborative Visualization for Large-Scale Accelerator Electromagnetic Modeling

In the Phase I SBIR we proposed a ParaView-based solution to provide an environment for individuals to actively collaborate in the visualization process. The technical objectives of Phase I were: (1) to determine the set of features required for an effect collaborative system; (2) to implement a two-person collaborative prototype; and (3) to implement key collaborative features such as control locking and annotation. Accordingly, we implemented a ParaView-based collaboration prototype with support for collaborating with up to four simultaneous clients. We also implemented collaborative features such as control locking, chatting, annotation etc. Due to in part of the flexibility provided by the ParaView framework and the design features implemented in the prototype, we were able to support collaboration with multiple views, instead of a simple give as initially proposed in Phase I. In this section we will summarize the results we obtained during the Phase I project. ParaView is complex, scalable, client-server application framework built on top of the VTK visualization engine. During the implementation of the Phase I prototype, we realized that the ParaView framework naturally supports collaboration technology; hence we were able to go beyond the proposed Phase I prototype in several ways. For example, we were able to support for multiple views, enable server-as well as client-side rendering, and manage up to four heterogeneous clients. The success we achieved with Phase I clearly demonstrated the technical feasibility of the ParaView based collaborative framework we are proposing in the Phase II effort. We also investigated using the web browser as one of the means of participating in a collaborative session. This would enable non-visualization experts to participate in the collaboration process without being intimidated by a complex application such as ParaView. Hence we also developed a prototype web visualization applet that makes it possible for interactive visualization over the web.

43 PARTICLE ACCELERATORS↗

Integrating Multiple Data Views for Improved Malware Analysis [Slides]

Malicious programs continue to be a serious threat within the internet landscape. In 2011, 403 million variants of malware were detected, a 41% increase from 2010. Malware cost consumers $\$$2.3 billion in 2011. Cybercrime cost companies $\$$338 billion in 2011. Given recent trends, and how lucrative the cybercrime industry has become, we can expect malware to be an ongoing threat.

97 MATHEMATICS AND COMPUTING↗

Template-based CTA to x-ray angio rigid registration of coronary arteries in frequency domain with automatic x-ray segmentation

Purpose: A key challenge for image guided coronary interventions is accurate and absolutely robust image registration bringing together preinterventional information extracted from a three-dimensional (3D) patient scan and live interventional image information. In this paper, the authors present a novel scheme for 3D to two-dimensional (2D) rigid registration of coronary arteries extracted from preoperative image scan (3D) and a single segmented intraoperative x-ray angio frame in frequency and spatial domains for real-time angiography interventions by C-arm fluoroscopy.Methods: Most existing rigid registration approaches require a close initialization due to the abundance of local minima and high complexity of search algorithms. The authors' method eliminates this requirement by transforming the projections into translation-invariant Fourier domain for estimating the 3D pose. For 3D rotation recovery, template Digitally Reconstructed Radiographs (DRR) as candidate poses of 3D vessels of segmented computed tomography angiography are produced by rotating the camera (image intensifier) around the DICOM angle values with a specific range as in C-arm setup. The authors have compared the 3D poses of template DRRs with the segmented x-ray after equalizing the scales in three domains, namely, Fourier magnitude, Fourier phase, and Fourier polar. The best rotation pose candidate was chosen by one of the highest similarity measures returned by the methods in these domains. It has been noted in literature that frequency domain methods are robust against noise and occlusion which was also validated by the authors' results. 3D translation of the volume was then recovered by distance-map based BFGS optimization well suited to convex structure of the authors' objective function without local minima due to distance maps. A novel automatic x-ray vessel segmentation was also performed in this study.Results: Final results were evaluated in 2D projection space for patient data; and with ground truth values and landmark distances for the images acquired with a solid phantom vessel. Results validate that rotation recovery in frequency domain is robust against differences in segmentations in two modalities. Distance-map translation is successful in aligning coronary trees with highest possible overlap.Conclusions: Numerical and qualitative results show that single view rigid alignment in projection space is successful. This work can be extended with multiple views to resolve depth ambiguity and with deformable registration to account for nonrigid motion in patient data.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

MPDV QUICKVIEW

QuickView is written in MATLAB® and runs as a stand-alone widget application. The application is typically deployed as a MATLAB executable or an application (for Mac OS X). The source code for stand-alone applications consists either entirely of MATLAB files or some combination of MATLAB files and MEX-files; as such, the end user must use the MATLAB Compiler Runtime (MCR) or have a full version of MATLAB with associated toolboxes. This program has been tested on both Microsoft Windows and MAC OS X. QuickView provides a unique capability for viewing multiple PDV data records. The user can select up to 40 .dig files and view them as spectrograms, eight per page. In addition to basic image exploration, i.e., zooming, panning, and pixel information, the user can change contrast, spectrogram parameters, save figures, and extract velocity profiles from the spectrograms.

Diaz, Abel↗

Flexible and Scalable Data Fusion using Proactive Schemaless Information Services

Exascale data environments are fast approaching, driven by diverse structured and unstructured data such as system and application telemetry streams, open-source information capture, and on-demand simulation output. Storage costs having plummeted, the question is now one of converting vast stores of data to actionable information. Complicating this problem are the low degrees of awareness across domain boundaries about what potentially useful data may exist, and write-once- read-never issues (data generation/collection rates outpacing data analysis and integration rates). Increasingly, technologists and researchers need to correlate previously unrelated data sources and artifacts to produce fused data views for domain-specific purposes. New tools and approaches for creating such views from vast amounts of data are vitally important to maintaining research and operational momentum. We propose to research and develop tools and services to assist in the creation, refinement, discovery and reuse of fused data views over large, diverse collections of heterogeneously structured data. We innovate in the following ways. First, we enable and encourage end-users to introduce customized index methods selected for local benefit rather than for global interaction (flexible multi-indexing). We envision rich combinations of such views on application data: views that span backing stores with different semantics, that introduce analytic methods of indexing, and that define multiple views on individual data items. We specifically decline to build a big fused database of everything providing a centralized index over all data, or to export a rigid schema to all comers as in federated query approaches. Second, we proactively advertise these application-specific views so that they may be programmatically reused and extended (data proactivity). Through this mechanism, both changes in state (new data in existing view collected) and changes in structure (new or derived view exists) are made known. Lastly, we embrace found data heterogeneity by coupling multi-indexing to backing stores with appropriate semantics (as opposed to a single store or schema).

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

Flexible and Scalable Data Fusion using Proactive, Schemaless Information Services

Exascale data environments are fast approaching, driven by diverse structured and unstructured data such as system and application telemetry streams, open-source information capture, and on-demand simulation output. Storage costs having plummeted, the question is now one of converting vast stores of data to actionable information. Complicating this problem are the low degrees of awareness across domain boundaries about what potentially useful data may exist, and write-once-read- never issues (data generation/collection rates outpacing data analysis and integration rates). Increasingly, technologists and researchers need to correlate previously unrelated data sources and artifacts to produce fused data views for domain-specific purposes. New tools and approaches for creating such views from vast amounts of data are vitally important to maintaining research and operational momentum. We propose to research and develop tools and services to assist in the creation, refinement, discovery and reuse of fused data views over large, diverse collections of heterogeneously structured data. We innovate in the following ways. First, we enable and encourage end-users to introduce customized index methods selected for local benefit rather than for global interaction (flexible multi-indexing). We envision rich combinations of such views on application data: views that span backing stores with different semantics, that introduce analytic methods of indexing, and that define multiple views on individual data items. We specifically decline to build a big fused database of everything providing a centralized index over all data, or to export a rigid schema to all comers as in federated query approaches. Second, we proactively advertise these application-specific views so that they may be programmatically reused and extended (data proactivity). Through this mechanism, both changes in state (new data in existing view collected) and changes in structure (new or derived view exists) are made known. Lastly, we embrace found data heterogeneity by coupling multi-indexing to backing stores with appropriate semantics (as opposed to a single store or schema).

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

Visualization of the Eastern Renewable Generation Integration Study: Preprint

The Eastern Renewable Generation Integration Study (ERGIS), explores the operational impacts of the wide spread adoption of wind and solar photovoltaics (PV) resources in the U.S. Eastern Interconnection and Quebec Interconnection (collectively, EI). In order to understand some of the economic and reliability challenges of managing hundreds of gigawatts of wind and PV generation, we developed state of the art tools, data, and models for simulating power system operations using hourly unit commitment and 5-minute economic dispatch over an entire year. Using NREL's high-performance computing capabilities and new methodologies to model operations, we found that the EI, as simulated with evolutionary change in 2026, could balance the variability and uncertainty of wind and PV at a 5-minute level under a variety of conditions. A large-scale display and a combination of multiple coordinated views and small multiples were used to visually analyze the four large highly multivariate scenarios with high spatial and temporal resolutions. state of the art tools, data, and models for simulating power system operations using hourly unit commitment and 5-minute economic dispatch over an entire year. Using NRELs high-performance computing capabilities and new methodologies to model operations, we found that the EI, as simulated with evolutionary change in 2026, could balance the variability and uncertainty of wind and PV at a 5-minute level under a variety of conditions. A large-scale display and a combination of multiple coordinated views and small multiples were used to visually analyze the four large highly multivariate scenarios with high spatial and temporal resolutions.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Three-dimensional reconstruction of x-ray emission volumes in magnetized liner inertial fusion from sparse projection data using a learned basis

The ability to visualize x-ray and neutron emission from fusion plasmas in 3D is critical to understand the origin of the complex shapes of the plasmas in experiments. Unfortunately, this remains challenging in experiments that study a fusion concept known as Magnetized Liner Inertial Fusion (MagLIF) due to a small number of available diagnostic views. Here, we present a basis function-expansion approach to reconstruct MagLIF stagnation plasmas from a sparse set of x-ray emission images. A set of natural basis functions is “learned” from training volumes containing quasi-helical structures whose projections are qualitatively similar to those observed in experimental images. Tests on several known volumes demonstrate that the learned basis outperforms both a cylindrical harmonic basis and a simple voxel basis with additional regularization, according to several metrics. Two-view reconstructions with the learned basis can estimate emission volumes to within 11% and those with three views recover morphology to a high degree of accuracy. The technique is applied to experimental data, producing the first 3D reconstruction of a MagLIF stagnation column from multiple views, providing additional indications of liner instabilities imprinting onto the emitting plasma.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗