• International Journal of CAD/CAM
• /
• v.13 no.1
• /
• pp.1-11
• /
• 2013

Just by adjusting the control points iteratively, progressive iterative approximation (PIA) presents an intuitive and straightforward scheme such that the resulting limit curve (surface) can interpolate the original data points. In order to obtain more flexibility, adjusting only a subset of the control points, a new method called local progressive iterative approximation (LPIA) has also been proposed. But to this day, there are two problems about PIA and LPIA: (1) Only an approximation process is discussed, but the accurate convergence curves (surfaces) are not given. (2) In order to obtain an interpolating curve (surface) with high accuracy, recursion computations are needed time after time, which result in a large workload. To overcome these limitations, this paper gives an explicit matrix expression of the control points of the limit curve (surface) by the PIA or LPIA method, and proves that the column vector consisting of the control points of the PIA's limit curve (or surface) can be obtained by multiplying the column vector consisting of the original data points on the left by the inverse matrix of the collocation matrix (or the Kronecker product of the collocation matrices in two direction) of the blending basis at the parametric values chosen by the original data points. Analogously, the control points of the LPIA's limit curve (or surface) can also be calculated by one-step. Furthermore, the $G^1$ joining conditions between two adjacent limit curves obtained from two neighboring data points sets are derived. Finally, a simple LPIA method is given to make the given tangential conditions at the endpoints can be satisfied by the limit curve.

• Communications for Statistical Applications and Methods
• /
• v.28 no.5
• /
• pp.425-445
• /
• 2021

A generalization of the log-logistic (LL) distribution called exponentiated log-logistic (ELL) distribution on lines of exponentiated Weibull distribution is considered. In this paper, based on progressive type-II censored samples, we have derived the maximum likelihood estimators and Bayes estimators for three parameters, the survival function and hazard function of the ELL distribution. Then, under the balanced squared error loss (BSEL) and the balanced linex loss (BLEL) functions, their corresponding Bayes estimators are obtained using Lindley's approximation (see Jung and Chung, 2018; Lindley, 1980), Tierney-Kadane approximation (see Tierney and Kadane, 1986) and Markov Chain Monte Carlo methods (see Hastings, 1970; Gelfand and Smith, 1990). Here, to check the convergence of MCMC chains, the Gelman and Rubin diagnostic (see Gelman and Rubin, 1992; Brooks and Gelman, 1997) was used. On the basis of their risks, the performances of their Bayes estimators are compared with maximum likelihood estimators in the simulation studies. In this paper, research supports the conclusion that ELL distribution is an efficient distribution to modeling data in the analysis of survival data. On top of that, Bayes estimators under various loss functions are useful for many estimation problems.

• Journal of the Korean Data and Information Science Society
• /
• v.24 no.6
• /
• pp.1309-1317
• /
• 2013

There are various parameter estimation methods for the generalized exponential distribution under progressive type I interval censoring. Chen and Lio (2010) studied the parameter estimation method by the maximum likelihood estimation method, mid-point approximation method, expectation maximization algorithm and methods of moments. Among those, mid-point approximation method has the smallest mean square error in the generalized exponential distribution under progressive type I interval censoring. However, this method is difficult to derive closed form of solution for the parameter estimation using by maximum likelihood estimation method. In this paper, we propose two type of approximate maximum likelihood estimate to solve that problem. The simulation results show the obtained estimators have good performance in the sense of the mean square error. And proposed method derive closed form of solution for the parameter estimation from the generalized exponential distribution under progressive type I interval censoring.

• ETRI Journal
• /
• v.43 no.3
• /
• pp.447-458
• /
• 2021

The quality of experience (QoE) of video streaming is degraded by playback interruptions, which can be mitigated by the playout buffers of end users. To analyze the impact of playout buffer dynamics on the QoE of wireless adaptive hypertext transfer protocol (HTTP) progressive video, we model the playout buffer as a G/D/1 queue with an arbitrary packet arrival rate and deterministic service time. Because all video packets within a block must be available in the playout buffer before that block is decoded, playback interruption can occur even when the playout buffer is non-empty. We analyze the queue length evolution of the playout buffer using diffusion approximation. Closed-form expressions for user-perceived video quality are derived in terms of the buffering delay, playback duration, and interruption probability for an infinite buffer size, the packet loss probability and re-buffering probability for a finite buffer size. Simulation results verify our theoretical analysis and reveal that the impact of playout buffer dynamics on QoE is content dependent, which can contribute to the design of QoE-driven wireless adaptive HTTP progressive video management.

• Journal of the Korean Data and Information Science Society
• /
• v.25 no.3
• /
• pp.643-653
• /
• 2014

In this paper, we propose some estimators for the extreme value distribution based on the interval method and mid-point approximation method from the progressive Type-I interval censored sample. Because log-likelihood function is a non-linear function, we use a Taylor series expansion to derive approximate likelihood equations. We compare the proposed estimators in terms of the mean squared error by using the Monte Carlo simulation.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.24 no.12
• /
• pp.3040-3052
• /
• 2000

For effective construction of second-order response surface models, an efficient quad ratic approximation method is proposed in the context of trust region model management strategy. In the proposed method, although only the linear and quadratic terms are uniquely determined using 2n+1 design points, the two-factor interaction terms are mathematically updated by normalized quasi-Newton formula. In order to show the numerical performance of the proposed approximation method, a sequential approximate optimizer is developed and solves a typical unconstrained optimization problem having 2, 6, 10, 15, 30 and 50 design variables, a gear reducer system design problem and two dynamic response optimization problems with multiple objectives, five objectives for one and two objectives for the other. Finally, their optimization results are compared with those of the CCD or the 50% over-determined D-optimal design combined with the same trust region sequential approximate optimizer. These comparisons show that the proposed method gives more efficient than others.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.1
• /
• pp.114-123
• /
• 2003

This paper proposes an efficient method for encoding the shape information of the object in the image. The polygonal approximation method is categorized into a loss coding method and is widely used for approximating object's shape information. The proposed method selects less number of vertices than IRM (iterated refinement method) or PVS (progressive vertex selection) when the maximum distortion is given, so reduces the bit-rates. The proposed method selects the vertices of a polygon with a simple and efficient method considering the rate-distortion sense. We construct the shape information coder, which shows the outstanding performance in the rate-distortion sense, based on the conventional progressive vertex selection method and the new vertex selection condition that we propose in this paper. Simulation results show that the proposed method has better performance than other conventional vertex selection methods in the tate-distortion sense.

• Journal of the Korean Data and Information Science Society
• /
• v.28 no.3
• /
• pp.659-668
• /
• 2017

The inverse Weibull distribution (IWD) can be readily applied to a wide range of situations including applications in medicines, reliability and ecology. It is generally known that the lifetimes of test items may not be recorded exactly. In this paper, therefore, we consider the maximum likelihood estimation (MLE) and Bayes estimation of the entropy of a IWD under generalized progressive hybrid censoring (GPHC) scheme. It is observed that the MLE of the entropy cannot be obtained in closed form, so we have to solve two non-linear equations simultaneously. Further, the Bayes estimators for the entropy of IWD based on squared error loss function (SELF), precautionary loss function (PLF), and linex loss function (LLF) are derived. Since the Bayes estimators cannot be obtained in closed form, we derive the Bayes estimates by revoking the Tierney and Kadane approximate method. We carried out Monte Carlo simulations to compare the classical and Bayes estimators. In addition, two real data sets based on GPHC scheme have been also analysed for illustrative purposes.

• ETRI Journal
• /
• v.39 no.1
• /
• pp.1-12
• /
• 2017

In this paper, we present a new approach for the progressive compression of three-dimensional (3D) mesh geometry using redundant frame dictionaries and sparse approximation techniques. We construct the proposed frames from redundant linear combinations of the eigenvectors of a combinatorial mesh Laplacian matrix. We achieve a sparse synthesis of the mesh geometry by selecting atoms from a frame using matching pursuit. Experimental results show that the resulting rate-distortion performance compares favorably with other progressive mesh compression algorithms in the same category, even when a very simple, sub-optimal encoding strategy is used for the transmitted data. The proposed frames also have the desirable property of being able to be applied directly to a manifold mesh having arbitrary topology and connectivity types; thus, no initial remeshing is required and the original mesh connectivity is preserved.

• Communications for Statistical Applications and Methods
• /
• v.27 no.4
• /
• pp.469-486
• /
• 2020

Entropy is an important term in statistical mechanics that was originally defined in the second law of thermodynamics. In this paper, we consider the maximum likelihood estimation (MLE), maximum product spacings estimation (MPSE) and Bayesian estimation of the entropy of an inverse Weibull distribution (InW) under a generalized type I progressive hybrid censoring scheme (GePH). The MLE and MPSE of the entropy cannot be obtained in closed form; therefore, we propose using the Newton-Raphson algorithm to solve it. Further, the Bayesian estimators for the entropy of InW based on squared error loss function (SqL), precautionary loss function (PrL), general entropy loss function (GeL) and linex loss function (LiL) are derived. In addition, we derive the Lindley's approximate method (LiA) of the Bayesian estimates. Monte Carlo simulations are conducted to compare the results among MLE, MPSE, and Bayesian estimators. A real data set based on the GePH is also analyzed for illustrative purposes.