• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.5
• /
• pp.56-69
• /
• 1999

본 논문에서는 움직임 보상 차영상 ( motion compensated difference image; MCDI)을 대역 분할한 뒤, 움직임 정보를 이용하여 에너지가 큰 부분만을 선택하여 적응적으로 벡터 양자화를 행함으로써 효율적으로 동영상을 부호화 할 수 있는 기법을 제안하였다. 제안한 기법에서는 MCDI의 특성들을 고려하여 에너지가 낮은 부분은 부호화를 행하지 않고, 에너지가 높은 부분에 대하여서만 움직임 벡터의 크기에 따라 클래스를 분류한 뒤 각 클래스에 맞는 코드북을 설계하여 벡터 양자화를 행한다. 이를 위해서는 부호화 되는 에너지가 높은 부분에 대한 정보와 클래스 부분에 대한 정보가 필요하다. 본 논문에서는 이러한 부가 정보의 양을 움직임 벡터를 이용하여 최소화함으로써 비트율을 크게 줄이면서도 우수한 화질의 복원 영상을 얻을 수 있었다.

• The KIPS Transactions:PartB
• /
• v.19B no.1
• /
• pp.1-8
• /
• 2012

Mosaic is to make a big image by gathering lots of small materials having various colors. With advance of digital imaging techniques, photomosaic techniques using photos are widely used. In this paper, we presents an automatic photomosaic algorithm based on adaptive tiling and block matching. The proposed algorithm is composed of two processes: photo database generation and photomosaic generation. Photo database is a set of photos (or tiles) used for mosaic, where a tile is divided into $4{\times}4$ regions and the average RGB value of each region is the feature of the tile. Photomosaic generation is composed of 4 steps: feature extraction, adaptive tiling, block matching, and intensity adjustment. In feature extraction, the feature of each block is calculated after the image is splitted into the preset size of blocks. In adaptive tiling, the blocks having similar similarities are merged. Then, the blocks are compared with tiles in photo database by comparing euclidean distance as a similarity measure in block matching. Finally, in intensity adjustment, the intensity of the matched tile is replaced as that of the block to increase the similarity between the tile and the block. Also, a tile redundancy minimization scheme of adjacent blocks is applied to enhance the quality of mosaic photos. In comparison with Andrea mosaic software, the proposed algorithm outperforms in quantitative and qualitative analysis.

• Journal of Korea Multimedia Society
• /
• v.7 no.2
• /
• pp.264-271
• /
• 2004

A load-sharing algorithm must deal with load imbalance caused by characteristics of a network and heterogeneity of nodes in Internet-based clustering systems. This paper has proposed the Efficient Load-Sharing algorithm. Efficient-Load-Sharing algorithm creates a scheduler based on the WF(Weighted Factoring) algorithm and then allocates tasks by an adaptive granularity strategy and the refined fixed granularity algorithm for better performance. In this paper, adaptive granularity strategy is that master node allocates tasks of relatively slower node to faster node and refined fixed granularity algorithm is to overlap between the time spent by slave nodes on computation and the time spent for network communication. For the simulation, the matrix multiplication using PVM is performed on the heterogeneous clustering environment which consists of two different networks. Compared to other algorithms such as Send, GSS and Weighted Factoring, the proposed algorithm results in an improvement of performance by 75%, 79% and 17%, respectively.

• The Journal of the Korea Contents Association
• /
• v.16 no.12
• /
• pp.19-26
• /
• 2016

Among the various services for mobile banking, user authentication method using bank security card is still very useful. We can use mobile banking easily and safely in case of saving encoded security codes in smart phone and entering codes automatically whenever user authentication is required without bank security card. In this paper automatic recognition algorithm of security codes of bank security card is proposed in oder to enroll the encoded security codes into smart phone using smart phone camera. Advanced adaptive binarization is used for extracting digit segments from various background image pattern and adaptive 2-dimensional layout analysis method is developed for segmentation and recognition of damaged or touched digits. Experimental results of proposed algorithm using Android and iPhone, show excellent security code recognition results.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.4A
• /
• pp.370-377
• /
• 2004

In this paper, we present an adaptive modulation technique for orthogonal frequency division multiplexing (OFDM) for broadband wireless communications. Also, using improved channel prediction, we enhance the performance of adaptive OFDM in high mobility environments. Adaptive modulation technique has been shown to achieve reliable high-rate data transmission over frequency-selective fading channel when OFDM is employed. This scheme requires the accurate channel information between two stations for a better performance. In an outdoor high mobility environment, most of adaptive OFDM systems have to be given the channel information transmitted from the receiver. Even if it is possible, there is some delay. Moreover, the channel impulse response between two stations is very rapidly varied. If the channel information is obsolete at the time of transmission, then poor system performance will result. In order to solve this problem, we propose adaptive OFDM with improved channel predictor. The proposed bit allocation algorithm has a lower complexity and the proposed scheme mitigates the effect of channel delay. Robust approach is less sensitive to outdated channel information. Performance results show that the proposed scheme can achieve considerable performance enhancement.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2012.11a
• /
• pp.755-758
• /
• 2012

국경 지역을 실시간 모니터링하고, 효율적인 데이터 전달을 위해서는 센서 노드의 에너지 소모를 줄임으로써 전체 네트워크의 수명을 연장시킬 필요가 있다. 그에 따라, 본 논문에서는 네트워크를 클러스터링 기반으로 한 다수의 영역으로 분할하고 각각의 영역 내 특정 노드에 헤드의 역할을 부여하여 라우팅을 수행하는 계층적 클러스터 센서 네트워크를 제안한다. 제안하는 기법에서는 클러스터 헤드에서의 데이터 모음을 통한 통신 메시지 수를 줄임으로써 센서 노드들의 에너지 소모를 최소화시키고, 긴 국경 라인을 커버할 수 있는 충분한 클러스터 확장이 가능하다. 또한 링크의 상태 및 노드의 밀집도를 고려하여 적응적으로 링크의 품질을 측정하는 알고리즘을 제시하여 링크 변화에 대한 빠른 탐색을 통해 네트워크를 관리하는 방안을 제시한다.

• The KIPS Transactions:PartA
• /
• v.10A no.3
• /
• pp.215-224
• /
• 2003

Since there are various networks and heterogeneity of nodes in Internet, the existing load-sharing algorithms are hardly adapted for use in Internet-based clustering systems. Therefore, in Internet-based clustering systems, a load-sharing algorithm must consider various conditions such as heterogeneity of nodes, characteristics of a network and imbalance of load, and so on. This paper has proposed an expanded-WF algorithm which is based on a WF (Weighted Factoring) algorithm for load-sharing in Internet-based clustering systems. The proposed algorithm uses an adaptive granularity strategy for load-sharing and duplicate execution of partial job for fault-tolerance. For the simulation, the to matrix multiplication using PVM is performed on the heterogeneous clustering environment which consists of two different networks. Compared to other algorithms such as Send, GSS and Weighted Factoring, the proposed algorithm results in an improvement of performance by 55%, 63% and 20%, respectively. Also, this paper shows that It can process the fault-tolerance.

• Proceedings of the Korean Environmental Sciences Society Conference
• /
• 2004.05a
• /
• pp.401-402
• /
• 2004

생분해성 고분자 재료들은 지구환경 보호측면에서 다양한 분야, 즉, 1회용 재료, 농업용 필름 및 생체적합성 재료(약물 방출, 봉합사) 등에서 실용화되거나 활발한 연구가 진행되고 있다. 이들 재료의 상업적응용은 물성, 분해능, 제조가격, 대량생산 등에 의해 좌우 될 수 있다. 이들 중 특히, 분해 메커니즘의 규명은 본질적인 응용에서 가장 중요한 위치를 차지하고 있다. 분해 속도의 규명 및 조절은 제품의 수명을 제어할 수 있고 응용 분야를 넓힐 수 있다. 본 연구에서는 분해매채에 따른 생분해성 고분자의 분해 메커니즘 및 속도를 단결정과 단분자막 기법을 이용하여 연구하였다. 결정성영역에서는 분해매체의 크기가 작은 알칼리 이온에 의해 표면 및 측면 분해가 일어나고 크가가 큰 효소는 비규칙성을 가진 영역에서 선호적 분해가 일어남을 두 모델 시스템으로부터 확인하였다.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.2
• /
• pp.143-151
• /
• 2013

NAND flash-based SSDs (Solid State Drive) have advantages of fast input/output performance and low power consumption so that they could be widely used as storages on tablet, desktop PC, smart-phone, and server. But, SSD has the disadvantage of wear-leveling due to increase of the number of writes. In order to improve the lifespan of the SSD, a variety of data deduplication techniques have been introduced. General fixed-size splitting method allocates fixed size of chunk without considering locality of data so that it may execute unnecessary chunking and hash key generation, and variable-size splitting method occurs excessive operation since it compares data byte-by-byte for deduplication. This paper proposes adaptive chunking method based on application locality and file name locality of written data in SSD-based server storage. The proposed method split data into 4KB or 64KB chunks adaptively according to application locality and file name locality of duplicated data so that it can reduce the overhead of chunking and hash key generation and prevent duplicated data writing. The experimental results show that the proposed method can enhance write performance, reduce power consumption and operation time compared to existing variable-size splitting method and fixed size splitting method using 4KB.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.6
• /
• pp.62-69
• /
• 2015

In this paper, a new frame rate up conversion (FRUC) algorithm using adaptive motion estimation (AME-FRUC) is proposed. The proposed algorithm performs extended bilateral motion estimation (EBME) conducts motion estimation (ME) processes on the static region, and extract region of interest with the motion vector (MV). In the region of interest block, the proposed AME-FRUC uses the texture block partitioning scheme and the unilateral motion estimation for improving ME accuracy. Finally, motion compensated frame interpolation (MCFI) are adopted to interpolate the intermediate frame in which MCFI is employed adaptively based on ME scheme. Experimental results show that the proposed algorithm improves the PSNR up to 3dB, the SSIM up to 0.07 and 68% lower SAD calculations compared to the EBME and the conventional FRUC algorithms.