• 제목/요약/키워드: discrete cosine transform(DCT)

검색결과 346건 처리시간 0.022초

Multiple Description Coding Using Directional Discrete Cosine Transform

  • Lama, Ramesh Kumar;Kwon, Goo-Rak
    • Journal of information and communication convergence engineering
    • /
    • 제11권4호
    • /
    • pp.293-297
    • /
    • 2013
  • Delivery of high quality video over a wide area network with large number of users poses great challenges for the video communication system. To ensure video quality, multiple descriptions have recently attracted various attention as a way of encoding and visual information delivery over wireless network. We propose a new efficient multiple description coding (MDC) technique. Quincunx lattice sub-sampling is used for generating multiple descriptions of an image. In this paper, we propose the application of a directional discrete cosine transform (DCT) to a sub-sampled quincunx lattice to create an MDC representation. On the decoder side, the image is decoded from the received side information. If all the descriptions arrive successfully, the image is reconstructed by combining the descriptions. However, if only one side description is received, decoding is executed using an interpolation process. The experimental results show that such the directional DCT can achieve a better coding gain as well as energy packing efficiency than the conventional DCT with re-alignment.

이산코사인변환 기반 이미지 압축 알고리즘에 관한 재구성 (Rebuilding of Image Compression Algorithm Based on the DCT (discrete cosine transform))

  • 남수태;진찬용
    • 한국정보통신학회논문지
    • /
    • 제23권1호
    • /
    • pp.84-89
    • /
    • 2019
  • JPEG은 가장 널리 사용되는 이미지 압축 표준 기술이다. 본 논문에서는 JPEG 이미지 압축 알고리즘을 소개하고 압축 및 압축 해제의 각 단계를 서술하고자 한다. 이미지 압축은 디지털 이미지를 데이터 압축을 적용하는 과정이다. 이산코사인변환은 시간 도메인에서 주파수 도메인으로 변환하는 기술이다. 먼저, 이미지는 8 by 8 픽셀 블록으로 분할하게 된다. 둘째, 위에서 아래로 왼쪽에서 오른쪽으로 진행하면서 DCT가 각각의 블록에 적용하게 된다. 셋째, 각 블록은 양자화를 통해 압축을 진행한다. 넷째, 이미지를 구성하는 압축된 블록의 행렬은 크게 줄어든 공간에 저장된다. 끝으로, 원하는 경우 이미지는 역이산코사인변환(IDCT)을 사용하는 프로세스인 압축 해제를 통해 재구성하게 된다. 본 연구에서는 이산코사인변환 기법을 이용해 이미지 압축/복원 및 재구성하는 것에 목적을 두고 있다.

비디오 코딩을 위한 선형성을 이용한 역변환 방법 (Inverse Transform Using Linearity for Video Coding)

  • 송현주;김명준;이영렬
    • 한국방송∙미디어공학회:학술대회논문집
    • /
    • 한국방송∙미디어공학회 2021년도 추계학술대회
    • /
    • pp.37-40
    • /
    • 2021
  • 비디오 압축 시 변환(transform)은 예측을 통해 만들어진 공간 영역에서의 잔차신호를 주파수 영역으로 변환함으로써 낮은 주파수 대역으로 에너지를 이동시켜 비디오 압축에서 중요한 역할을 수행한다. VVC(Versatile Video Coding)에서는 DCT-II(Discrete Cosine Transform-II), DST-VII(Discrete Sine Transform-VII), DCTVIII(Discrete Cosine Transform-VIII)를 이용하여 잔차신호 변환을 수행한다. 본 논문에서는 DCT-II, DST-VII, DCT-VIII 가 모두 선형 변환(linear transform)이라는 점에서 착안하여 변환의 선형성을 이용하여 계산량을 감소시키는 역변환을 제안한다. 실험결과 변환 수행 시 약 12.7%의 시간이 감소되는 것을 확인하였다.

  • PDF

VLSI 병렬 연산을 위한 여현 변환 알고리듬 (Discrete Cosine Transform Algorithms for the VLSI Parallel Implementation)

  • 조남익;이상욱
    • 대한전자공학회논문지
    • /
    • 제25권7호
    • /
    • pp.851-858
    • /
    • 1988
  • In this paper, we propose two different VLSI architectures for the parallel computation of DCT (discrete cosine transform) algorithm. First, it is shown that the DCT algorithm can be implemented on the existing systolic architecture for the DFT(discrete fourier transform) by introducing some modification. Secondly, a new prime factor DCT algorithm based on the prime factor DFT algorithm is proposed. And it is shown that the proposed algorihtm can be implemented in parallel on the systolic architecture for the prime factor DFT. However, proposed algorithm is only applicable to the data length which can be decomposed into relatively prime and odd numbers. It is also found that the proposed systolic architecture requires less multipliers than the structures implementing FDCT(fast DCT) algorithms directly.

  • PDF

Fingerprint Matching Based on Dimension Reduced DCT Feature Vectors

  • Bharkad, Sangita;Kokare, Manesh
    • Journal of Information Processing Systems
    • /
    • 제13권4호
    • /
    • pp.852-862
    • /
    • 2017
  • In this work a Discrete Cosine Transform (DCT)-based feature dimensionality reduced approach for fingerprint matching is proposed. The DCT is applied on a small region around the core point of fingerprint image. The performance of our proposed method is evaluated on a small database of Bologna University and two large databases of FVC2000. A dimensionally reduced feature vector is formed using only approximately 19%, 7%, and 6% DCT coefficients for the three databases from Bologna University and FVC2000, respectively. We compared the results of our proposed method with the discrete wavelet transform (DWT) method, the rotated wavelet filters (RWFs) method, and a combination of DWT+RWF and DWT+(HL+LH) subbands of RWF. The proposed method reduces the false acceptance rate from approximately 18% to 4% on DB1 (Database of Bologna University), approximately 29% to 16% on DB2 (FVC2000), and approximately 26% to 17% on DB3 (FVC2000) over the DWT based feature extraction method.

정수 직교 겹침 변환을 이용한 이미지 압축 (Image Compression Using Integer Lapped Orthogonal Transform)

  • 이상호;장준호;김영섭;임상민
    • 반도체디스플레이기술학회지
    • /
    • 제8권3호
    • /
    • pp.45-50
    • /
    • 2009
  • Recently, block-based transforms, like discrete cosine transform (DCT), have been widely used in image and video coding standards, but block-based transforms have a weak point with blocking effect. However, the integer lapped orthogonal transform (ILOT) is a tool for block-based coding with bases functions that overlap near blocks, so it has a strong point against blocking effect. Although it has slightly higher arithmetic complexity than the DCT, the coding gain is significantly higher with much less blocking artifacts. This paper introduces the integer lapped orthogonal transforms and discrete cosine transform. And we compare the performance of DCT with ILOT which is proposed a new efficient method for image coding applications.

  • PDF

DCT 행렬 분해에 관한 연구 (On Factorizing the Discrete Cosine Transform Matrix)

  • 최태영
    • 한국통신학회논문지
    • /
    • 제16권12호
    • /
    • pp.1236-1248
    • /
    • 1991
  • 행렬 분해방식에 의한 새로운 고속 DCT 연산 방법을 유도하였다. N점 DCT변환을 N/2점 DCT 변환과 2개의 N/4점 변환들로 얻을수 있었다. 이 방법은 곱셈작용이 대부분 신호 흐름도상의 출력단에 가깝게 있게 되어 유한길이 연산인 경우에 발생하는 반올림 오차량이 기존의 Lee와 Chen 방법에 비하여 배우 적다는 점이 장점이다. 그리고 곱셈작용의 위치는 다르지만 동일 연산량을 갖는 또다른 3개의 DCT 행렬분해 결과도 보였다.

  • PDF

Optimal Controller Design of One Link Inverted Pendulum Using Dynamic Programming and Discrete Cosine Transform

  • Kim, Namryul;Lee, Bumjoo
    • Journal of Electrical Engineering and Technology
    • /
    • 제13권5호
    • /
    • pp.2074-2079
    • /
    • 2018
  • Global state space's optimal policy is used for offline controller in the form of table by using Dynamic Programming. If an optimal policy table has a large amount of control data, it is difficult to use the system in a low capacity system. To resolve these problem, controller using the compressed optimal policy table is proposed in this paper. A DCT is used for compression method and the cosine function is used as a basis. The size of cosine function decreased as the frequency increased. In other words, an essential information which is used for restoration is concentrated in the low frequency band and a value of small size that belong to a high frequency band could be discarded by quantization because high frequency's information doesn't have a big effect on restoration. Therefore, memory could be largely reduced by removing the information. The compressed output is stored in memory of embedded system in offline and optimal control input which correspond to state of plant is computed by interpolation with Inverse DCT in online. To verify the performance of the proposed controller, computer simulation was accomplished with a one link inverted pendulum.

Inverse-Orthogonal Jacket-Haar, DCT 변환 (Inverse-Orthogonal Jacket-Haar and DCT Transform)

  • 박주용;엠디 하심 알리 칸;김정수;이문호
    • 전자공학회논문지
    • /
    • 제51권9호
    • /
    • pp.30-40
    • /
    • 2014
  • 본 논문에서는 Hadamard 변환이 Jacket 변환으로 일반화 될 수 있는 것처럼 Haar 변환을 Jacket-Haar 변환으로 일반화 한다. Jacket-Haar 변환의 원소는 0 과 ${\pm}2^k$ 이다. original Haar 변환과 비교해서 Jacket-Haar 변환의 베이시스(basis)는 신호처리에 보다 적합하다. 응용으로 $2{\times}2$ Hadamard 행렬을 기반으로 한 DCT-II(discrete cosine transform-II)와 $2{\times}2$ Haar 행렬을 기반으로 한 HWT(Haar Wavelete transform)를 제시하고 이들의 성능을 분석하며 Lenna 이미지의 시뮬레이션을 통해 성능을 평가하였다.

A Low Frequency Band Watermarking with Weighted Correction in the Combined Cosine and Wavelet Transform Domain

  • Deb, Kaushik;Al-Seraj, Md. Sajib;Chong, Ui-Pil
    • 융합신호처리학회논문지
    • /
    • 제14권1호
    • /
    • pp.13-20
    • /
    • 2013
  • A combined DWT and DCT based watermarking technique of low frequency watermarking with weighted correction is proposed. The DWT has excellent spatial localization, frequency spread and multi-resolution characteristics, which are similar to the theoretical models of the human visual system (HVS). The DCT based watermarking techniques offer compression while DWT based watermarking techniques offer scalability. These desirable properties are used in this combined watermarking technique. In the proposed method watermark bits are embedded in the low frequency band of each DCT block of selected DWT sub-band. The weighted correction is also used to improve the imperceptibility. The extracting procedure reverses the embedding operations without the reference of the original image. Compared with the similar approach by DCT based approach and DWT based approach, the experimental results show that the proposed algorithm apparently preserves superiori mage quality and robustness under various attacks such as JPEG compression, cropping, sharping, contrast adjustments and so on.