Results 1  10
of
22,024
MEASURED NOISE
, 2009
"... Gravitational wave astrophysics is on the threshold of a first direct detection and in the next few years will begin contributing to astronomy. The groundwork for this advance was laid over the past three decades through a vigorous program of R&D. Significant further advances in sensitivity and ..."
Abstract
 Add to MetaCart
Gravitational wave astrophysics is on the threshold of a first direct detection and in the next few years will begin contributing to astronomy. The groundwork for this advance was laid over the past three decades through a vigorous program of R&D. Significant further advances in sensitivity and frequency coverage for thirdgeneration groundbased interferometers are possible and will address questions of major scientific importance. To accomplish this, a forwardlooking program of instrumental research should be supported.
DeNoising By SoftThresholding
, 1992
"... Donoho and Johnstone (1992a) proposed a method for reconstructing an unknown function f on [0; 1] from noisy data di = f(ti)+ zi, iid i =0;:::;n 1, ti = i=n, zi N(0; 1). The reconstruction fn ^ is de ned in the wavelet domain by translating all the empirical wavelet coe cients of d towards 0 by an a ..."
Abstract

Cited by 1279 (14 self)
 Add to MetaCart
by an amount p 2 log(n) = p n. We prove two results about that estimator. [Smooth]: With high probability ^ fn is at least as smooth as f, in any of a wide variety of smoothness measures. [Adapt]: The estimator comes nearly as close in mean square to f as any measurable estimator can come, uniformly over
Stable signal recovery from incomplete and inaccurate measurements,”
 Comm. Pure Appl. Math.,
, 2006
"... Abstract Suppose we wish to recover a vector x 0 ∈ R m (e.g., a digital signal or image) from incomplete and contaminated observations y = Ax 0 + e; A is an n × m matrix with far fewer rows than columns (n m) and e is an error term. Is it possible to recover x 0 accurately based on the data y? To r ..."
Abstract

Cited by 1397 (38 self)
 Add to MetaCart
? To recover x 0 , we consider the solution x to the 1 regularization problem where is the size of the error term e. We show that if A obeys a uniform uncertainty principle (with unitnormed columns) and if the vector x 0 is sufficiently sparse, then the solution is within the noise level As a first example
Linklevel Measurements from an 802.11b Mesh Network
 In SIGCOMM
, 2004
"... This paper anal yzes the causes of packetl oss in a 38node urban mul tihop 802.11b network. The patterns and causes oflv# are important in the design of routing and errorcorrection proto colv as wel as in networkplqq"(v The paper makes the fol l owing observations. The distribution of intern ..."
Abstract

Cited by 567 (11 self)
 Add to MetaCart
scal e. Sign al tonoise ratio and distance have lv tl e predictive val e forl oss rate. Thel arge number of lv ks with intermediate l oss rates is probabl y due to mul tipath fading rather than attenuation or interference. The phenomena discussed here are al l wel l known. The contributions
The Aurora Experimental Framework for the Performance Evaluation of Speech Recognition Systems under Noisy Conditions
 in ISCA ITRW ASR2000
, 2000
"... This paper describes a database designed to evaluate the performance of speech recognition algorithms in noisy conditions. The database may either be used to measure frontend feature extraction algorithms, using a defined HMM recognition backend, or complete recognition systems. The source speech f ..."
Abstract

Cited by 534 (6 self)
 Add to MetaCart
This paper describes a database designed to evaluate the performance of speech recognition algorithms in noisy conditions. The database may either be used to measure frontend feature extraction algorithms, using a defined HMM recognition backend, or complete recognition systems. The source speech
Singularity Detection And Processing With Wavelets
 IEEE Transactions on Information Theory
, 1992
"... Most of a signal information is often found in irregular structures and transient phenomena. We review the mathematical characterization of singularities with Lipschitz exponents. The main theorems that estimate local Lipschitz exponents of functions, from the evolution across scales of their wavele ..."
Abstract

Cited by 595 (13 self)
 Add to MetaCart
study separately. We show that the size of the oscillations can be measured from the wavelet transform local maxima. It has been shown that one and twodimensional signals can be reconstructed from the local maxima of their wavelet transform [14]. As an application, we develop an algorithm that removes
Random forests
 Machine Learning
, 2001
"... Abstract. Random forests are a combination of tree predictors such that each tree depends on the values of a random vector sampled independently and with the same distribution for all trees in the forest. The generalization error for forests converges a.s. to a limit as the number of trees in the fo ..."
Abstract

Cited by 3613 (2 self)
 Add to MetaCart
. Schapire, Machine Learning: Proceedings of the Thirteenth International conference, ∗∗∗, 148–156), but are more robust with respect to noise. Internal estimates monitor error, strength, and correlation and these are used to show the response to increasing the number of features used in the splitting
Determining Optical Flow
 ARTIFICIAL INTELLIGENCE
, 1981
"... Optical flow cannot be computed locally, since only one independent measurement is available from the image sequence at a point, while the flow velocity has two components. A second constraint is needed. A method for finding the optical flow pattern is presented which assumes that the apparent veloc ..."
Abstract

Cited by 2404 (9 self)
 Add to MetaCart
Optical flow cannot be computed locally, since only one independent measurement is available from the image sequence at a point, while the flow velocity has two components. A second constraint is needed. A method for finding the optical flow pattern is presented which assumes that the apparent
Exploration, normalization, and summaries of high density oligonucleotide array probe level data.
 Biostatistics,
, 2003
"... SUMMARY In this paper we report exploratory analyses of highdensity oligonucleotide array data from the Affymetrix GeneChip R system with the objective of improving upon currently used measures of gene expression. Our analyses make use of three data sets: a small experimental study consisting of f ..."
Abstract

Cited by 854 (33 self)
 Add to MetaCart
SUMMARY In this paper we report exploratory analyses of highdensity oligonucleotide array data from the Affymetrix GeneChip R system with the objective of improving upon currently used measures of gene expression. Our analyses make use of three data sets: a small experimental study consisting
Implicit Fairing of Irregular Meshes using Diffusion and Curvature Flow
, 1999
"... In this paper, we develop methods to rapidly remove rough features from irregularly triangulated data intended to portray a smooth surface. The main task is to remove undesirable noise and uneven edges while retaining desirable geometric features. The problem arises mainly when creating highfidelit ..."
Abstract

Cited by 542 (23 self)
 Add to MetaCart
In this paper, we develop methods to rapidly remove rough features from irregularly triangulated data intended to portray a smooth surface. The main task is to remove undesirable noise and uneven edges while retaining desirable geometric features. The problem arises mainly when creating high
Results 1  10
of
22,024