• Journal of the Korean Institute of Telematics and Electronics
• /
• v.14 no.5
• /
• pp.15-21
• /
• 1977

The syntactic pattern recognition system of Korean characters is composed of three main functional parts; Preprocessing, Graph-representation, and Segmentation. In preprocessing routine, the input pattern has been thinned using the Hilditch's thinning algorithm. The graph-representation is the detection of a number of nodes over the input pattern and codification of branches between nodes by 8 directional components. Next, segmentation routine which has been implemented by top down nondeterministic parsing under the control of tree grammar identifies parts of the graph-represented Pattern as basic components of Korean characters. The authors have made sure that this system is effective for recognizing Korean characters through the recognition simulations by digital computer.

• Journal of KIISE:Computing Practices and Letters
• /
• v.5 no.4
• /
• pp.405-415
• /
• 1999

웹의 성장은 점차 복잡한 응용에 대한 요구를 가중시켰으며, 데이타베이스와 웹과의 효율적인 연동 역시 중요한 문제가 되었다. 본 논문에서는 이와 같은 환경을 효율적으로 지원하기 위한 웹 응용 서버 WATS를 설계하고 구현하였다. WATS에서 응용 프로그램은 컴포넌트 단위로 작성된 후 동적으로 링크되고 요청을 처리할 응용 서버가 대기 상태로 존재하는 확장 API 응용 서버 방식으로 구현되었으며, 이러한 웹 서버와 응용 서버의 분리 구조는 대량의 요청을 처리하기에 적합하다. 또한 컴포넌트를 특성에 따라 분류한 후 각 특성에 적합한 특성 기반 스케줄링 알고리즘을 적용하여 프로세스 부하 균형을 이루었으며, 이 기법이 일반적인 라운드 로빈 스케줄링 알고리즘보다 좋은 성능을 나타냄을 성능 측정을 통해서 보인다.Abstract The increasing popularity of the World-Wide-Web (WWW) has resulted in demand for more complex applications, and web gateways to database became core component in such applications. In this paper, we have designed and implemented WATS in order to support these environments. In WATS, application components are dynamically linked with application server processes. And it is implemented as extensible API application server architecture and is able to process a large amount of requests through separating web server from application server. Also we classify the components into various categories according to its own properties and devise process load balancing algorithm by using property-based scheduling. We show WATS using this algorithm performs better than those using general round-robin algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.7
• /
• pp.1860-1868
• /
• 1998

A simple postprocessing algorithm is proposed to reduce the blocky artifacts of Block Discrete Cosine Transform (BDCT) coded images. Since the block noise is mostly antisymmetric relative to the block boundaries, we model the blocky noise as one-dimensional antisymmertric functions made by superposing DCT basis functions. observing the frequency characteristics of the noies model, we approximate its high frequency components as those of step functions. Then the proposed postprocessing algorithm eliminates the carefully selected high frequency components of step functions in the one-dimensional sN-point DCT domain, when the encoding block size is $N\;{\times}\;N$. It is shown that the proposed algorithm can also be performed in the spatial domain without computational burden of transforms. The experimental results show that the proposed algorithm well reduces the blocky artifacts in both subjective and objectie viewpoints.

• ETRI Journal
• /
• v.31 no.6
• /
• pp.784-794
• /
• 2009

We present a full HD (1080p) H.264/AVC High Profile hardware encoder based on fast motion estimation (ME). Most processing cycles are occupied with ME and use external memory access to fetch samples, which degrades the performance of the encoder. A novel approach to fast ME which uses shared multibank memory can solve these problems. The proposed pixel subsampling ME algorithm is suitable for fast motion vector searches for high-quality resolution images. The proposed algorithm achieves an 87.5% reduction of computational complexity compared with the full search algorithm in the JM reference software, while sustaining the video quality without any conspicuous PSNR loss. The usage amount of shared multibank memory between the coarse ME and fine ME blocks is 93.6%, which saves external memory access cycles and speeds up ME. It is feasible to perform the algorithm at a 270 MHz clock speed for 30 frame/s real-time full HD encoding. Its total gate count is 872k, and internal SRAM size is 41.8 kB.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2002.05a
• /
• pp.429-434
• /
• 2002

For companies assembling end products from sub assemblies or components, MRP (Material Requirement Planning) logic is frequently used to synchronize and pace the production activities for the required parts. However, in MRP, the planning of operational-level activities is left to short term scheduling. So, we need a good scheduling algorithm to generate feasible schedules taking into account shop floor characteristics and multi-level job structures used in MRP. In this paper, we present a GA (Genetic Algorithm) solution for this complex scheduling problem based on a new gene to reflect the machine assignment, operation sequences and the levels of the operations relative to final operation. The relative operation level is the control parameter that paces the completion timing of the components belonging to the same branch in the multi-level job hierarchy. In order to revise the fixed relative level which solutions are confined to, we apply large step transition in the first step and GA in the second step. We compare the genetic algorithm and 2-phase optimization with several dispatching rules in terms of tardiness for about forty modified standard job-shop problem instances.

• Proceedings of the KIPE Conference
• /
• 2013.07a
• /
• pp.244-245
• /
• 2013

This paper proposes a control algorithm for permanent magnet synchronous generator with a back-to-back three-level neutral-point clamped voltage source converter in a medium-voltage offshore wind power system under unbalanced grid conditions. The proposed control algorithm particularly compensates for the unbalanced grid voltage at the point of common coupling in a collector bus of offshore wind power system. This control algorithm has been formulated based on the symmetrical components in positive and negative rotating synchronous reference frames under generalized unbalanced operating conditions. Instantaneous active and reactive power are described in terms of symmetrical components of measured grid input voltages and currents. Negative sequential component of ac input current is injected to the point of common coupling in the proposed control strategy. The amplitude of negative sequential component is calculated to minimize the negative sequential component of grid voltage under the limitation of current capability in a voltage source converter. The proposed control algorithm makes it possible to provide a balanced voltage at the point of common coupling resulting in the generated power of high quality from offshore wind power system under unbalanced network conditions.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.29 no.5
• /
• pp.71-79
• /
• 2015

Recently, new Low Voltage DC (LVDC) power distribution systems have been constantly researched as uses of DC in end-user equipment are increased. As in conventional AC distribution system, High Impedance Fault (HIF) which may cause a failure of protective relay can occur in LVDC distribution system as well. It, however, is hard to be detected since change in magnitude of current due to the fault is too small to detect the fault by the protective relay using overcurrent element. In order to solve the problem, this paper presents an algorithm for detecting HIF using accumulated energy in LVDC distribution system. Wavelet Singular Value Decomposition (WSVD) is used to extract abnormal high frequency components from fault current and accumulated energy of high frequency components is considered as the element to detect the fault. LVDC distribution system including AC/DC and DC/DC converter is modeled to verify the proposed algorithm using ElectroMagnetic Transient Program (EMTP) software. Simulation results considering various conditions show that the proposed algorithm can be utilized to effectively detect HIF.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.58 no.11
• /
• pp.2275-2280
• /
• 2009

u-Healthcare service is one of attractive applications in ubiquitous environment. In this paper, we propose a method to recognize exercises using a new accelerometer based body-attached platform for supporting u-Healthcare service. The platform consists of a device for measuring accelerometer data and a device for receiving the data. The former measures a user's motion data using a 3-axis accelerometer. The latter transmits the accelerometer data to a computer for recognizing the user's exercise. The algorithm for exercise recognition classifies the type of exercise using principle components analysis(PCA) from the accelerometer data transformed by discrete fourier transform(DFT), and estimates the repetition count of the recognized exercise using a peak detection algorithm. We evaluate the performance of the algorithm from the accuracy of the recognition of exercise type and the error rate of the estimation of repetition count. In our experimental result, the algorithm shows the accuracy about 98%.

• Journal of Software Assessment and Valuation
• /
• v.17 no.2
• /
• pp.151-159
• /
• 2021

To derive grid lines for analyzing a table layout, line image enhancement techniques are studying such as various filtering or morphology methods. In spite of line image enhancement, it is still hard to extract line components and to express table cell's layout logically in which the cutting points are exist on the line or the tables are skewing . In this paper, we proposed a line tracking algorithm to extract line components under the cutting points on the line or the skewing lines. The table document layout analysis algorithm is prepared by searching grid-lines, line crossing points and gird-cell using line tracking algorithm. Simulation results show that the proposed method derive 96.4% table document analysis result with average 0.41sec processing times.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.12
• /
• pp.71-83
• /
• 1996

This paper describes facial component detection and skew correction algorithm for face recognition. We use a priori knowledge and models about isolated regions to detect eye location from the face image captured in natural office environments. The relations between human face components are represented by several rules. We adopt an edge detection algorithm using sobel mask and 8-connected labelling algorith using array pointers. A labeled image has many isolated components. initially, the eye size rules are used. Eye size rules are not affected much by irregular input image conditions. Eye size rules size, and limited in the ratio between gorizontal and vertical sizes. By the eye size rule, 2 ~ 16 candidate eye components can be detected. Next, candidate eye parirs are verified by the information of location and shape, and one eye pair location is decided using face models about eye and eyebrow. Once we extract eye regions, we connect the center points of the two eyes and calculate the angle between them. Then we rotate the face to compensate for the angle so that the two eyes on a horizontal line. We tested 120 input images form 40 people, and achieved 91.7% success rate using eye size rules and face model. The main reasons of the 8.3% failure are due to components adjacent to eyes such as eyebrows. To detect facial components from the failed images, we are developing a mouth region processing module.