نتایج جستجو برای: shape error

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

1996
Sameer P. Singh

In this paper I shall describe a new method called String Distance Measurement (SDM) for recognizing handwritten characters. The advantage of the technique is that it can be applied in a generic manner to different applications which involve shape recognition and may be successfully modified for individual applications. The technique is based on the measurement of gradient change. The technique...

2011
John Hannon Evgeny Knutov Paul De Bra Mykola Pechenizkiy Kevin McCarthy Barry Smyth

In this paper we consider Recommender System (RS) modeling in terms of Adaptive Hypermedia Systems (AHS) and investigate AHS and RS functionality compliance in terms of common features, functionality, building blocks and composition of the system. We bring up complementary aspects of adaptation, personalization and recommendation in a context of a generic framework which provides properties of ...

2002
Kibeom Seong Taek Soo Kim

In this report, we investigate the adaptive modulation issue for MIMO systems in timevarying channels and propose a low complexity rate quantization scheme, which is called ERQ (Enhanced Rate Quantization). Without any exhaustive numerical search, the ERQ with square QAM constellations of 5 rate levels achieves the spectral efficiency within 0.2dB of the efficiency obtained with the optimal con...

Journal: :EURASIP J. Wireless Comm. and Networking 2012
Saif E. A. Alnawayseh Pavel Loskot

The ordered statistics-based list decoding techniques for linear binary block codes of small to medium block length are investigated. The construction of a list of the test error patterns is considered. The original ordered-statistics decoding (OSD) is generalized by assuming segmentation of the most reliable independent positions (MRIPs) of the received bits. The segmentation is shown to overc...

Journal: :Journal of the American Statistical Association 2011
Raymond J Carroll Aurore Delaigle Peter Hall

In many applications we can expect that, or are interested to know if, a density function or a regression curve satisfies some specific shape constraints. For example, when the explanatory variable, X, represents the value taken by a treatment or dosage, the conditional mean of the response, Y , is often anticipated to be a monotone function of X. Indeed, if this regression mean is not monotone...

2007
Marta Grzanek Katarzyna Szulc

Numerical method of identification for small circular openings in the domain of integration of an elliptic equation is presented. The method combines the asymptotic analysis of PDE’s with an application of neural networks. The asymptotic analysis is performed in singularly perturbed geometrical domains with the imperfections in form of small voids and results in the form of the so-called topolo...

Journal: :Applied optics 2011
Ying Xu Laura Ekstrand Junfei Dai Song Zhang

This paper analyzes the phase error for a three-dimensional (3D) shape measurement system that utilizes our recently proposed projector defocusing technique. This technique generates seemingly sinusoidal structured patterns by defocusing binary structured patterns and then uses these patterns to perform 3D shape measurement by fringe analysis. However, significant errors may still exist if an o...

2004
Oleg V. Vasilyev Daniel E. Goldstein

In this Brief Communication we present a new mathematical tool, which we call local spectrum analysis, that can be used to obtain information about local spectral content of the commutation error in large eddy simulations and its dependence on the filter shape and the non-uniformity of the filter width. To illustrate these theoretical findings, the local commutation spectrum analysis is applied...

Journal: :SIAM J. Numerical Analysis 2012
Gregory E. Fasshauer Fred J. Hickernell Henryk Wozniakowski

This article studies the problem of approximating functions belonging to a Hilbert space Hd with an isotropic or anisotropic translation invariant (or stationary) reproducing kernel with special attention given to the Gaussian kernel Kd(x, t) = exp ( − d ∑ `=1 γ ` (x` − t`) 2 ) for all x, t ∈ R. The isotropic (or radial) case corresponds to using the same shape parameters for all coordinates, n...

Journal: :J. Multivariate Analysis 2009
Stephan Huckemann Thomas Hotz

In this paper a numerical method to compute principal component geodesics for Kendall’s planar shape spaces which are essentially complex projective spaces is presented. Underlying is the notion of principal component analysis based on geodesics for non-Euclidean manifolds as proposed in an earlier paper by Huckemann and Ziezold (2006). Currently, principal component analysis for shape spaces i...

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

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