๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An efficient computational method for moments of order statistics under progressive censoring

โœ Scribed by N. Balakrishnan; A. Childs; B. Chandrasekar

Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
113 KB
Volume
60
Category
Article
ISSN
0167-7152

No coin nor oath required. For personal study only.

โœฆ Synopsis

Thomas and Wilson (Technometrics 14 (1972) 679) developed a computational method for calculating the single and product moments of order statistics from progressively censored samples by making use of the corresponding moments of the usual order statistics. The absence of an explicit representation for the marginal and joint density function of order statistics under progressive censoring makes their method extremely tedious. By deriving the required marginal and joint density functions in explicit form, we obtain an alternative, highly e cient, method for computing the desired moments.

๐Ÿ“œ SIMILAR VOLUMES

P-Norm bounds for moments of progressive
P-Norm bounds for moments of progressive type II censored order statistics
โœ Mohammad Z. Raqab ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 236 KB

In this paper, we present p-norm bounds for the moments of progressive type II censored order statistics, measured in scale units generated by absolute moments of the parent distribution of a single observation. The bounds are established based on combining the Moriguti monotone approximations with

An Efficient Method for Computation of L
An Efficient Method for Computation of Legendre Moments
โœ Huazhong Shu; Limin Luo; Xudong Bao; Wenxue Yu; Guoniu Han ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 227 KB

The two-dimensional (2D) and three-dimensional (3D) orthogonal moments are useful tools for 2D and 3D object recognition and image analysis. However, the problem of computation of orthogonal moments has not been well solved because there exist few algorithms that can efficiently reduce the computati