Results 1 - 10
of
97
Iterated random functions
- SIAM Review
, 1999
"... Abstract. Iterated random functions are used to draw pictures or simulate large Ising models, among other applications. They offer a method for studying the steady state distribution of a Markov chain, and give useful bounds on rates of convergence in a variety of examples. The present paper surveys ..."
Abstract
-
Cited by 94 (1 self)
- Add to MetaCart
Abstract. Iterated random functions are used to draw pictures or simulate large Ising models, among other applications. They offer a method for studying the steady state distribution of a Markov chain, and give useful bounds on rates of convergence in a variety of examples. The present paper surveys the field and presents some new examples. There is a simple unifying idea: the iterates of random Lipschitz functions converge if the functions are contracting on the average. 1. Introduction. The
Estimating and Interpreting the Instantaneous Frequency of a Signal
- Proceedings of the IEEE
, 1992
"... The frequency of a sinusoidal signal is a well defined quantity. However, often in practice, signals are not truly sinusoidal, or even aggregates of sinusoidal components. Nonstationary signals in particular do not lend themselves well to decomposition into sinusoidal components. For such signals, t ..."
Abstract
-
Cited by 80 (1 self)
- Add to MetaCart
The frequency of a sinusoidal signal is a well defined quantity. However, often in practice, signals are not truly sinusoidal, or even aggregates of sinusoidal components. Nonstationary signals in particular do not lend themselves well to decomposition into sinusoidal components. For such signals, the notion of frequency loses its effectiveness, and one needs to use a parameter which accounts for the time-varying nature of the process. This need has given rise to the idea of instantaneous frequency. The instantaneous frequency (IF) of a signal is a parame-ter which is often of significant practical importance. In many situations such as seismic, radar, sonar, communications, and biomedical applications, the IF is a good descriptor of some physical phenomenon. This paper discusses the concept of instantaneous frequency, its definitions, and the correspondence between the various mathe-matical models formulated for representation of IF. The paper also considers the extent to which the IF corresponds to our intuitive expectation of reality. A historical review of the successive attempts to define the IF is presented. Then the relationships between the IF and the group-delay, analytic signal, and bandwidth-time (BT) product are explored, as well as the relationship with time-frequency distribu-tions. Finally, the notions of monocomponent and multicomponent signals, and instantaneous bandwidth are discussed. It is shown that all these notions are well described in the context of the theory presented. I.
Improving Regression Estimation: Averaging Methods for Variance Reduction with Extensions to General Convex Measure Optimization
, 1993
"... ..."
Frequency content of randomly scattered signals
- PART I, WAVE MOTION
, 1990
"... The statistical properties of acoustic signals reflected by a randomly layered medium are analyzed when a pulsed spherical wave issuing from a point source is incident upon it. The asymptotic analysis of stochastic equations and geometrical acoustics is used to arrive at a set of transport equatio ..."
Abstract
-
Cited by 68 (19 self)
- Add to MetaCart
The statistical properties of acoustic signals reflected by a randomly layered medium are analyzed when a pulsed spherical wave issuing from a point source is incident upon it. The asymptotic analysis of stochastic equations and geometrical acoustics is used to arrive at a set of transport equations that characterize multiply scattered signals observed at the surface of the layered medium. The results of extensive numerical simulations are presented, illustrating the scope of the theory. A number of inverse problems for randomly layered media are also formulated where we
Optimal Ensemble Averaging of Neural Networks
- Network
, 1997
"... Based on an observation about the different effect of ensemble averaging on the bias and variance portion of the prediction error, we discuss training methodologies for ensembles of networks. We demonstrate the effect of variance reduction and present a method of extrapolation to the limit of an inf ..."
Abstract
-
Cited by 26 (4 self)
- Add to MetaCart
Based on an observation about the different effect of ensemble averaging on the bias and variance portion of the prediction error, we discuss training methodologies for ensembles of networks. We demonstrate the effect of variance reduction and present a method of extrapolation to the limit of an infinite ensemble. A significant reduction of variance is obtained by averaging just over initial conditions of the neural networks, without varying architectures or training sets. The minimum of the ensemble prediction error is reached later than that of a single network. In the vicinity of the minimum, the ensemble prediction error appears to be flatter than that of the single network, thus simplifying optimal stopping decision. The results are demonstrated on the sunspots data, where the predictions are among the best obtained, and on the 1993 energy prediction competition data-set B. 1 Introduction In recent years, the use of artificial neural networks (NN) for time series prediction has g...
Finding the Embedding Dimension and Variable Dependences in Time Series
, 1994
"... : We present a general method, the ffi-test, which establishes functional dependencies given a sequence of measurements. The approach is based on calculating conditional probabilities from vector component distances. Imposing the requirement of continuity of the underlying function, the obtained va ..."
Abstract
-
Cited by 23 (3 self)
- Add to MetaCart
: We present a general method, the ffi-test, which establishes functional dependencies given a sequence of measurements. The approach is based on calculating conditional probabilities from vector component distances. Imposing the requirement of continuity of the underlying function, the obtained values of the conditional probabilities carry information on the embedding dimension and variable dependencies. The power of the method is illustrated on synthetic time-series with different time-lag dependencies and noise levels and on the sunspot data. The virtue of the method for preprocessing data in the context of feed-forward neural networks is demonstrated. Also, its applicability for tracking residual errors in output units is stressed. 1 pihong@thep.lu.se 2 carsten@thep.lu.se Introduction The behaviour of a dynamical system is often modeled by analyzing a time series record of certain system variables. Using artificial neural networks (ANN) to model such systems has recently attr...
Interdisciplinary Application of Nonlinear Time Series Methods
- Phys. Rep
, 1998
"... : This paper reports on the application to field measurements of time series methods developed on the basis of the theory of deterministic chaos. The major difficulties are pointed out that arise when the data cannot be assumed to be purely deterministic and the potential that remains in this situat ..."
Abstract
-
Cited by 23 (5 self)
- Add to MetaCart
: This paper reports on the application to field measurements of time series methods developed on the basis of the theory of deterministic chaos. The major difficulties are pointed out that arise when the data cannot be assumed to be purely deterministic and the potential that remains in this situation is discussed. For signals with weakly nonlinear structure, the presence of nonlinearity in a general sense has to be inferred statistically. The paper reviews the relevant methods and discusses the implications for deterministic modeling. Most field measurements yield nonstationary time series, which poses a severe problem for their analysis. Recent progress in the detection and understanding of nonstationarity is reported. If a clear signature of approximate determinism is found, the notions of phase space, attractors, invariant manifolds etc. provide a convenient framework for time series analysis. Although the results have to be interpreted with great care, superior performance can be achieved for typical signal processing tasks. In particular, prediction and filtering of signals are discussed, as well as the classification of system states by means of time series recordings.
Digital Audio Restoration
- Applications of Digital Signal Processing to Audio and Acoustics
, 1997
"... This chapter is concerned with the application of modern signal processing techniques to the restoration of degraded audio signals. Although attention is focussed on gramophone recordings, film sound tracks and tape recordings, many of the techniques discussed have applications in other areas where ..."
Abstract
-
Cited by 22 (9 self)
- Add to MetaCart
This chapter is concerned with the application of modern signal processing techniques to the restoration of degraded audio signals. Although attention is focussed on gramophone recordings, film sound tracks and tape recordings, many of the techniques discussed have applications in other areas where degraded audio signals occur, such as speech transmission, telephony and hearing aids. We aim to provide a wide coverage of existing methodology while giving insight into current areas of research and future trends. 1 Introduction The introduction of high quality digital audio media such as Compact Disk (CD) and Digital Audio Tape (DAT) has dramatically raised general awareness and expectations about sound quality in all types of recordings. This, combined with an upsurge in interest in historical and nostalgic material, has led to a growing requirement for restoration of degraded sources ranging from the earliest recordings made on wax cylinders in the nineteenth century, through disc reco...
Design of Neural Network Filters
- Electronics Institute, Technical University of Denmark
, 1993
"... Emnet for n rv rende licentiatafhandling er design af neurale netv rks ltre. Filtre baseret pa neurale netv rk kan ses som udvidelser af det klassiske line re adaptive l-ter rettet mod modellering af uline re sammenh nge. Hovedv gten l gges pa en neural netv rks implementering af den ikke-rekursive, ..."
Abstract
-
Cited by 19 (12 self)
- Add to MetaCart
Emnet for n rv rende licentiatafhandling er design af neurale netv rks ltre. Filtre baseret pa neurale netv rk kan ses som udvidelser af det klassiske line re adaptive l-ter rettet mod modellering af uline re sammenh nge. Hovedv gten l gges pa en neural netv rks implementering af den ikke-rekursive, uline re adaptive model med additiv st j. Formalet er at klarl gge en r kke faser forbundet med design af neural netv rks arkitekturer med henblik pa at udf re forskellige \black-box " modellerings opgaver sa som: System identi kation, invers modellering og pr diktion af tidsserier. De v senligste bidrag omfatter: Formulering af en neural netv rks baseret kanonisk lter repr sentation, der danner baggrund for udvikling af et arkitektur klassi kationssystem. I hovedsagen drejer det sig om en skelnen mellem globale og lokale modeller. Dette leder til at en r kke kendte neurale netv rks arkitekturer kan klassi ceres, og yderligere abnes der mulighed for udvikling af helt nye strukturer. I denne sammenh ng ndes en gennemgang af en r kke velkendte arkitekturer. I s rdeleshed l gges der v gt pa behandlingen af multi-lags perceptron neural netv rket.

