Search NASA⌕ Search

SEARCH · Search NASA

Results for “Vectorized algorithm”

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 775 records · Page 43

Charged particle velocity map image reconstruction with one-dimensional projections of spherical functions

Velocity map imaging (VMI) is used in mass spectrometry and in angle resolved photo-electron spectroscopy to determine the lateral momentum distributions of charged particles accelerated towards a detector. VM-images are composed of projected Newton spheres with a common centre. The 2D images are usually evaluated by a decomposition into base vectors each representing the 2D projection of a set of particles starting from a centre with a specific velocity distribution. We propose to evaluate 1D projections of VM-images in terms of 1D projections of spherical functions, instead. The proposed evaluation algorithm shows that all distribution information can be retrieved from an adequately chosen set of 1D projections, alleviating the numerical effort for the interpretation of VM-images considerably. The obtained results produce directly the coefficients of the involved spherical functions, making the reconstruction of sliced Newton spheres obsolete.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

WE-G-18A-05: Cone-Beam CT Reconstruction with Deformed Prior Image

Purpose: Prior image can be incorporated into image reconstruction process to improve the quality of on-treatment cone-beam CT (CBCT) from sparseview or low-dose projections. However, the deformation between the prior image and on-treatment CBCT are not considered in current prior image based reconstructions (e.g., prior image constrained compressed sensing (PICCS)). The purpose of this work is to develop a deformed-prior-imagebased- reconstruction strategy (DPIR) to address the mismatch problem between the prior image and target image. Methods: The deformed prior image is obtained by a projection based registration approach. Specifically, the deformation vector fields (DVF) used to deform the prior image is estimated through matching the forward projection of the prior image and the measured on-treatment projection. The deformed prior image is then used as the prior image in the standard PICCS algorithm. Simulation studies on the XCAT phantom was conducted to evaluate the performance of the projection based registration procedure and the proposed DPIR strategy. Results: The deformed prior image matches the geometry of on-treatment CBCT closer as compared to the original prior image. Using the deformed prior image, the quality of the image reconstructed by DPIR from few-view projection data is greatly improved as compared to the standard PICCS algorithm. The relative image reconstruction error is reduced to 11.13% in the proposed DPIR from 17.57% in the original PICCS. Conclusion: The proposed DPIR approach can solve the mismatch problem between the prior image and target image, which overcomes the limitation of the original PICCS algorithm for CBCT reconstruction from sparse-view or low-dose projections.

60 APPLIED LIFE SCIENCES↗

SIS epidemiological model for adaptive RT: Forecasting the parotid glands shrinkage during tomotherapy treatment

Purpose: A susceptible-infected-susceptible (SIS) epidemic model was applied to radiation therapy (RT) treatments to predict morphological variations in head and neck (H&N) anatomy. Methods: 360 daily MVCT images of 12 H&N patients treated by tomotherapy were analyzed in this retrospective study. Deformable image registration (DIR) algorithms, mesh grids, and structure recontouring, implemented in the RayStation treatment planning system (TPS), were applied to assess the daily organ warping. The parotid’s warping was evaluated using the epidemiological approach considering each vertex as a single subject and its deformed vector field (DVF) as an infection. Dedicated IronPython scripts were developed to export daily coordinates and displacements of the region of interest (ROI) from the TPS. MATLAB tools were implemented to simulate the SIS modeling. Finally, the fully trained model was applied to a new patient. Results: A QUASAR phantom was used to validate the model. The patients’ validation was obtained setting 0.4 cm of vertex displacement as threshold and splitting susceptible (S) and infectious (I) cases. The correlation between the epidemiological model and the parotids’ trend for further optimization of alpha and beta was carried out by Euclidean and dynamic time warping (DTW) distances. The best fit with experimental conditions across all patients (Euclidean distance of 4.09 ± 1.12 and DTW distance of 2.39 ± 0.66) was obtained setting the contact rate at 7.55 ± 0.69 and the recovery rate at 2.45 ± 0.26; birth rate was disregarded in this constant population. Conclusions: Combining an epidemiological model with adaptive RT (ART), the authors’ novel approach could support image-guided radiation therapy (IGRT) to validate daily setup and to forecast anatomical variations. The SIS-ART model developed could support clinical decisions in order to optimize timing of replanning achieving personalized treatments.

60 APPLIED LIFE SCIENCES↗

Initial CEED API (CEED-MS10)

Key components of CEED software development involve fast finite element operator storage and evaluation, architecture optimizations, performant algorithms for all orders, global kernels for finite element operators, efficient use of the memory sub-system, optimal data locality and motion, enhanced scalability and parallelism, and fast tensor contractions. As ultimate goals of the project, CEED is exploring and identifying the best algorithms for the full range of discretizations and applying algorithmic and software development to support ECP applications’ needs. In this milestone, we initiated the development and implementation of a common CEED API consisting of two main components: low-level and high-level APIs. We accomplished the goal of having the low-level component ready for the release of CEED v1.0 in the next quarter, see CEED-MS13. In this report we also provide a highlight from CEED’s integration with the MARBL app and the corresponding Laghos miniapp. A main theme in this work has been the systematic transition of advanced algorithms, developed and tested in Laghos, to the large-scale multi-physics settings of the MARBL code. The low-level CEED API provides a set of FE kernels and components for writing new low-level kernels. Examples include: vector and sparse linear algebra, element matrix assembly over a batch of elements, partial assembly and action for efficient high-order operators like mass, diffusion, advection, etc. The main goal of the low-level API is to establish the basis for the high-level API. Also, identifying such low-level kernels and providing a reference implementation for them serves as the basis for collaboration with vendors and STs. Another goal for the low-level API is to make it easy for applications with their own discretization infrastructure, who do not want to switch directly to using the high-level CEED API, to still evaluate and use the core operations provided by the low-level API. One of the challenges with high-order methods is that a global sparse matrix is no longer a good representation of a high-order linear operator, both with respect to the FLOPs needed for its evaluation, as well as the memory transfer needed for a matvec. Thus, another important question we tried to address while developing the low-level API is: is it possible to abstract out in a natural and efficient way the different implementations and data structures that arise when dealing with various computational device types: CPUs, GPUs, etc. Fully answering this question is beyond the scope of this particular milestone, since that requires longer time as we develop and expand the devices we support. The future high-level API will be the frontend provided by CEED consisting of high-level abstractions such as meshes, finite element spaces and solutions, bilinear forms, solvers, etc. At this high-level, an important aspect of the API will be to provide a uniform abstraction layer for writing code in a portable manner. To achieve that, we plan to utilize the MPI programming model combined with a device abstraction layer (DAL) for finite element computations that we will develop. The DAL will serve as the bridge between the low- and the high-level APIs, allowing a variety of programming models to be used for the low-level kernel implementations. The software artifacts delivered as part of this milestone include an initial CEED API software implementation (libCEED) provided through the CEED website, http://ceed.exascaleproject.org and the CEED GitHub organization, http://github.com/ceed. In addition to details and results from the above R&D efforts, in this document we are also reporting on other project-wide activities performed in Q1 of FY18, including: the Nek5000 v17.0 MFEM v3.3.2 and PETSc v3.8 releases, collaborations with ECP/ST and SciDAC projects, the inaugural Nek5000 hackathon and various outreach activities.

97 MATHEMATICS AND COMPUTING↗

Cold Commissioning Simulant Selection for the Hanford Tank Waste Treatment Plant LAW Facility - 18465

Commissioning the Low-Activity Waste (LAW) Facility of the Hanford Tank Waste Treatment and Immobilization Plant (WTP) will require large volumes (∼2,000,000 liters) of a non-radioactive, chemically analogous waste simulant. Cold commissioning will provide for operator training in an integrated facility, demonstration of mechanical process equipment capacity, environmental performance demonstration of emissions control systems, and process control systems shakedown and tuning. Selection of the cold commissioning simulant is following a structured four-phase process to arrive at the preferred composition and recipe. Phases I, II and III are complete. Phase I laid the framework for decision making with preparation of a Project Management Plan, an update to the Simulant Development, Approval, Validation, and Documentation procedure, and a kickoff meeting to gather stakeholder input into the simulant definition and selection criteria. Phase II consisted of a comprehensive literature search and compilation of LAW simulant recipes, followed by initial screening against the selection criteria identified in Phase I. This process identified 72 candidate simulant recipes and down-selected 9 for further study. Phase III studies involved a) statistical comparisons of the similarity of candidate simulant compositions to the tank waste feed vector, b) process modelling of the commissioning sequence with each simulant to estimate glass former and simulant material consumption, offgas and effluent volumes and compositions, and product glass volumes and compositions, and c) evaluation of simulants against the immobilized LAW glass composition algorithm to determine allo able waste loading to ensure compliance with product specifications and process constraints. The results of these studies identified two of the candidate recipes to be carried forward to full-scale testing. Phase IV consists of testing these two recipes at vendor facilities to determine scalability, fabricability, and stability of the simulants when produced at industrial scale. Scalability is the ability to take a recipe from bench scale (1 to 40 liters) batch size to full scale (>35,000 liters) batch size. Fabricability is the ability of a recipe to be prepared in large batches without the need for complex or expensive mechanical equipment, heating, or cooling systems. Stability is the ability of a simulant to withstand long term storage and variations in environmental conditions without unacceptable changes in key characteristics (the set of chemical, physical, and rheological parameters that the simulant is intended to exhibit during cold commissioning tests). Simulants will also be tested for compatibility with other startup material (i.e., frit), tuning simulants, and environmental performance demonstration test spiking solutions to ensure against unexpected situations. Using a structured process is essential when making high impact decisions such as waste simulant selection. Proper planning and a clear explanation of how the decision process will unfold is key to obtaining stakeholder buy-in as more information is gathered. The documentation resulting from this structured selection process will be compiled and summarized in a Cold Commissioning Simulant Definition deliverable due to the Department of Energy 24 months before the start of Cold Commissioning. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

A hybrid reconstruction algorithm for fast and accurate 4D cone-beam CT imaging

Purpose: 4D cone beam CT (4D-CBCT) has been utilized in radiation therapy to provide 4D image guidance in lung and upper abdomen area. However, clinical application of 4D-CBCT is currently limited due to the long scan time and low image quality. The purpose of this paper is to develop a new 4D-CBCT reconstruction method that restores volumetric images based on the 1-min scan data acquired with a standard 3D-CBCT protocol. Methods: The model optimizes a deformation vector field that deforms a patient-specific planning CT (p-CT), so that the calculated 4D-CBCT projections match measurements. A forward-backward splitting (FBS) method is invented to solve the optimization problem. It splits the original problem into two well-studied subproblems, i.e., image reconstruction and deformable image registration. By iteratively solving the two subproblems, FBS gradually yields correct deformation information, while maintaining high image quality. The whole workflow is implemented on a graphic-processing-unit to improve efficiency. Comprehensive evaluations have been conducted on a moving phantom and three real patient cases regarding the accuracy and quality of the reconstructed images, as well as the algorithm robustness and efficiency. Results: The proposed algorithm reconstructs 4D-CBCT images from highly under-sampled projection data acquired with 1-min scans. Regarding the anatomical structure location accuracy, 0.204 mm average differences and 0.484 mm maximum difference are found for the phantom case, and the maximum differences of 0.3–0.5 mm for patients 1–3 are observed. As for the image quality, intensity errors below 5 and 20 HU compared to the planning CT are achieved for the phantom and the patient cases, respectively. Signal-noise-ratio values are improved by 12.74 and 5.12 times compared to results from FDK algorithm using the 1-min data and 4-min data, respectively. The computation time of the algorithm on a NVIDIA GTX590 card is 1–1.5 min per phase. Conclusions: High-quality 4D-CBCT imaging based on the clinically standard 1-min 3D CBCT scanning protocol is feasible via the proposed hybrid reconstruction algorithm.

60 APPLIED LIFE SCIENCES↗

Machine Learning-Based Identification of the Interface Regions for Coupling Local and Nonlocal Models

Local-nonlocal coupling approaches provide a means to combine the computational efficiency of local models and the accuracy of nonlocal models. However, the coupling process can be challenging, requiring expertise to identify the interface between local and nonlocal regions. Here, this study introduces a machine learning-based approach to automatically detect the regions in which the local and nonlocal models should be used. The method uses loading functions evaluated at grid points to decide the model selection at those points. Training of the networks is based on datasets provided by classes of loading functions for which reference coupling configurations are computed using accurate coupled solutions, where accuracy is measured in terms of the relative error between the solution to the coupling approach and the solution to the nonlocal model. We study two approaches that vary in data structure. The first, the full-domain input data approach, uses the entire load vector and outputs a complete label vector, performing a global classification. The second, a window-based approach, processes loads into windows and addresses the problem as a node-wise classification where each window's central point is classified individually. The classification problems are solved via deep learning algorithms based on convolutional neural networks. The performance of these approaches is studied on one-dimensional numerical examples using F1-scores and accuracy metrics. Notably, the windowing approach achieves an accuracy of 0.96 and an F1-score of 0.97, highlighting its potential to automate coupling processes effectively and enhance computational efficiency in material science applications.

97 MATHEMATICS AND COMPUTING↗

Computation of pseudospectral abscissa for large-scale nonlinear eigenvalue problems

We present an algorithm to compute the pseudospectral abscissa for a nonlinear eigenvalue problem. The algorithm relies on global under-estimator and over-estimator functions for the eigenvalue and singular value functions involved. These global models follow from eigenvalue perturbation theory. The algorithm has three particular features. First, it converges to the globally rightmost point of the pseudospectrum, and it is immune to nonsmoothness. The global convergence assertion is under the assumption that a global lower bound is available for the second derivative of a singular value function depending on one parameter. It may not be easy to deduce such a lower bound analytically, but assigning large negative values works robustly in practice. Second, it is applicable to large-scale problems since the dominant cost per iteration stems from computing the smallest singular value and associated singular vectors, for which efficient iterative solvers can be used. Furthermore, a significant increase in computational efficiency can be obtained by subspace acceleration, that is, by restricting the domains of the linear maps associated with the matrices involved to small but suitable subspaces, and solving the resulting reduced problems. Occasional restarts of these subspaces further enhance the efficiency for large-scale problems. Finally, in contrast to existing iterative approaches based on constructing low-rank perturbations and rightmost eigenvalue computations, the algorithm relies on computing only singular values of complex matrices. Hence, the algorithm does not require solutions of nonlinear eigenvalue problems, thereby further increasing efficiency and reliability. This work is accompanied by a robust implementation of the algorithm that is publicly available.

97 MATHEMATICS AND COMPUTING↗

Krylov subspace recycling for evolving structures

Krylov subspace recycling is a powerful tool when solving a long series of large, sparse linear systems that change only slowly over time. In PDE constrained shape optimization, these series appear naturally, as typically hundreds or thousands of optimization steps are needed with only small changes in the geometry. In this setting, however, applying Krylov subspace recycling can be a difficult task. As the geometry evolves, in general, so does the finite element mesh defined on or representing this geometry, including the numbers of nodes and elements and element connectivity. This is especially the case if re-meshing techniques are used. As a result, the number of algebraic degrees of freedom in the system changes, and in general the linear system matrices resulting from the finite element discretization change size from one optimization step to the next. Changes in the mesh connectivity also lead to structural changes in the matrices. In the case of re-meshing, even if the geometry changes only a little, the corresponding mesh might differ substantially from the previous one. Obviously, this prevents any straightforward mapping of the approximate invariant subspace of the linear system matrix (the focus of recycling in this work) from one optimization step to the next; similar problems arise for other selected subspaces. In this paper, we present an algorithm to map an approximate invariant subspace of the linear system matrix for the previous optimization step to an approximate invariant subspace of the linear system matrix for the current optimization step, for general meshes. This is achieved by exploiting the map from coefficient vectors to finite element functions on the mesh, combined with interpolation or approximation of functions on the finite element mesh. We demonstrate the effectiveness of our approach numerically with several proof of concept studies for a specific meshing technique.

42 ENGINEERING↗

Enabling Technology for Energy Sustainability: Power Electronic Converter Control for Renewables

To ensure high penetration of renewable energy sources into power grids, their interfacing inverters need to be designed to provide grid support functions. Important grid support functions include frequency and voltage support. To this end, the research community has recently invested heavily on grid-forming control pilot projects. Grid forming control aims to replace traditional grid following control, which is based on phase-locked loop and can achieve decoupled real and reactive power control. Here, in this article, we review the state-of-the-art grid following and forming technology and point out some deficiencies in dynamic performance in the widely adopted grid-forming control design. We also examine how to ensure that the vector control capable of decoupled real and reactive power regulation can also be achieved in the grid forming design. This type of design has been prototyped and shown great potential to enable retrofitting of large amounts of grid-following controllers through purely software algorithm update. The technology ensures reliable operation of power grids with high penetration of IBRs, thereby further reducing fossil fueled energy sources and cut down carbon emission.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Model predictive control and optimization for battery charging and discharging

An apparatus for model predictive control (“MPC”) is disclosed. A method and system also perform the functions of the apparatus. The apparatus includes a measurement module that receives battery status information from one or more sensors receiving information from a battery cell, and a Kalman filter module that uses a Kalman filter and the battery status information to provide a state estimate vector. The apparatus includes a battery model module that inputs the state estimate vector and battery status information into a battery model and calculates a battery model output, the battery model representing the battery cell, and an MPC optimization module that inputs one or more battery model outputs and an error signal in a model predictive control algorithm to calculate an optimal response. The optimal response includes a modification of the error signal.

Trimboli, Michael Scott↗

Theoretical Plasma Physics

Lattice Boltzmann algorithms are a mesoscopic method to solve problems in nonlinear physics which are highly parallelized – unlike the direction solution of the original problem. These methods are applied to both fluid and magnetohydrodynamic turbulence. By introducing entropic constraints one can enforce the positive definiteness of the distribution functions and so be able to simulate fluids at high Reynolds numbers without numerical instabilities. By introducing a vector distribution function for the magnetic field one can enforce the divergence free condition on the magnetic field automatically, without the need of divergence cleaning as needed in most direct numerical solutions of the resistive magnetohydrodynamic equations. The principal reason for the high parallelization of lattice Boltzmann codes is that they consist of a kinetic collisional relaxation step (which is purely local) followed by a simple shift of the relaxed data to neighboring lattice sites. In large eddy simulations, the closure schemes are highly nonlocal – the most famous of these schemes is that due to Smagorinsky. Under a lattice Boltzmann representation the Smagorinsky closure is purely local – being simply a particular moment on the perturbed distribution fucntions. After nonlocal fluid moment models were discovered to represent Landau damping, it was found possible to model these fluid models using an appropriate lattice Boltzmann algorithm. The close to ideal parallelization of the lattice Boltzmann codes permitted us to be Gordon Bell finalists on using the Earth Simulation in Japan. We have also been involved in the radio frequency propagation of waves into a tokamak and into a spherical overdense tokamak plasma. Initially we investigated the use of a quasi-optical grill for the launching of lower hybrid waves into a tokamak. It was found that the conducting walls do not prevent the rods from being properly irradiated, the overloading of the quasi-optical grill is not severe with the electric field only being about three times higher than in the ideal case. Moreover, the quasi-optical grill was significantly fewer structural elements that the multijunction grill. Nevertheless there has not been much interest from experimental fusion groups to implementing these structures. Hence we have returned to optimizing the multijunction grill so that the large number of coupling matrix elements can be efficiently evaluated using symmetry arguments. In overdense plasmas, the standard electromagnetic waves cannot propagate into the plasma center, but are reflected at the plasma edge. By optimizing mode conversion processes (in particular, the O-X-B wave propagation of Ordinary Mode converting to an Extraordinary mode which then converts into an electrostatic Bernstein wave) one can excite within the plasma an electrostatic Bernstein wave that does not suffer density cutoffs and is absorbed on the electron cyclotron harmonics. Finally we have started looking at other mesoscopic lattice algorithms that involve unitary collision and streaming steps. Because these algorithms are unitary they can be run on quantum computers when they become available – unlike their computational cousin of lattice Boltzmann which is a purely classical code. These quantum lattice gas algorithms have been tested successfully on exact analytic soliton collision solution. These calculations are hoped to be able to study Bose Einstein condensed atomic gases and their ground states in an optical lattice.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

$\mathrm{SIM}$-$\mathrm{STEM}$ $\mathrm{Lab}$: Incorporating Compressed Sensing Theory for Fast STEM Simulation

We report recently it has been shown that precise dose control and an increase in the overall acquisition speed of atomic resolution scanning transmission electron microscope (STEM) images can be achieved by acquiring only a small fraction of the pixels in the image experimentally and then reconstructing the full image using an inpainting algorithm. In this paper, we apply the same inpainting approach (a form of compressed sensing) to simulated, sub-sampled atomic resolution STEM images. We find that it is possible to significantly sub-sample the area that is simulated, the number of g-vectors contributing the image, and the number of frozen phonon configurations contributing to the final image while still producing an acceptable fit to a fully sampled simulation. Here we discuss the parameters that we use and how the resulting simulations can be quantifiably compared to the full simulations. As with any Compressed Sensing methodology, care must be taken to ensure that isolated events are not excluded from the process, but the observed increase in simulation speed provides significant opportunities for real time simulations, image classification and analytics to be performed as a supplement to experiments on a microscope to be developed in the future

47 OTHER INSTRUMENTATION↗

Improved predictions of transcription factor binding sites using physicochemical features of DNA

Typical approaches for predicting transcription factor binding sites (TFBSs) involve use of a position-specific weight matrix (PWM) to statistically characterize the sequences of the known sites. Recently, an alternative physicochemical approach, called SiteSleuth, was proposed. In this approach, a linear support vector machine (SVM) classifier is trained to distinguish TFBSs from background sequences based on local chemical and structural features of DNA. SiteSleuth appears to generally perform better than PWM-based methods. Here, we improve the SiteSleuth approach by considering both new physicochemical features and algorithmic modifications. New features are derived from Gibbs energies of amino acid–DNA interactions and hydroxyl radical cleavage profiles of DNA. Algorithmic modifications consist of inclusion of a feature selection step, use of a nonlinear kernel in the SVM classifier, and use of a consensus-based post-processing step for predictions. We also considered SVM classification based on letter features alone to distinguish performance gains from use of SVM-based models versus use of physicochemical features. The accuracy of each of the variant methods considered was assessed by cross validation using data available in the RegulonDB database for 54 Escherichia coli TFs, as well as by experimental validation using published ChIP-chip data available for Fis and Lrp.

59 BASIC BIOLOGICAL SCIENCES↗

Population Count on Intel® CPU, GPU, and FPGA

Population count is a primitive used in many applications. Commodity processors have dedicated instructions for achieving high-performance population count. Motivated by the productivity of high-level synthesis and the importance of population count, in this paper we investigated the OpenCL implementations of population count algorithms, and evaluated their performance and resource utilizations on an FPGA. Based on the results, we select the most efficient implementation. Then we derived a reduction pattern from a representative application of population count. We parallelized the reduction with atomic functions, and optimized it with vectorized memory accesses, tree reduction, and compute-unit duplication. We evaluated the performance of the reduction kernel on an Intel (R) Xeon (R) CPU and an Intel (R) IrisT Pro integrated GPU, and an FPGA card that features an Intel (R) Arria (R) 10 FPGA. When DRAM memory bandwidth is comparable on the three computing platforms, the FPGA can achieve the highest kernel performance for large workload. On the other hand, we described performance bottlenecks on the FPGA. To make FPGAs more competitive in raw performance compared to high-performant CPU and GPU platforms, it is important to increase external memory bandwidth, minimize data movement between a host and a device, and reduce OpenCL runtime overhead on an FPGA.

heterogeneous computing↗

TH-CD-207A-03: A Surface Deformation Driven Respiratory Model for Organ Motion Tracking in Lung Cancer Radiotherapy

Purpose: To propose and validate a novel real-time surface-mesh-based internal organ-external surface motion and deformation tracking method for lung cancer radiotherapy. Methods: Deformation vector fields (DVFs) which characterizes the internal and external motion are obtained by registering the internal organ and tumor contours and external surface meshes to a reference phase in the 4D CT images using a recent developed local topology preserved non-rigid point matching algorithm (TOP). A composite matrix is constructed by combing the estimated internal and external DVFs. Principle component analysis (PCA) is then applied on the composite matrix to extract principal motion characteristics and finally yield the respiratory motion model parameters which correlates the internal and external motion and deformation. The accuracy of the respiratory motion model is evaluated using a 4D NURBS-based cardiac-torso (NCAT) synthetic phantom and three lung cancer cases. The center of mass (COM) difference is used to measure the tumor motion tracking accuracy, and the Dice’s coefficient (DC), percent error (PE) and Housdourf’s distance (HD) are used to measure the agreement between the predicted and ground truth tumor shape. Results: The mean COM is 0.84±0.49mm and 0.50±0.47mm for the phantom and patient data respectively. The mean DC, PE and HD are 0.93±0.01, 0.13±0.03 and 1.24±0.34 voxels for the phantom, and 0.91±0.04, 0.17±0.07 and 3.93±2.12 voxels for the three lung cancer patients, respectively. Conclusions: We have proposed and validate a real-time surface-mesh-based organ motion and deformation tracking method with an internal-external motion modeling. The preliminary results conducted on a synthetic 4D NCAT phantom and 4D CT images from three lung cancer cases show that the proposed method is reliable and accurate in tracking both the tumor motion trajectory and deformation, which can serve as a potential tool for real-time organ motion and deformation monitoring in lung cancer radiotherapy. This work is supported in part by grant from VARIAN MEDICAL SYSTEMS INC, the National Natural Science Foundation of China (no 81428019 and no 81301940), the Guangdong Natural Science Foundation (2015A030313302)and the 2015 Pearl River S&T Nova Program of Guangzhou (201506010096).

60 APPLIED LIFE SCIENCES↗

A Thermo-Optic Propagation Modeling Capability.

A new theoretical basis is derived for tracing optical rays within a finite-element (FE) volume. The ray-trajectory equations are cast into the local element coordinate frame and the full finite-element interpolation is used to determine instantaneous index gradient for the ray-path integral equation. The FE methodology (FEM) is also used to interpolate local surface deformations and the surface normal vector for computing the refraction angle when launching rays into the volume, and again when rays exit the medium. The method is implemented in the Matlab(TM) environment and compared to closed- form gradient index models. A software architecture is also developed for implementing the algorithms in the Zemax(TM) commercial ray-trace application. A controlled thermal environment was constructed in the laboratory, and measured data was collected to validate the structural, thermal, and optical modeling methods.

Schrader, Karl↗

Aerial Scene Recognition using Efficient Sparse Representation

Advanced scene recognition systems for processing large volumes of high-resolution aerial image data are in great demand today. However, automated scene recognition remains a challenging problem. Efficient encoding and representation of spatial and structural patterns in the imagery are key in developing automated scene recognition algorithms. We describe an image representation approach that uses simple and computationally efficient sparse code computation to generate accurate features capable of producing excellent classification performance using linear SVM kernels. Our method exploits unlabeled low-level image feature measurements to learn a set of basis vectors. We project the low-level features onto the basis vectors and use simple soft threshold activation function to derive the sparse features. The proposed technique generates sparse features at a significantly lower computational cost than other methods~\cite{Yang10, newsam11}, yet it produces comparable or better classification accuracy. We apply our technique to high-resolution aerial image datasets to quantify the aerial scene classification performance. We demonstrate that the dense feature extraction and representation methods are highly effective for automatic large-facility detection on wide area high-resolution aerial imagery.

Computer Vision↗