• Title/Summary/Keyword: discrete cosine transform(DCT)

Search Result 346, Processing Time 0.025 seconds

2D Adjacency Matrix Generation using DCT for UWV contents

  • Li, Xiaorui;Lee, Euisang;Kang, Dongjin;Kim, Kyuheon
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2016.11a
    • /
    • pp.39-42
    • /
    • 2016
  • Since a display device such as TV or signage is getting larger, the types of media is getting changed into wider view one such as UHD, panoramic and jigsaw-like media. Especially, panoramic and jigsaw-like media is realized by stitching video clips, which are captured by different camera or devices. In order to stich those video clips, it is required to find out 2D Adjacency Matrix, which tells spatial relationships among those video clips. Discrete Cosine Transform (DCT), which is used as a compression transform method, can convert the each frame of video source from the spatial domain (2D) into frequency domain. Based on the aforementioned compressed features, 2D adjacency Matrix of images could be found that we can efficiently make the spatial map of the images by using DCT. This paper proposes a new method of generating 2D adjacency matrix by using DCT for producing a panoramic and jigsaw-like media through various individual video clips.

  • PDF

New Algorithm for Arbitrary-ratio Image Resizing in DCT Domain (DCT 영역에서 영상의 임의 비율 크기 변환을 위한 새로운 알고리즘)

  • Kim, Yong-Jae;Lee, Chang-Woo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.2C
    • /
    • pp.113-123
    • /
    • 2007
  • In Ubiquitous communication environment, various conversions of images are essential, and most digital images are compressed by standard methods such as the Joint Photographic Expert Group (JPEG) and Motion Picture Expert Group (MPEG) which are based on the discrete cosine transform (DCT). In this paper, various image resizing algorithms in the DCT domain are analyzed, and a new image resizing algorithm, which shows superior performance compared with the conventional methods, is proposed. For arbitrary-ratio image resizing in the DCT domain, several blocks of $8{\times}8$ DCT coefficients are converted into one block using the conversion formula in the proposed algorithm, and the size of the inverse discrete cosine transform (IDCT) is decided optimally. The performance is analyzed by comparing the peak signal to noise ratio (PSNR) between original images and converted images. The performance of the proposed algorithm is better than that of the conventional algorithm, since the correlation of pixels in images is utilized more efficiently.

A study on application of DCT algorithm with MVP(Multimedia Video Processor) (MVP(Multimedia Video Processor)를 이용한 DCT알고리즘 구현에 관한 연구)

  • 김상기;정진현
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1997.10a
    • /
    • pp.1383-1386
    • /
    • 1997
  • Discrete cosine transform(DCT) is the most popular block transform coding in lossy mode. DCT is close to statistically optimal transform-the Karhunen Loeve transform. In this paper, a module for DCT encoder is made with TMS320C80 based on JPEG and MPEG, which are intermational standards for image compression. the DCT encoder consists of three parts-a transformer, a vector quantizer and an entropy encoder.

  • PDF

A Visual Reconstruction of Core Algorithm for Image Compression Based on the DCT (discrete cosine transform) (이산코사인변환 기반 이미지 압축 핵심 알고리즘 시각적 재구성)

  • Jin, Chan-yong;Nam, Soo-tai
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2018.10a
    • /
    • pp.180-181
    • /
    • 2018
  • JPEG is a most widely used standard image compression technology. This research introduces the JPEG image compression algorithm and describes each step in the compression and decompression. Image compression is the application of data compression on digital images. The DCT (discrete cosine transform) is a technique for converting a time domain to a frequency domain. First, the image is divided into 8 by 8 pixel blocks. Second, working from top to bottom left to right, the DCT is applied to each block. Third, each block is compressed through quantization. Fourth, the array of compressed blocks that make up the image is stored in a greatly reduced amount of space. Finally if desired, the image is reconstructed through decompression, a process using IDCT (inverse discrete cosine transform).

  • PDF

High Speed 2D Discrete Cosine Transform Processor

  • Kim, Ji-Eun;Hae Kyung SEONG;Kang Hyeon RHEE
    • Proceedings of the IEEK Conference
    • /
    • 2002.07c
    • /
    • pp.1823-1826
    • /
    • 2002
  • On modern computer culture, the high quality data is required in multimedia systems. So, the technology of data compression fur data transmission is necessary now. This paper presents the pipeline architecture for the low and column address generator of 2D DCT/IDCT (Discrete Cosine Transform/Inverse Discrete Cosine Transform. In the proposed architecture, the area of hardware is reduced by using the DA (distributed arithmetic) method and applies the concepts of pipeline to the parallel architecture. As a result the designed pipeline of the low and column address generator for 2D DCT/IDCT architecture is implemented with an efficiency and high speed compared with the non-pipeline architecture.

  • PDF

A Simple Discrete Cosine Transform Systolic Array Based on DFT for Video Codec (DFT에 의한 비데오 코덱용 DCT의 단순한 시스톨릭 어레이)

  • 박종오;이광재;양근호;박주용;이문호
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.26 no.11
    • /
    • pp.1880-1885
    • /
    • 1989
  • In this paper, a new approach for systolic array realizing the discrete cosine transform (DCT) based on discrete Fourier transform (DFT) of an input sequence is presented. The proposed array is based on a simple modified DFT(MDFT) version of the Goertzel algorithm combined with Kung's approach and is proved perfectly. This array requires N cells, one multiplier and takes N clock cycles to produce a complete N-point DCT and also is able to process a continuous stream of data sequences. We have analyzed the output signal-to-noise ratio(SNR) and designed the circuit level layout of one-PE chip. The array coefficients are static adn thus stored-product ROM's can be used in place of multipliers to limit cost as eliminate errors due to coefficients quantization.

  • PDF

Inter Coding using DST-based Interpolation Filter (DST 기반 보간 필터를 이용한 인터 코딩)

  • Kim, MyungJun;Lee, Yung-Lyul
    • Journal of Broadcast Engineering
    • /
    • v.22 no.3
    • /
    • pp.321-326
    • /
    • 2017
  • High Efficiency Video Coding (HEVC) adopted the Discrete Cosine Transform-II (DCT-II) based interpolation filter to improve coding efficiency in motion compensation and estimation. In HEVC, the interpolation filters based on the DCT-II are composed of 8-point for half-pixel and 7-point for 1/4-pixel and 3/4-pixel. In this paper, a DST-VII based interpolation filter is used improve motion compensation and estimation. The experimental results which applied the DST-VII interpolation filter are presented. They show the 0.45% of average bitrate reduction in Random Access configuration and 0.5% of average bitrate reduction in Low Delay B configuration, respectively.

Search point displacement using DCT for Motion Estimation (움직임탐색에 있어서 DCT를 이용한 탐색점 배치)

  • 송지연;김준한;김상곤;윤영우
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 1999.10b
    • /
    • pp.407-409
    • /
    • 1999
  • 블록의 DCT계수를 이용하여 동영상 움직임 탐색(motion estimation)에서 탐색점 수를 결정하는 선택적 탐색 기법을 제안한다. DCT(Discrete Cosine Transform)에서 탐색점 수를 결정하는 선택적 탐색 기법을 제안한다. DCT(Discrete Cosine Transform) 연산과 블록정합 기법인 3단게 탐색기법을 기반으로 한다. DCT 연산 결과인 블록의 주파수성분에 가중치테이블을 적용하여 고주파성분을 많이 가진 블록일수록 탐색점의 수를 증가시켜 국부극소에 빠질 확률을 줄여 화질을 개선한다. MP@ML 영상테이터에 대해 제안된 기법을 사용하여 시뮬레이션하였다. 제안하는 기법은 3단계 탐색기법에 비하여 연산량은 증가하나, 연산량 증가에 비하여 좋은 화질을 제공한다.

  • PDF

Video Coding Algorithm Based on High Efficiency Video Coding (HEVC) and Hybrid Transforms

  • Wang, Chengyou;Shan, Rongyang;Zhou, Xiao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.9
    • /
    • pp.4448-4466
    • /
    • 2018
  • In recent years, due to its high efficiency and better performance, the high efficiency video coding (HEVC) has become the most common compression standard in the field of video coding. In this paper, the framework of HEVC is deeply analyzed, and an improved HEVC video coding algorithm based on all phase biorthogonal transform (APBT) is proposed, where APBT is utilized to replace the discrete cosine transform (DCT) and discrete sine transform (DST) in original HEVC standard. Based on the relationship between APBT and DCT, the integer APBT is deduced. To further improve the coding performance, an optimal HEVC video coding algorithm based on hybrid APBT is proposed. The coding performance of the proposed HEVC coding algorithm is improved without increasing the complexity. Experimental results show that compared with HEVC standard algorithm, the improved HEVC video coding algorithm based on hybrid APBT can improve the coding performance of chrominance components by about 0.3%.

Digital Cage Watermarking using Human Visual System and Discrete Cosine Transform (인지 시각시스템 및 이산코사인변환을 이용한 디지털 이미지 워터마킹)

  • 변성철;김종남;안병하
    • Journal of KIISE:Information Networking
    • /
    • v.30 no.1
    • /
    • pp.17-23
    • /
    • 2003
  • In this Paper. we Propose a digital watermarking scheme for digital images based on a perceptual model, the frequency masking, texture making, and luminance masking Properties of the human visual system(HVS), which have been developed in the context of image compression. We embed two types of watermark, one is pseudo random(PN) sequences, the other is a logo image. To embed the watermarks, original images are decomposed into $8\times8$ blocks, and the discrete cosine transform(DCT) is carried out for each block. Watermarks are casted in the low frequency components of DCT coefficients. The perceptual model adjusts adaptively scaling factors embedding watermarks according to the local image properties. Experimental results show that the proposed scheme presents better results than that of non-perceptual watermarking methods for image qualify without loss of robustness.