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 847 records · Page 47

A Deep Generative Deconvolutional Image Model

A deep generative model is developed for representation and analysis of images, based on a hierarchical convolutional dictionary-learning framework. Stochastic unpooling is employed to link consecutive layers in the model, yielding top-down image generation. A Bayesian support vector machine is linked to the top-layer features, yielding max-margin discrimination. Deep deconvolutional inference is employed when testing, to infer the latent features, and the top-layer features are connected with the max-margin classifier for discrimination tasks. The model is efficiently trained using a Monte Carlo expectation-maximization (MCEM) algorithm; the algorithm is implemented on graphical processor units (GPU) to enable large-scale learning, and fast testing. Excellent results are obtained on several benchmark datasets, including ImageNet, demonstrating that the proposed model achieves results that are highly competitive with similarly sized convolutional neural networks.

convolutional neural network↗

Brill-Noether-general limit root bundles: absence of vector-like exotics in F-theory Standard Models

Root bundles appear prominently in studies of vector-like spectra of 4d F-theory compactifications. Of particular importance to phenomenology are the Quadrillion F-theory Standard Models (F-theory QSMs). In this work, we analyze a superset of the physical root bundles whose cohomologies encode the vector-like spectra for the matter representations ($3$, $2$) 1/6 , ($\overline{3}$, $1$) -2/3 and ($1$, $1$) 1 . For the family B 3 (Δ$^{°}_{4}$) consisting of $\mathcal{O}$(10 11 ) F-theory QSM geometries, we argue that more than 99.995% of the roots in this superset have no vector-like exotics. This indicates that absence of vector-like exotics in those representations is a very likely scenario in the O(10 11 ) QSM geometries B 3 (Δ$^{°}_{4}$). The QSM geometries come in families of toric 3-folds B 3 (Δ°) obtained from triangulations of certain 3-dimensional polytopes Δ°. The matter curves in X Σ $\large{ϵ}$ B 3 (Δ°) can be deformed to nodal curves which are the same for all spaces in B 3 (Δ°). Therefore, one can probe the vector-like spectra on the entire family B 3 (Δ°) from studies of a few nodal curves. We compute the cohomologies of all limit roots on these nodal curves. In our applications, for the majority of limit roots the cohomologies are determined by line bundle cohomology on rational tree-like curves. For this, we present a computer algorithm. The remaining limit roots, corresponding to circuit-like graphs, are handled by hand. The cohomologies are independent of the relative position of the nodes, except for a few circuits. On these jumping circuits, line bundle cohomologies can jump if nodes are specially aligned. This mirrors classical Brill-Noether jumps. B 3 (Δ°) admits a jumping circuit, but the root bundle constraints pick the canonical bundle and no jump happens.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

PetIGA: A framework for high-performance isogeometric analysis

We present PetIGA, a code framework to approximate the solution of partial differential equations using isogeometric analysis. PetIGA can be used to assemble matrices and vectors which come from a Galerkin weak form, discretized with Non-Uniform Rational B-spline basis functions. We base our framework on PETSc, a high-performance library for the scalable solution of partial differential equations, which simplifies the development of large-scale scientific codes, provides a rich environment for prototyping, and separates parallelism from algorithm choice. We describe the implementation of PetIGA, and exemplify its use by solving a model nonlinear problem. To illustrate the robustness and flexibility of PetIGA, we solve some challenging nonlinear partial differential equations that include problems in both solid and fluid mechanics. Lastly, we show strong scaling results on up to 4096 cores, which confirm the suitability of PetIGA for large scale simulations.

97 MATHEMATICS AND COMPUTING↗

PETSc TSAdjoint: A Discrete Adjoint ODE Solver for First-Order and Second-Order Sensitivity Analysis

Here, we present a new software system PETSc TSAdjoint for first-order and second order adjoint sensitivity analysis of time-dependent nonlinear differential equations. The derivative calculation in PETSc TSAdjoint is essentially a high-level algorithmic differentiation process. The adjoint models are derived by differentiating the timestepping algorithms and implementing them based on the parallel infrastructure in PETSc. Full differentiation of the library code, including MPI routines, is avoided, and users do not need to derive their own adjoint models for their specific applications. PETSc TSAdjoint can compute the first-order derivative, that is, the gradient of a scalar functional, and the Hessian-vector product, which carries second-order derivative information, while requiring minimal input (a few callbacks) from the users. The adjoint model employs optimal checkpointing schemes in a manner that is transparent to users. Finally, usability, efficiency, and scalability are demonstrated through examples from a variety of applications.

79 ASTRONOMY AND ASTROPHYSICS↗

Using Sequence-Specific Chemical and Structural Properties of DNA to Predict Transcription Factor Binding Sites

An important step in understanding gene regulation is to identify the DNA binding sites recognized by each transcription factor (TF). Conventional approaches to prediction of TF binding sites involve the definition of consensus sequences or position-specific weight matrices and rely on statistical analysis of DNA sequences of known binding sites. Here, we present a method called SiteSleuth in which DNA structure prediction, computational chemistry, and machine learning are applied to develop models for TF binding sites. In this approach, binary classifiers are trained to discriminate between true and false binding sites based on the sequence-specific chemical and structural features of DNA. These features are determined via molecular dynamics calculations in which we consider each base in different local neighborhoods. For each of 54 TFs in Escherichia coli, for which at least five DNA binding sites are documented in RegulonDB, the TF binding sites and portions of the non-coding genome sequence are mapped to feature vectors and used in training. According to cross-validation analysis and a comparison of computational predictions against ChIP-chip data available for the TF Fis, SiteSleuth outperforms three conventional approaches: Match, MATRIX SEARCH, and the method of Berg and von Hippel. SiteSleuth also outperforms QPMEME, a method similar to SiteSleuth in that it involves a learning algorithm. The main advantage of SiteSleuth is a lower false positive rate.

59 BASIC BIOLOGICAL SCIENCES↗

Reference Computational Meshing Strategy for Computational Fluid Dynamics Simulation of Departure from Nucleate Boiling

The objective of this effort is to establish a strategy and process for generation of suitable computational mesh for computational fluid dynamics simulations of departure from nucleate boiling in a 5 by 5 fuel rod assembly held in place by PWR mixing vane spacer grids. This mesh generation process will support ongoing efforts to develop, demonstrate and validate advanced multi-phase computational fluid dynamics methods that enable more robust identification of dryout conditions and DNB occurrence.Building upon prior efforts and experience, multiple computational meshes were developed using the native mesh generation capabilities of the commercial CFD code STAR-CCM+. These meshes were used to simulate two test cases from the Westinghouse 5 by 5 rod bundle facility. The sensitivity of predicted quantities of interest to the mesh resolution was then established using two evaluation methods, the Grid Convergence Index method and the Least Squares method. This evaluation suggests that the Least Squares method can reliably establish the uncertainty associated with local parameters such as vector velocity components at a point in the domain or surface averaged quantities such as outlet velocity magnitude. However, neither method is suitable for characterization of uncertainty in global extrema such as peak fuel surface temperature, primarily because such parameters are not necessarily associated with a fixed point in space. This shortcoming is significant because the current generation algorithm for identification of DNB event conditions relies on identification of such global extrema. Ongoing efforts to identify DNB based on local surface conditions will address this challenge.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

GPU-BASED MONTE CARLO DUST RADIATIVE TRANSFER SCHEME APPLIED TO ACTIVE GALACTIC NUCLEI

A three-dimensional parallel Monte Carlo (MC) dust radiative transfer code is presented. To overcome the huge computing-time requirements of MC treatments, the computational power of vectorized hardware is used, utilizing either multi-core computer power or graphics processing units. The approach is a self-consistent way to solve the radiative transfer equation in arbitrary dust configurations. The code calculates the equilibrium temperatures of two populations of large grains and stochastic heated polycyclic aromatic hydrocarbons. Anisotropic scattering is treated applying the Heney-Greenstein phase function. The spectral energy distribution (SED) of the object is derived at low spatial resolution by a photon counting procedure and at high spatial resolution by a vectorized ray tracer. The latter allows computation of high signal-to-noise images of the objects at any frequencies and arbitrary viewing angles. We test the robustness of our approach against other radiative transfer codes. The SED and dust temperatures of one- and two-dimensional benchmarks are reproduced at high precision. The parallelization capability of various MC algorithms is analyzed and included in our treatment. We utilize the Lucy algorithm for the optical thin case where the Poisson noise is high, the iteration-free Bjorkman and Wood method to reduce the calculation time, and the Fleck and Canfield diffusion approximation for extreme optical thick cells. The code is applied to model the appearance of active galactic nuclei (AGNs) at optical and infrared wavelengths. The AGN torus is clumpy and includes fluffy composite grains of various sizes made up of silicates and carbon. The dependence of the SED on the number of clumps in the torus and the viewing angle is studied. The appearance of the 10 {mu}m silicate features in absorption or emission is discussed. The SED of the radio-loud quasar 3C 249.1 is fit by the AGN model and a cirrus component to account for the far-infrared emission.

79 ASTRONOMY AND ASTROPHYSICS↗

Adaptive control of laser-wakefield accelerators driven by mid-IR laser pulses

There has been growing interest both in studying high intensity ultrafast laser plasma interactions with adaptive control systems as well as using long wavelength driver beams. We demonstrate the coherent control of the dynamics of laser-wakefield acceleration driven by ultrashort (~ 100 fs) mid-infrared (~ 3.9 μ m) laser pulses. The critical density at this wavelength is 7.3 × 10 19 cm -3 , which is achievable with an ordinary gas target system. Interactions between mid-infrared laser pulses and such near-critical-density plasma may be beneficial due to much higher absorption of laser energy. In addition, the normalized vector potential of the laser field a 0 increases with longer laser wavelength, lowering the required peak laser intensity to drive non-linear laser-wakefield acceleration. Here, MeV level, collimated electron beams with non-thermal, peaked energy spectra are generated. Optimization of electron beam qualities are realized through adaptive control of the laser wavefront. A genetic algorithm controlling a deformable mirror improves the electron total charge, energy spectra, beam pointing and stability at various plasma density profiles. Particle-in-cell simulations reveal that the optimal wavefront causes an earlier injection on the density up-ramp and thus higher energy gain as well as less filamentation during the interaction, which leads to the improvement in electron beam collimation and energy spectra.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Advancements of the Hybrid Method UF6 Container Inspection System

Safeguards inspectors currently visit uranium enrichment plants to verify UF6 cylinder enrichment declarations. Measurements are performed with handheld high-resolution detectors on a limited number of cylinders taken to be representative of the plant’s cylinder inventory. These enrichment assay methods interrogate only a small fraction of the total cylinder volume, and are time-consuming and expensive to execute. Pacific Northwest National Laboratory (PNNL) is developing an automated UF6 cylinder verification station concept based on the combined collection of traditional enrichment-meter data (186 keV photons from 235U) and non-traditional, neutron-induced, high-energy gamma-ray signatures (3-8 MeV) with an array of collimated, medium-resolution scintillators. Previous work at PNNL (2010) demonstrated proof-of-principle that this hybrid method yields accurate, full-volume assay of the cylinder enrichment, reduces systematic errors when compared to several other enrichment assay methods, and provides simplified instrumentation and algorithms suitable for long-term, unattended operations. This system aims to increase the number of inspected cylinders at higher accuracy and with lower cost than when compared to inspectors with hand-held instruments. Several measurement campaigns of 30B cylinder populations and a refined MCNP model will be reported. The MCNP model consists of per-gram basis vectors for the different uranium isotopes and several fill geometries, enabling fast generation of any UF6 enrichment level and multiple configurations. The refined model was used to optimize collimator design and detector configuration for the hybrid method. In addition, a new field prototype based on model results was utilized in a set of field measurements.

Mace, Emily K.↗

Imprint of DESI fiber assignment on the anisotropic power spectrum of emission line galaxies

The Dark Energy Spectroscopic Instrument (DESI), a multiplexed fiber-fed spectrograph, is a Stage-IV ground-based dark energy experiment aiming to measure redshifts for 29 million Emission-Line Galaxies (ELG), 4 million Luminous Red Galaxies (LRG), and 2 million Quasi-Stellar Objects (QSO). The survey design includes a pattern of tiling on the sky, the locations of the fiber positioners in the focal plane of the telescope, and an observation strategy determined by a fiber assignment algorithm that optimizes the allocation of fibers to targets. This strategy allows a given region to be covered on average five times for a five-year survey, with a typical variation of about 1.5 about the mean, which imprints a spatially-dependent pattern on the galaxy clustering. In this study, we investigate the systematic effects of the fiber assignment coverage on the anisotropic galaxy clustering of ELGs and show that, in the absence of any corrections, it leads to discrepancies of order ten percent on large scales for the power spectrum multipoles. We introduce a method where objects in a random catalog are assigned a coverage, and the mean density is separately computed for each coverage factor. We show that this method reduces, but does not eliminate the effect. We next investigate the angular dependence of the contaminated signal, arguing that it is mostly localized to purely transverse modes. We demonstrate that the cleanest way to remove the contaminating signal is to perform an analysis of the anisotropic power spectrum P( k ,μ) and remove the lowest μ bin, leaving μ > 0 modes accurate at the few-percent level. Here, μ is the cosine of the angle between the line-of-sight and the direction of $\vec k$. Lastly, we also investigate two alternative definitions of the random catalog and show that they are comparable but less effective than the coverage randoms method.

79 ASTRONOMY AND ASTROPHYSICS↗

Recent Developments in SHERPA

Some recent QCD-related developments in the SHERPA event generator are presented. In the past decades, event generators such as PYTHIA [1, 2] and HERWIG [3, 4] have been central for nearly all physics analyses at particle physics experiments at the high-energy frontier. This will also hold true at the LHC, where a large number of interesting signals for new particles or new phenomena (the Higgs boson or any other manifestation of the mechanism behind electro-weak symmetry breaking, supersymmetry, extra dimensions etc.) is hampered by a plethora of severe, sometimes overwhelming backgrounds. Nearly all of them are largely influenced by QCD. Therefore it seems fair to say that the success of the LHC in finding new physics may very well depend on a deep and detailed understanding of old physics, like QCD. Examples for this include, among others, the central-jet veto for the vector boson fusion channel for Higgs production or topologies, where gauge bosons emerge in association with many jets, a background for many search channels. In a reflection on increased needs by the experimental community, aiming at higher precision, incorporation of new physics models and so on, the work horses of old have undergone serious renovation efforts, resulting in new, improved versions of the respective codes, namely PYTHIA8 [5] and HERWIG++ [6]. In addition a completely new code, SHERPA [7], has been constructed and is in the process of maturing. The status of this code is the topic of this contribution. SHERPA's hallmark property is the inclusion of higher-order tree-level QCD contributions, leading to an improved modelling of jet production. They are introduced through a full-fledged matrix element generator, AMEGIC++ [8], which is capable of generating matrix elements and corresponding phase space mappings for processes with multi-particle final states in various models, including the Standard Model, anomalous gauge triple and quadruple couplings according to [9, 10], the Minimal Supersymmetric Standard Model with Feynman rules from [11], the ADD-model of extra dimensions [12, 13], and a model with an extra U(1) singlet coupling to the Higgs boson only [14]. The code has been thoroughly tested and validated [15]. This code, however, is limited, especially in the treatment of many ({ge} 6) external QCD particles. Therefore, in the near future, SHERPA will incorporate another, new matrix element generator, COMIX, which is based on Berends-Giele recursion relations [16] and color-dressing [17] rather than color-ordering. In Tabs. 1 and 2 some example cross sections for gg {yields} ng at fixed energies and pp {yields} b{bar b} + n jets obtained with this program are exhibited and compared to those from other programs. In addition, concerning the calculation of higher-order matrix elements and cross sections, there have been first steps towards an automation of such calculations at truly next-to leading order accuracy. They manifest themselves in the implementation of a procedure [19] to fully automatically construct and evaluate Catani-Seymour dipole subtraction terms [20] for the real part of such NLO calculations. The results from the matrix element calculations are merged with the subsequent parton shower through the formalism of [21, 22]. The results of its implementation in SHERPA [23] has recently been compared with other algorithms [24]. Although there remains some dispute about the theoretical equivalence of the different approaches, the overall results show satisfying agreement with each other, such that they can be used with confidence for data analysis.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Intelligent feature selection techniques for pattern classification of Lamb wave signals

Lamb wave interaction with flaws is a complex, three-dimensional phenomenon, which often frustrates signal interpretation schemes based on mode arrival time shifts predicted by dispersion curves. As the flaw severity increases, scattering and mode conversion effects will often dominate the time-domain signals, obscuring available information about flaws because multiple modes may arrive on top of each other. Even for idealized flaw geometries the scattering and mode conversion behavior of Lamb waves is very complex. Here, multi-mode Lamb waves in a metal plate are propagated across a rectangular flat-bottom hole in a sequence of pitch-catch measurements corresponding to the double crosshole tomography geometry. The flaw is sequentially deepened, with the Lamb wave measurements repeated at each flaw depth. Lamb wave tomography reconstructions are used to identify which waveforms have interacted with the flaw and thereby carry information about its depth. Multiple features are extracted from each of the Lamb wave signals using wavelets, which are then fed to statistical pattern classification algorithms that identify flaw severity. In order to achieve the highest classification accuracy, an optimal feature space is required but it’s never known a priori which features are going to be best. For structural health monitoring we make use of the fact that physical flaws, such as corrosion, will only increase over time. This allows us to identify feature vectors which are topologically well-behaved by requiring that sequential classes “line up” in feature vector space. An intelligent feature selection routine is illustrated that identifies favorable class distributions in multi-dimensional feature spaces using computational homology theory. Betti numbers and formal classification accuracies are calculated for each feature space subset to establish a correlation between the topology of the class distribution and the corresponding classification accuracy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Performance of GeantV EM Physics Models

The recent progress in parallel hardware architectures with deeper vector pipelines or many-cores technologies brings opportunities for HEP experiments to take advantage of SIMD and SIMT computing models. Launched in 2013, the GeantV project studies performance gains in propagating multiple particles in parallel, improving instruction throughput and data locality in HEP event simulation on modern parallel hardware architecture. Due to the complexity of geometry description and physics algorithms of a typical HEP application, performance analysis is indispensable in identifying factors limiting parallel execution. In this report, we will present design considerations and preliminary computing performance of GeantV physics models on coprocessors (Intel Xeon Phi and NVidia GPUs) as well as on mainstream CPUs.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

CHESS 2025: Waveform LiDAR data from NEON AOP surveys

This dataset provides Level 1 (L1) full-waveform light detection and ranging (LiDAR) data collected for the 2025 Colorado Headwaters Ecological Spectroscopy Study (CHESS). These data were acquired to enable characterization of vegetation structure and other three-dimensional features of the land surface, and to evaluate structural changes that may have occurred between a prior LiDAR acquisition in 2018 and the 2025 overflight. Waveform LiDAR data can provide more detailed information about objects on the ground than discrete point clouds typically do, and they are often used for granular target segmentation and characterization of subcanopy vegetation. The data were acquired over three study domains in the Upper Gunnison river basin: the upper East River watershed (CRBU); Almont Triangle and Taylor Canyon (ALMO); and Upper Taylor River watershed (UPTA) between 2025-06-13 and 2025-07-15. LiDAR data were acquired using the Optech Galaxy Prime Airborne LiDAR Terrain Mapper onboard the National Ecological Observatory Network (NEON) Airborne Observation Platform (AOP). These are the primary waveform LiDAR data delivered by NEON and are provided per flightline in compressed Pulsewaves format, an open-source binary file standard. A Pulsewaves object comprises a two files: a pulse (.pls) file, which stores the geographic origin, outgoing vector, and metadata for every laser pulse emitted by the scanner, and a wave file (.wvs), which stores the sequential amplitude samples of the outgoing pulse and the returning signals. The files are published here in their compressed forms (.plz, .wvz). All waveform data were processed following the theoretical workflow described in the NEON L0-to-L1 Waveform LiDAR Algorithm Theoretical Basis Document (Krause and Goulden 2022a); however, the Pulsewaves output format differs from a legacy format described in that document. Waveform amplitude samples are recorded at 1 nanosecond intervals. All coordinates are provided in meters. Horizontal coordinates are referenced in Universal Transverse Mercator (UTM) zone 13N and the World Geodetic System (WGS) 1984 ensemble datum. Elevations are referenced to Geoid12A. Waveform data for the UPTA survey area were collected without incident and the published records are complete. However, both the ALMO and CRBU collections experienced issues that resulted in incomplete data for those areas. On collection day 2018-06-16 a hardware failure caused the waveform digitizer to lose data from the eastern edge of the ALMO site (Figure 22). The waveform data for flightlines 2–20 could not be extracted from the digitizer, and the data proved unrecoverable. As a result, a portion of the site does not have coverage with waveform data. Although no hardware failure was observed during collection over the CRBU area, final waveform files generated by vendor software contained only ~25% of the expected number of return pulses. After discovery, NEON initiated troubleshooting with the vendor. The root cause of the data ablation had not been identified at the time of publication. Additional data will be published in an update to this package if further recovery proves successful. CHESS Project Description: The Colorado Headwaters Ecological Spectroscopy Study (CHESS) comprised a multi-week airborne remote sensing and field observation campaign in the Upper Gunnison Basin, Colorado, conducted in June and July of 2025. Airborne remote sensing was conducted by the National Ecological Observatory Network Airborne Observation Platform (NEON AOP), concurrent with a field campaign run by the Rocky Mountain Biological Laboratory (RMBL), the Lawrence Berkeley National Laboratory (LBNL) and SLAC National Accelerator Laboratory Watershed Function Science Focus Area (SFA), and NASA-JPL (Jet Propulsion Laboratory) Earth Surface Mineral Dust Source Investigation (EMIT) program. Between June 10 and July 18, 2025, the NEON AOP flight team collected high-resolution aerial imaging spectroscopy and Light Detection and Ranging (LiDAR) data over three domains: the Upper East River (CRBU), Almont Triangle (ALMO), and the Upper Taylor Basin (UPTA). In coordination with the flights, a field campaign acquired ground-truth observations, including observations of vegetation composition, foliar traits, forest demography, and subsurface properties in 18 core sampling areas within the domains. Additional surface water observations were taken at over 380 point locations. All CHESS campaign datasets can be found within the CHESS ESS-DIVE data portal: https://data.ess-dive.lbl.gov/portals/chess. Funding Acknowledgement: Field and remote-sensing data acquisition was performed under a grant from the National Aeronautics and Space Administration (80NSSC24K1005). This work was also supported by the Watershed Function Science Focus Area at Lawrence Berkeley National Laboratory funded by the US Department of Energy, Office of Science, Biological and Environmental Research under Contract No. DE-AC02-05CH11231.

2018 NEON and 2025 CHESS Campaigns↗

Enhancing Privacy in Participatory Sensing Applications with Multidimensional Data

Participatory sensing applications rely on individuals to share local and personal data with others to produce aggregated models and knowledge. In this setting, privacy is an important consideration, and lack of privacy could discourage widespread adoption of many exciting applications. We present a privacy-preserving participatory sensing scheme for multidimensional data which uses negative surveys. Multidimensional data, such as vectors of attributes that include location and environment fields, pose a particular challenge for privacy protection and are common in participatory sensing applications. When reporting data in a negative survey, an individual participant randomly selects a value from the set complement of the sensed data value, once for each dimension, and returns the negative values to a central collection server. Using algorithms described in this paper, the server can reconstruct the probability density functions of the original distributions of sensed values, without knowing the participants actual data. As a consequence, complicated encryption and key management schemes are avoided, conserving energy. We study trade-offs between accuracy and privacy, and their relationships to the number of dimensions, categories, and participants. We introduce dimensional adjustment, a method that reduces the magnification of error associated with earlier work. Two simulation scenarios illustrate how the approach can protect the privacy of a participant's multidimensional data while allowing useful population information to be aggregated.

Groat, Michael↗

Non-Intrusive Energy Disaggregation Using Non-Negative Matrix Factorization With Sum-to-k Constraint

Energy disaggregation or non-intrusive load monitoring addresses the issue of extracting device-level energy consumption information by monitoring the aggregated signal at one single measurement point without installing meters on each individual device. Energy disaggregation can be formulated as a source separation problem, where the aggregated signal is expressed as linear combination of basis vectors in a matrix factorization framework. In this paper, an approach based on Sum-to-k constrained non-negative matrix factorization (S2K-NMF) is proposed. By imposing the sum-to-k constraint and the non-negative constraint, S2K-NMF is able to effectively extract perceptually meaningful sources from complex mixtures. The strength of the proposed algorithm is demonstrated through two sets of experiments: Energy disaggregation in a residential smart home; and heating, ventilating, and air conditioning components energy monitoring in an industrial building testbed maintained at the Oak Ridge National Laboratory. Furthermore, extensive experimental results demonstrate the superior performance of S2K-NMF as compared to state-of-the-art decomposition-based disaggregation algorithms.

42 ENGINEERING↗

SU-E-I-87: Automated Liver Segmentation Method for CBCT Dataset by Combining Sparse Shape Composition and Probabilistic Atlas Construction

Purpose: The aiming of this study was to extract liver structures for daily Cone beam CT (CBCT) images automatically. Methods: Datasets were collected from 50 intravenous contrast planning CT images, which were regarded as training dataset for probabilistic atlas and shape prior model construction. Firstly, probabilistic atlas and shape prior model based on sparse shape composition (SSC) were constructed by iterative deformable registration. Secondly, the artifacts and noise were removed from the daily CBCT image by an edge-preserving filtering using total variation with L1 norm (TV-L1). Furthermore, the initial liver region was obtained by registering the incoming CBCT image with the atlas utilizing edge-preserving deformable registration with multi-scale strategy, and then the initial liver region was converted to surface meshing which was registered with the shape model where the major variation of specific patient was modeled by sparse vectors. At the last stage, the shape and intensity information were incorporated into joint probabilistic model, and finally the liver structure was extracted by maximum a posteriori segmentation.Regarding the construction process, firstly the manually segmented contours were converted into meshes, and then arbitrary patient data was chosen as reference image to register with the rest of training datasets by deformable registration algorithm for constructing probabilistic atlas and prior shape model. To improve the efficiency of proposed method, the initial probabilistic atlas was used as reference image to register with other patient data for iterative construction for removing bias caused by arbitrary selection. Results: The experiment validated the accuracy of the segmentation results quantitatively by comparing with the manually ones. The volumetric overlap percentage between the automatically generated liver contours and the ground truth were on an average 88%–95% for CBCT images. Conclusion: The experiment demonstrated that liver structures of CBCT with artifacts can be extracted accurately for following adaptive radiation therapy. This work is supported by National Natural Science Foundation of China (No. 61201441), Research Fund for Excellent Young and Middle-aged Scientists of Shandong Province (No. BS2012DX038), Project of Shandong Province Higher Educational Science and Technology Program (No. J12LN23), Jinan youth science and technology star (No.20120109)

60 APPLIED LIFE SCIENCES↗

TH-C-18A-02: Machine Learning and STAPLE Based Simultaneous Longitudinal Segmentation of Bone and Marrow Structures From Dual Energy CT

Purpose: To develop a fully-automatic longitudinal bone and marrow segmentation method in the pelvic region from dual energy computed tomography (DECT). Methods: We developed a two-step automatic bone and marrow segmentation method for simultaneous longitudinal evaluation of patients with metastatic bone disease using dual energy CT (DECT). Our approach transforms the DECT images into a multi-material decomposition (MMD) model that represents the voxels as a mixture of multiple materials. A support vector machine (SVM) was trained using a single scan. In the first step of the longitudinal segmentation the trained SVM model detects bone and marrow structures on all available longitudinal scans. Segmentation is further refined through active contour segmentation. In the second step, the segmentations from the individual scans are merged by employing the simultaneous truth and performance level estimation (STAPLE) algorithm. The scans are registered using affine and deformable registration. We found that our approach improves the segmentation in all the scans under reliable registration performance between the same scans. Improving registration was not under the scope of this work. Results: We applied our approach to segment bone and marrow in DECT scans in the pelvic regions for multiple patients. Each patient had three to five follow up scans. All the patients in the analysis had artificial metal prostheses which introduced challenges for the registration. Our algorithm achieved reasonable accurate segmentation despite the presence of metal artifacts and high-density oral contrast in neighboring structures. Our approach obtained an overall segmentation accuracy of 80% using DICE metric. Conclusion: We developed a two-step automatic longitudinal segmentation technique for bone and marrow region structures in the pelvic areas from dual energy CT. Our approach achieves robust segmentation despite the presence of confounding structures with similar intensities as the bone and marrow regions due to uptake of oral contrast and metal artifacts.

60 APPLIED LIFE SCIENCES↗