• Communications for Statistical Applications and Methods
• /
• 제23권1호
• /
• pp.71-83
• /
• 2016

In this paper we discuss a deconvolution density estimator obtained using the support vector machines (SVM) and Tikhonov's regularization method solving ill-posed problems in reproducing kernel Hilbert space (RKHS). A remarkable property of SVM is that the SVM leads to sparse solutions, but the support vector deconvolution density estimator does not preserve sparsity as well as we expected. Thus, in section 3, we propose another support vector deconvolution estimator (method II) which leads to a very sparse solution. The performance of the deconvolution density estimators based on the support vector method is compared with the classical kernel deconvolution density estimator for important cases of Gaussian and Laplacian measurement error by means of a simulation study. In the case of Gaussian error, the proposed support vector deconvolution estimator shows the same performance as the classical kernel deconvolution density estimator.

• Communications for Statistical Applications and Methods
• /
• 제19권4호
• /
• pp.517-526
• /
• 2012

In this paper a support vector method is proposed for use when the sample observations are contaminated by a normally distributed measurement error. The performance of deconvolution density estimators based on the support vector method is explored and compared with kernel density estimators by means of a simulation study. An interesting result was that for the estimation of kurtotic density, the support vector deconvolution estimator with a Gaussian kernel showed a better performance than the classical deconvolution kernel estimator.

• Communications for Statistical Applications and Methods
• /
• 제17권3호
• /
• pp.451-457
• /
• 2010

This paper considers the problem of nonparametric deconvolution density estimation when sample observa-tions are contaminated by double exponentially distributed errors. Three different deconvolution density estima-tors are introduced: a weighted kernel density estimator, a kernel density estimator based on the support vector regression method in a RKHS, and a classical kernel density estimator. The performance of these deconvolution density estimators is compared by means of a simulation study.

• Molecules and Cells
• /
• 제46권2호
• /
• pp.99-105
• /
• 2023

Tumors are surrounded by a variety of tumor microenvironmental cells. Profiling individual cells within the tumor tissues is crucial to characterize the tumor microenvironment and its therapeutic implications. Since single-cell technologies are still not cost-effective, scientists have developed many statistical deconvolution methods to delineate cellular characteristics from bulk transcriptome data. Here, we present an overview of 20 deconvolution techniques, including cutting-edge techniques recently established. We categorized deconvolution techniques by three primary criteria: characteristics of methodology, use of prior knowledge of cell types and outcome of the methods. We highlighted the advantage of the recent deconvolution tools that are based on probabilistic models. Moreover, we illustrated two scenarios of the common application of deconvolution methods to study tumor microenvironments. This comprehensive review will serve as a guideline for the researchers to select the appropriate method for their application of deconvolution.

• Communications for Statistical Applications and Methods
• /
• 제29권2호
• /
• pp.277-286
• /
• 2022

Due to the uniquely slow convergence speed of the EM algorithm, it suffers form a lot of processing time until the desired deconvolution image is obtained when the image is large. To cope with the problem, in this paper, an immediate solution of the EM algorithm is provided under the Gaussian image model. It is derived by finding the recurrent formular of the EM algorithm and then substituting the results repeatedly. In this paper, two types of immediate soultion of image deconboution by EM algorithm are provided, and both methods have been shown to work well. It is expected that it free the processing time of image deconvolution because it no longer requires an iterative process. Based on this, we can find the statistical properties of the restored image at specific iterates. We demonstrate the effectiveness of the proposed method through a simple experiment, and discuss future concerns.

• Journal of the Korean Statistical Society
• /
• 제25권2호
• /
• pp.265-276
• /
• 1996

The nonparametric deconvolution problems are studied to recover an unknown density when the data are contaminated with Gaussian error. We propose the estimator which is a linear combination of kernel type estimates of derivertives of the observed density function. We show that this estimator is consistent and also consider the properties of estimator at small sample by simulation.

• Communications for Statistical Applications and Methods
• /
• 제15권6호
• /
• pp.939-946
• /
• 2008

In this paper the support vector method is presented for the probability density function estimation when the sample observations are contaminated with random noise. The performance of the procedure is compared to kernel density estimates by the simulation study.

• Communications for Statistical Applications and Methods
• /
• 제8권3호
• /
• pp.859-866
• /
• 2001

The problem of wavelet density estimation is studied when the sample observations are contaminated with random noise. In this paper a linear wavelet estimator based on Meyer-type wavelets is shown to be L$_1$ strongly consistent for f(x) with bounded support when Fourier transform of random noise has polynomial descent or exponential descent.

• Communications for Statistical Applications and Methods
• /
• 제9권1호
• /
• pp.241-248
• /
• 2002

The problem of wavelet density estimation based on Shannon's wavelets is studied when the sample observations are contaminated with random noise. In this paper we will discuss the asymptotic normality for deconvolving wavelet density estimator of the unknown density f(x) when courier transform of random noise has polynomial descent.

• Communications for Statistical Applications and Methods
• /
• 제4권3호
• /
• pp.833-845
• /
• 1997

Fourier expansion is considered for the deconvolution problem of estimating a probability density function when the sample observations are contaminated with random noise. In the log-Fourier method of density estimation for data without noise, the logarithm of the unknown density function is approximated by a trigonometric function, the unknown parameters of which are estimated by maximum likelihood. The log-Fourier density estimation method, which has been considered theoretically by Koo and Chung (1997), is studied for the finite-sample case with noise. Numerical examples using simulated data are given to show the performance of the log-Fourier deconvolution.