• Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
• /
• 2001.11a
• /
• pp.270-273
• /
• 2001

Electrical tree is studied widely by manufacture state of insulating material fare and blazing fire diagnosis system of use in phenomenon of part discharge that happen for main cause of dielectric breakdown of equipment for electric power. Use process that draw tree pattern here measuring above zero to study special quality of this electricity tree, real-time processing by image processing is proposed because reproduction of tree blazing fire process drops and pattern of tree is difficult correct quantification of tree growth by existent visual observation by involution. This research presents general process that need in image processing of tree blazing fire, and that remove various noises that happen in above zero by measuring electrical tree dividing background and complete view in measured above zero taking advantage of specially proposed complete view object abstraction techniques effectively and quantification of tree becomes easy naturally, can apply to dielectric breakdown estimate because can chase growth process of tree.

• Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
• /
• 2001.11b
• /
• pp.270-273
• /
• 2001

Electrical tree is studied widely by manufacture state of insulating material fare and blazing fire diagnosis system of use in phenomenon of part discharge that happen for main cause of dielectric breakdown of equipment for electric power. Use process that draw tree pattern here measuring above zero to study special quality of this electricity tree, real-time processing by image processing is proposed because reproduction of tree blazing fire process drops and pattern of tree is difficult correct quantification of tree growth by existent visual observation by involution. This research presents general process that need in image processing of tree blazing fire, and that remove various noises that happen in above zero by measuring electrical tree dividing background and complete view in measured above zero taking advantage of specially proposed complete view object abstraction techniques effectively and quantification of tree becomes easy naturally, can apply to dielectric breakdown estimate because can chase growth process of tree.

• Journal of the Institute of Convergence Signal Processing
• /
• v.2 no.1
• /
• pp.63-70
• /
• 2001

EZW(Embedded coding using Zero-trees of Wavelet coefficients) decreases symbol-position information using zero-trees, but threshold value fall lot raising resolution, then coding cost of significant coefficients is expensive. To avoide this fact, this paper uses quad-tree representing coefficient-position information. a magnitude of significant coefficient is represented on matrix used at EZW. the proposed algorithm is hoped for raising a coding cost.

• The KIPS Transactions:PartB
• /
• v.10B no.5
• /
• pp.575-578
• /
• 2003

SPIHT algorithm is a wavelet based fast and effective technique for image compression. It uses a list structure to store status information which is generated during set-partitioning of zero-tree. Usually, this requires lots of additional memory depending on how high the bit-rate is. Therefore, in this paper, we propose a new technique called MZP-DFS, which needs no additional memory when running SPIHT algorithm. It traverses a spatial-tree according to DFS and eliminates additional memory as it uses test-functions for encoding and LSB bits of coefficients for decoding respectively. This method yields nearly the same performance as SPIHT. This may be desirable in hardware implementation because no additional memory is required. Moreover. it exploits parallelism to process each spatial-tree that it can be applied well in real-time image compression.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.2311-2314
• /
• 2003

In this paper, the embedded zero-tree wavelet image compression method using multi- threshold is proposed, which can reduce the scanning and symbol redundancy of the existing embedded zero-tree wavelet (EZW) method and enable more efficient coding. In the proposed scheme, a multi-threshold is constructed with the maximum absolute values from each subband decomposed by the wavelet transforms of the input image data. The multi-threshold values are compared with the threshold value T$_1$ in each pass in Successive Approximation Quantization (SAQ) to select the significant subbands, which are only used for the subsequent coding processes, therefore, can reduce the coding redundancy in the existing EZW. By the experimental results, it is verified that the proposed multi-threshold EZW method shows superior performances to the existing EZW method.

• Journal of the Korean Data and Information Science Society
• /
• v.14 no.2
• /
• pp.177-186
• /
• 2003

The Zero-Inflated Poisson regression is a model for count data with exess zeros. When the correlated response variables are intrested, we have to extend the univariate zero-inflated regression model to multivariate model. In this paper, we study and simulate the multivariate zero-inflated regression model. A real example was applied to this model. Regression parameters are estimated by using MLE's. We also compare the fitness of multivariate zero-inflated Poisson regression model with the decision tree model.

• Journal of the Korean Data and Information Science Society
• /
• v.14 no.1
• /
• pp.45-53
• /
• 2003

The Zero-Inflated Poisson regression is a model for count data with exess zeros. When the reponse variables have excess zeros, it is not easy to apply the Poisson regression model. In this paper, we study and simulate the zero-inflated Poisson regression model. An real example was applied to this model. Regression parameters are estimated by using MLE's. We also compare the fitness of zero-inflated Poisson model with the Poisson regression and decision tree model.

• Communications for Statistical Applications and Methods
• /
• v.23 no.1
• /
• pp.1-20
• /
• 2016

Causal inference methodologies have been developed for the past decade to estimate the unconfounded effect of an exposure under several key assumptions. These assumptions include, but are not limited to, the stable unit treatment value assumption, the strong ignorability of treatment assignment assumption, and the assumption that propensity scores be bounded away from zero and one (the positivity assumption). Of these assumptions, the first two have received much attention in the literature. Yet the positivity assumption has been recently discussed in only a few papers. Propensity scores of zero or one are indicative of deterministic exposure so that causal effects cannot be defined for these subjects. Therefore, these subjects need to be removed because no comparable comparison groups can be found for such subjects. In this paper, using currently available causal inference methods, we evaluate the effect of arbitrary cutoffs in the distribution of propensity scores and the impact of those decisions on bias and efficiency. We propose a tree-based method that performs well in terms of bias reduction when the definition of positivity is based on a single confounder. This tree-based method can be easily implemented using the statistical software program, R. R code for the studies is available online.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.12A
• /
• pp.2092-2099
• /
• 2001

In the three-dimensional image system using stereoscopic images, efficient coding schemes which can get rid of redundancy between the left and right images are usually used. In this paper, we propose an efficient coding method by using relationship between a reference image and residual image. In the proposed algorithm, zero-tree method which guaranty a good quality in low bit rate is used for encoding the residual image. Zero-tree algorithm gives good coding performance, but it has computational complexity so that we used ADLS method to reduce time for the disparity estimation. Using the wavelet based zero-tree method, it is shown that high quality of image in the limited band-width can be preserved through computer simulation.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.5_6
• /
• pp.321-327
• /
• 2004

SPIHT algorithm is a wavelet based fast and effective technique for image compression. It uses a list structure to store status information which is generated during set-partitioning of toro-tree. Usually, this requires lots of additional memory depending on how high the bit-rate is. Therefore, in this paper, we propose a new technique called MZC-BFS, which needs no additional memory when running SPIHT algorithm. It explicitly performs a breadth first search of the spatial-tree using peano-code and eliminates additional memory as it uses pre-status significant test for encoding and LSB bits of some coefficients for decoding respectively. This method yields nearly the same performance as SPIHT. This may be desirable in fast and simple hardware implementation and reduces the cost of production because no lists and additional memory are required.