نتایج جستجو برای: bounded normal mean

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

Journal: :Journal of Differential Geometry 2007

Journal: :Journal of Multivariate Analysis 1986

Journal: :Communications for Statistical Applications and Methods 2006

Journal: :Banach Center Publications 1985

2001
J. Rataj M. Zähle

The existence of mixed curvature measures of two sets in R with positive reach introduced in [6] is discussed. An example shows that the non-osculating condition from [6] does not ensure the locally bounded variation of the mixed curvature measures. Further, some sufficient conditions for the local boundedness of mixed curvature measures involving absolute curvature measures are presented. For ...

2004
Vladimir Nedović

The implementation of the kernel-based tracking of moving video objects [1], [2] based on the mean shift algorithm [4] is presented. We show that the algorithm performs exceptionally well on moving objects in various video sequences and that it is robust to changes in shape as well as almost complete occlusion. We also propose possible extensions of the current implementation and future work th...

2008
Jianjiang Yu Kanjian Zhang Shumin Fei

In this paper, a direct adaptive fuzzy tracking control scheme is presented for a class of stochastic uncertain nonlinear systems with unknown dead-zone input. A direct adaptive fuzzy tracking controller is developed by using the backstepping approach. It is proved that the design scheme ensures that all the error variables are bounded in probability while the mean square tracking error becomes...

2007
Ye Wang Prakash Ishwar

The reconstruction of a deterministic data field from binary–quantized noisy observations of sensors which are randomly deployed over the field domain is studied. The study focuses on the extremes of lack of deterministic control in the sensor deployment, lack of knowledge of the noise distribution, and lack of sensing precision and reliability. Such adverse conditions are motivated by possible...

2007
Eric J. Griffith Michal Koutek Frits H. Post

We present two methods for lossy compression of normal vectors through quantization using “base” polyhedra. The first revisits subdivision-based quantization. The second uses fixed-precision barycentric coordinates. For both, we provide fast (de)compression algorithms and a rigorous upper bound on compression error. We discuss the effects of base polyhedra on the error bound and suggest polyhed...

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

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