• Journal of the Institute of Convergence Signal Processing
• /
• v.4 no.2
• /
• pp.31-39
• /
• 2003

The MPEG-2 source coding algorithm is very sensitive to transmission errors due to using of variable-length coding. When the compressed data are transmitted, transmission errors are generated and error correction scheme is not able to be corrected well them. In the decoder error concealment (EC) techniques must be used to conceal errors and it is able to minimize degradation of video quality. The proposed algorithm is method to conceal successive macroblock errors of I-frame and utilize temporal information of B-frame and spatial information of P-frame In the previous GOP which is temporally the nearest location to I-frame. This method can improve motion distortion and blurring by temporal and spatial errors which cause at existing error concealment techniques. In network where the violent transmission errors occur, we can conceal more efficiently severe slice errors. This algorithm is Peformed in MPEG-2 video codec and Prove that we can conceal efficiently slice errors of I-frame compared with other approaches by simulations.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.41 no.2
• /
• pp.9-22
• /
• 2004

This paper presents a parallel genetic algorithm for the Multi-disk data allocation problem an NP-complete problem. This problem is to find a method to distribute a Binary Cartesian Product File on disk-arrays to maximize parallel disk I/O accesses. A Sequential Genetic Algorithm(SGA), DAGA, has been proposed and showed the superiority to the other proposed methods, but it has been observed that DAGA consumes considerably lengthy simulation time. In this paper, a parallel version of DAGA(ParaDAGA) is proposed. The ParaDAGA is a 2-dimension torus-based Parallel Genetic Algorithm(PGA) and it is based on a distributed population structure. The ParaDAGA has been implemented on the parallel computer simulated on a single processor platform. Through the simulation, we study the impact of varying ParaDAGA parameters and compare the quality of solution derived by ParaDAGA and DAGA. Comparing the quality of solutions, ParaDAGA is superior to DAGA in all cases of configurations in less simulation time.

• Journal of the Institute of Electronics Engineers of Korea TE
• /
• v.37 no.3
• /
• pp.6-15
• /
• 2000

In this paper, we propose a high speed parallel multiplier with a hierarchical architecture using a fast 4-2 compressor and 6-2 compressor. Generally, the performance of parallel multiplier depends on the processing speed of partial products summation tree with CSA adder. In this paper we propose a new circuit of 4-2 compressor and 6-2 compressor which reduces the propagation delay time, compared with conventional one. We Propose a hierarchical multiplier architecture in order to improve the execution speed of 16$\times$16 parallel multiplier using proposed compressors in this paper and make layout design easily by regular structure. The propagation delay time of the proposed 4-2 compressor circuit was 14% reduced as a result of SPICE simulation, compared with the conventional 4-2 compressor. The total propagation delay time of proposed 16$\times$16 parallel multiplier was 12% reduced using proposed 4-2 compressor and 6-2 compressor.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.1C
• /
• pp.69-77
• /
• 2002

Sine digital signal processing for motion pictures requires huge amount of data computation to store, manipulate and transmit, more effective data compression is necessary. Therefore, the ITU-T recommended H.26x as data compression standards for digital motion pictures. The data compression method that eliminates time redundancies by motion estimation using relationship between picture frames has been widely used. Most video conding systems employ block matching algorithm for the motion estimation and compensation, and the algorithm is based on the minimun value of cast functions. Therefore, fast search algorithm rather than full search algorithm is more effective in real time low data rates encodings such as H.26x. In this paper, motion estimation employing the Nearest-Neighbors algorithm is designed to reduce search time using FPGA, coded in VHDL, and simulated and verified using Xilink Foundation.

• Journal of the Institute of Convergence Signal Processing
• /
• v.4 no.1
• /
• pp.27-35
• /
• 2003

Because of the lack of translation invariance of wavelet basis, traditional wavelet thresholding denoising leads to pseudo-Gibbs phenomena in the vicinity of discontinuities of signal. In this paper, in order to reduce the pseudo-Gibbs phenomena, wavelet coefficients are thresholded and reconstruction algorithm is implemented through minimizing the total variation of denoising signal using subgradient descent algorithm. Most of experiments were performed under the non-real-time and real-time environments. In the case of non-real-time experiments, the algorithm that this paper proposes was found more effective than that of wavelet hard thresholding denoising by 2.794㏈(SNR) based on the signal to noise ratio. And lots of pseudo-Gibbs phenomena was removed visually in the vicinity of discontinuities. In the case of real-time experiments, the number of iteration was restricted to 60 times considering the performance time. It took 0.49 seconds and most of the pseudo-Gibbs phenomena were also removed.

• The Transactions of the Korea Information Processing Society
• /
• v.13 no.3
• /
• pp.122-129
• /
• 2024

Though programming education has been stressed recently, the elementary, middle, and high school students are having trouble in programming education. Most programming environments for them are based on block coding, which hinders them from moving to text coding. The traditional PC environment has also troubles such as maintenance problems. In this situation, mobile applications can be considered as alternative programming environments. This paper addresses the design and implementation of coding applications for mobile devices. As a prototype, a Scheme interpreter mobile app is proposed, where Scheme is used for programming courses at MIT since it supports multi-paradigm programming. The implementation has the advantage of not consuming the network bandwidth since it is designed as a standalone application. According to the benchmark result, the execution time on Android devices, relative to that on a desktop, was 131% for the Derivative and 157% for the Tak. Further, the maximum execution times for the benchmark programs on the Android device were 19.8ms for the Derivative and 131.15ms for the Tak benchmark. This confirms that when selecting an Android device for programming education purposes, there are no significant constraints for training.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.6
• /
• pp.21-30
• /
• 2011

In the global IT market, a lot of issues for responding to various environmental regulations emerged. In case of the data centers, it is consuming huge amounts of energy to maintain. So there have been various technical attempts as Consolidation, Virtualization, Optimization to efficiently manage energy and data storage to fix the problems. In this paper, we propose a new RAID(Redundant Array of Independent Disks) mechanism which is differing the intensity of power consumption and works to provide data protection and disaster recovery(backup, mirroring etc.) to stratify multiple volumes. G-RAID minimize the power consumption and the lower of I/O performance by selecting the volume depending on the frequency of data access while classifying the power consumption between volumes in storage system. Also, it is possible that a filesystem and block map information of G-RAID is processed by basic unit which is group located in a row for the blocks to work efficiently and can minimize the performance degradation of block mapping load by the access frequency in each groups. As a result, we obtained to elevate a little bit of response time caused by block relocation work, but showed the decrease of power consumption by 38%.

• Proceedings of the KIEE Conference
• /
• 2008.04a
• /
• pp.105-106
• /
• 2008

영상을 이용한 물체인식은 컴퓨터 비젼분야의 주요한 관심분야중 하나이다. 이중 특정기반 물체인식은 영상이 가지고 있는 특징점을 이용하는 방법으로 입력영상과 물체에 대한 질의 영상의 특징점을 검출하고 매칭을 수행하여 물체를 인식하게 된다. 특징점은 스케일, 회전, 어파인 변화 등에 변하지 않는 특징을 가지고 있는 점을 말한다. 이러한 특징점을 구하기 위하여 사용하는 방범으로는 SIFT(Scale Invariant Feature Transform)가 있다. SIFT는 스케일, 회선, 어파인 변화에 우수한 성능을 보여주기는 하나 많은 연산으로 인하여 처리속도가 느리다는 단점이 존재한다. 이에 본 논문에서는 SIFT를 사용한 특징기반 물체인식에서 속도 개선 방법에 대하여 제안하였다. 제안한 방법을 사용하였을 경우 물체인식을 위한 특징점을 검출하고 매칭을 수행하는데 소모된 시간이 줄어드는 것을 실험을 통하여 확인 하였다.

• Proceedings of the Korean Vacuum Society Conference
• /
• 2016.02a
• /
• pp.92-92
• /
• 2016

전기방전의 기본적인 특성을 가지고 있는 플라즈마를 이용하여 재료를 가공하는 증착, 식각, 표면처리 공정에 있어서 플라즈마 내의 전자 충돌 반응에 의한 이온, 라디칼의 생성과 재료 표면의 반응을 분석하는 도구로써 분압 측정은 일반적인 화학 조성 분석에 기원한 오랜 역사를 가지고 있다. 1 amu 정도의 분해능을 가지고 있고 크기가 30 cm 정도에 불과한 사중극자 질량 분석기는 적절한 질량 스캔 시간과 넓은 이온 전류 측정 범위를 가지므로 소형 차등 배기 시스템과 조합하면 1 mTorr 영역의 스퍼터링 시스템에서 1 Torr 영역의 PECVD/PEALD 시스템 진단에도 쉽게 적용이 가능하다. Inficon사의 CPM-300과 Pfeiffer사의 Prisma80을 이용한 플라즈마 식각 공정 분석 결과를 보면 동위원소까지 분석이 가능하다. 또한 전자충돌 이온화 에너지를 조절하여 m/q(질량전하비율)가 중첩되는 경우의 해석도 가능하다. 다중 오리피스를 갖는 compact design의 밸브 블록을 이용한 설계에서는 line-of-sight 입사가 불가능하여 이온 전류를 분석할 수 없다는 단점이 있으나 표준 가스를 이용한 정량화 등의 큰 장점들이 있다. 최근 이루어진 연구의 내용으로는 유도 결합 플라즈마 장치에서 전도성 메쉬를 이용한 라디칼 거동 관찰을 위해서 두 대의 CPM-300을 메쉬 전 후에 설치하여 라디칼의 양 변화를 전류 프로브와 같이 사용하여 조사하였다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2016.06a
• /
• pp.50-53
• /
• 2016

조건부 대체 알고리즘 (CRA: Conditional Replenishment Algorithm)은 융합형 3DTV 서비스에서 부가정보를 전송함으로써 수신기에서의 화질을 개선하는 방법이다. 이 알고리즘은 비용함수를 도입함으로써 가변크기의 처리단위 (PU: Processing Unit) 마다 최적의 모드를 결정하는데, 이 과정에서 시공간적 인접 PU 사이에 모드의 불연속이 발생하는 경우에 블록화 또는 플리커링 현상 등 주관적 화질을 저하시키는 문제가 생길 수 있다. 본 논문에서는 모드를 결정하는 과정에서 시간적으로 연속적인 PU 사이의 상관성을 고려함으로써 플리커링 현상을 방지하는 기법을 제안하고 모의실험을 통해 주관적 화질이 향상됨을 보였다.