• Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
• /
• 2007.11a
• /
• pp.203-204
• /
• 2007

This paper investigated the influence on partial discharge distribution of various defects at the model power cable joints interface using K-means clustering. As the result of analyzing discharge number distribution of ${\Phi}-n$ cluster, clusters shifted to $0^{\circ}\;and\;180^{\circ}$ with increasing applying voltage. It was confirmed that discharge quantity and euclidean distance between centroids were increased with applying voltage from the analyzing centroid distribution of ${\Phi}-q$ cluster. The degree of dispersion was increased with calculating standard deviation of ${\Phi}-q$ cluster centroid. The tendency both number of discharge and mean value of ${\Phi}-q$ cluster centroid were some different with defect types.

• Journal of the Korean Institute of Electrical and Electronic Material Engineers
• /
• v.20 no.11
• /
• pp.959-964
• /
• 2007

To investigate the influence of partial discharge(PD) distribution characteristics due to various defects on the power cable joints interface, we used the K-means clustering method. As the result of PD number(n) distribution analyzing on $\Phi-n$ graph, the phase angle($\Phi$) of cluster centroid shifted to $0^{\circ}\;and\;180^{\circ}$ increasing with applying voltage. It was confirmed that the PD quantify(q) and euclidean distance of centroid were increased with applying voltage from the centroid distribution analyzing of $\Phi-q$ plane. The dispersion degree was increased with calculated standard deviation of the $\Phi-q$ cluster centroid. The PD number and mean value on $\Phi-q$ graph were some different by electric field concentration with defect types.

• Journal of the Chungcheong Mathematical Society
• /
• v.20 no.3
• /
• pp.203-210
• /
• 2007

Let X be a hyperbolic region in the complex plane C such that the hyperbolic metrix ${\lambda}_X(w){\mid}dw{\mid}$ exists. Let $R(X)=sup\{{\delta}_X(w):w{\in}X\}$ where ${\delta}_X(w)$ is the euclidean distance from w to ${\partial}X$. Here ${\partial}X$ is the boundary of X. A hyperbolic region X is called a Bloch region if R(X) < ${\infty}$. In this paper, we obtain lower bounds for the hyperbolic metric on Bloch regions in terms of the distance to the boundary.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.11
• /
• pp.1637-1643
• /
• 2022

In recent years, the demand for image-processing technology in digital marketing has increased due to the expansion and diversification of the digital market, such as video, security, and machine intelligence. Noise-processing is essential for image-correction and reconstruction, especially in the case of sensitive noises, such as in CT, MRI, X-ray, and scanners. The two main salt and pepper noises have been actively studied, but the details and edges are still unsatisfactory and tend to blur when there is a lot of noise. Therefore, this paper proposes an algorithm that applies a weight-based Euclidean distance equation to the partial mask and uses only the non-noisy pixels that are the most similar to the original as effective pixels. The proposed algorithm determines the type of filter based on the state of the internal pixels of the designed partial mask and the degree of mask deterioration, which results in superior noise cancellation even in highly damaged environments.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.3 s.345
• /
• pp.95-102
• /
• 2006

This paper proposes the KB-Fano algorithm which has lower decoding complexity by applying modified Fano-like metric bias to the conventional K-best algorithm. Additionally, an efficient K-best decoding algorithm, named the KR-Fano scheme, is proposed by jointly combining the K-reduction and the KB-Fano schemes. Simulations show that the proposed algerian provides the remarkable improvement from the viewpoints of the BER performance and the decoding complexity as compared to the conventional K-best scheme.

• Proceedings of the IEEK Conference
• /
• 2000.11d
• /
• pp.65-68
• /
• 2000

This paper describes an approach for extracting invariant features using a view-based representation and recognizing an object with a high speed search method in FLIR. In this paper, we use a reformulated eigenspace technique based on robust estimation for extracting features which are robust for outlier such as noise and clutter. After extracting feature, we recognize an object using a partial distance search method for calculating Euclidean distance. The experimental results show that the proposed method achieves the improvement of recognition rate compared with standard PCA.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.14 no.4
• /
• pp.9-16
• /
• 2018

This study described partial discharge(PD) distribution analysis between the XLPE(Cross-Linked PolyEthylene)and EPDM(Ethylene Propylene Diene Monomer) interface with unsupervised classification. The ${\phi}-q-n$ patterns were analyzed using phase resolved partial discharge(PRPD). K-means cluster analysis forms a cluster based on similarities and distances among scattered individuals, and analyzes the characteristics of the formed clusters, dividing the multivariate data into several groups according to the similarity of each characteristic, Is a statistical analysis that makes it easier to navigate. It was confirmed that the phase angle of the cluster with the maximum discharge charge was concentrated around $0^{\circ}$ and $180^{\circ}$ at 30 kV after the initial phase distribution localized around $90^{\circ}$ and $300^{\circ}$ expanded to the whole phase angle according to the voltage rise. The Euclidean distance between the center of gravity and the discharge charge in the ${\Phi}-q$ cluster increased with increasing applied voltage.

• Journal of the Institute of Convergence Signal Processing
• /
• v.14 no.4
• /
• pp.217-221
• /
• 2013

Recently, researches for methods of generating binary feature descriptors have been actively done. Since matching of binary feature descriptors uses Hamming distance which is based on bit operations, it is much more efficient than that of previous general feature descriptors which uses Euclidean distance based on real number operations. However, since increase in the number of features linearly drops matching speed, in applications such as object tracking where real-time applicability is a must, there has been an increasing demand for methods of further improving the matching speed of binary feature descriptors. In this regard, this paper proposes a method that improves the matching speed greatly while maintaining the matching accuracy by splitting high dimensional binary feature descriptors to several low dimensional ones and sequentially analyzing their partial Hamming distances. To evaluate the efficiency of the proposed method, experiments of comparison with previous matching methods are conducted. In addition, this paper discusses schemes of generating binary feature descriptors for maximizing the performance of the proposed method. Based on the analysis on the performance of several generation schemes, we try to find out the most effective scheme.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.2020-2023
• /
• 2003

In this paper, our proposed system uses the regional Gabor wavelet and Neural Network to implement face recognition similar to human face recognition system, because the Gator wavelet expresses visual recognition system of human mathematically and the regional Neural Network is robust to white noise and partial illumination. This system consists of two stages of building database and recognizing face. One is composed by using the supervised learning of Neural Network. At this time, the Neural Network is applied to the upper and the lower part of face images respectively. The Backpropagation algorithm is used to learn Neural Network. Another consists of calibration of slope of face image, measurement of illumination variant using deviation with average face image and similarity comparison using Euclidean distance measure.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.6
• /
• pp.682-689
• /
• 2019

In part-based image representation, the partial shapes of an object are represented as basis vectors, and an image is decomposed as a linear combination of basis vectors where the coefficients of those basis vectors represent the partial (or local) feature of an object. In this paper, a face recognition for occluded faces is proposed in which face images are represented using non-negative matrix factorization(NMF), one of part-based representation techniques, and recognized using an artificial neural network technique. Standard NMF, projected gradient NMF and orthogonal NMF were used in part-based representation of face images, and their performances were compared. Learning vector quantizer were used in the recognizer where Euclidean distance was used as the distance measure. Experimental results show that proposed recognition is more robust than the conventional face recognition for the occluded faces.