نتایج جستجو برای: smoothness

تعداد نتایج: 10043  

1993
Mads Nielsen

Regularization of ill-posed problems has been applied in various ways to surface reconstruction problems. Typically the smoothness term has been found in an ad hoc manner. In this work the a priori knowledge of the surface is used to construct the smoothness terms. If all surface normals are considered equally probable, different smoothness terms can be derived for different projections using B...

2001
Emilios Cambouropoulos Simon Dixon Werner Goebl Gerhard Widmer

In this study we investigate the relationship between beat and musical performance. It is hypothesised that listeners prefer beat sequences that are smoother than beat tracks that are fully aligned with the actual onsets of performed notes. In order to examine this hypothesis, an experiment was designed whereby six different smoothed beat tracks generated are rated by subjects in relation to ho...

1996
W. Knox Carey Sheila S. Hemami Peter N. Heller

The uniform quantizers used in typical wavelet image compression algorithms can introduce perceptually disturbing artifacts by decreasing visual smoothness. In this paper, we use local Hölder regularity to quantify changes in visual smoothness and propose a modified quantization scheme which constrains local regularity decreases. The reconstructed images show a significant perceptual improvemen...

1997
Zhihong Hu Etienne Barnard

Dynamic modeling of speech is potentially a major improvement on Hidden Markov Models (HMMs). In one approach, trajectory models[1] are used to model the dynamics of the spectrum, and are used as basis for classi cation [1, 2]. Although some improvement has been achieved in this way, one would hope for more substantial improvements given that the independence assumption is removed. One reason w...

2007
ALESSANDRO ARDIZZONI

We prove that given a bialgebra surjection π : E → H with nilpotent kernel such that H is a Hopf algebra which is formally smooth as a K-algebra, then π has a section which is a right H-colinear algebra homomorphism. Moreover, if H is also endowed with an ad-invariant integral, then the section can be chosen to be H-bicolinear. We also deal with the dual case. As an application, we prove that e...

2003
Tuomas Virtanen

A signal model is described which forces temporal and spectral smoothness of harmonic sounds. Smoothness refers to harmonic partials, the amplitudes of which are slowly-varying as a function of time and frequency. An algorithm is proposed for the estimation of the model parameters. The algorithm is utilized in a sound separation system, the robustness of which is increased by the smoothness con...

1999
Shunan Lin Onur G. Guleryuz

This paper presents novel algorithms that perform motion estimation for video processing and compression. We observe that “smoothness” is a very important and intuitive property in the estimation of motion fields. It is pointed out that most current motion estimation techniques implement smoothness as a constraint, differing only in terms of the specific type of smoothness demanded from video d...

Journal: :Numerische Mathematik 2009
Philipp Grohs

We study the following modification of a linear subdivision scheme S: Let M be a surface embedded in Euclidean space, and P a smooth projection mapping onto M . Then the P -projection analogue of S is defined as T := P ◦ S. As it turns out, the smoothness of the scheme T is always at least as high as the smoothness of the underlying scheme S or the smoothness of P minus 1, whichever is lower. T...

2006
Konrad Schindler Hanzi Wang

We propose an efficient way to account for spatial smoothness in foreground-background segmentation of video sequences. Most statistical background modeling techniques regard the pixels in an image as independent and disregard the fundamental concept of smoothness. In contrast, we model smoothness of the foreground and background with a Markov random field, in such a way that it can be globally...

Journal: :J. Complexity 2007
Josef Dick Friedrich Pillichshammer

In this paper we proof the existence of digitally shifted polynomial lattice rules which achieve strong tractability results for Sobolev spaces of arbitrary high smoothness. The convergence rate is shown to be best possible up to a given degree of smoothness of the integrand. Indeed we even show the existence of polynomial lattice rules which automatically adjust themselves to the smoothness of...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید