Results 1  10
of
6,144
The permutation classes equinumerous to the Smooth class
 J. Combin
, 1998
"... We determine all permutation classes defined by pattern avoidance which are equinumerous to the class of permutations whose Schubert variety is smooth. We also provide a lattice path interpretation for the numbers of such permutations. 1 Introduction Let q =(q 1 ,q 2 ,...,q k ) # S k be a permut ..."
Abstract

Cited by 42 (0 self)
 Add to MetaCart
We determine all permutation classes defined by pattern avoidance which are equinumerous to the class of permutations whose Schubert variety is smooth. We also provide a lattice path interpretation for the numbers of such permutations. 1 Introduction Let q =(q 1 ,q 2 ,...,q k ) # S k be a
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
balls in each of two broad scales of smoothness classes. These two properties are unprecedented in several ways. Our proof of these results develops new facts about abstract statistical inference and its connection with an optimal recovery model.
On local smoothness classes of periodic functions
 J. Fourier Anal. Appl
"... We obtain a characterization of local Besov spaces of periodic functions in terms of trigonometric polynomial operators. Several numerical examples are discussed, including applications to the problem of direction finding in phased array antennas and finding the location of jump discontinuities of d ..."
Abstract

Cited by 10 (7 self)
 Add to MetaCart
We obtain a characterization of local Besov spaces of periodic functions in terms of trigonometric polynomial operators. Several numerical examples are discussed, including applications to the problem of direction finding in phased array antennas and finding the location of jump discontinuities of derivatives of different order. 1
Scalespace and edge detection using anisotropic diffusion
 IEEE Transactions on Pattern Analysis and Machine Intelligence
, 1990
"... AbstractThe scalespace technique introduced by Witkin involves generating coarser resolution images by convolving the original image with a Gaussian kernel. This approach has a major drawback: it is difficult to obtain accurately the locations of the “semantically meaningful ” edges at coarse sca ..."
Abstract

Cited by 1887 (1 self)
 Add to MetaCart
scales. In this paper we suggest a new definition of scalespace, and introduce a class of algorithms that realize it using a diffusion process. The diffusion coefficient is chosen to vary spatially in such a way as to encourage intraregion smoothing in preference to interregion smoothing. It is shown
On Sequential Monte Carlo Sampling Methods for Bayesian Filtering
 STATISTICS AND COMPUTING
, 2000
"... In this article, we present an overview of methods for sequential simulation from posterior distributions. These methods are of particular interest in Bayesian filtering for discrete time dynamic models that are typically nonlinear and nonGaussian. A general importance sampling framework is develop ..."
Abstract

Cited by 1051 (76 self)
 Add to MetaCart
been employed in the deterministic filtering literature; these lead to very effective importance distributions. Furthermore we describe a method which uses RaoBlackwellisation in order to take advantage of the analytic structure present in some important classes of statespace models. In a final
Fast approximate energy minimization via graph cuts
 IEEE Transactions on Pattern Analysis and Machine Intelligence
, 2001
"... In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major restriction is that the energy function’s smoothness term must only involve pairs of pixels. We propose two algorithms that use graph cuts to compute a local minimum even when v ..."
Abstract

Cited by 2120 (61 self)
 Add to MetaCart
In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major restriction is that the energy function’s smoothness term must only involve pairs of pixels. We propose two algorithms that use graph cuts to compute a local minimum even when
Strongly Elliptic Systems and Boundary Integral Equations
, 2000
"... Partial differential equations provide mathematical models of many important problems in the physical sciences and engineering. This book treats one class of such equations, concentrating on methods involving the use of surface potentials. It provides the first detailed exposition of the mathematic ..."
Abstract

Cited by 501 (0 self)
 Add to MetaCart
Partial differential equations provide mathematical models of many important problems in the physical sciences and engineering. This book treats one class of such equations, concentrating on methods involving the use of surface potentials. It provides the first detailed exposition
Bayesian density estimation and inference using mixtures.
 J. Amer. Statist. Assoc.
, 1995
"... JSTOR is a notforprofit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about J ..."
Abstract

Cited by 653 (18 self)
 Add to MetaCart
mixtures of normal distributions. Efficient simulation methods are used to approximate various prior, posterior, and predictive distributions. This allows for direct inference on a variety of practical issues, including problems of local versus global smoothing, uncertainty about density estimates
A computational approach to edge detection
 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 1986
"... This paper describes a computational approach to edge detection. The success of the approach depends on the definition of a comprehensive set of goals for the computation of edge points. These goals must be precise enough to delimit the desired behavior of the detector while making minimal assumpti ..."
Abstract

Cited by 4675 (0 self)
 Add to MetaCart
assumptions about the form of the solution. We define detection and localization criteria for a class of edges, and present mathematical forms for these criteria as functionals on the operator impulse response. A third criterion is then added to ensure that the detector has only one response to a single edge
Polynomial operators and local smoothness classes on the unit interval
 Journal of Approximation Theory
"... We prove the existence of quadrature formulas exact for integrating high degree polynomials with respect to Jacobi weights based on scattered data on the unit interval. We also obtain a characterization of local Besov spaces using the coefficients of a tight frame expansion. 1 ..."
Abstract

Cited by 17 (10 self)
 Add to MetaCart
We prove the existence of quadrature formulas exact for integrating high degree polynomials with respect to Jacobi weights based on scattered data on the unit interval. We also obtain a characterization of local Besov spaces using the coefficients of a tight frame expansion. 1
Results 1  10
of
6,144