• 전기학회논문지
• /
• 제57권8호
• /
• pp.1311-1317
• /
• 2008

In this paper, a fault location algorithm using wavelet transform is proposed for HVDC cable lines. The arriving instants of the first and second fault-induced backward travelling waves can be detected by using wavelet transform. The fault distance is estimated by using the time difference between the two instants of backward travelling waves and the velocity of the travelling wave. To distinguish between the backward wave from fault point and the backward wave from the remote end, polarities of backward waves are used. The proposed algorithm is verified varying with fault distances and fault resistances in underground cables of VSC(voltage source converter) HVDC system and CSC(Current Source Converter) HVDC respectively. Performance evaluations of the proposed algorithm shows that it has good ability for a fault location of HVDC cable faults.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권5호
• /
• pp.2414-2433
• /
• 2019

The aim of this paper is to design a 3D laser radar prototype based on laser triangulation. The mathematical model of distance sensitivity is deduced; a pixel-distance conversion formula is discussed and used to complete 3D scanning. The center position extraction algorithm of the spot is proposed, and the error of the linear laser, camera distortion and installation are corrected by using the proposed weighted average algorithm. Finally, the three-dimensional analytic computational algorithm is given to transform the measured distance into point cloud data. The experimental results show that this 3D laser radar can accomplish the 3D object scanning and the environment 3D reconstruction task. In addition, the experiment result proves that the product of the camera focal length and the baseline length is the key factor to influence measurement accuracy.

• 대한의용생체공학회:의공학회지
• /
• 제20권3호
• /
• pp.265-274
• /
• 1999

본 논문에서는 3차원 의료 영상에 적합한 interframe 부호화 알고리즘을 제안하였다. 제안된 알고리즘은 움직임 추정/보상과 변환 부호화를 사용하는 동영상 압축 방법에 기초를 두고 있다. 이 알고리즘에서는 움직임 추정을 위해 와핑 방법이 채택되었다. 그리고, 부호화 효율을 향상시키기 위해 적응적 모드 선택을 사용하여 웨이블릿 변환 영역에서 움직임 조상된 오차 영상과 원 영상을 혼합한다. 이렇게 혼합된 영상은 제로트리 부호화 기법에 의해 압축된다. 본 논문은 제안된 방법이 3차원 의료 영상의 부호화에 매우 유용함을 증명하였다. 모의실험결과는 제안된 방법이 슬라이스 간의 간격과 무관하게 항상 좋은 결과를 얻을 수 있도록 하고, 그럼으로써 3차원 의료 영상 압축에 매우 바람직하다는 사실을 보여준다.

• 한국정보과학회논문지:시스템및이론
• /
• 제37권6호
• /
• pp.323-329
• /
• 2010

문자열에 대한 편집 거리 문제는 하나의 문자열을 다른 문자열로 변환할 때 필요한 최소한의 연산의 개수를 구하는 문제이다. 영어와 같은 1차원 문자열에 대한 최적해에 대해서는 오랫동안 연구가 진행되어 왔으나, 한글과 같이 좀 더 복잡한 언어에 대한 편집 거리에 대해서는 많은 연구가 진행되지 못했다. 본 논문에서는 음소와 음절을 구분하여 편집거리를 구하는 기존 연구를 확장하여, 음소간의 유사도를 정의하고 이를 이용하여 유사한 단어를 더 정확하게 구분해 내는 알고리즘을 제안한다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2001년도 춘계학술대회 논문집 전력기술부문
• /
• pp.34-37
• /
• 2001

This paper presents some results after comparing the characteristics of 3 algorithms, which are discrete Fourier transform based algorithm, least square method, and modified differential approximation algorithm, used at most distance relays all over the world. In case of the DFT based distance relaying algorithm, the length of the algorithm data window and the cut-off frequency of an anti-aliasing low-pass filter adopted are fixed. On the other hand, the data window lengths are changed according to the corresponding low-pass filters in the rest two algorithms. In series of tests, the apparent impedance estimated by the modified differential approximation algorithm shows faster and more stable characteristics of convergence than the two others.

• Journal of Electrical Engineering and Technology
• /
• 제8권5호
• /
• pp.1188-1193
• /
• 2013

In content based image retrieval (CBIR) system, the images are represented based upon its feature such as color, texture, shape, and spatial relationship etc. In this paper, we propose a MRI Image Retrieval using wavelet transform with mahalanobis distance measurement. Wavelet transformation can also be easily extended to 2-D (image) or 3-D (volume) data by successively applying 1-D transformation on different dimensions. The proposed algorithm has tested using wavelet transform and performance analysis have done with HH and $H^*$ elimination methods. The retrieval image is the relevance between a query image and any database image, the relevance similarity is ranked according to the closest similar measures computed by the mahalanobis distance measurement. An adaptive similarity synthesis approach based on a linear combination of individual feature level similarities are analyzed and presented in this paper. The feature weights are calculated by considering both the precision and recall rate of the top retrieved relevant images as predicted by our enhanced technique. Hence, to produce effective results the weights are dynamically updated for robust searching process. The experimental results show that the proposed algorithm is easily identifies target object and reduces the influence of background in the image and thus improves the performance of MRI image retrieval.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2001년도 추계학술대회 논문집 전력기술부문
• /
• pp.383-386
• /
• 2001

Distance relay is tripped by the line impedance calculated at the relay point. Accordingly the accurate operation depends on the precise calculation of line impedance. Impedance can be accurately calculated in case of overhead line. However, in case of power cables or combined transmission lines, impedance can not be accurately calculated because cable systems have the sheath, grounding wires, and cable cover protection units (CCPUs). There are also several grounding systems in cable systems. Therefore, if there is a fault in cable system, these terms will severely be caused much error to calculation of impedance. Accordingly the proper compensation should be developed for the correct operation of the distance relay. This paper presents the distance calculating algorithm in combined transmission line with power cable using wavelet transform. In order to achieve such purpose, judgement method to discriminate the fault section in both sections was proposed using db1 coefficient summation. And also, error compensation factor was proposed for correct calculation of impedance in power cable.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제54권3호
• /
• pp.148-155
• /
• 2005

A seam-line determination algorithm is proposed to determine image border-line in mosaicing using the transformation of gray value differences and dynamic programming. Since visually good border-line is the one along which pixel differences are as small as possible, it can be determined in association with an optimal path finding algorithm. A well-known effective optimal path finding algorithm is the Dynamic Programming (DP). Direct application of the dynamic programming to the seam-line determination causes the distance effect, in which seam-line is affected by its length as well as the gray value difference. In this paper, an adaptive cost transform algorithm with which the distance effect is suppressed is proposed in order to utilize the dynamic programming on the transformed pixel difference space. Also, a figure of merit which is the summation of fixed number of the biggest pixel difference on the seam-line (SFBPD) is suggested as an evaluation measure of seamlines. The performance of the proposed algorithm has been tested in both quantitively and visually on various kinds of images.

• International Journal of Contents
• /
• 제11권2호
• /
• pp.15-19
• /
• 2015

In this paper, we propose an efficient document layout analysis algorithm that includes table detection. Typical methods of document layout analysis use the height and gap between words or columns. To correspond to the various styles and sizes of documents, we propose an algorithm that uses the mean value of the distance transform representing thickness and compare with components in the local area. With this algorithm, we combine a table detection algorithm using the same feature as that of the text classifier. Table candidates, separators, and big components are isolated from the image using Connected Component Analysis (CCA) and distance transform. The key idea of text classification is that the characteristics of the text parallel components that have a similar thickness and height. In order to estimate local similarity, we detect a text region using an adaptive searching window size. An improved adaptive run-length smoothing algorithm (ARLSA) was proposed to create the proper boundary of a text zone and non-text zone. Results from experiments on the ICDAR2009 page segmentation competition test set and our dataset demonstrate the superiority of our dataset through f-measure comparison with other algorithms.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제27권2호
• /
• pp.146-159
• /
• 2023

This paper proposes a hybrid algorithm combining K-means clustering and watershed algorithms for flower segmentation and counting. We use the K-means clustering algorithm to obtain the main colors in a complex background according to the cluster centers and then take a color space transformation to extract pixel values for the hue, saturation, and value of flower color. Next, we apply the threshold segmentation technique to segment flowers precisely and obtain the binary image of flowers. Based on this, we take the Euclidean distance transformation to obtain the distance map and apply it to find the local maxima of the connected components. Afterward, the proposed algorithm adaptively determines a minimum distance between each peak and apply it to label connected components using the watershed segmentation with eight-connectivity. On a dataset of 30 images, the test results reveal that the proposed method is more efficient and precise for the counting of overlapped flowers ignoring the degree of overlap, number of overlap, and relatively irregular shape.