• Title/Summary/Keyword: block processing

Search Result 1,479, Processing Time 0.027 seconds

DCT Based Watermarking Technique Using Region of Interest (관심영역을 이용한 DCT기반 워터마킹 기법)

  • Shin, Jae-Wook;Jeong, Dong-Seok
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.37 no.1
    • /
    • pp.16-26
    • /
    • 2000
  • The proposed method inserts a watermark information not mto a whole Image region but only into regions of interest(ROIs) To extract the ROIs, we divide an original Image into sub-blocks and use modified Shi-Kuo Chang's PIM(picture information measure) as the criteria to select the ROIs Considering the directional information and frequency bands, we insert the watermark information into sub-blocks m the DCT domain. The proposed method can reduce the distortion in comparison With the other methods which utilize the whole Image as an nor The proposed method makes much less damaged Images m comparison to the other methods And those Images processed by the proposed algorithm are more robust to the changes caused by signal processing operations such as resampling, clipping. noise, and so on Also due to the block-based watermark insertion, the proposed method has the robustness to the Image compression processes such as JPEG and MPEG.

  • PDF

Efficient Motion Estimation Algorithm and Circuit Architecture for H.264 Video CODEC (H.264 비디오 코덱을 위한 효율적인 움직임 추정 알고리즘과 회로 구조)

  • Lee, Seon-Young;Cho, Kyeong-Soon
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.47 no.12
    • /
    • pp.48-54
    • /
    • 2010
  • This paper presents a high-performance architecture of integer-pel motion estimation circuit for H.264 video CODEC. Full search algorithm guarantees the best results by examining all candidate blocks. However, the full search algorithm requires a huge amount of computation and data. Many fast search algorithms have been proposed to reduce the computational efforts. The disadvantage of these algorithms is that data access from or to memory is very irregular and data reuse is difficult. In this paper, we propose an efficient integer-pixel motion estimation algorithm and the circuit architecture to improve the processing speed and reduce the external memory bandwidth. The proposed circuit supports seven kinds of variable block sizes and generates 41 motion vectors. We described the proposed high-performance motion estimation circuit at R1L and verified its operation on FPGA board. The circuit synthesized by using l30nm CMOS standard cell library processes 139.8 1080HD ($1,920{\times}1,088$) image frames per second and supports up to H.264 level 5.1.

On Extending JPEG Compression Method Using Line-based Differential Coding (행/열 단위 증분 부호화를 이용한 JPEG 압축 기법 확장에 관한 연구)

  • Park, Dae-Hyun;Ahn, Young-Hoon;Shin, Hyun-Joon;Wee, Young-Cheul
    • Journal of the Korea Computer Graphics Society
    • /
    • v.15 no.3
    • /
    • pp.11-18
    • /
    • 2009
  • In this paper, we introduce a novel method to extend the JPEG standard, which is the most widely used for lossy image compression, in order to improve compression ratio. To employ two of the most successful methodologies for the data compression: differential coding and quantization simultaneously, we propose a line-based approach. For each line in a block, we apply one-dimensional discrete cosine transformation to the increments instead of the pixel values. Those values are quantized and entropy-coded similarly to the JPEG standard. To further increase compression ratio, the proposed method is plugged into the JPEG standard to form a new compression method, in which the proposed method are applied to only selected JPEG blocks. In our experiment, we found that the proposed method outperform the JPEG standard when the qualities of the coded images are set to be high. We believe the proposed method can be simply plugged into the standard to improve its compression ratio for higher quality images.

  • PDF

A Study on Horizontal Shuffle Scheduling for High Speed LDPC decoding in DVB-S2 (DVB-S2 기반 고속 LDPC 복호를 위한 Horizontal Shuffle Scheduling 방식에 관한 연구)

  • Lim, Byeong-Su;Kim, Min-Hyuk;Jung, Ji-Won
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.16 no.10
    • /
    • pp.2143-2149
    • /
    • 2012
  • DVB-S2 employs LDPC codes which approach to the Shannon's limit, since it has characteristics of a good distance, error floor does not appear. Furthermore it is possible to processes full parallel processing. However, it is very difficult to high speed decoding because of a large block size and number of many iterations. This paper present HSS algorithm to reduce the iteration numbers without performance degradation. In the flooding scheme, the decoder waits until all the check-to-variable messages are updated at all parity check nodes before computing the variable metric and updating the variable-to-check messages. The HSS algorithm is to update the variable metric on a check by check basis in the same way as one code draws benefit from the other. Eventually, LDPC decoding speed based on HSS algorithm improved 30% ~50% compared to conventional one without performance degradation.

Design of After-processing Encrypted Record System for Copy Protection of Digital Video Optical Discs (디지털 비디오 광 디스크의 복제방지를 위한 후처리 암호화 기록 장치의 설계)

  • Kim, Hyeong-Woo;Joo, Jae-Hoon;Kim, Jin-Ae;Choi, Jung-Kyeng
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.6
    • /
    • pp.1435-1440
    • /
    • 2010
  • This paper presents encrypted secret code recording system which can insert an unique manufacture ID code after complete disc process. First, we detect a memory block synchronizing signal which is SYNC. by using FPGA, then, design a recording pattern to write Multi Pulse. Finally, a method that any data is recorded in any place in any data area of optical disc by using a FPGA was proposed. Newly proposed method in this paper that any user records user data in protected data areas on digital video optical discs, can be very useful for effective software copy protection, and can be applicable to encrypted record on high density DVD in near future.

3D Depth Information Extraction Algorithm Based on Motion Estimation in Monocular Video Sequence (단안 영상 시퀸스에서 움직임 추정 기반의 3차원 깊이 정보 추출 알고리즘)

  • Park, Jun-Ho;Jeon, Dae-Seong;Yun, Yeong-U
    • The KIPS Transactions:PartB
    • /
    • v.8B no.5
    • /
    • pp.549-556
    • /
    • 2001
  • The general problems of recovering 3D for 2D imagery require the depth information for each picture element form focus. The manual creation of those 3D models is consuming time and cost expensive. The goal in this paper is to simplify the depth estimation algorithm that extracts the depth information of every region from monocular image sequence with camera translation to implement 3D video in realtime. The paper is based on the property that the motion of every point within image which taken from camera translation depends on the depth information. Full-search motion estimation based on block matching algorithm is exploited at first step and ten, motion vectors are compensated for the effect by camera rotation and zooming. We have introduced the algorithm that estimates motion of object by analysis of monocular motion picture and also calculates the averages of frame depth and relative depth of region to the average depth. Simulation results show that the depth of region belongs to a near object or a distant object is in accord with relative depth that human visual system recognizes.

  • PDF

An Effective Solution to Overcome the Restriction of SACK Blocks' Number in TCP SACK (오프셋을 활용한 효율적인 TCP SACK 메커니즘)

  • Lin, Cui;Hong, Choong-Seon
    • The KIPS Transactions:PartC
    • /
    • v.12C no.7 s.103
    • /
    • pp.1039-1046
    • /
    • 2005
  • TCP SACK is the unique mechanism to reflect the situation of sink's sequence space, some TCP variants and proposals can perform in conjunction with SACK mechanism for achieving optimal performance. By definition of RFC 2018, however, each contiguous block of data queued at the data receiver is defined in the SACK option by two 32-bit unsigned integers in network byte order. Since TCP Options field has a 40-byte maximum length, when error bursts now, we note that the available option space may not be sufficient to report all blocks present in the receiver's queue and lead to unnecessarily force the TCP sender to retransmit Packets that have actually been received by TCP sink. For overcoming this restriction, in this thesis, a new solution named 'one-byte offset based SACK mechanism' is designed to further improve the performance or TCP SACK and prevent those unwanted retransmissions. The results or both theory analysis and simulation also show that his proposed scheme operates simply and more effectively than the other existing schemes by means of the least bytes and most robust mechanism to the high packet error rates often seen in networks environment.

Multiple Pedestrians Detection and Tracking using Color Information from a Moving Camera (이동 카메라 영상에서 컬러 정보를 이용한 다수 보행자 검출 및 추적)

  • Lim, Jong-Seok;Kim, Wook-Hyun
    • The KIPS Transactions:PartB
    • /
    • v.11B no.3
    • /
    • pp.317-326
    • /
    • 2004
  • This paper presents a new method for the detection of multiple pedestrians and tracking of a specific pedestrian using color information from a moving camera. We first extract motion vector on the input image using BMA. Next, a difference image is calculated on the basis of the motion vector. The difference image is converted to a binary image. The binary image has an unnecessary noise. So, it is removed by means of the proposed noise deletion method. Then, we detect pedestrians through the projection algorithm. But, if pedestrians are very adjacent to each other, we separate them using RGB color information. And we track a specific pedestrian using RGB color information in center region of it. The experimental results on our test sequences demonstrated the high efficiency of our approach as it had shown detection success ratio of 97% and detection failure ratio of 3% and excellent tracking.

A Study for a real-time variety region(object) extraction algorithm to implement MPEG-4 based Video Phones. (MPEG-4 기반의 영상전화기 구현을 위한 실시간 변환영역(객체) 추출에 관한 알고리즘)

  • Oh, In-Gwon;Shon, Young-Woo;Namgung, Jae-Chan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.1C
    • /
    • pp.92-101
    • /
    • 2004
  • This paper proposes a algorithm to extract the variety region (object) from video for the real-time encoding of MPEG-4 based. The previous object segmentation methods cannot used the videophone or videoconference required by real-time processing. It is difficult to transfer a video to real-time because it increased complexity for the operation of each pixel on the spatial segmentation and temporal segmentation method proposed by MPEG-4 Working Group. But algorithm proposed for this thesis not operates a pixel unit but operates a macro block unit. Thus this enables real-time transfer. But this algorithm cannot extract several object for a image using proposed algorithm as previous algorithm. On system constructed by encoder and decoder. A proposed algorithm inserted for encoder as pre-process.

Ambient Occlusion Volume Rendering using Multi-Range Statistics (다중 영역 통계량을 이용한 환경-광 가림 볼륨 가시화)

  • Nam, Jinhyun;Kye, Heewon
    • Journal of the Korea Computer Graphics Society
    • /
    • v.21 no.3
    • /
    • pp.27-35
    • /
    • 2015
  • This study presents a volume rendering method using ambient occlusion which is one of global illumination methods. By considering the volume density distribution as normal distribution, ambient occlusion can be calculated at real-time speed regardless of modification of opacity transfer function. We calculate and store the averages and standard deviations of densities in a block centered at each voxel in pre-processing time. In rendering process, we determine the illumination value by estimating the nearby opacity. We generalized theoretical model and generated better quality images improving our previous research. In detail, various shapes of transfer function can be used due to the proposed equation model. Moreover, we introduced a multi-range model to give nearer objects more weight. As the result, more realistic volume rendering image can be generated at real-time speed by mixing local and ambient occlusion shading.