• Title/Summary/Keyword: the DCT

Search Result 1,146, Processing Time 0.026 seconds

Feature Extraction of Disease Region in Stomach Images Based on DCT (DCT기반 위장영상 질환부위의 특징추출)

  • Ahn, Byeoung-Ju;Lee, Sang-Bock
    • Journal of the Korean Society of Radiology
    • /
    • v.6 no.3
    • /
    • pp.167-171
    • /
    • 2012
  • In this paper, we present an algorithm to extract features about disease region in digital stomach images. For feature extraction, DCT coefficients of gastrointestinal imaging matrix was obtained. DCT coefficent matrix is concentrated energy in low frequency region, we were extracted 128 feature parameters in low frequency region. Extracted feature parameters can using for differential compression of PACS and, can using for input parameter in CAD.

DCT Implementation on FPGA for HDTV Encoder (FPGA를 이용한 HDTV인코더를 위한 DCT회로의 구현)

  • 김우철;정규철;고광철;정재명
    • Proceedings of the IEEK Conference
    • /
    • 2002.06d
    • /
    • pp.235-238
    • /
    • 2002
  • This paper presents a way of a novel FPGA implementation of DCT. It shows how to limit the required bits on each DCT processing step, instead of implementing high-cost 64-bit floating-point arithmetic of IEEE Std 754-1985 on FPGA. ID-DCT implementation has been done which operates at 30 frame per second with 1920${\times}$1080 resolution.

  • PDF

Inverse quantization of DCT coefficients using Laplacian pdf (Laplacian pdf를 적용한 DCT 계수의 역양자화)

  • 강소연;이병욱
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.6C
    • /
    • pp.857-864
    • /
    • 2004
  • Many image compression standards such as JPEG, MPEG or H.263 are based on the discrete cosine transform (DCT) and quantization method. Quantization error. is the major source of image quality degradation. The current dequantization method assumes the uniform distribution of the DCT coefficients. Therefore the dequantization value is the center of each quantization interval. However DCT coefficients are regarded to follow Laplacian probability density function (pdf). The center value of each interval is not optimal in reducing squared error. We use mean of the quantization interval assuming Laplacian pdf, and show the effect of correction on image quality. Also, we compare existing quantization error to corrected quantization error in closed form. The effect of PSNR improvements due to the compensation to the real image is in the range of 0.2 ∼0.4 ㏈. The maximum correction value is 1.66 ㏈.

Face Recognition Using DCT/LDA (DCT/LDA를 이용한 얼굴 인식)

  • 이흔진;박현선;김경수;김희정;정병희;하명환;김회율
    • Proceedings of the IEEK Conference
    • /
    • 2003.07e
    • /
    • pp.2024-2027
    • /
    • 2003
  • 본 논문에서는 얼굴 인식 분야에서 사용되는 PCA/LDA 알고리즘을 대신하기 위해 DCT/LDA 알고리즘을 제안하였다. PCA/LDA를 이용한 얼굴 인식의 경우 PCA 를 이용하여 얼굴 영상을 적은 수의 특징 값으로 표현한 다음 LDA를 수행한다. 그러나 PCA는 트레이닝 과정의 계산량이 많고 트레이닝 셋이 변할 때마다 기저 벡터가 변화한다. PCA/LDA의 단점을 개선하기 위해 계산량이 적고 기저 벡터가 일정한 DCT의 계수를 사용한다. DCT/LDA를 사용할 경우 특징 값을 빠르게 추출하면서 PCP/LDA와 유사한 성능을 얻을 수 있다. 실험을 통하여 포즈 변화와 조명 변화가 있는 얼굴 데이터 셋에서 최고 97.8%의 인식률을 보였다.

  • PDF

Face Recognition using High-order Local Pattern Descriptor and DCT-based Illuminant Compensation (DCT 기반의 조명 보정과 고차 지역 패턴 서술자를 이용한 얼굴 인식)

  • Choi, Sung-Woo;Kwon, Oh-Seol
    • Journal of Broadcast Engineering
    • /
    • v.21 no.1
    • /
    • pp.51-59
    • /
    • 2016
  • This paper presents a method of DCT-based illuminant compensation to enhance the accuracy of face recognition under an illuminant change. The basis of the proposed method is that the illuminant is generally located in low-frequency components in the DCT domain. Therefore, the effect of the illuminant can be compensated by controlling the low-frequency components. Moreover, a directional high-order local pattern descriptor is used to detect robust features in the case of face motion. Experiments confirm the performance of the proposed algorithm got up to 95% when tested using a real database.

Discontinuity Detection in the DCT Domain for Real-Time Processing (실시간 처리를 위한 DCT 영역에서의 불연속 경계 검출)

  • Kim, Tae-Yong;Han, Jun-Hui
    • Journal of KIISE:Software and Applications
    • /
    • v.28 no.2
    • /
    • pp.141-148
    • /
    • 2001
  • DCT(Discrete Cosine Transform) 변환은 MPEG과 JPEG 표준에 의하여 영상이나 비디오 영상을 압축하는데 사용되어져 왔다. 본 연구에서는 이상적인 경계가 관련된 특성을 유도하고, 실시간 처리를 위하여 모델에 바탕을 둔 DCT 영역에서의 불연속 경계 평가 방법을 제안한다. 이 방법은 방향 검증과 위치 정렬 등의 평가로 구성된다. 두 가지의 평가 방법에 의하여 경계의 다양한 방향과위치를 알 수 있으며, DCT 계수들을 표준화된 형식으로 정렬시킬 수 있고, 표준화된 DCT 계수에서 이상적인 계단 경계의 특성과 비교하여 경계의 크기를 산출할 수 있다. DCT 계수가 8x8의 블록 단위로 이루어져 있어 경계의 표현이 조밀하지는 않지만 처리 시간이 빠르고 잡음에 강한 특성을 가지고 있어 다양한 실시간 응용분야에 사용될 수 있을 것이다.

  • PDF

Intra Frame transcoding Scheme based on DCT-domain for H.264 Transcoding (H.264 변환을 위한 DCT 도메인에서의 Intra 프레임 변환 기법)

  • 강진미;이주경;정기동
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2004.10c
    • /
    • pp.460-462
    • /
    • 2004
  • 최신의 동영상 압축 표준인 H.264[1]는 기존의 동영상 압축 표준에 비해 압축 성능이 매우 높으며 4$\times$4 DCT(Discrete Cosine Transform)를 수행하는 특징이 있다. H.264 표준에서는 압축 효율을 높이기 위해 Intra 프레임 내의 이웃한 픽셀칸의 연관성을 이용한 프레임 내 창조(Intra Prediction)를 수행한다. 그러므로 기존의 동영상 압축 데이터를 H.264로 변환하기 위해서는 intra 프레임의 프레임 내 창조와 8$\times$8 DCT 블록의 4$\times$4 정수형 DCT 블록으로의 변환을 필수적으로 수행해야 한다. 또한, Intra 프레임은 GOP 내의 다른 프레임의 창조 대상이 되므로 변환 시 화질의 최적화가 필수적이다[2]. 본 논문에서는 Intra 프레임의 변환 시 화질의 최적화를 위해 DCT 도메인 상에서 프레임 내 창조를 수행하는 기법을 제안한다. 제안된 기법은 추가적인 계산없이 DCT 변환으로 인한 오류를 줄여 변환된 intra 프레임의 화질을 개선할 수 있다.

  • PDF

Upsampling and Downsampling using DCT Coefficients (DCT 변환 계수를 이용한 축소/확대)

  • Park, Il-Chul;Kwon, Goo-Rak
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.8
    • /
    • pp.1714-1719
    • /
    • 2011
  • High quality image processing schemes are used more widely than ever according to the development of various visual media. We need a compressed form of image for sending more capacity and a controlling strategy of images for small display devices. In this paper, we propose an image upsampling and downsamplig scheme using DCT coefficients for those purposes. Our scheme is designed to control the size of picture based on the target display media by reducing the data in DCT domain while not increasing the computational burdens. With the power of controlling the resolution in DCT domain, the proposed method shows higher PSNR than other competing methods in experiment.

Area and Power Efficient VLSI Architecture for Two Dimensional 16-point Modified Gate Diffusion Input Discrete Cosine Transform

  • Thiruveni, M.;Shanthi, D.
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • v.16 no.4
    • /
    • pp.497-505
    • /
    • 2016
  • The two-dimensional (2D) Discrete Cosine Transform (DCT) is used widely in image and video processing systems. The perception of human visualization permits us to design approximate rather than exact DCT. In this paper, we propose a digital implementation of 16-point approximate 2D DCT architecture based on one-dimensional (1D) DCT and Modified Gate Diffusion Input (MGDI) technique. The 8-point 1D Approximate DCT architecture requires only 12 additions for realization in digital VLSI. Additions can be performed using the proposed 8 transistor (8T) MGDI Full Adder which reduces 2 transistors than the existing 10 transistor (10T) MGDI Full Adder. The Approximate MGDI 2D DCT using 8T MGDI Full adders is simulated in Tanner SPICE for $0.18{\mu}m$ CMOS process technology at 100MHZ.The simulation result shows that 13.9% of area and 15.08 % of power is reduced in the 8-point approximate 2D DCT, 10.63 % of area and 15.48% of power is reduced in case of 16-point approximate 2D DCT using 8 Transistor MGDI Full Adder than 10 Transistor MGDI Full Adder. The proposed architecture enhances results in terms of hardware complexity, regularity and modularity with a little compromise in accuracy.

Design of Sigma Filter in DCT Domain and its application (DCT영역에서의 시그마 필터설계와 응용)

  • Kim, Myoung-Ho;Eom, Min-Young;Choe, Yoon-Sik
    • Proceedings of the KIEE Conference
    • /
    • 2004.11c
    • /
    • pp.178-180
    • /
    • 2004
  • In this work, we propose new method of sigma filtering for efficient filtering and preserving edge regions in DCT Domain. In block-based image compression technique, the image is first divided into non-overlapping $8{\times}8$ blocks. Then, the two-dimensional DCT is computed for each $8{\times}8$ block. Once the DCT coefficients are obtained, they are quantized using a specific quantization table. Quantization of the DCT coefficients is a lossy process, and in this step, noise is added. In this work, we combine IDCT matrix and filter matrix to a new matrix to simplify filtering process to remove noise after IDCT in spatial domain, for each $8{\times}8$ DCT coefficient block, we determine whether this block is edge or homogeneous region. If this block is edge region, we divide this $8{\times}8$ block into four $4{\times}4$ sub-blocks, and do filtering process for sub-blocks which is homogeneous region. By this process, we can remove blocking artifacts efficiently preserving edge regions at the same time.

  • PDF