Search NASA⌕ Search

SEARCH · Search NASA

Results for “kernel method”

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 955 records · Page 53

Crossover ensembles of random matrices and skew-orthogonal polynomials

Highlights: > We study crossover ensembles of Jacobi family of random matrices. > We consider correlations for orthogonal-unitary and symplectic-unitary crossovers. > We use the method of skew-orthogonal polynomials and quaternion determinants. > We prove universality of spectral correlations in crossover ensembles. > We discuss applications to quantum conductance and communication theory problems. - Abstract: In a recent paper (S. Kumar, A. Pandey, Phys. Rev. E, 79, 2009, p. 026211) we considered Jacobi family (including Laguerre and Gaussian cases) of random matrix ensembles and reported exact solutions of crossover problems involving time-reversal symmetry breaking. In the present paper we give details of the work. We start with Dyson's Brownian motion description of random matrix ensembles and obtain universal hierarchic relations among the unfolded correlation functions. For arbitrary dimensions we derive the joint probability density (jpd) of eigenvalues for all transitions leading to unitary ensembles as equilibrium ensembles. We focus on the orthogonal-unitary and symplectic-unitary crossovers and give generic expressions for jpd of eigenvalues, two-point kernels and n-level correlation functions. This involves generalization of the theory of skew-orthogonal polynomials to crossover ensembles. We also consider crossovers in the circular ensembles to show the generality of our method. In the large dimensionality limit, correlations in spectra with arbitrary initial density are shown to be universal when expressed in terms of a rescaled symmetry breaking parameter. Applications of our crossover results to communication theory and quantum conductance problems are also briefly discussed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Improving the Accuracy of Quadrature Method Solutions of Fredholm Integral Equations that Arise from Nonlinear Two-Point Boundary Value Problems

In this paper we are concerned with high-accuracy quadrature method solutions of nonlinear Fredholm integral equations of the form y(x) = r(x) + integral(0 to 1) g(x,t) F(t, y(t)) dt, 0 less than or equal to x less than or equal to 1, where the kernel function g(x,t) is continuous, but its partial derivatives have finite jump discontinuities across x = t. Such integrals equations arise, e.g., when one applies Green's function techniques to nonlinear two-point boundary value problems of the form U''(x) = f(x,y(x)), 0 less than or equal to x less than or equal to 1, with y(0) = y(sub 0) and g(l) = y(sub 1), or other linear boundary conditions. A quadrature method that is especially suitable and that has been employed for such equations is one based on the trapezoidal rule that has a low accuracy. By analyzing the corresponding Euler-Maclaurin expansion, we derive suitable correction terms that we add to the trapezoidal thus obtaining new numerical quadrature formulas of arbitrarily high accuracy that we also use in defining quadrature methods for the integral equations above. We prove an existence and uniqueness theorem for the quadrature method solutions, and show that their accuracy is the same as that of the underlying quadrature formula. The solution of the nonlinear systems resulting from the quadrature methods is achieved through successive approximations whose convergence is also proved. The results are demonstrated with numerical examples.

Sidi, Avram↗

Noise and error analysis and optimization in particle-based kinetic plasma simulations

In this paper we analyze the noise in macro-particle methods used in plasma physics and fluid dynamics, leading to approaches for minimizing the total error, focusing on electrostatic models in one dimension. We begin by describing kernel density estimation for continuous values of the spatial variable x, expressing the kernel in a form in which its shape and width are represented separately. The covariance matrix of the noise in the density is computed, first for uniform true density. The bandwidth of the covariance matrix C(x,y) is related to the width of the kernel. A feature that stands out is the presence of constant negative terms in the elements of the covariance matrix both on and off-diagonal. These negative correlations are related to the fact that the total number of particles is fixed at each time step; they also lead to the property ∫C(x,y)dy = 0. We investigate the effect of these negative correlations on the electric field computed by Gauss's law, finding that the noise in the electric field is related to a process called the Ornstein-Uhlenbeck bridge, leading to a covariance matrix of the electric field with variance significantly reduced relative to that of a Brownian process. For non-constant density, p(x), still with continuous x, we analyze the total error in the density estimation and discuss it in terms of bias-variance optimization (BVO). For some characteristic length l, determined by the density and its second derivative, and kernel width h, having too few particles within h leads to too much variance; for h that is large relative to l, there is too much smoothing of the density. The optimum between these two limits is found by BVO. For kernels of the same width, it is shown that this optimum (minimum) is weakly sensitive to the kernel shape. Next, we repeat the analysis for x discretized on a grid. In this case the charge deposition rule is determined by a particle shape. An important property to be respected in the discrete system is the exact preservation of total charge on the grid; this property is necessary to ensure that the electric field is equal at both ends, consistent with periodic boundary conditions. We find that if the particle shapes satisfy a partition of unity property, the particle charge deposited on the grid is conserved exactly. Further, if the particle shape is expressed as the convolution of a kernel with another kernel that satisfies the partition of unity, then the particle shape obeys the partition of unity. This property holds for kernels of arbitrary width, including widths that are not integer multiples of the grid spacing. Furthermore, we show results relaxing the approximations used to do BVO optimization analytically, by doing numerical computations of the total error as a function of the kernel width, on a grid in x. The comparison between numerical and analytical results shows good agreement over a range of particle shapes. We discuss the practical implications of our results, including the criteria for design and implementation of computationally efficient particle shapes that take advantage of the developed theory.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

An algorithm to locate the centers of baryon acoustic oscillations

The cosmic structure formed from baryon acoustic oscillations (BAO) in the early universe is imprinted in the galaxy distribution observable in large-scale surveys and is used as a standard ruler in contemporary cosmology. Typically, BAOs are detected as a preferential length scale in two-point statistics, which gives little information about the location of the BAO structures in real space. The aim of the algorithm described in this paper is to find probable centers of BAOs in the cosmic matter distribution. The algorithm convolves the three-dimensional distribution of matter density with a spherical shell kernel of variable radius placed at different locations. The locations that correspond to the highest values of the convolution correspond to the probable centers of BAOs. This method is realized in an open-source, computationally efficient algorithm. Here, we describe the algorithm and present the results of applying it to the SDSS DR9 CMASS survey and associated mock catalogs. A detailed performance study demonstrates the ability of the algorithm to locate BAO centers and in doing so presents a novel detection of the BAO scale in galaxy surveys.

79 ASTRONOMY AND ASTROPHYSICS↗

Inferring safety critical events from vehicle kinematics in naturalistic driving environment: Application of deep learning Algorithms

Advances in sensing technology has enabled the collection of countless terabytes of second-by-second kinematics data. Such data provides opportunities for real-time monitoring of driving behavior and identification of safety critical events (SCEs) including crashes and near crashes. The concept of volatility is relevant in this context, which identifies instability and erratic variations in driving behavior prior to involvement in SCEs. This study utilized vehicle kinematics from a large-scale naturalistic driving data to develop a deep learning approach based on 1D convolutional neural networks (CNN) for inferring SCEs. The data are unique in the sense that such accurate pre-crash data at high fidelity are not available in traditional crash repositories. This study contributes to the literature by providing a first attempt at predicting responses to SCEs by developing deep learning-based CNN architectures using novel driving volatility based kinematic thresholds for a sample of 9553 events. The key contribution lies in developing a volatility-based CNN input layout that is acceptable to CNN schemes and represents the motion kinematics such as speed, acceleration and volatility measures. Several 1D-CNN architectures were developed using layers, numbers of convolutions, layer patterns, and kernels. Shallow and deep architectures were tested, revealing higher accuracy of shallow architectures in detecting SCEs. The optimal number of epochs were identified using an early stopping method while the CNN performance was improved by increasing the number of epochs. The ensemble CNN had the highest predictive accuracy of 95.6% for detection of crashes and near crashes, which was 2.5% higher than the optimal CNN using 20% hold out test data. The ensemble CNN also outperformed classical machine learning models and model performance reported in past studies on detection of SCEs. Finally, these results have implications for identification of safety hotspots and providing real-time alerts and warnings in connected and highly automated vehicle environment including society of automotive engineers levels 3–5.

42 ENGINEERING↗

Parallel DTFE Surface Density Field Reconstruction

We improve the interpolation accuracy and efficiency of the Delaunay tessellation field estimator (DTFE) for surface density field reconstruction by proposing an algorithm that takes advantage of the adaptive triangular mesh for line-of-sight integration. The costly computation of an intermediate 3D grid is completely avoided by our method and only optimally chosen interpolation points are computed, thus, the overall computational cost is significantly reduced. The algorithm is implemented as a parallel shared-memory kernel for large-scale grid rendered field reconstructions in our distributed-memory framework designed for N-body gravitational lensing simulations in large volumes. We also introduce a load balancing scheme to optimize the efficiency of processing a large number of field reconstructions. Our results show our kernel outperforms existing software packages for volume weighted density field reconstruction, achieving ~ 10x speedup, and our load balancing algorithm gains an additional ~ 3.6x speedup at scales with ~ 16k processes.

97 MATHEMATICS AND COMPUTING↗

TH-A-9A-06: Inverse Planning of Gamma Knife Radiosurgery Using Natural Physical Models

Purpose: Treatment-planning systems rely on computer intensive optimization algorithms in order to provide radiation dose localization. We are investigating a new optimization paradigm based on natural physical modeling and simulations, which tend to evolve in time and find the minimum energy state. In our research, we aim to match physical models with radiation therapy inverse planning problems, where the minimum energy state coincides with the optimal solution. As a prototype study, we have modeled the inverse planning of Gamma Knife radiosurgery using the dynamic interactions between charged particles and demonstrate the potential of the paradigm. Methods: For inverse planning of Gamma Knife radiosurgery: (1) positive charges are uniformly placed on the surface of tumors and critical structures. (2) The Gamma Knife dose kernels of 4mm, 8mm and 16mm radii are modeled as geometric objects with variable charges. (3) The number of shots per each kernel radii is obtained by solving a constrained integer-linear problem. (4) The shots are placed into the tumor volume and move under electrostatic forces. The simulation is performed until internal forces are zero or maximum iterations are reached. (5) Finally, non-negative least squares (NNLS) is used to calculate the beam-on times for each shot. Results: A 3D C-shaped tumor surrounding a spherical critical structure was used for testing the new optimization paradigm. These tests showed that charges spread out evenly covering the tumor while keeping distance from the critical structure, resulting in a high quality plan. Conclusion: We have developed a new paradigm for dose optimization based on the simulation of physical models. As prototype studies, we applied electrostatic models to Gamma Knife radiosurgery and demonstrated the potential of the new paradigm. Further research and fine-tuning of the model are underway. NSF CBET-0853157.

60 APPLIED LIFE SCIENCES↗

Radiation Effects on Network on Chips (NoC) Laboratory Directed Research and Development (LDRD) project

This project was motivated by State-of-the-Art (SOTA) technology that incorporates Network on Chips (NOC) for efficient data communication across the various computer kernels. For example, on the AMD Versal Field Programmable Gate Arrays (FPGA), an NoC has been incorporated for fast data communication from the programmable logic and other computer kernels (processing system, adaptable intelligence engines, etc.). The radiation effects on the legacy technology of this FPGA, such as the programmable logic, are well understood, and established methods exist to measure cross-sections when new families/generations are released; however, newly incorporated technologies, such as the NoC, are not fully understood and could introduce new failure points into the mission space.

36 MATERIALS SCIENCE↗

The Transition Density Formalism in the First Compton Computation on $^4$He

The method and results of the first theory description of 4He Compton scattering at nuclear energies is presented, with a focus on figures. It uses the same Compton kernels familiar from proton, deuteron and 3He Compton scattering in Chiral Effective Field Theory with explicit Delta degrees of freedom, applicable between about 50 and 130MeV. The result compares well to data from HIγS, MAXlab and Illinois. The sensitivity of the cross section on the (static) scalar-isoscalar polarisabilities of the nucleon is explored. The project is part of the synergetic international effort of experimentalists and theorists in Compton scattering on one- and few-nucleon systems.

Griesshammer, Harald [The George Washington Univer↗

Use of speckle for determining the response characteristics of Doppler imaging radars

An optical model is developed for imaging optical radars such as the SAR on Seasat and the Shuttle Imaging Radar (SIR-B) by analyzing the Doppler shift of individual speckles in the image. The signal received at the spacecraft is treated in terms of a Fresnel-Kirchhoff integration over all backscattered radiation within a Huygen aperture at the earth. Account is taken of the movement of the spacecraft along the orbital path between emission and reception. The individual points are described by integration of the point source amplitude with a Green's function scattering kernel. Doppler data at each point furnishes the coordinates for visual representations. A Rayleigh-Poisson model of the surface scattering characteristics is used with Monte Carlo methods to generate simulations of Doppler radar speckle that compare well with Seasat SAR data SIR-B data.

Tilley, D. G.↗

The probabilistic neural network architecture for high speed classification of remotely sensed imagery

In this paper we discuss a neural network architecture (the Probabilistic Neural Net or the PNN) that, to the best of our knowledge, has not previously been applied to remotely sensed data. The PNN is a supervised non-parametric classification algorithm as opposed to the Gaussian maximum likelihood classifier (GMLC). The PNN works by fitting a Gaussian kernel to each training point. The width of the Gaussian is controlled by a tuning parameter called the window width. If very small widths are used, the method is equivalent to the nearest neighbor method. For large windows, the PNN behaves like the GMLC. The basic implementation of the PNN requires no training time at all. In this respect it is far better than the commonly used backpropagation neural network which can be shown to take O(N6) time for training where N is the dimensionality of the input vector. In addition the PNN can be implemented in a feed forward mode in hardware. The disadvantage of the PNN is that it requires all the training data to be stored. Some solutions to this problem are discussed in the paper. Finally, we discuss the accuracy of the PNN with respect to the GMLC and the backpropagation neural network (BPNN). The PNN is shown to be better than GMLC and not as good as the BPNN with regards to classification accuracy.

Chettri, Samir R.↗

Predicting Cycle-to-cycle Variations in a Spark-ignition Engine using Multi-cycle Large Eddy Simulation

Multi-cycle large eddy simulation (LES) of a spark-ignition engine has been performed to predict cycle-to-cycle variations (CCV). To describe spark-ignited premixed flame propagation, the front propagation formulation (FPF) method is combined with a laminar-to-turbulent flame transition model that describes the non-equilibrium flame development processes during the initial stage of the kernel growth. In the laminar-to-turbulent flame transition model, the effects of turbulence on the variations in the laminar-to-turbulent flame transition time are modeled based on the Kolmogorov energy cascade. 15 consecutive cycle LES of in-cylinder processes in a spark-ignition four-valve single cylinder engine is conducted. The predicted in-cylinder pressure is compared with the experimental measurements. The range of CCV observed in the experiment is reproduced to an acceptable degree. The predicted CCV is found to be closely related to the difference in the turbu- lence field near the spark plug around the time of spark discharging, which is consistent with the previous LES studies. The current results also suggest the importance of capturing the variations of the laminar-to-turbulent flame transition in predicting CCV.

Su, Yunde↗

Predicting Cycle-to-cycle Variations in a Spark-ignition Engine using Multi-cycle Large Eddy Simulation

Multi-cycle large eddy simulation (LES) of a spark-ignition engine has been performed to predict cycle-to-cycle variations (CCV). To describe spark-ignited premixed flame propagation, the front propagation formulation (FPF) method is combined with a laminar-to-turbulent flame transition model that describes the non-equilibrium flame development processes during the initial stage of the kernel growth. In the laminar-to-turbulent flame transition model, the effects of turbulence on the variations in the laminar-to-turbulent flame transition time are modeled based on the Kolmogorov energy cascade. 15 consecutive cycle LES of in-cylinder processes in a spark-ignition four-valve single cylinder engine is conducted. The predicted in-cylinder pressure is compared with the experimental measurements. The range of CCV observed in the experiment is reproduced to an acceptable degree. The predicted CCV is found to be closely related to the difference in the turbulence field near the spark plug around the time of spark discharging, which is consistent with the previous LES studies. The current results also suggest the importance of capturing the variations of the laminar-to-turbulent flame transition in predicting CCV.

Yu, Yunde↗

Evaluating Operating System Vulnerability to Memory Errors

Reliability is of great concern to the scalability of extreme-scale systems. Of particular concern are soft errors in main memory, which are a leading cause of failures on current systems and are predicted to be the leading cause on future systems. While great effort has gone into designing algorithms and applications that can continue to make progress in the presence of these errors without restarting, the most critical software running on a node, the operating system (OS), is currently left relatively unprotected. OS resiliency is of particular importance because, though this software typically represents a small footprint of a compute node's physical memory, recent studies show more memory errors in this region of memory than the remainder of the system. In this paper, we investigate the soft error vulnerability of two operating systems used in current and future high-performance computing systems: Kitten, the lightweight kernel developed at Sandia National Laboratories, and CLE, a high-performance Linux-based operating system developed by Cray. For each of these platforms, we outline major structures and subsystems that are vulnerable to soft errors and describe methods that could be used to reconstruct damaged state. Our results show the Kitten lightweight operating system may be an easier target to harden against memory errors due to its smaller memory footprint, largely deterministic state, and simpler system structure.

99 GENERAL AND MISCELLANEOUS↗

Nonlinear registration of serial coronary CT angiography (CCTA) for assessment of changes in atherosclerotic plaque

Purpose: Coronary CT angiography (CCTA) is a high-resolution three-dimensional imaging technique for the evaluation of coronary arteries in suspected or confirmed coronary artery disease (CAD). Coregistration of serial CCTA scans would allow precise superimposition of images obtained at two different points in time, which could aid in recognition of subtle changes and precise monitoring of coronary plaque progression or regression. To this end, the authors aimed at developing a fully automatic nonlinear volume coregistration for longitudinal CCTA scan pairs. Methods: The algorithm combines global displacement and local deformation using nonlinear volume coregistration with a volume-preserving constraint. Histogram matching of intensities between two serial scans is performed prior to nonlinear coregistration with dense nonparametric local deformation in which sum of squared differences is used as a similarity measure. The approximate segmentation of coronary arteries obtained from commercially available software provides initial anatomical landmarks for the coregistration algorithm that help localize and emphasize the structure of interest. To avoid possible bias caused by incorrect segmentation, the authors convolve the Gaussian kernel with the segmented binary coronary tree mask and define an extended weighted region of interest. A multiresolution approach is employed to represent coarse-to-fine details of both volumes and the energy function is optimized using a gradient descent method. The authors applied the algorithm in ten paired CCTA datasets (20 scans in total) obtained within 10.7{+-}5.7 months from each other on a dual source CT scanner to monitor progression of CAD. Results: Serial CCTA coregistration was successful in 9/10 cases as visually confirmed. The global displacement and local deformation of target registration error obtained from four anatomical landmarks were 2.22{+-}1.15 and 1.56{+-}0.74 mm, respectively, and the inverse consistency error of local deformation was 0.14{+-}0.06 mm. The observer variability between two expert observers was 1.31{+-}0.91 mm. Conclusions: The proposed coregistration algorithm demonstrates potential to accurately register serial CCTA scans, which may allow direct comparison of calcified and noncalcified atherosclerotic plaque changes between the two scans.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Alpha image reconstruction (AIR): A new iterative CT image reconstruction approach using voxel-wise alpha blending

Purpose: Iterative image reconstruction gains more and more interest in clinical routine, as it promises to reduce image noise (and thereby patient dose), to reduce artifacts, or to improve spatial resolution. Among vendors and researchers, however, there is no consensus of how to best achieve these aims. The general approach is to incorporatea priori knowledge into iterative image reconstruction, for example, by adding additional constraints to the cost function, which penalize variations between neighboring voxels. However, this approach to regularization in general poses a resolution noise trade-off because the stronger the regularization, and thus the noise reduction, the stronger the loss of spatial resolution and thus loss of anatomical detail. The authors propose a method which tries to improve this trade-off. The proposed reconstruction algorithm is called alpha image reconstruction (AIR). One starts with generating basis images, which emphasize certain desired image properties, like high resolution or low noise. The AIR algorithm reconstructs voxel-specific weighting coefficients that are applied to combine the basis images. By combining the desired properties of each basis image, one can generate an image with lower noise and maintained high contrast resolution thus improving the resolution noise trade-off. Methods: All simulations and reconstructions are performed in native fan-beam geometry. A water phantom with resolution bar patterns and low contrast disks is simulated. A filtered backprojection (FBP) reconstruction with a Ram-Lak kernel is used as a reference reconstruction. The results of AIR are compared against the FBP results and against a penalized weighted least squares reconstruction which uses total variation as regularization. The simulations are based on the geometry of the Siemens Somatom Definition Flash scanner. To quantitatively assess image quality, the authors analyze line profiles through resolution patterns to define a contrast factor for contrast-resolution plots. Furthermore, the authors calculate the contrast-to-noise ratio with the low contrast disks and the authors compare the agreement of the reconstructions with the ground truth by calculating the normalized cross-correlation and the root-mean-square deviation. To evaluate the clinical performance of the proposed method, the authors reconstruct patient data acquired with a Somatom Definition Flash dual source CT scanner (Siemens Healthcare, Forchheim, Germany). Results: The results of the simulation study show that among the compared algorithms AIR achieves the highest resolution and the highest agreement with the ground truth. Compared to the reference FBP reconstruction AIR is able to reduce the relative pixel noise by up to 50% and at the same time achieve a higher resolution by maintaining the edge information from the basis images. These results can be confirmed with the patient data. Conclusions: To evaluate the AIR algorithm simulated and measured patient data of a state-of-the-art clinical CT system were processed. It is shown, that generating CT images through the reconstruction of weighting coefficients has the potential to improve the resolution noise trade-off and thus to improve the dose usage in clinical CT.

60 APPLIED LIFE SCIENCES↗

Prediction of bacterial E3 ubiquitin ligase effectors using reduced amino acid peptide fingerprinting

Background Although pathogenic Gram-negative bacteria lack their own ubiquitination machinery, they have evolved or acquired virulence effectors that can manipulate the host ubiquitination process through structural and/or functional mimicry of host machinery. Many such effectors have been identified in a wide variety of bacterial pathogens that share little sequence similarity amongst themselves or with eukaryotic ubiquitin E3 ligases. Methods To allow identification of novel bacterial E3 ubiquitin ligase effectors from protein sequences we have developed a machine learning approach, the SVM-based Identification and Evaluation of Virulence Effector Ubiquitin ligases (SIEVE-Ub). We extend the string kernel approach used previously to sequence classification by introducing reduced amino acid (RED) alphabet encoding for protein sequences. Results We found that 14mer peptides with amino acids represented as simply either hydrophobic or hydrophilic provided the best models for discrimination of E3 ligases from other effector proteins with a receiver-operator characteristic area under the curve (AUC) of 0.90. When considering a subset of E3 ubiquitin ligase effectors that do not fall into known sequence based families we found that the AUC was 0.82, demonstrating the effectiveness of our method at identifying novel functional family members. Feature selection was used to identify a parsimonious set of 10 RED peptides that provided good discrimination, and these peptides were found to be located in functionally important regions of the proteins involved in E2 and host target protein binding. Our general approach enables construction of models based on other effector functions. We used SIEVE-Ub to predict nine potential novel E3 ligases from a large set of bacterial genomes. SIEVE-Ub is available for download at https://doi.org/10.6084/m9.figshare.7766984.v1 or https://github.com/biodataganache/SIEVE-Ub for the most current version.

59 BASIC BIOLOGICAL SCIENCES↗

TU-CD-BRA-12: Coupling PET Image Restoration and Segmentation Using Variational Method with Multiple Regularizations

Purpose: To propose a new variational method which couples image restoration with tumor segmentation for PET images using multiple regularizations. Methods: Partial volume effect (PVE) is a major degrading factor impacting tumor segmentation accuracy in PET imaging. The existing segmentation methods usually need to take prior calibrations to compensate PVE and they are highly system-dependent. Taking into account that image restoration and segmentation can promote each other and they are tightly coupled, we proposed a variational method to solve the two problems together. Our method integrated total variation (TV) semi-blind deconvolution and Mumford-Shah (MS) segmentation. The TV norm was used on edges to protect the edge information, and the L{sub 2} norm was used to avoid staircase effect in the no-edge area. The blur kernel was constrained to the Gaussian model parameterized by its variance and we assumed that the variances in the X-Y and Z directions are different. The energy functional was iteratively optimized by an alternate minimization algorithm. Segmentation performance was tested on eleven patients with non-Hodgkin’s lymphoma, and evaluated by Dice similarity index (DSI) and classification error (CE). For comparison, seven other widely used methods were also tested and evaluated. Results: The combination of TV and L{sub 2} regularizations effectively improved the segmentation accuracy. The average DSI increased by around 0.1 than using either the TV or the L{sub 2} norm. The proposed method was obviously superior to other tested methods. It has an average DSI and CE of 0.80 and 0.41, while the FCM method — the second best one — has only an average DSI and CE of 0.66 and 0.64. Conclusion: Coupling image restoration and segmentation can handle PVE and thus improves tumor segmentation accuracy in PET. Alternate use of TV and L2 regularizations can further improve the performance of the algorithm. This work was supported in part by National Natural Science Foundation of China (NNSFC), under Grant No.61375018, and Fundamental Research Funds for the Central Universities, under Grant No. 2012QN086. Wei Lu was supported in part by the National Institutes of Health (NIH) Grant No. R01 CA172638.

60 APPLIED LIFE SCIENCES↗