• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.7
• /
• pp.4912-4917
• /
• 2015

Fragile watermarking is a technique to insert a watermark into an image without significantly degrading its visual quality so that the watermark can be extracted for the purposes of authentication or integrity verification. And the watermark for authentication and integrity verification should be erased easily when the image is changed by filtering etc. In this paper, we propose a image block-wise watermarking method for image tamper proofing using digital signature. In the proposed method, a digital signature is generated from the hash code of the initialized image block. And The proposed method is able to detect the tampered parts of the image without testing the entire block of the watermarked image.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.3
• /
• pp.68-74
• /
• 2009

In this paper, we propose an effective memory reduction algorithm to reduce the amount of reference frame buffer and memory bandwidth in video encoder and decoder. In general video codecs, decoded previous frames should be stored and referred to reduce temporal redundancy. Recently, reference frames are recompressed for memory efficiency and bandwidth reduction between a main processor and external memory. However, these algorithms could hurt coding efficiency. Several algorithms have been proposed to reduce the amount of reference memory with minimum quality degradation. They still suffer from quality degradation with fixed-bit allocation. In this paper, we propose an adaptive block-based min-max quantization that considers local characteristics of image. In the proposed algorithm, basic process unit is $8{\times}8$ for memory alignment and apply an adaptive quantization to each $4{\times}4$ block for minimizing quality degradation. We found that the proposed algorithm can obtain around 1.7% BD-bitrate gain and 0.03dB BD-PSNR gain, compared with the conventional fixed-bit min-max algorithm with 37.5% memory saving.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1998.06a
• /
• pp.77-80
• /
• 1998

영상 데이터는 방대하므로 한정된 대역폭을 통하여 영상을 전송하기 위해서는 압축을 필요로 한다. 그러나 압축으로 전송 비트율은 낮아지지만 고압축률에서는 여러 가지 화질 열화가 발생한다. 화질 열화에는 이산 여현 변환을 수행하는 압축 부호화 알고리듬에서 나타나는 블록킹 현상 또는 모기잡음이 있고 웨이브렛 기반 압축 영상에서는 에지 부근에 나타나는 링잉 현상이 있다. 이와 같은 화질 열화들은 후처리를 통해 제거되지만, 많은 처리 시간이 소요되지 않도록 해야 한다. 본 논문에서는 웨이브렛 기반 영상 압축에서 링잉 현상을 효율적으로 제거하는 후처리 방법을 제안한다. 제안한 방법에 대한 모의실험 결과 기존의 방법과 비교하여 처리 속도를 빠르게 하면서 유사한 주관적, 객관적 화질을 얻었다.

• Proceedings of the IEEK Conference
• /
• 2007.07a
• /
• pp.215-216
• /
• 2007

LCTV에서 대부분의 전력 소비가 이루어지는 곳은 백라이트 유닛이다. 따라서 백 라이트의 소비 전력을 절감하는 기술은 사용자 각자의 에너지 절약 효과만이 아니라 국가적인 에너지 절약 차원에서도 중요하다. 기존의 연구들은 이러한 에너지 절감을 위하여 영상 특성을 분석하여 백 라이트를 조절하는데 그 방법이 픽셀기반의 처리이므로 처리량이 많아 시간이 오래 걸린다. 본 연구에서는 픽셀 기반 처리를 최소화 할 수 있도록 영상의 특성에 따라 밝기 값에 대한 변화를 추적하여 최소 블록 처리로 그 속도를 개선하는 방법을 제안한다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.3
• /
• pp.694-701
• /
• 2004

In this paper, we proposed a feature-based tracking system that traces moving objects with a pan-tilt camera after separating the global motion of an active camera and the local motion of moving objects. The tracking system traces only the local motion of the comer features in the foreground objects by finding the block motions between two consecutive frames using a block-based motion estimation and eliminating the global motion from the block motions. For the robust estimation of the camera motion using only the background motion, we suggest a dominant motion extraction to classify the background motions from the block motions. We also propose an efficient clustering algorithm based on the attributes of motion trajectories of corner features to remove the motions of noise objects from the separated local motion. The proposed tracking system has demonstrated good performance for several test video sequences.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.35 no.7
• /
• pp.619-626
• /
• 2007

The analysis of the frictional energy of the rubber block with contact to the surface is necessary to study the wear for rubber. It is important to define the relationship of the frictional energy and wear, as the most theory of the wear of rubber product is based on the frictional energy of rubber block. To predict the life of the rubber block, the most of research has been focused on the use of the finite element analysis or the actual experiments which need the many time and expensive costs.Therefore, this research is achieved the successful results of the analysis to the frictional energy by analytic method. This frictional energy is function of the material properties, the shape of block, the vertical and horizontal load and the block moving speed. The analytical results are compared with the test results of this paper which can be used for the analysis of the friction behavior for the wear estimation of the rubber products.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2006.11a
• /
• pp.111-115
• /
• 2006

스케일러블 비디오 코딩(SVC, Scalable Video Coding)은 MPEG(Moving Picture Expert Group)과 VCEG (Video Coding Expert Group)의 JVT(Joint VIdeo Team)에 의해 현재 표준화 되고 있는 새로운 압축 표준 기술이며 시간, 공간 및 화질의 스케일러빌리티를 지원하기 위해 계층 구조를 가지고 있다. 특히 시간적 스케일러빌리티를 위해 계층적 B-픽처 구조를 채택하고 있다. 스케일러블 비디오 코딩의 기본 계층은 H.264|AVC와 호환적이므로, 모션 예측과 모드 결정과정에서 $16{\times}16,\;16{\times}8,\;8{\times}16,\;8{\times}8,\;8{\times}4,\;4{\times}8$ 그리고 $4{\times}4$와 같은 7개의 서로 다른 크기를 갖는 블록을 사용한다. 스케일러블 비디오 코딩에서 사용되고있는 계층적 B-픽처 구조는 키 픽처인 I와 P 픽처를 제외하고는 한 GOP (Group of Picture)내에서 모두 B-픽처를 사용하므로 H.264|AVC와 비교했을 때 연산량 증가와 함께 부호화 지연도 급격히 증가한다. B-픽처는 양방향 모션 벡터인 LIST0와 LIST1을 사용하고 양방향 모두에서 다중 참조 픽처를 사용하기 때문이다. 본 논문에서는 통계적 가선 검증을 이용하여 스케일러블 비디오 부호화에 적용 가능한 고속 프레임간 모드 결정 알고리듬 대해 소개한다. 제안된 방법은 $16{\times}16$ 매크로 블록과 $8{\times}8$ 서브 매크로 블록에 통계적 가설 감증 기법을 적용하여 실행되며, 현재 블록과 복원된 참조 블록간의 픽셀 값을 비교하여 RD(Rate Distortion) 최적화 기반 모드 결정을 빨리 완료함으로써 고속 프레임간 모드 결정을 가능하게 한다. 제안된 방법은 프레임 간 모드 결정을 고속화함으로써 스케일러블 비디오 부호화기의 연산량과 복잡도를 최대 57%감소시킨다. 그러나 연산량 감소에 따른 비트율의 증가나 화질의 열화는 최대 1.74% 비트율 증가 및 0.08dB PSNR 감소로 무시할 정도로 작다.

• Journal of Broadcast Engineering
• /
• v.12 no.3
• /
• pp.250-265
• /
• 2007

In this paper, a fast intermode decision scheme is introduced by efficiently performing the mode decision using statistical hypothesis testing for hierarchical B-picture coding of SVC, in which much computational power is expensed for combined variable block sizes and hierarchical B-pictures. The hypothesis testing in the proposed method is performed on $16{\times}16\;and\;8{\times}8$ blocks to have early termination for RD computation of all possible modes. The early termination in intermode decision is performed by comparing the pixel values of current blocks and corresponding motion-compensated blocks. The proposed scheme exhibits effective early termination behavior in intermode decision and leads to a significant reduction up to 69% in computational complexity with slight increment in bit amounts. The degradation of visual quality turns out to be negligible in terms of PSNR values.

• Journal of the Microelectronics and Packaging Society
• /
• v.25 no.4
• /
• pp.35-40
• /
• 2018

Simple and useful synthetic process to control the morphology of block copolymers (BCPs) is required for implementation in various device applications. However, the conventional method to use colloidal templates is not enough to realize the production of pure and massive core-shell nanoparticles due to the cost-intensive complex process. Here, we introduce a novel and facile synthesis method to realize the formation of core-shell $SiO_x$ nanoparticle power by employing an immersion annealing of a sphere-forming poly(styrene-b-dimethylsiloxane) (PS-b-PDMS) BCP. We successfully obtained a PS-encapsulated $SiO_x$ nanoparticle with a diameter of ~20 nm. In addition, we analyzed how the mixing ratio of heptane/ethanol affects the BCP morphology of self-assembled PS-b-PDMS nanoparticles, showing a worm-like structure under the optimum immersion conditions. This useful approach is expected to be extendable to other solvent-based BCP synthesis, providing a new guideline for unique BCP production.

• Journal of Korea Multimedia Society
• /
• v.13 no.7
• /
• pp.991-999
• /
• 2010

In this paper, we propose a fast motion estimation algorithm for video encoding. Conventional fast motion estimation algorithms have a serious problem of low prediction quality in some frames. However, full search based fast algorithms have low computational reduction ratio. In the paper, we propose an algorithm that significantly reduces unnecessary computations, while keeping prediction quality almost similar to that of the full search. The proposed algorithm uses distribution probability of motion vectors and adaptive search patterns and block matching criteria. By taking different search patterns and error criteria of block matching according to distribution probability of motion vectors, we can reduces only unnecessary computations efficiently. Our algorithm takes only 20~30% in computational amount and has decreased prediction quality about 0~0.02dB compared with the fast full search of the H.264 reference software. Our algorithm will be useful to real-time video coding applications using MPEG-2 or MPEG-4 AVC standards.