• The Transactions of the Korea Information Processing Society
• /
• v.7 no.3
• /
• pp.935-942
• /
• 2000

In this paper we introduce a fast simplification algorithm for terrain height fields to produce a triangulated irregular network, based on the greedy insertion algorithm in [1,4,5]. Our algorithm partitions a terrain height data into rectangular blocks with the same size ad simplifies blocks one by one with the greedy insertion algorithm. Our algorithm references only to the points and the triangles withing each current block for adding a point into the triangulation. Therefore, the algorithm runs faster than the greedy insertion algorithm, which references all input points and triangles in the terrain. Our experiment shows that partitioning method runs from 4 to more than 20 times faster, and it approximates test height fields as accurately as the greedy insertion algorithms. Most greedy insertion algorithms suffer from elongated triangles that usually appear near the boundaries. However, we insert the four corner points into each block to produce the base triangulation of the block before the point addition step begins so that elongated triangles could not appear in th simplified terrain.

• Journal of the Institute of Convergence Signal Processing
• /
• v.7 no.4
• /
• pp.155-160
• /
• 2006

This paper presents the hierarchical block matching algorithm using the 4 subbands of the wavelet transformation and the thresholding method. The proposed algorithm improves the PSNR performance of the reconstructed image using the 4 subbands of the wavelet transformation and reduces the computational complexity by thresholding the motion vector. The experimental results of the proposed algorithm for 'Carphone' image and 'Mother and Daughter' image show that if the thresholding value is 0, the computational complexity is increasing up to 16% and the PSNR performance of the reconstructed image improves the 0.16dB in comparison with that of the existing. hierarchical motion estimation algorithm. In addition, as the thresholding value is increasing, the computational complexity reduces up to 8% and the PSNR performance of the reconstructed image is similar.

• Journal of Information Processing Systems
• /
• v.15 no.3
• /
• pp.670-681
• /
• 2019

Orthogonal frequency division multiplexing (OFDM) is a system which is used to encode data using multiple carriers instead of the traditional single carrier system. This method improves the spectral efficiency (optimum use of bandwidth). It also lessens the effect of fading and intersymbol interference (ISI). In 1995, digital audio broadcast (DAB) adopted OFDM as the first standard using OFDM. Later in 1997, it was adopted for digital video broadcast (DVB). Currently, it has been adopted for WiMAX and LTE standards. In this project, a Verilog design is employed to implement an OFDM transmitter (DAC block) and receiver (FFT and ADC block). Generally, OFDM uses FFT and IFFT for modulation and demodulation. In this paper, 16-point FFT decimation-in-frequency (DIF) with the radix-2 algorithm and direct summation method have been analyzed. ADC and DAC in OFDM are used for conversion of the signal from analog to digital or vice-versa has also been analyzed. All the designs are simulated using Verilog on ModelSim simulator. The result generated from the FFT block after Verilog simulation has also been verified with MATLAB.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2022.11a
• /
• pp.559-561
• /
• 2022

인공지능 시대에 들어서면서 개인 맞춤형 환경을 제공하기 위하여 사람의 감정을 인식하고 교감하는 기술이 많이 발전되고 있다. 사람의 감정을 인식하는 방법으로는 얼굴, 음성, 신체 동작, 생체 신호 등이 있지만 이 중 가장 직관적이면서도 쉽게 접할 수 있는 것은 표정이다. 따라서, 본 논문에서는 정확도 높은 얼굴 감정 식별을 위해서 Convolution Block Attention Module(CBAM)의 각 Gate와 Residual Block, Skip Connection을 이용한 Identity- CBAM Module을 제안한다. CBAM의 각 Gate와 Residual Block을 이용하여 각각의 표정에 대한 핵심 특징 정보들을 강조하여 Context 한 모델로 변화시켜주는 효과를 가지게 하였으며 Skip-Connection을 이용하여 기울기 소실 및 폭발에 강인하게 해주는 모듈을 제안한다. AI-HUB의 한국인 감정 인식을 위한 복합 영상 데이터 세트를 이용하여 총 6개의 클래스로 구분하였으며, F1-Score, Accuracy 기준으로 Identity-CBAM 모듈을 적용하였을 때 Vanilla ResNet50, ResNet101 대비 F1-Score 0.4~2.7%, Accuracy 0.18~2.03%의 성능 향상을 달성하였다. 또한, Guided Backpropagation과 Guided GradCam을 통해 시각화하였을 때 중요 특징점들을 더 세밀하게 표현하는 것을 확인하였다. 결과적으로 이미지 내 표정 분류 Task에서 Vanilla ResNet50, ResNet101을 사용하는 것보다 Identity-CBAM Module을 함께 사용하는 것이 더 적합함을 입증하였다.

• The Journal of Korean Association of Computer Education
• /
• v.21 no.4
• /
• pp.1-10
• /
• 2018

Block programming environment, which is represented by Scratch in elementary and middle school programming education, is suitable for learner's characteristics and cognitive level, and is recommended not only for beginners. Transference to the text programming environment after the block programming is essential for understanding the data processing process, understanding the accuracy and efficiency aspects of algorithms, and creating SW activity. In addition, it is presented step by step in the programming curriculum. In this study, developed WithBlock the online evaluation system for the purpose of transference from a block programming to a text programming environment. The developed system can solve the same algorithm problem in both block and text programming environment, and it can be used for elementary and secondary programming education by automatically scoring the written code and providing immediate feedback. In order to applicable to programming education in elementary and secondary surveyed the usability, learning possibility, interest and satisfaction of WithBlock. The results of the survey showed that it can be used for programming education.

• The KIPS Transactions:PartB
• /
• v.10B no.3
• /
• pp.321-328
• /
• 2003

This Paper Proposes a size-variable block matching algorithm for motion vector extraction. The Proposed algorithm dynamically determines the search area and the size of a block. We exploit the constraint of small velocity changes of a block along the time to determine the origin of the search area. The range of the search area is adjusted according to the motion coherency of spatially neighboring blocks. The process of determining the sire of a block begins matching with a small block. If the matching degree is not good enough, we expand the size of a block a little bit and then repeat the matching process until our matching criterion Is satisfied. The experimental results show that the proposed algorithm can yield very accurate block motion vectors. Our algorithm outperforms other algorithms in terms of the estimated motion vectors, though our algorithm requires some computational overhead.

• Journal of the Korean Society for Nondestructive Testing
• /
• v.22 no.1
• /
• pp.14-21
• /
• 2002

The development of a new experimental method is required to easily observe the growth behavior of fatigue cracks. To satisfy the requirement, an image processing technique was introduced to fatigue testing. The length of surface fatigue crack could be successfully measured by the image processing system. At first, the image data of cracks were stored into the computer while the cyclic loading was interrupted. After testing, crack length was determined using an image processing software which was developed by authors. Various image processing techniques like a block matching method was applied tc the detection of surface fatigue cracks. By comparing the data measured by the image processing system with those by the manual measurement with a microscope, the effectiveness of the image processing system was established. If the proposed method is used to monitor and observe the crack growth behavior automatically, the time and efforts for fatigue test could be dramatically reduced.

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.403-406
• /
• 1999

Among the compression methods of moving picture information, a motion estimation method is used to remove time-repeating. The Block Matching Algorithm in motion estimation methods is the commonest one. In recent days, it is required the more advanced high quality in many image processing fields, for example HDTV, etc. Therefore, we have to accomplish not by means of Partial Search Algorithm, but by means of Full Search Algorithm in Block Matching Algorithm. In this paper, it is suggested a structure that reduce total calculation quantity and size, because the structure using Bit Plane select and use only 3bit of 8bit luminance signal.

• Transactions of Materials Processing
• /
• v.6 no.3
• /
• pp.192-202
• /
• 1997

This study presents an effect of number of passes in wire-cut electric discharge machining on fine blanking dies and products. Three part fine blanking dies were produced by the difference of numbers of passes discharge machining. Brake pad was produced, through the die produced like that, the objective of this study is the improvement in surface roughness of die block and punch, life extension of die block, the decrease of second fracture dimensions, the rise of productive.

• Proceedings of the KIEE Conference
• /
• 1999.07g
• /
• pp.2905-2907
• /
• 1999

The meaningful speech sound block classification provides very important information in the speech recognition. The following technique of the classification is based on the DWT (discrete wavelet transform), which will provide a more fast algorithm and a useful, compact solution for the pre-processing of speech recognition. The algorithm is implemented to the unvoiced/voiced classification and the denoising.