Presence Of Aliasing Research Articles

A logical analysis of aliasing in imperative higher-order functions

We present a compositional program logic for call-by-value imperative higher-order functions with general forms of aliasing, which can arise from the use of reference names as function parameters, return values, content of references and parts of data structures. The program logic extends our earlier logic for alias-free imperative higher-order functions with new modal operators which serve as building blocks for clean structural reasoning about programs and data structures in the presence of aliasing. This has been an open issue since the pioneering work by Cartwright-Oppen and Morris twenty-five years ago. We illustrate usage of the logic for description and reasoning through concrete examples including a higher-order polymorphic Quicksort. The logical status of the new operators is clarified by translating them into (in)equalities of reference names. The logic is observationally complete in the sense that two programs are observationally indistinguishable if they satisfy the same set of assertions.

Cost effective dynamic program slicing

Although dynamic program slicing was first introduced to aid in user level debugging, applications aimed at improving software quality, reliability, security, and performance have since been identified as candidates for using dynamic slicing. However, the dynamic dependence graph constructed to compute dynamic slices can easily cause slicing algorithms to run out of memory for realistic program runs. In this paper we present the design and evaluation of a cost effective dynamic program slicing algorithm. This algorithm is based upon a dynamic dependence graph representation that is highly compact and rapidly traversable. Thus, the graph can be held in memory and dynamic slices can be quickly computed. A compact representation is derived by recognizing that all dynamic dependences (data and control) need not be individually represented. We identify sets of dynamic dependence edges between a pair of statements that can share a single representative edge. We further show that the dependence graph can be transformed in a manner that increases sharing and sharing can be performed even in the presence of aliasing. Experiments show that transformed dynamic dependence graphs explicitly represent only 6% of the dependence edges present in the full dynamic dependence graph. When the full graph sizes range from 0.84 to 1.95 Gigabytes in size, our compacted graphs range from 20 to 210 Megabytes in size. Average slicing times for our algorithm range from 1.74 to 36.25 seconds across several benchmarks from SPECInt2000/95.

Method and apparatus for automatic control of spectral doppler imaging

An ultrasound system is disclosed that includes a method and apparatus to automatically adjust certain parameters that affect visualization of a Doppler spectral image. The ultrasound system acquires spectral lines of Doppler data generated by the ultrasound system. A data processor within the ultrasound system determines the presence of aliasing and estimates noise levels from the spectral lines of Doppler data. The data processor then automatically adjusts system parameters such as pulse repetition frequency (PRF), baseline shift, and spectrum orientation in response to aliasing and noise levels. The data processor of the ultrasound system also determines positive and negative signal boundaries for each spectral line of Doppler data and a display architecture processes the signal boundary data to display a spectral trace corresponding to the edges of the spectral lines.

An Adaptive Parallel Observer System for Multirate Systems and Frequency-Aliased Output Measurements

This paper proposes the adaptive parallel observer system (APOS), a multirate estimation technique for discrete time systems, to compensate for output measurements that are available only periodically and for systems whose frequency content is beyond that of the Nyquist frequency. The APOS provides the controller with stable state and system parameter estimates, which allow for the extraction of the system damping ratio and resonant frequency despite the presence of aliasing. A stability proof and error bounds are provided. The APOS is applied to the actuator dynamics of an IBM Head/Disk Assembly (HDA) System, and the APOS parameter estimates are used to extract values of the system damping ratio and aliased resonant frequency via a trained neural network.

A fast direct Fourier-based algorithm for subpixel registration of images

This paper presents a new direct Fourier-based algorithm for performing image-to-image registration to subpixel accuracy, where the image differences are restricted to translations and uniform changes of illumination. The algorithm detects the Fourier components that have become unreliable estimators of shift due to aliasing, and removes them from the shift-estimate computation. In the presence of aliasing, the average precision of the registration is a few hundredths of a pixel. Experimental data presented here show that the new algorithm yields superior registration precision in the presence of aliasing when compared to several earlier methods and has comparable precision to the iterative method of P. Thevenaz et al. (1998).

Band-limited functions on a bounded spherical domain: the Slepian problem on the sphere

The Slepian problem consists of determining a sequence of functions that constitute an orthonormal basis of a subset of ℝ (or ℝ2) concentrating the maximum information in the subspace of square integrable functions with a band-limited spectrum. The same problem can be stated and solved on the sphere. The relation between the new basis and the ordinary spherical harmonic basis can be explicitly written and numerically studied. The new base functions are orthogonal on both the subspace and the whole sphere. Numerical tests show the applicability of the Slepian approach with regard to solvability and stability in the case of polar data gaps, even in the presence of aliasing. This tool turns out to be a natural solution to the polar gap problem in satellite geodesy. It enables capture of the maximum amount of information from non-polar gravity field missions.

Path-sensitive alias analysis for data flow testing

This paper describes a new approach to performing data flow testing in the presence of aliasing, and a tool based on this method. The technique is based on the observation that, under certain reasonable assumptions, one can statically determine which variables are aliased whenever control reaches a given program point via a particular path. Furthermore, one can group together paths that behave similarly with respect to aliasing and represent them by regular expressions. The resulting test requirements demand that the test data execute representatives of particular sets of paths between variable definitions and uses. Copyright © 1999 John Wiley & Sons, Ltd.

Evidence for spatial aliasing effects in the Y-like cells of the magnocellular visual pathway.

Several lines of evidence are provided indicating that our visual percept can be dominated by spatial aliasing for viewing conditions near those needed to see the spatial frequency doubled illusion. The apparent aliasing effect indicates that the underlying sampling array has a density 15-30% of that of M-cells, in agreement with the known proportion of Y-like M-cells (M(y)-cells). The presence of aliasing indicates, that there is a separate irregular array of M(y)-cells, and that their role is to rapidly convey information on retinal gain control to the brain rather than to act primarily as inputs to image motion computation.

Nonlinearity effects in the pure phase correlation method in multiobject scenes

The nonlinearity used in the pure phase correlation method can improve pattern recognition, but it causes high-order harmonics in the correlation plane in the case of multiobject scenes. High-order harmonics and the presence of aliasing may cause false alarms. We show that these effects are strongly diminished when the periodicity in the scene is broken (by different objects, random distribution, etc.).

An MTF method immune to aliasing.

The variance derived from the images of cyclic bar patterns can be used to determine the modulation transfer function (MTF) of an imaging system. Unlike most MTF methods, it is applicable even when the imaging system undersamples the test object and generates aliasing errors. The validity of the variance method in the presence of aliasing is established theoretically and by computer simulation.