• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.6
• /
• pp.127-136
• /
• 1998

This paper proposes a new MVQMultistage Vector Quantizer) using a hybrid structure. While in a conventional MVQ, the quantizers of all stages perform the encoding procedure for input signals, we introduce a quantizer that performs selectively. The proposed quantizer with a hybrid structure is composed of a FSVQ(Finite-State Vector Quantizer) for the first stage and a ordinary VQ(Vector Quantizer) for the second stage. A input block is firstly encoded by the FSVQ of the first stage. If the Euclidean distortion measure between original signals and the codevector selected from the state codebook of the FSVQ is less than a prespecified value, only the FSVQ is used for image coding. Otherwise, both the FSVQ of the first stage and the ordinary VQ of the second stage are used for image coding. While the conventional MVQ has an advantage that can achieve low encoding complexity in comparison to the ordinary VQ, but has a disadvantage that is suboptimal with respect to the performance measure and can not achieve the bit rate reduction, the proposed method achieve not only the bit rate reduction but also the performance improvement.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.10C
• /
• pp.1000-1010
• /
• 2006

This paper proposes a new architecture for DCT-based motion estimation and compensation. Previous methods do riot take sufficient advantage of the sparseness of 2-D DCT coefficients to reduce execution time. We first derive a recursion equation to perform DCT domain motion estimation more efficiently; we then use it to develop a wavefront array processor (WAP) consisting of processing elements. In addition, we show that the recursion equation enables motion predicted images with different frequency bands, for example, from the images with low frequency components to the images with low and high frequency components. The wavefront way Processor can reconfigure to different motion estimation algorithms, such as logarithmic search and three step search, without architectural modifications. These properties can be effectively used to reduce the energy required for video encoding and decoding. The proposed WAP architecture achieves a significant reduction in computational complexity and processing time. It is also shown that the motion estimation algorithm in the transform domain using SAD (Sum of Absolute Differences) matching criterion maximizes PSNR and the compression ratio for the practical video coding applications when compared to tile motion estimation algorithm in the spatial domain using either SAD or SSD.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.4
• /
• pp.1499-1513
• /
• 2014

This paper proposes a novel blind image watermarking scheme exploiting Block Truncation Coding (BTC). Most of existing BTC-based watermarking or data hiding methods embed information in BTC compressed images by modifying the BTC encoding stage or BTC-compressed data, resulting in watermarked images with bad quality. Other than existing BTC-based watermarking schemes, our scheme does not really perform the BTC compression on images during the embedding process but uses the parity of BTC quantization data to guide the watermark embedding and extraction processes. In our scheme, we use a binary image as the original watermark. During the embedding process, the original cover image is first partitioned into non-overlapping $4{\times}4$ blocks. Then, BTC is performed on each block to obtain its BTC quantized high mean and low mean. According to the parity of high mean and the parity of low mean, two watermark bits are embedded in each block by modifying the pixel values in the block to make sure that the parity of high mean and the parity of low mean in the modified block are equal to the two watermark bits. During the extraction process, BTC is first performed on each block to obtain its high mean and low mean. By checking the parity of high mean and the parity of low mean, we can extract the two watermark bits in each block. The experimental results show that the proposed watermarking method is fragile to most image processing operations and various kinds of attacks while preserving the invisibility very well, thus the proposed scheme can be used for image authentication.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.10
• /
• pp.3290-3299
• /
• 2000

Digital watermarking has similar concepts with channel coding thechnique for transferring data with minimizing error in noise environment, since it should be robust to various kinds of data manipulation for protecting copyrights of multimedia data. This paper proposes a digital watermarking technique which is robust to various kinds of data manipulation. Intellectual property rights information is encoded using a convolutional code, and block-interleaving technique is applied to prevent successive loss of encoded data. Encoded intelloctual property rithts informationis embedded using spread spectrum technique which is robust to cata manipulation. In order to reconstruct intellectual property rights information, watermark signalis detected by covariance between watermarked image and pseudo rando noise sequence which is used to einbed watermark. Embedded intellectual property rights information is obtaned by de-interleaving and cecoding previously detected wtermark signal. Experimental results show that block interleaving watermarking technique can detect embedded intellectial property right informationmore correctly against to attacks like Gaussian noise additon, filtering, and JPEG compression than general spread spectrum technique in the same PSNR.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.20 no.6
• /
• pp.33-42
• /
• 2010

With the emergence of increasingly complex networks and diverse user terminals, demand for the next generation IPTV service is rapidly growing. It enables any content to seamlessly be reused on the diverse terminals as well as be broadcasted in real-time through the complex networks. In this paper, a novel security framework is proposed for the real-time and reusable IPTV services. The proposed framework is advantageous over the conventional content protection techniques in easily producing the scalable content with lightweight, perceptual, transcodable, and adjustable security features. It does not only ensure end-to-end security over the entire service range based on a single security mechanism, but also can control a level of security while dynamically transcoding the original content. This approach basically performs selective encryption during and after the compression using scalable video coding. The suitability of the proposed approach is demonstrated through experiments with a practical service scenario. Therefore, it is expected that security technology alone could practically contribute to creating new business opportunities for IPTV services.

• Journal of Broadcast Engineering
• /
• v.21 no.3
• /
• pp.341-348
• /
• 2016

HEVC is the next compression standard and is expected to be used widely replacing the conventional H.264/AVC standard. The compression ratio of the HEVC is twice times than H.264/AVC, whereas its computational complexity is increased by up to 40%. Many research efforts have been made to reduce the computational complexity and to speed up encoding. For intra coding, the rough mode decision (RMD) is commonly applied. The rate-distortion optimization (RDO) process to decide the best mode is too complex so that RMD chooses the candidate modes with a simple process and sends the candidates to RDO process. However, for large-size blocks, the RMD also requires considerable computations. In this paper, a down-sampling scheme is proposed for the RMD process. The reference pixel loading, predicted pixel generation are performed using the down-sampled pixel data. When the proposed scheme is applied to the RMD, the computational complexity is reduced by 70% with a marginal bitrate increase of 0.04%. In terms of area of hardware-based RMD, the gate count and the buffer size is reduced 33% and 66%, respectively.

• Journal of Korean Society of Transportation
• /
• v.26 no.1
• /
• pp.191-201
• /
• 2008

It has been employed TRANSYT-7F and NETSIM to evaluate the validity and effectiveness of improvement on TSM(Transportation Systems Management). But T7F is hard to describe platoon compression and dispersion in actually, and NETSIM takes a long time for network coding, calibration and have difficulty in setting up saturation flow. While Shockwave Model have advantage which can describe platoon compression and dispersion in actually and shorten hours, convenience of application. But Shockwave Model apply unrealistic traffic flow relation ship(U-K curve) and simplify platoon because of difficulty in calculating shockwave's position and cross. For solving limitation of existing shockwave models, It develop new model with 2-regime linear model, New platoon model, Extended shockwave, etc. For verifying the validity of the proposed model, it was compared with delay of T7F and NETSIM by offset variation. In conclusion, it is thought that proposed model have outstanding performance to simulate traffic phenomenon.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.4
• /
• pp.418-423
• /
• 2004

The motion estimation algorithm based block matching is a widely used in the international standards related to video compression, such as the MPEG series and H.26x series. Full search algorithm(FA) ones of this block matching algorithms is usually impractical because of the large number of computations required for large search region. Fast search algorithms and conventional binary block matching algorithms reduce computational complexity and data processing time but this algorithms have disadvantages that is less performance than full search algorithm. This paper presents new Boolean matching algorithm, called BCBM(Bit Converted Boolean Matching). Proposed algorithm has performance closed to the FA by Boolean only block matching that may be very efficiently implemented in hardware for real time video communication. Simulation results show that the PSNR of the proposed algorithm is about 0.08㏈ loss than FA but is about 0.96∼2.02㏈ gain than fast search algorithm and conventional Boolean matching algorithm.

• Journal of IKEEE
• /
• v.2 no.2 s.3
• /
• pp.239-246
• /
• 1998

In this paper, a new morphological details extraction algorithm is proposed. It is known that separate transmission of details and background smoothed image is a powerful technique for very low bit-rate video data transmission. Several details extraction algorithms show relatively large variation of grayscale levels in details, smoothed image, which is the difference between original and details images, provides highly distortedand complicated result. In order to remedy those pitfails, and thus to improve the coding efficiency, we propose a new algorithm using the reconstruction top-hat result as the reference image in process of obtaining details, instead of top-hat result, which is used fur existing a1gorithms. Experimental results show that details, extracted using the proposed algorithm, are much similar to original image, and thus the smoothed image is not too complicated.

• Proceedings of the Korean Society of Medical Physics Conference
• /
• 2002.09a
• /
• pp.489-491
• /
• 2002

The need for video diagnosis in medicine has been increased and real-time transfer of digital video will be an important component in PACS and telemedicine. But, Network environment has certain limitations that the required throughput can not satisfy quality of service (QoS). MPEG-4 ratified as a moving video standard by the ISO/IEC provides very efficient video coding covering the various ranges of low bit-rate in network environment. We implemented MPEG-4 CODEC (coder/decoder) and applied various compression ratios to moving ultrasound images. These images were displayed in random order on a client monitor passed through network. Radiologists determined subjective opinion scores for evaluating clinically acceptable image quality and then these were statistically processed in the t-Test method. Moreover the MPEG-4 decoded images were quantitatively analyzed by computing peak signal-to-noise ratio (PSNR) to objectively evaluate image quality. The bit-rate to maintain clinically acceptable image quality was up to 0.8Mbps. We successfully implemented the adaptive throughput or bit-rate relative to the image quality of ultrasound sequences used MPEG-4 that can be applied for diagnostic performance in real-time.