• The Journal of the Korea Contents Association
• /
• v.9 no.2
• /
• pp.1-9
• /
• 2009

In this paper, we propose the efficient processing technique for unavailable data in hardware implementation of motion estimator in H.264/AVC with parallel processing architecture. Motion estimation processing in the hardware is generally based on pipe-lining, some MV data of neighbor blocks are not available, whereas all MV data are valid in software processing where the data are sequentially processed. In this paper, we solve the problem of data being unavailable in MVp computation. To minimize the quality degradation caused by unavailable MVs, in the proposed method, the unavailable MV of a neighboring block is replaced with an integer pel unit MV, an MVp of neighboring blocks, or an MVcol (MV of co-located block). Comparing to the conventional method [7], our method outperformed maximally 0.832dB and 0.179dB for QCIF and CIF, respectively, in terms of BDPSNR.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.1
• /
• pp.182-192
• /
• 1999

The advance of the MPEG(Moving Picture Expert Group) and DSP(Digital Signal Processing) technologies lead the energence of the information appliances which are gradually digitalized and embedded the high-speed networking function. This paper proposes a CHANCE(Cost-effective Home ATM Network for the Consumer Electronics) protocol supporting the ATM-based high-speed networking between the information appliances within the home, and designs its specific functions including the network management and signalling function. The CHANCE protocol is basically based on the tree topology, and supports the plug-and-play function by using only the header field of the ATM cells. Unlike the existing ATM Warren protocol which uses the source routed addressing scheme to control the in-home devices from the Warren controller, the CHANCE protocol can support the inter-device controls as well as the controls from the CHANCE controller by using the switch and device identifier.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.3
• /
• pp.29-35
• /
• 2012

In this paper, it is presented the method of image recovering which existing is only pixel processing, but suggesting method is concluding image clustering overlap degree after classfying around unit fixel to crowd pixel. Concluding overlap degree threshold value is after identifying pattern pixel and grasping geometry structure of sample pattern and deduction of deciding function. distinguishing feature space is above four dimension is reason of not visual observation of pattern structure. consideration of distribution structure is distance of center of crowd pixel, the number of each crowd pattern pixel and standard deviation. The over threshold value elimate the overlap image and the downward is recovered and established dynamic image. memory storage deduction of 20% and elevation of 15% performance is estimated in recovery of image.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.45 no.6
• /
• pp.74-79
• /
• 2008

In this paper, we propose and design a new 0.264/AVC watermarking algorithm for protection of copyright by inserting a watermark after quantization. This invisible watermarking algorithm insets a watermark into chrominance components of I frame such that we can avoid degradation of original images. According to test results we could limit image degradation by 1dB, avoid bit rate increment within 2% and increase processing time by only 2%. The IP is designed by Hynix 0.25 micron technology and the maximum operating frequency of 115MHz is achieved. The PSNR of the embedded watermark is about 35dB according to the test result.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.1
• /
• pp.114-123
• /
• 2003

This paper proposes an efficient method for encoding the shape information of the object in the image. The polygonal approximation method is categorized into a loss coding method and is widely used for approximating object's shape information. The proposed method selects less number of vertices than IRM (iterated refinement method) or PVS (progressive vertex selection) when the maximum distortion is given, so reduces the bit-rates. The proposed method selects the vertices of a polygon with a simple and efficient method considering the rate-distortion sense. We construct the shape information coder, which shows the outstanding performance in the rate-distortion sense, based on the conventional progressive vertex selection method and the new vertex selection condition that we propose in this paper. Simulation results show that the proposed method has better performance than other conventional vertex selection methods in the tate-distortion sense.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.1
• /
• pp.57-68
• /
• 2004

Although variable-length codes (VLCs) increase coding efficiency using the statistical characteristics of the source data, they have catastrophic effects from bit errors in noisy transmission environments. In order to overcome this problem with VLCs, reversible variable-length codes (RVLCS) have recently been proposed owing to their data recovering capability. RVLCS can be divided into two categories: symmetrical and asymmetrical RVLCs. Although the symmetrical RVLC has generally more overheads than the asymmetrical RVLC, it has some advantages of simpler design and more efficient memory usage. However, existing symmetrical RVLCs still have high complexity in their code design and some room for improvement in coding efficiency. In this paper, we propose a new algorithm for constructing a symmetrical RVLC from the optimal Huffman code table. The proposed algorithm has a simpler design process and also demonstrates improved performance in terms of the average codeword length relative to the existing symmetrical RVLC algorithms.

• The Journal of the Korea Contents Association
• /
• v.12 no.12
• /
• pp.135-145
• /
• 2012

This study is a research development case study on the free-standing Network based camera video recording DVR. The DVR devices till now have recorded data by converting and compressing analogue video to digital, but in the future, digital videos will be recorded directly through the network camera. Also, digital compressing methods are progressing from MPEG-4, MJPEG, to H.264 method, with products considering high definition compression efficiency, minimized data size, network compatibility, and fast pending time. According to this, in 2012, it is predicted that network camera and video devices throughout the world will outrun the current analogue devices. With this transition of technological environment and fast product pending speed, a new, quality focused design is required for product development including technical realization, reliability, high-definition, compression technology, will be essential. Manufacturers are researching a new direction for the product appearance. This study considers the actual end-users as the design target and through consumer survey on preferences, design needs and required elements necessary in the design development process are extracted. Furthermore, usability and preferred images were explored through literature study and market research. Through this research process, appropriate forms for the network based DVR were analyzed, and applied into the design development process. This product will take into consideration its competitiveness and the significance of USP(Unique Selling Proposition) which is the design supremacy and professional technical skills.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.6
• /
• pp.114-123
• /
• 2003

The current paper proposes a new vertex selection scheme for polygon-based contour coding. To efficiently characterize the shape of an object, we incorporate the curvature information in addition to the conventional maximum distance criterion in vertex selection process. The proposed method consists of "two-step procedure." At first, contour pixels of high curvature value are selected as key vortices based on the curvature scale space (CSS), thereby dividing an overall contour into several contour-segments. Each segment is considered as an open contour whose end points are two consecutive key vortices and is processed independently. In the second step, vertices for each contour segment are selected using progressive vertex selection (PVS) method in order to obtain minimum number of vertices under the given maximum distance criterion ( $D_{max}$$^{*}$). Furthermore, the obtained vortices are adjusted using the dynamic programming (DP) technique to optimal positions in the error area sense. Experimental results are presented to compare the approximation performances of the proposed and conventional methods.imation performances of the proposed and conventional methods.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.4
• /
• pp.434-441
• /
• 2001

We present an image retrieval method for improving retrieval performance by the effective fusion of spatial histogram and wavelet moments. In this method, the similarity for spatial histograms and the similarity for wavelet moment are effectively fused in the computation of the similarity between a query image and DB image. That is, the wavelet moments feature represented in multi-resolution and the spatial histogram feature robust to translation and rotation are used to improve retrieval performance. In order to evaluate the performance of the proposed method, we use Brodatz texture DB, MPEG-7 T1 DB, and Corel Draw Photo DB. Experimental results show that the proposed method yields 5.3% and 13.8% better Performances for Brodatz DB, and 15.5% and 3.2% better Performances for Corel Draw Photo DB over the histogram method and the wavelet moment method, respectively.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.4
• /
• pp.777-781
• /
• 2005

It is issued that protecting and managing a copyright are very important to a digitization of multimedia content. All of these techniques are for developing solution about protection and management of the copyright and media service. These have been at the head of the growth of the whole media service, but cause problems such as a illegal copy and distribution. To solve these problems, researchers are performing many projects. We analyze the trend of a multimedia service IPMP(Intellectual Property Management and Protection), DMP(Digital Media Project), ENTHRONE(End-to-end Qos through Integrated Management of Content, Networks and Terminals), and DRM(Digital Rights Management).