Search NASA⌕ Search

SEARCH · Search NASA

Results for “adaptive wavelets”

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 37 records · Page 2

A wavelet-optimized, very high order adaptive grid and order numerical method

Differencing operators of arbitrarily high order can be constructed by interpolating a polynomial through a set of data followed by differentiation of this polynomial and finally evaluation of the polynomial at the point where a derivative approximation is desired. Furthermore, the interpolating polynomial can be constructed from algebraic, trigonometric, or, perhaps exponential polynomials. This paper begins with a comparison of such differencing operator construction. Next, the issue of proper grids for high order polynomials is addressed. Finally, an adaptive numerical method is introduced which adapts the numerical grid and the order of the differencing operator depending on the data. The numerical grid adaptation is performed on a Chebyshev grid. That is, at each level of refinement the grid is a Chebvshev grid and this grid is refined locally based on wavelet analysis.

Jameson, Leland↗

A comparison of spectral decorrelation techniques and performance evaluation metrics for a wavelet-based, multispectral data compression algorithm

Future space-based, remote sensing systems will have data transmission requirements that exceed available downlinks necessitating the use of lossy compression techniques for multispectral data. In this paper, we describe several algorithms for lossy compression of multispectral data which combine spectral decorrelation techniques with an adaptive, wavelet-based, image compression algorithm to exploit both spectral and spatial correlation. We compare the performance of several different spectral decorrelation techniques including wavelet transformation in the spectral dimension. The performance of each technique is evaluated at compression ratios ranging from 4:1 to 16:1. Performance measures used are visual examination, conventional distortion measures, and multispectral classification results. We also introduce a family of distortion metrics that are designed to quantify and predict the effect of compression artifacts on multi spectral classification of the reconstructed data.

Matic, Roy M.↗

Effects of isothermal stratification strength on vorticity dynamics for single-mode compressible Rayleigh-Taylor instability

The effects of isothermal initial stratification on the dynamics of the vorticity for single-mode Rayleigh-Taylor instability (RTI) are examined using two-dimensional fully compressible wavelet-based direct numerical simulations. Here, the simulations model low Atwood number ( A = 0.04) RTI development for four different initial stratification strengths, corresponding to Mach numbers from 0.3 (weakly stratified) to 1.2 (strongly stratified), and for three different Reynolds numbers, from 25 500 to 102 000. Here, the Mach number is based on the Atwood-independent gravity wave speed and characterizes the strength of the initial stratification. All simulations use adaptive wavelet-based mesh refinement to achieve very fine spatial resolutions at relatively low computational cost. For all stratifications, the RTI bubble and spike go through the exponential growth regime, followed by a slowing of the RTI evolution.

42 ENGINEERING↗

Extension of Low Dissipative High Order Hydrodynamics Schemes for MHD Equations

The objective of this paper is to extend our recently developed highly parallelizable nonlinear stable high order schemes for complex multiscale hydrodynamic applications to the viscous MHD (magnetohydrodynamic) equations. These schemes employed multiresolution wavelets as adaptive numerical dissipation controls to limit the amount and to aid the selection and/or blending of the appropriate types of dissipation to be used. The new scheme is formulated for both the conservative and non-conservative form of the MHD equations in curvi-linear grids. The three features of the present MHD scheme over existing schemes in the open literature are as follows. First, the scheme is constructed for long-time integrations of shock/turbulence/combustion magnetized flows. Available schemes are too diffusive for long-time integrations and/or turbulence/combustion problems. Second, unlike existing schemes for the conservative MHD equations which suffer from ill-conditioned eigen-decompositions, the present scheme makes use of a well-conditioned eigen-decomposition to solve the conservative form of the MHD equations. This is due to, partly. the fact that the divergence of the magnetic field condition is a different type of constraint from its incompressible Navier-Stokes cousin. Third, a new approach to minimize the numerical error of the divergence free magnetic condition for high order scheme is introduced.

Yee, H. C.↗

A New Low Dissipative High Order Schemes for MHD Equations

The goal of this talk is to extend our recently developed highly parallelizable nonlinear stable high order schemes for complex multiscale hydrodynamic applications to the viscous MHD equations. These schemes employed multiresolution wavelets as adaptive numerical dissipation controls to limit the amount and to aid the selection and/or blending of the appropriate types of dissipation to be used. The new scheme is formulated for both the conservative and non-conservative form of the MHD equations in curvilinear grids.

Yee, H. C.↗

Scalability of a Low-Cost Multi-Teraflop Linux Cluster for High-End Classical Atomistic and Quantum Mechanical Simulations

Scalability of a low-cost, Intel Xeon-based, multi-Teraflop Linux cluster is tested for two high-end scientific applications: Classical atomistic simulation based on the molecular dynamics method and quantum mechanical calculation based on the density functional theory. These scalable parallel applications use space-time multiresolution algorithms and feature computational-space decomposition, wavelet-based adaptive load balancing, and spacefilling-curve-based data compression for scalable I/O. Comparative performance tests are performed on a 1,024-processor Linux cluster and a conventional higher-end parallel supercomputer, 1,184-processor IBM SP4. The results show that the performance of the Linux cluster is comparable to that of the SP4. We also study various effects, such as the sharing of memory and L2 cache among processors, on the performance.

Kikuchi, Hideaki↗

Efficient Low Dissipative High Order Schemes for Multiscale MHD Flows, I: Basic Theory

The objective of this paper is to extend our recently developed highly parallelizable nonlinear stable high order schemes for complex multiscale hydrodynamic applications to the viscous MHD equations. These schemes employed multiresolution wavelets as adaptive numerical dissipation controls t o limit the amount of and to aid the selection and/or blending of the appropriate types of dissipation to be used. The new scheme is formulated for both the conservative and non-conservative form of the MHD equations in curvilinear grids. The four advantages of the present approach over existing MHD schemes reported in the open literature are as follows. First, the scheme is constructed for long-time integrations of shock/turbulence/combustion MHD flows. Available schemes are too diffusive for long-time integrations and/or turbulence/combustion problems. Second, unlike exist- ing schemes for the conservative MHD equations which suffer from ill-conditioned eigen- decompositions, the present scheme makes use of a well-conditioned eigen-decomposition obtained from a minor modification of the eigenvectors of the non-conservative MHD equations t o solve the conservative form of the MHD equations. Third, this approach of using the non-conservative eigensystem when solving the conservative equations also works well in the context of standard shock-capturing schemes for the MHD equations. Fourth, a new approach to minimize the numerical error of the divergence-free magnetic condition for high order schemes is introduced. Numerical experiments with typical MHD model problems revealed the applicability of the newly developed schemes for the MHD equations.

Sjoegreen, Bjoern↗

Optical Implementation of Matching Pursuit for Image Representation

We have developed a technique for image analysis, representation, and decomposition. This technique was motivated by Stephane Mallat's matching-pursuit algorithm. We've altered and simplified the mechanics of his algorithm to enable an extremely fast implementation via optical processing. Initial computer simulations show that our algorithm is capable of decomposing and representing a 2-D image as a linear combination of basis images with both high speed and high fidelity.

matching pursuit adaptive wavelet transform image ↗

Transiting Planet Search in the Kepler Pipeline

The Kepler Mission simultaneously measures the brightness of more than 160,000 stars every 29.4 minutes over a 3.5-year mission to search for transiting planets. Detecting transits is a signal-detection problem where the signal of interest is a periodic pulse train and the predominant noise source is non-white, non-stationary (1/f) type process of stellar variability. Many stars also exhibit coherent or quasi-coherent oscillations. The detection algorithm first identifies and removes strong oscillations followed by an adaptive, wavelet-based matched filter. We discuss how we obtain super-resolution detection statistics and the effectiveness of the algorithm for Kepler flight data.

Jenkins, Jon M.↗

The Impact of Stellar Variability on the Detection of Transiting Earth-like Planets

Stellar variability represents a key limitation on the detectability of weak transit signatures of small, Earth-size planets with space-based missions such as NASA's Kepler Mission or ESA's PLATO Mission. The expectations for the performance of the Kepler Mission in the face of solar-like variability were predicated on observations of the Sun with the Variability of Solar Irradiance and Gravity Oscillations (VIRGO) instrument aboard NASA and ESA's joint Solar and Heliospheric Observatory (SOHO) mission, which was launched in December 1995. Analyses of SOHO data indicated that solar-like variability would contribute approx.10 ppm to Kepler's noise budget at 6.5 ours, a typical grazing transit timescale. This proved to be optimistic as the typical 12th mag G2V star in the Kepler field of view exhibited 20 ppm of stellar variability-related noise at 6.5 hours, making the detection of true Earth-Sun analogs more difficult. While the consequent increase in the total noise at 6.5 hours from 20 ppm to 30 ppm could have been overcome by extending the mission to a total duration of 7 to 8 years. Unfortunately, a second reaction wheel failed in May 2013, ending the Kepler primary mission. Nevertheless, Kepler proved to be a veritable cornucopia of science results, both for exoplanets and for astrophysics. The phenomenal photometric precision and continuous observations required in order to identify small, rocky transiting planets enables the study of a large range of phenomena contributing to stellar variability for many thousands of solar-like stars in Kepler's field of view in exquisite detail. These effects range from less than 1 ppm acoustic oscillations on timescales from a few minutes and longward, to flares on timescales of hours, to spot-induced modulation on timescales of days to weeks to activity cycles on timescales of months to years. Kepler discovered over 2600 validated and confirmed exoplanets, and measured the pressure-mode oscillations of over 15000 stars over the course of its mission and the reconstituted K2 mission. We present the adaptive, wavelet-based matched filter used for both the Kepler and the TESS missions, and discuss the connections between this detection algorithm and fundamental detection theory, which allows the detector to function as a noise characterization engine. This provides a dynamical measurement of the photometric noise at transit timescales and thus, a key performance metric for missions like PLATO and Kepler. We give an overview of the stellar variability we see across the full range of spectral types observed by Kepler, from the cool, small red M stars to the hot, large late A stars, both in terms of amplitude as well as timescale.

transit surveys↗

The Impact of Stellar Variability on the Detection of Transiting Earth-Like Planets

Stellar variability represents a key limitation on the detectability of weak transit signatures of small, Earth-size planets with space-based missions such as NASA's Kepler Mission or ESA's PLATO Mission. The expectations for the performance of the Kepler Mission in the face of solar-like variability were predicated on observations of the Sun with the Variability of Solar Irradiance and Gravity Oscillations (VIRGO) instrument aboard NASA and ESA's joint Solar and Heliospheric Observatory (SOHO) mission, which was launched in December 1995. Analyses of SOHO data indicated that solar-like variability would contribute ~10 ppm to Kepler's noise budget at 6.5 ours, a typical grazing transit timescale. This proved to be optimistic as the typical 12th mag G2V star in the Kepler field of view exhibited 20 ppm of stellar variability-related noise at 6.5 hours, making the detection of true Earth-Sun analogs more difficult. While the consequent increase in the total noise at 6.5 hours from 20 ppm to 30 ppm could have been overcome by extending the mission to a total duration of 7 to 8 years. Unfortunately, a second reaction wheel failed in May 2013, ending the Kepler primary mission. Nevertheless, Kepler proved to be a veritable cornucopia of science results, both for exoplanets and for astrophysics. The phenomenal photometric precision and continuous observations required in order to identify small, rocky transiting planets enables the study of a large range of phenomena contributing to stellar variability for many thousands of solar-like stars in Kepler's field of view in exquisite detail. These effects range from <1 ppm acoustic oscillations on timescales from a few minutes and longward, to flares on timescales of hours, to spot-induced modulation on timescales of days to weeks to activity cycles on timescales of months to years. Kepler discovered over 2600 validated and confirmed exoplanets, and measured the pressure-mode oscillations of over 15000 stars over the course of its mission and the reconstituted K2 mission. We present the adaptive, wavelet-based matched filter used for both the Kepler and the TESS missions, and discuss the connections between this detection algorithm and fundamental detection theory, which allows the detector to function as a noise characterization engine. This provides a dynamical measurement of the photometric noise at transit timescales and thus, a key performance metric for missions like PLATO and Kepler. We give an overview of the stellar variability we see across the full range of spectral types observed by Kepler, from the cool, small red M stars to the hot, large late A stars, both in terms of amplitude as well as timescale.

exoplanets↗

Dynamical Approach Study of Spurious Numerics in Nonlinear Computations

The last two decades have been an era when computation is ahead of analysis and when very large scale practical computations are increasingly used in poorly understood multiscale complex nonlinear physical problems and non-traditional fields. Ensuring a higher level of confidence in the predictability and reliability (PAR) of these numerical simulations could play a major role in furthering the design, understanding, affordability and safety of our next generation air and space transportation systems, and systems for planetary and atmospheric sciences, and in understanding the evolution and origin of life. The need to guarantee PAR becomes acute when computations offer the ONLY way of solving these types of data limited problems. Employing theory from nonlinear dynamical systems, some building blocks to ensure a higher level of confidence in PAR of numerical simulations have been revealed by the author and world expert collaborators in relevant fields. Five building blocks with supporting numerical examples were discussed. The next step is to utilize knowledge gained by including nonlinear dynamics, bifurcation and chaos theories as an integral part of the numerical process. The third step is to design integrated criteria for reliable and accurate algorithms that cater to the different multiscale nonlinear physics. This includes but is not limited to the construction of appropriate adaptive spatial and temporal discretizations that are suitable for the underlying governing equations. In addition, a multiresolution wavelets approach for adaptive numerical dissipation/filter controls for high speed turbulence, acoustics and combustion simulations will be sought. These steps are corner stones for guarding against spurious numerical solutions that are solutions of the discretized counterparts but are not solutions of the underlying governing equations.

Yee, H. C.↗

Visual information processing II; Proceedings of the Meeting, Orlando, FL, Apr. 14-16, 1993

Various papers on visual information processing are presented. Individual topics addressed include: aliasing as noise, satellite image processing using a hammering neural network, edge-detetion method using visual perception, adaptive vector median filters, design of a reading test for low-vision image warping, spatial transformation architectures, automatic image-enhancement method, redundancy reduction in image coding, lossless gray-scale image compression by predictive GDF, information efficiency in visual communication, optimizing JPEG quantization matrices for different applications, use of forward error correction to maintain image fidelity, effect of peanoscanning on image compression. Also discussed are: computer vision for autonomous robotics in space, optical processor for zero-crossing edge detection, fractal-based image edge detection, simulation of the neon spreading effect by bandpass filtering, wavelet transform (WT) on parallel SIMD architectures, nonseparable 2D wavelet image representation, adaptive image halftoning based on WT, wavelet analysis of global warming, use of the WT for signal detection, perfect reconstruction two-channel rational filter banks, N-wavelet coding for pattern classification, simulation of image of natural objects, number-theoretic coding for iconic systems.

Huck, Friedrich O.↗

Relativistic Hydrodynamics with Wavelets

Methods to solve the relativistic hydrodynamic equations are important in a large number of astrophysical simulations, which may be very dynamic and involve multiscale features. This requires computational methods that are highly adaptive and capable of automatically resolving numerous localized features and instabilities that emerge across the computational domain and over many temporal scales. While this has been historically accomplished with adaptive-mesh-refinement-based methods, alternatives using wavelet bases and the wavelet transformation have recently achieved significant success in adaptive representation for advanced engineering applications. The current work presents a new method, extending the wavelet adaptive multiresolution representation method, for the integration of the relativistic hydrodynamic equations using iterated interpolating wavelets and introduces a highly adaptive implementation for multidimensional simulation. We note the wavelet coefficients provide a direct measure of the local approximation error for the solution and place collocation points that naturally adapt to the fluid flow while providing good conservation of fluid quantities. The resulting implementation, OAHU , is applied to a series of demanding 1D and 2D problems that explore high Lorentz factor outflows and the formation of several instabilities, including the Kelvin–Helmholtz instability and the Rayleigh–Taylor instability.

79 ASTRONOMY AND ASTROPHYSICS↗

Entanglement Renormalization for Quantum Field Theories with Discrete Wavelet Transforms

We propose an adaptation of Entanglement Renormalization for quantum field theories that, through the use of discrete wavelet transforms, strongly parallels the tensor network architecture of the Multiscale Entanglement Renormalization Ansatz (a.k.a. MERA). Our approach, called wMERA, has several advantages of over previous attempts to adapt MERA to continuum systems. In particular, (i) wMERA is formulated directly in position space, hence preserving the quasi-locality and sparsity of entanglers; and (ii) it enables a built-in RG flow in the implementation of real-time evolution and in computations of correlation functions, which is key for efficient numerical implementations. As examples, we describe in detail two concrete implementations of our wMERA algorithm for free scalar and fermionic theories in (1+1) spacetime dimensions. Possible avenues for constructing wMERAs for interacting field theories are also discussed.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Locally-Based Kernal PLS Smoothing to Non-Parametric Regression Curve Fitting

We present a novel smoothing approach to non-parametric regression curve fitting. This is based on kernel partial least squares (PLS) regression in reproducing kernel Hilbert space. It is our concern to apply the methodology for smoothing experimental data where some level of knowledge about the approximate shape, local inhomogeneities or points where the desired function changes its curvature is known a priori or can be derived based on the observed noisy data. We propose locally-based kernel PLS regression that extends the previous kernel PLS methodology by incorporating this knowledge. We compare our approach with existing smoothing splines, hybrid adaptive splines and wavelet shrinkage techniques on two generated data sets.

Rosipal, Roman↗

Improved Compression of Wavelet-Transformed Images

A recently developed data-compression method is an adaptive technique for coding quantized wavelet-transformed data, nominally as part of a complete image-data compressor. Unlike some other approaches, this method admits a simple implementation and does not rely on the use of large code tables. A common data compression approach, particularly for images, is to perform a wavelet transform on the input data, and then losslessly compress a quantized version of the wavelet-transformed data. Under this compression approach, it is common for the quantized data to include long sequences, or runs, of zeros. The new coding method uses prefixfree codes for the nonnegative integers as part of an adaptive algorithm for compressing the quantized wavelet-transformed data by run-length coding. In the form of run-length coding used here, the data sequence to be encoded is parsed into strings consisting of some number (possibly 0) of zeros, followed by a nonzero value. The nonzero value and the length of the run of zeros are encoded. For a data stream that contains a sufficiently high frequency of zeros, this method is known to be more effective than using a single variable length code to encode each symbol. The specific prefix-free codes used are from two classes of variable-length codes: a class known as Golomb codes, and a class known as exponential-Golomb codes. The codes within each class are indexed by a single integer parameter. The present method uses exponential-Golomb codes for the lengths of the runs of zeros, and Golomb codes for the nonzero values. The code parameters within each code class are determined adaptively on the fly as compression proceeds, on the basis of statistics from previously encoded values. In particular, a simple adaptive method has been devised to select the parameter identifying the particular exponential-Golomb code to use. The method tracks the average number of bits used to encode recent runlengths, and takes the difference between this average length and the code parameter. When this difference falls outside a fixed range, the code parameter is updated (increased or decreased). The Golomb code parameter is selected based on the average magnitude of recently encoded nonzero samples. The coding method requires no floating- point operations, and more readily adapts to local statistics than other methods. The method can also accommodate arbitrarily large input values and arbitrarily long runs of zeros. In practice, this means that changes in the dynamic range or size of the input data set would not require a change to the compressor. The algorithm has been tested in computational experiments on test images. A comparison with a previously developed algorithm that uses large code tables (generated via Huffman coding on training data) suggests that the data-compression effectiveness of the present algorithm is comparable to the best performance achievable by the previously developed algorithm.

Kiely, Aaron↗

Compression of multispectral Landsat imagery using the Embedded Zerotree Wavelet (EZW) algorithm

The Embedded Zerotree Wavelet (EZW) algorithm has proven to be an extremely efficient and flexible compression algorithm for low bit rate image coding. The embedding algorithm attempts to order the bits in the bit stream in numerical importance and thus a given code contains all lower rate encodings of the same algorithm. Therefore, precise bit rate control is achievable and a target rate or distortion metric can be met exactly. Furthermore, the technique is fully image adaptive. An algorithm for multispectral image compression which combines the spectral redundancy removal properties of the image-dependent Karhunen-Loeve Transform (KLT) with the efficiency, controllability, and adaptivity of the embedded zerotree wavelet algorithm is presented. Results are shown which illustrate the advantage of jointly encoding spectral components using the KLT and EZW.

Shapiro, Jerome M.↗