• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.39 no.6
• /
• pp.59-68
• /
• 2002

In this paper, we design the two-dimensional Discrete Wavelet Transform (2D DWT) filter that is widely used in various applications such as image compression because it has no blocking effects and relatively high compression rate. The filter that we used here is two-channel four-taps QMF(Quadrature Mirror Filter) Lattice filter with PR (Perfect Reconstruction) property. The proposed DWT architecture, with two consecutive inputs shows an efficient performance with a minimum of such hardware resources as multipliers, adders, and registers due to a simple scheduling. The proposed architecture was verified by the RTL simulation, and utilizes the hardware 100%. Our architecture shows a relatively high performance with a minimum hardware when compared with other approaches. An efficient memory mapping and address generation techniques are introduced and the fixed-point arithmetic analysis for minimizing the PSNR degradation due to quantization is discussed.

• The KIPS Transactions:PartD
• /
• v.14D no.7
• /
• pp.801-808
• /
• 2007

Video coding standards such as MPEG-2, MPEG-4, H.263, and H.264 transmit a compressed video data using wired/wireless communication line with limited bandwidth. Because highly compressed bit-streams is likely to fragile to error from channel noise, video is damaged by error. There have been many research works on error concealment techniques, which recover transmission errors at decoder side [1, 2]. We designed an error concealment technique for lost motion vectors of H.264 video coding. In this paper, we propose a Kalman filter based motion vector recovery scheme, and experimented with standard video sequences. The experimental results show that our scheme restores original motion vector with more precision of 0.91 - 1.12 on average over conventional H.264 decoding with no error recovery.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.6
• /
• pp.145-155
• /
• 2013

In this paper, we proposed a $4{\times}4$ block parallel architecture of interpolation for high-performance H.264/AVC Fractional Motion Estimation in 8K UHD($7680{\times}4320$) video real time processing. To improve throughput, we design $4{\times}4$ block parallel interpolation. For supplying the $10{\times}10$ reference data for interpolation, we design 2D cache buffer which consists of the $10{\times}10$ memory arrays. We minimize redundant storage of the reference pixel by applying the Search Area Stripe Reuse scheme(SASR), and implement high-speed plane interpolator with 3-stage pipeline(Horizontal Vertical 1/2 interpolation, Diagonal 1/2 interpolation, 1/4 interpolation). The proposed architecture was simulated in 0.13um standard cell library. The gate count is 436.5Kgates. The proposed H.264/AVC Fractional Motion Estimation can support 8K UHD at 30 frames per second by running at 187MHz.

• The Journal of the Korea Contents Association
• /
• v.9 no.7
• /
• pp.37-44
• /
• 2009

Digital watermarking is a technology for preventing illegal copying, for protecting intellectual property rights and copyrights, and for suggesting grounds of the ownership by inserting watermarks into digital contents. Generally speaking, watermarking techniques cannot escape from data distortion and quality degradation due to the watermark insertion. In order to overcome the shortcoming, zero-watermarking techniques which do not change the original data have been proposed recently. This paper proposes CSMVQ(Chaotic SMVQ), a zero-watermarking system for SMVQ(Side Match Vector Quantization) which shows better compression ratio and quality and less blocking effect than VQ(Vector Quantization). In SMVQ, compression progresses from left top to right bottom in order to use the information of the two neighbor blocks, so it is impossible to insert watermarks chaotically. In the process of encoding, CSMVQ dynamically considers the information of the (1 to 4) neighbor blocks already encoded. Therefore, watermark can be inserted into digital contents in chaotic way. Experimental results show that the image quality compressed by CSMVQ is better than that of SMVQ and the inserted watermark is robust against some common attacks.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2012.07a
• /
• pp.124-126
• /
• 2012

3차원 동영상은 수많은 응용분야에서 차세대 멀티미디어 콘텐츠로 큰 주목을 받고 있지만 2차원에서 3차원 콘텐츠로의 과도기인 현 시점에서 3차원 콘텐츠의 부족현상은 관련 산업분야의 큰 문제점으로 떠오르고 있다. 2D-to-3D 변환 기술은 높은 비용 없이 기존의 방대한 2차원 콘텐츠를 3차원 콘텐츠로 재사용하는 것이 가능하기 때문에 3차원 콘텐츠의 부족 문제를 해결할 수 있는 기술로 큰 관심을 끌고 있다. 본 논문에서는 블록 단위 초점 정보의 보간을 통한 새로운 초점 기반 3차원 변환 기법을 제안한다. 기존의 화소 단위 초점 측정치를 그대로 깊이 정보로 이용하는 경우나 분할 영역 단위 초점 측정치를 깊이 정보로 활용하는 경우는 이웃 화소간 깊이정보의 불연속성이 발생할 수 있지만 제안방식은 블록 초점 측청치의 보간수행으로 인해 이웃 화소 사이에서 뿐만 아니라 블록경계 혹은 영역경계에서도 특별할 스무딩필터 처리 없이도 화소간 깊이정보의 불연속성이 발생하지 않게 된다. 실험결과를 통해 제안한 방식이 기존의 방식들 보다 더 자연스러운 깊이 정보 추출 성능을 보여준다는 것을 알 수 있다.

• Journal of Broadcast Engineering
• /
• v.20 no.4
• /
• pp.521-532
• /
• 2015

This paper presents a piecewise image denoising with multi-scale block region detector based on quadtree structure for effective image restoration. Proposed piecewise image denoising method suggests multi-scale block region detector (MBRD) by dividing whole pixels of a noisy image into three parts, with regional characteristics: strong variation region, weak variation region, and flat region. These regions are classified according to total pixels variation between multi-scale blocks and are applied principal component analysis with local pixel grouping, bilateral filtering, and structure-preserving image decomposition operator called relative total variation. The performance of proposed method is evaluated by Experimental results. we can observe that region detection results generated by the detector seems to be well classified along the characteristics of regions. In addition, the piecewise image denoising provides the positive gain with regard to PSNR performance. In the visual evaluation, details and edges are preserved efficiently over the each region; therefore, the proposed method effectively reduces the noise and it proves that it improves the performance of denoising by the restoration process according to the region characteristics.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.10C
• /
• pp.1036-1043
• /
• 2005

In this paper, we propose a sequential motion vector recovery algorithm for H.264 video coding standard. Motion vectors of H.264 video coding standard cover relatively smaller areas than other standard, since motion estimation of H.264 takes place in the fashion of variable block size. Therefore, the correlation of motion vectors between neighboring blocks increases as the block size of motion estimation is lowered. Under the framework of sequential recovery, we introduce a motion vector recovery using $\alpha$-trimed mean filter. Experimental results show that proposed algorithm is useful in real time video delivery .with nearly comparable or better visual quality than previous approaches such as macro block boundary matching and Lagrage interpolation.

• The KIPS Transactions:PartA
• /
• v.13A no.2 s.99
• /
• pp.101-110
• /
• 2006

One of the most effective ways to improve cache performance is to exploit both temporal and spatial locality given by any program executional characteristics. This paper proposes a data cache with small space for low power but high performance on multimedia applications. The basic architecture is a split-cache consisting of a direct-mapped cache with small block sire and a fully-associative buffer with large block size. To overcome the disadvantage of small cache space, two mechanisms are enhanced by considering operational behaviors of multimedia applications: an adaptive multi-block prefetching to initiate various fetch sizes and an efficient block filtering to remove rarely reused data. The simulations on MediaBench show that the proposed 5KB-cache can provide equivalent performance and reduce energy consumption up to 40% as compared with 16KB 4-way set associative cache.

• Journal of the Korea Society of Computer and Information
• /
• v.26 no.2
• /
• pp.45-52
• /
• 2021

In this paper, we propose a method of generating theme, background amd signal music usage monitoring information based on a blockchain, in which the music usage informations are recorded by the monitoring tool using feature-based filtering of monitoring organizations. Theme, background and signal music are music inserted into the broadcasting contents of broadcaster. Since they are recognized as created contents just like normal music, there are lyricists and composers who have the right for those music and all copyright holders of them have to receive the corresponding copyright fees, once the music was used in the broadcast. However, there are problems with inaccurate monitoring results for music usage, due to the omission of usage details and non-transparent settlement method. In order to solve these problems, If the information generation method proposed in this paper, accurate music usage history can be created, the details are stored in the blockchain without changes or omissions, and transparent settlement and distribution are possible by smart contract, avoiding the current non-transparent settlement method.

• Journal of Broadcast Engineering
• /
• v.26 no.3
• /
• pp.321-326
• /
• 2021

Blockchain is increasing in value as a platform for safe transmission of capital transactions or secure data. In addition, blockchain has the potential as a new platform that can safely store large amounts of data such as videos, music, and photos, and safely manage transaction details and service usage specifications. Since it is not possible to store large-capacity media data in a block, research on the performance of storing sound source information in a block and retrieving the stored sound source data by using the distributed storage system (IPFS) and the hash information of the sound source signature data was conducted. In this paper, we propose a sound source signature indexing method using a bloom filter that can improve the search speed suggested by previous studies. As a result of the experiment, it was confirmed that improved search performance (O(1)) than the existing search performance (O(n)) can be achieved.