206736471
Wavelet spectrum and its characterization property for random processes
The wavelet spectrum of a random process comprises the variances of the wavelet coefficients of the process computed within each scale. This paper investigates the possibility of using the wavelet spectrum, obtained from a continuous wavelet transform (CWT), to uniquely represent the second-order statistical properties of random processes-particularly, stationary processes and long-memory nonstationary processes. As is well known, the Fourier spectrum of a stationary process is mathematically equivalent to the autocovariance function (ACF) and thus uniquely determines the second-order statistics of the process. This characterization property is shown to be possessed also by the wavelet spectrum under very mild regularity conditions that are easily satisfied by many widely used wavelets. It is also shown that under suitable regularity conditions, the characterization property remains valid for processes with stationary increments including 1/f noise.
3381503
Finite-alphabet information and multivariate blind deconvolution and identification of linear systems
This article addresses the problem of estimating a multivariate linear system from its output when the input is an unobservable sequence of random vectors with finite-alphabet distribution. By explicitly utilizing the finite-alphabet property, an estimation method is proposed under the traditional inverse filtering paradigm as a generalization of a univariate method that has been studied previously. Identifiability of multivariate systems by the proposed method is proved mathematically under very mild conditions that can be satisfied even if the input is nonstationary and has both cross-channel and serial statistical dependencies. Statistical super-efficiency in estimating both parametric and nonparametric systems is also established for an alphabet-based cost function.
25228668
A joint estimation approach for two-tone image deblurring by blind deconvolution
A new statistical method is proposed for deblurring two-tone images, i.e., images with two unknown grey levels, that are blurred by an unknown linear filter. The key idea of the proposed method is to adjust a deblurring filter until its output becomes two tone. Two optimization criteria are proposed for the adjustment of the deblurring filter. A three-step iterative algorithm (TSIA) is also proposed to minimize the criteria. It is proven mathematically that by minimizing either of the criteria, the original (nonblurred) image, along with the blur filter, will be recovered uniquely (only with possible scale/shift ambiguities) at high SNR. The recovery is guaranteed not only for i.i.d. images but also for correlated and nonstationary images. It does not require a priori knowledge of the statistical parameters or the tone values of the original image; neither does it require a priori knowledge of the phase or other special information (e.g., FIR, symmetry, nonnegativity, etc.) about the blur filter. Numerical experiments are carried out to test the method on synthetic and real images.
20811204
Asymptotic analysis of a fast algorithm for efficient multiple frequency estimation
Based on an asymptotic analysis of the contraction mapping (CM) method of Li and Kedem (1993), a bandwidth shrinkage rule is proposed for fast and accurate estimation of the frequencies of multiple sinusoids from noisy measurements. The CM frequency estimates are defined as the fixed points of a contractive mapping formed by the lag-one autocorrelation coefficient calculated from the output. of a parametric filter applied to the observed time series. With bandwidth parameters judiciously chosen according to the asymptotic analysis, the algorithm is shown to be able to accommodate possibly poor initial values of precision O(n/sup -1/3/) and converge to a final estimate whose accuracy is arbitrarily close to O(n/sup -3/2/), the optimal error rate for frequency estimation under the Gaussian assumption. The total computational complexity of the algorithm is shown to be O(n log n), which is comparable to that of n-point fast Fourier transform (FFT). A novelty in the asymptotic analysis is that it accommodates closely spaced frequencies by allowing not only the filter bandwidth but also the frequency separation to be functions of the sample size n. This enables an assessment of the accuracy of the frequency estimates for given bandwidths and initial values in situations where some or all of the frequencies are close to each other.
3016046
Asymptotic analysis of a fast algorithm for efficient multiple frequency estimation
8716577
Blind identification and deconvolution of linear systems driven by binary random sequences
The problem of blind identification and deconvolution of linear systems with independent binary inputs is addressed. To solve the problem, a linear system is applied to the observed data and adjusted so as to produce binary outputs. It is proved that the system coincides with the inverse of the unknown system (with scale and shift ambiguities), whether it is minimum or nonminimum phase. These results are derived for nonstationary independent binary inputs of infinite or finite length. Based on these results, an identification method is proposed for parametric linear systems. It is shown that under some mild conditions, a consistent estimator of the parameter can be obtained by minimizing a binariness criterion for the output data. Unlike many other blind identification and deconvolution methods, this criterion handles nonstationary signals and does not utilize any moment information of the inputs. Three numerical examples are presented to demonstrate the effectiveness of the proposed method. >
5255914
Recommendation on Item Graphs
A novel scheme for item-based recommendation is proposed in this paper. In our framework, the items are described by an undirected weighted graph Q = (V,epsiv). V is the node set which is identical to the item set, and epsiv is the edge set. Associate with each edge eij isin epsiv is a weight omegaij ges 0, which represents similarity between items i and j. Without the loss of generality, we assume that any user's ratings to the items should be sufficiently smooth with respect to the intrinsic structure of the items, i.e., a user should give similar ratings to similar items. A simple algorithm is presented to achieve such a smooth solution. Encouraging experimental results are provided to show the effectiveness of our method.
2911701
Workload characterization of bioinformatics applications
The exponential growth in the amount of genomic information has spurred growing interest in large scale analysis of genetic data. Bioinformatics applications represent the increasingly important workloads. However, very few results on the behavior of these applications running on the state-of-the-art microprocessor and systems have been published. This paper proposes a suite of widely used bioinformatics applications and studies the execution characteristics of these benchmarks on a representative architecture-the Intel Pentium 4. To understand the impacts and implications of bioinformatics workloads on the microprocessor designs, we contrast the characteristics of bioinformatics workloads and the widely used SPEC 2000 integer benchmarks.
9813108
CoFD : An Algorithm for Non-distance Based Clustering in High Dimensional Spaces
The clustering problem, which aims at identifying the distribution of patterns and intrinsic correlations in large data sets by partitioning the data points into similarity clusters, has been widely studied. Traditional clustering algorithms use distance functions to measure similarity and are not suitable for high dimensional spaces. In this paper, we propose CoFD algorithm, which is a non-distance based clustering algorithm for high dimensional spaces. Based on the maximum likelihood principle, CoFD is to optimize parameters to maximize the likelihood between data points and the model generated by the parameters. Experimental results on both synthetic data sets and a real data set show the efficiency and effectiveness of CoFD.
13900916
Detection of cognitive binding during ambiguous figure tasks by wavelet coherence analysis of EEG signals
It is hypothesized that the perception of an alternative image in ambiguous figures would be manifested as an increase in synchronization of EEG signals over multiple scalp sites as "cognitive binding" occurs. A statistical time-frequency analysis (STFA) approach is taken to detect cognitive binding. The STFA approach consists of an analysis filter bank that extracts useful components from the input EEG signals and certain statistical parameters at the output that characterize the synchronization patterns over multiple scalp sites. With the help of wavelet-packet filters and wavelet coherence measures, cognitive binding is detected over many frequency bands by statistical testing.
654543
A survey on wavelet applications in data mining
Recently there has been significant development in the use of wavelet methods in various data mining processes. However, there has been written no comprehensive survey available on the topic. The goal of this is paper to fill the void. First, the paper presents a high-level data-mining framework that reduces the overall process into smaller components. Then applications of wavelets for each component are reviewd. The paper concludes by discussing the impact of wavelets on data mining research and outlining potential future research directions and applications.