Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “matching pursuit”

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.

Highly Scalable Matching Pursuit Signal Decomposition Algorithm

Matching Pursuit Decomposition (MPD) is a powerful iterative algorithm for signal decomposition and feature extraction. MPD decomposes any signal into linear combinations of its dictionary elements or atoms . A best fit atom from an arbitrarily defined dictionary is determined through cross-correlation. The selected atom is subtracted from the signal and this procedure is repeated on the residual in the subsequent iterations until a stopping criterion is met. The reconstructed signal reveals the waveform structure of the original signal. However, a sufficiently large dictionary is required for an accurate reconstruction; this in return increases the computational burden of the algorithm, thus limiting its applicability and level of adoption. The purpose of this research is to improve the scalability and performance of the classical MPD algorithm. Correlation thresholds were defined to prune insignificant atoms from the dictionary. The Coarse-Fine Grids and Multiple Atom Extraction techniques were proposed to decrease the computational burden of the algorithm. The Coarse-Fine Grids method enabled the approximation and refinement of the parameters for the best fit atom. The ability to extract multiple atoms within a single iteration enhanced the effectiveness and efficiency of each iteration. These improvements were implemented to produce an improved Matching Pursuit Decomposition algorithm entitled MPD++. Disparate signal decomposition applications may require a particular emphasis of accuracy or computational efficiency. The prominence of the key signal features required for the proper signal classification dictates the level of accuracy necessary in the decomposition. The MPD++ algorithm may be easily adapted to accommodate the imposed requirements. Certain feature extraction applications may require rapid signal decomposition. The full potential of MPD++ may be utilized to produce incredible performance gains while extracting only slightly less energy than the standard algorithm. When the utmost accuracy must be achieved, the modified algorithm extracts atoms more conservatively but still exhibits computational gains over classical MPD. The MPD++ algorithm was demonstrated using an over-complete dictionary on real life data. Computational times were reduced by factors of 1.9 and 44 for the emphases of accuracy and performance, respectively. The modified algorithm extracted similar amounts of energy compared to classical MPD. The degree of the improvement in computational time depends on the complexity of the data, the initialization parameters, and the breadth of the dictionary. The results of the research confirm that the three modifications successfully improved the scalability and computational efficiency of the MPD algorithm. Correlation Thresholding decreased the time complexity by reducing the dictionary size. Multiple Atom Extraction also reduced the time complexity by decreasing the number of iterations required for a stopping criterion to be reached. The Course-Fine Grids technique enabled complicated atoms with numerous variable parameters to be effectively represented in the dictionary. Due to the nature of the three proposed modifications, they are capable of being stacked and have cumulative effects on the reduction of the time complexity.

Christensen, Daniel↗

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 ↗

Use of the Matching Pursuit Algorithm for Flight Flutter Test Data Analysis

The goal of flight flutter testing is to detect possibly destructive modes of aircraft vibration which may arise during flight from interaction of aerodynamic forces with structural dynamic properties of the airframe. This is typically accomplished by exciting the airframe with a time varying force and monitoring the response of the aircraft throughout its flight envelope. The data generated must be analyzed and presented so that the frequency and time of occurrence of excited modes are clearly and unambiguously displayed. Processing and display in near real time is also desirable. Display of data in the time-frequency plane is a natural choice because it is a familiar and intuitive framework. The Matching Pursuit algorithm provides a time-frequency analysis with good adaptability to signal structure and good signal representation in the time-frequency plane. Improvements in efficiency are needed before the algorithm can be used in real time, however.

Nelson, Ronald E.↗

Dictionary Approaches to Image Compression and Reconstruction

This paper proposes using a collection of parameterized waveforms, known as a dictionary, for the purpose of medical image compression. These waveforms, denoted as lambda, are discrete time signals, where y represents the dictionary index. A dictionary with a collection of these waveforms Is typically complete or over complete. Given such a dictionary, the goal is to obtain a representation Image based on the dictionary. We examine the effectiveness of applying Basis Pursuit (BP), Best Orthogonal Basis (BOB), Matching Pursuits (MP), and the Method of Frames (MOF) methods for the compression of digitized radiological images with a wavelet-packet dictionary. The performance of these algorithms is studied for medical images with and without additive noise.

Ziyad, Nigel A.↗

Dictionary Approaches to Image Compression and Reconstruction

This paper proposes using a collection of parameterized waveforms, known as a dictionary, for the purpose of medical image compression. These waveforms, denoted as phi(sub gamma), are discrete time signals, where gamma represents the dictionary index. A dictionary with a collection of these waveforms is typically complete or overcomplete. Given such a dictionary, the goal is to obtain a representation image based on the dictionary. We examine the effectiveness of applying Basis Pursuit (BP), Best Orthogonal Basis (BOB), Matching Pursuits (MP), and the Method of Frames (MOF) methods for the compression of digitized radiological images with a wavelet-packet dictionary. The performance of these algorithms is studied for medical images with and without additive noise.

Ziyad, Nigel A.↗

Estimation of Modal Parameters Using a Wavelet-Based Approach

Modal stability parameters are extracted directly from aeroservoelastic flight test data by decomposition of accelerometer response signals into time-frequency atoms. Logarithmic sweeps and sinusoidal pulses are used to generate DAST closed loop excitation data. Novel wavelets constructed to extract modal damping and frequency explicitly from the data are introduced. The so-called Haley and Laplace wavelets are used to track time-varying modal damping and frequency in a matching pursuit algorithm. Estimation of the trend to aeroservoelastic instability is demonstrated successfully from analysis of the DAST data.

Lind, Rick↗

Sparse Regression as a Sparse Eigenvalue Problem

We extend the l0-norm "subspectral" algorithms for sparse-LDA [5] and sparse-PCA [6] to general quadratic costs such as MSE in linear (kernel) regression. The resulting "Sparse Least Squares" (SLS) problem is also NP-hard, by way of its equivalence to a rank-1 sparse eigenvalue problem (e.g., binary sparse-LDA [7]). Specifically, for a general quadratic cost we use a highly-efficient technique for direct eigenvalue computation using partitioned matrix inverses which leads to dramatic x103 speed-ups over standard eigenvalue decomposition. This increased efficiency mitigates the O(n4) scaling behaviour that up to now has limited the previous algorithms' utility for high-dimensional learning problems. Moreover, the new computation prioritizes the role of the less-myopic backward elimination stage which becomes more efficient than forward selection. Similarly, branch-and-bound search for Exact Sparse Least Squares (ESLS) also benefits from partitioned matrix inverse techniques. Our Greedy Sparse Least Squares (GSLS) generalizes Natarajan's algorithm [9] also known as Order-Recursive Matching Pursuit (ORMP). Specifically, the forward half of GSLS is exactly equivalent to ORMP but more efficient. By including the backward pass, which only doubles the computation, we can achieve lower MSE than ORMP. Experimental comparisons to the state-of-the-art LARS algorithm [3] show forward-GSLS is faster, more accurate and more flexible in terms of choice of regularization

Exact Sparse Least Squares (ESLS)↗

Differential Saccade-Pursuit Coordination Under Sleep Loss and Low-Dose Alcohol

Introduction: Ocular tracking of a moving object requires tight coordination between smooth pursuit and saccadic eye movements. Normally, pursuit drives gaze velocity to closely match target velocity, with residual position offsets corrected by catch-up saccades. However, how/if common stressors affect this coordination is largely unknown. This study seeks to elucidate the effects of acute and chronic sleep loss, and low-dose alcohol, on saccade-pursuit coordination, as well as that of caffeine. Methods: We used an ocular tracking paradigm to assess three metrics of tracking (pursuit gain, saccade rate, saccade amplitude) and to compute “ground lost” (from reductions in steady-state pursuit gain) and “ground recouped” (from increases in steady-state saccade rate and/or amplitude). We emphasize that these are measures of relative changes in positional offsets, and not absolute offset from the fovea. Results: Under low-dose alcohol and acute sleep loss, ground lost was similarly large. However, under the former, it was nearly completely recouped by saccades, whereas under the latter, compensation was at best partial. Under chronic sleep restriction and acute sleep loss with a caffeine countermeasure, the pursuit deficit was dramatically smaller, yet saccadic behavior remained altered from baseline. In particular, saccadic rate remained significantly elevated, despite the fact that ground lost was minimal. Discussion: This constellation of findings demonstrates differential impacts on saccade-pursuit coordination with low-dose alcohol impacting only pursuit, likely through extrastriate cortical pathways, while acute sleep loss not only disrupts pursuit but also undermines saccadic compensation, likely through midbrain/brainstem pathways. Furthermore, while chronic sleep loss and caffeine-mitigated acute sleep loss show little residual pursuit deficit, consistent with uncompromised cortical visual processing, they nonetheless show an elevated saccade rate, suggesting residual midbrain and/or brainstem impacts.

smooth pursuit↗

Oculometric Biomarkers of Visuomotor Deficits in Clinically Asymptomatic Patients With Systemic Lupus Erythematosus Undergoing Long-Term Hydroxychloroquine Treatment

Introduction: This study examines a set of oculomotor measurements, or “oculometric” biomarkers, as potential early indicators of visual and visuomotor deficits due to retinal toxicity in asymptomatic Systemic Lupus Erythematosus (SLE) patients on long-term hydroxychloroquine (HCQ) treatment. The aim is to identify subclinical functional impairments that are otherwise undetectable by standard clinical tests and to link them to structural retinal changes. Methods: We measured oculomotor responses in a cohort of SLE patients on chronic HCQ therapy using a previously established behavioral task and analysis technique. We also examined the relationship between oculometrics, OCT measures of retinal thickness, and standard clinical perimetry measures of visual function in our patient group using Bivariate Pearson Correlation and a Linear Mixed-Effects Model (LMM). Results: Significant visual and visuomotor deficits were found in 12 asymptomatic SLE patients on long-term HCQ therapy compared to a cohort of 17 age-matched healthy controls. Notably, six oculometrics were significantly different. The median initial pursuit acceleration was 22%, steady-state pursuit gain 16%, proportion smooth 7%, and target speed responsiveness 31% lower, while catch-up saccade amplitude was 46% and fixation error 46% larger. Excluding the two patients with diagnosed mild toxicity, four oculometrics, all but fixation error and proportion smooth, remained significantly impaired compared to controls. Across our population of 12 patients (24 retinae), we found that pursuit latency, initial acceleration, steady-state gain, and fixation error were linearly related to retinal thickness even when age was accounted for, while standard measures of clinical function (Mean Deviation and Pattern Standard Deviation) were not. Discussion: Our data show that specific oculometrics are sensitive early biomarkers of functional deficits in SLE patients on HCQ that could be harnessed to assist in the early detection of HCQ-induced retinal toxicity and other visual pathologies, potentially providing early diagnostic value beyond standard visual field and OCT evaluations.

eye movements↗

Minimization of Retinal Slip Cannot Explain Human Smooth-Pursuit Eye Movements

Existing models assume that pursuit attempts a direct minimization of retinal image motion or "slip" (e.g. Robinson et al., 1986; Krauzlis & Weisberger, 1989). Using occluded line-figure stimuli, we have previously shown that humans can accurately pursue stimuli for which perfect tracking does not zero retinal slip (Neurologic ARCO). These findings are inconsistent with the standard control strategy of matching eye motion to a target-motion signal reconstructed by adding retinal slip and eye motion, but consistent with a visual front-end which estimates target motion via a global spatio-temporal integration for pursuit and perception. Another possible explanation is that pursuit simply attempts to minimize slip perpendicular to the segments (and neglects parallel "sliding" motion). To resolve this, 4 observers (3 naive) were asked to pursue the center of 2 types of stimuli with identical velocity-space descriptions and matched motion energy. The line-figure "diamond" stimulus was viewed through 2 invisible 3 deg-wide vertical apertures (38 cd/m2 equal to background) such that only the sinusoidal motion of 4 oblique line segments (44 cd/m2 was visible. The "cross" was identical except that the segments exchanged positions. Two trajectories (8's and infinity's) with 4 possible initial directions were randomly interleaved (1.25 cycles, 2.5s period, Ax = Ay = 1.4 deg). In 91% of trials, the diamond appeared rigid. Correspondingly, pursuit was vigorous (mean Again: 0.74) with a V/H aspect ratio approx. 1 (mean: 0.9). Despite a valid rigid solution, the cross however appeared rigid in 8% of trials. Correspondingly, pursuit was weaker (mean Hgain: 0.38) with an incorrect aspect ratio (mean: 1.5). If pursuit were just minimizing perpendicular slip, performance would be the same in both conditions.

Stone, Leland S.↗

A comparison of head and manual control for a position-control pursuit tracking task

Head control was compared with manual control in a pursuit tracking task involving proportional controlled-element dynamics. An integrated control/display system was used to explore tracking effectiveness in horizontal and vertical axes tracked singly and concurrently. Compared with manual tracking, head tracking resulted in a 50 percent greater rms error score, lower pilot gain, greater high-frequency phase lag and greater low-frequency remnant. These differences were statistically significant, but differences between horizontal- and vertical-axis tracking and between 1- and 2-axis tracking were generally small and not highly significant. Manual tracking results were matched with the optimal control model using pilot-related parameters typical of those found in previous manual control studies. Head tracking performance was predicted with good accuracy using the manual tracking model plus a model for head/neck response dynamics obtained from the literature.

Levison, W. H.↗

Experimental tests of a superposition hypothesis to explain the relationship between the vestibuloocular reflex and smooth pursuit during horizontal combined eye-head tracking in humans

1. We used a modeling approach to test the hypothesis that, in humans, the smooth pursuit (SP) system provides the primary signal for cancelling the vestibuloocular reflex (VOR) during combined eye-head tracking (CEHT) of a target moving smoothly in the horizontal plane. Separate models for SP and the VOR were developed. The optimal values of parameters of the two models were calculated using measured responses of four subjects to trials of SP and the visually enhanced VOR. After optimal parameter values were specified, each model generated waveforms that accurately reflected the subjects' responses to SP and vestibular stimuli. The models were then combined into a CEHT model wherein the final eye movement command signal was generated as the linear summation of the signals from the SP and VOR pathways. 2. The SP-VOR superposition hypothesis was tested using two types of CEHT stimuli, both of which involved passive rotation of subjects in a vestibular chair. The first stimulus consisted of a "chair brake" or sudden stop of the subject's head during CEHT; the visual target continued to move. The second stimulus consisted of a sudden change from the visually enhanced VOR to CEHT ("delayed target onset" paradigm); as the vestibular chair rotated past the angular position of the stationary visual stimulus, the latter started to move in synchrony with the chair. Data collected during experiments that employed these stimuli were compared quantitatively with predictions made by the CEHT model. 3. During CEHT, when the chair was suddenly and unexpectedly stopped, the eye promptly began to move in the orbit to track the moving target. Initially, gaze velocity did not completely match target velocity, however; this finally occurred approximately 100 ms after the brake onset. The model did predict the prompt onset of eye-in-orbit motion after the brake, but it did not predict that gaze velocity would initially be only approximately 70% of target velocity. One possible explanation for this discrepancy is that VOR gain can be dynamically modulated and, during sustained CEHT, it may assume a lower value. Consequently, during CEHT, a smaller-amplitude SP signal would be needed to cancel the lower-gain VOR. This reduction of the SP signal could account for the attenuated tracking response observed immediately after the brake. We found evidence for the dynamic modulation of VOR gain by noting differences in responses to the onset and offset of head rotation in trials of the visually enhanced VOR.(ABSTRACT TRUNCATED AT 400 WORDS).

Non-NASA Center↗

An Investigation of the Effects of the Time Lag Due to Long Transmission Distances upon Remote Control: Tracking Experiments - Phase 1

A series of pursuit tracking tasks were performed incorporating a transport lag in the control loop. The target was a mixture of four sine waves, the fastest having a frequency of 16 cycles per minute at full speed. An attempt was made to design the experiments so that they would provide data applicable to remote control of a ground vehicle over long transmission distances. Three programs were run. In each the time lag was placed between the control and the display. In the first program a velocity control was used and the operator was told that his knob controlled a vehicle, the problem represented a road 9 and he was to drive his vehicle along the road 9 using the delayed vehicle position as feedback for whatever means he desired. The objective was not to match the display traces. In the second program a velocity control was used, and the operator was told that the problem trace represented a road and the delayed trace represented a vehicle and he was to keep them together. The objective was to match display traces. The third program was identical with the first, except that an acceleration control was used rather than a velocity control. Target speeds used were full speed, 1/2 speed, 1/4 speed, 1/8 speed, and 1/16 speed. Time lags were 1/4 second, l/2 second, 1 second, 1-1/2 second, 2 second, 3 second, and 6 seconds. The experimental results are presented in the last section of this report.

Adams, James L.↗

Harnessing Collaborative Learning Automata to Guide Multi-objective Optimization based Inverse Analysis for Structural Damage Identification

Structural damage identification based on physical models is often transformed into an optimization problem that minimizes the difference between measurement information of structure being monitored and the model prediction in the parametric space. However, the objective function in this context often exhibits multimodality, involving high-dimensional variables due to the reliance on finite element models for damage identification. These features pose challenges to optimization algorithms, where entrapment in local solutions can lead to false positives and false negatives in damage identification. In this research, we propose a reinforcement learning based multi-swarm optimizer to tackle such challenges in pursuit of a small yet diverse solution set that can capture the true damage scenario as one of the solutions. The proposed method leverages the flexibility of the particle swarm optimizer and incorporates novel strategies of metaheuristics to realize targeted improvement. To enable the particle swarm to adaptively select the appropriate search strategy based on the current environment, we adopt the learning automata technique, which sidesteps the need for reward strategy selection that is usually ad hoc at each step of the search. The integration harnesses the automatic learning and self-adaptation capabilities of learning automata, enabling the particles to navigate based on environmental signals. This leads to accumulated probabilities tied to advantageous movements, fostering an adaptive exploration of particles in the search space. The proposed approach is first validated through implementing into benchmark test cases with comparisons. It is then applied to structural damage identification with piezoelectric admittance experimental signals. `The results highlight the capability of the algorithm to identify a small solution set with high accuracy to match the actual damage scenario.

Yang Zhang↗