• Proceedings of the IEEK Conference
• /
• 2001.06b
• /
• pp.373-376
• /
• 2001

This paper has been studied a real-time video frame data processing control that used the linear systolic array for motion estimation. The proposed data control processing provides to the input data into the multiple processor array unit(MPAU) from search area and reference block data. The proposed data control architecture has based on two slice band for input data processing. And it has no required external control logic blocks for input data as like reference block or search area data.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.2
• /
• pp.313-325
• /
• 1996

This paper presents a new architecture for full-search block-matching motion estimation. The architecture is based on linear systolic arrays. High speed operation is obtained by feeding reference data, search data, and control signals into the linear systolic array in a pipelined fashion. Input data are fed into the linear systolic array at a half of the processor speed, reducing the required data bandwidth to half. The proposed architecture has a good scalability with respect to the number of processors and input bandwidth when the size of reference block and search range change.

• Journal of Korea Multimedia Society
• /
• v.14 no.10
• /
• pp.1275-1286
• /
• 2011

This paper proposes a high speed systolic array architecture for full search block matching algorithm (FBMA). The pixels of the search area for a reference block are input only one time to find the matched candidate block and reused to compute the sum of absolute difference (SAD) for the adjacent candidate blocks. Each row of designed 2-dimensional systolic array compares the reference block with the adjacent blocks of the same row in search area. The lower rows of the designed array get the pixels from the upper row and compute the SAD with reusing the overlapped pixels of the candidate blocks within same column of the search area. This designed array has no data broadcasting and global paths. The comparison with existing architectures shows that this array is superior in terms of throughput through it requires a little more hardware.

• KIPS Transactions on Computer and Communication Systems
• /
• v.7 no.11
• /
• pp.281-288
• /
• 2018

The block chain, which is characterized by a distributed ledger that stores the same data in several places, has various technical features including security and stability. Due to these characteristics, various researches are being conducted on the application of the block chain. In this paper, we consider the issues to be considered for applying the block chain to the Korea Real Estate Administration Intelligence System (KRAS). Based on this, we propose a block chain reference model for KRAS including a system configuration method and a consensus algorithm.

• Smart Media Journal
• /
• v.6 no.2
• /
• pp.9-14
• /
• 2017

A packet loss in wireless environments causes a severe degradation of video quality in video communications. In this paper, a novel video error concealment algorithm is presented by combining boundary errors and a block reliability measure. The block reliability measure decides the reliability of a block by checking residual errors of a block. In the proposed approach, a motion vector of a missing unreliable block in an inter coded frame is obtained initially based on the motion vector of the same block in the reference frame. Furthermore, if the block in the reference frame is unreliable according to the reliability measure, a new motion vector is decided based on block boundary errors around the initial motion vector. According to our simulations, the proposed approach shows promising results for error concealment in error-prone wireless environments.

• The Journal of the Korea Contents Association
• /
• v.10 no.4
• /
• pp.28-35
• /
• 2010

The variable block size motion estimation (ME) and compensation (MC) using multiple reference frames is adopted in H.264/AVC to improve coding efficiency. However, the computational complexity for ME/MC increases proportional to the number of reference frames and variable blocks. In this paper, we propose a new efficient reference frame selection algorithm to reduce the complexity while keeping the visual quality. First, a motion vector reference map is constructed by SAD of $4{\times}4$ block unit for multi reference frames. Next, the variable block size motion estimation and motion compensation is performed according to the motion vector reference map. The computer simulation results show that the average loss of BDPSNR is -0.01dB, the increment of BDBR is 0.27%, and the encoding time is reduced by 38% compared with the original method for H.264/AVC.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.19 no.1
• /
• pp.40-47
• /
• 2009

Recently, dynamic proxy caching has been proposed on the distributed environment so that media objects by user's requests can be served directly from the proxy without contacting the server. However, it makes caching challenging due to multimedia large sizes, low latency and continuous streaming demands of media objects. To solve the problems caused by streaming demands of media objects, this paper has been proposed the grouping scheme with fuzzy filtering based on partition and mapping. For partition and mapping, this paper divides media block segments into fixed partition reference block(R$_f$P) and variable partition reference block(R$_v$P). For semantic relationship, it makes fuzzy relationship to performs according to the fixed partition temporal synchronization(T$_f$) and variable partition temporal synchronization(T$_v$). Simulation results show that the proposed scheme makes streaming service efficiently with a high average request response time rate and cache hit rate and with a low delayed startup ratio compared with other schemes.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.51 no.1
• /
• pp.1-7
• /
• 2002

This paper proposes a algebraic parameter determination of MRA(Model Reference Adaptive Control) controller using block Pulse functions and block Pulse function's differential operation. Generally, adaption is performed by solving differential equations which describe adaptive low for updating controller parameter. The proposes algorithm transforms differential equations into algebraic equation, which can be solved much more easily inn a recursive manner. We believe that proposes methods are very attractive and proper for parameter estimation of MRAC controller on account of its simplicity and computational convergence.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.11
• /
• pp.2941-2956
• /
• 2013

In this paper, we propose an effective fragile image watermarking scheme for tampering detection and content recovery. Cover image is divided into a series of non-overlapping blocks and a block mapping relationship is constructed by the secret key. Several DCT coefficients with direct current and lower frequencies of the MSBs for each block are used to generate the reference bits, and different coefficients are assigned with different bit numbers for representation according to their importance. To enhance recovery performance, authentication bits are generated by the MSBs and the reference bits, respectively. After LSB substitution hiding, the embedded watermark bits in each block consist of the information of itself and its mapping blocks. On the receiver side, all blocks with tampered MSBs can be detected and recovered using the valid extracted reference bits. Experimental results demonstrate the effectiveness of the proposed scheme.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2012.11a
• /
• pp.259-262
• /
• 2012

In this paper, we propose a new fast algorithm for effective scene change detection. The proposed algorithm exploits Otsu threshold matching technique, which was proposed earlier. In this method, the current and the reference frames are divided into square blocks of particular size. After doing so, the pixel histogram of each block is generated. According to Otsu method, every histogram distribution is assumed to be bimodal, i.e. pixel distribution can be divided into two groups, based on within-group variance value. The pixel value that minimizes the within-group variance is said to be Otsu threshold. After Otsu threshold is found, the same procedure is performed at the reference frame. If the difference between Otsu threshold of a block in the current frame and co-located block in the reference frame is larger than predefined threshold, then a scene change between those two blocks is detected.