• Title/Summary/Keyword: DCT coefficients

Search Result 295, Processing Time 0.027 seconds

Intra MB Prediction Mode Decision Method for Fast MPEG-2 to H.264/AVC Transcoding (고속 MPEG-2-H.264/AVC 변 환부호화를 위한 화면내 MB 예측 모드 결정 기법)

  • Liu, Xingang;Yoo, Kook-Yeol
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.12C
    • /
    • pp.1046-1054
    • /
    • 2008
  • Since the high quality digital TV systems are broadly deployed in the market, the digital video contents will be edited and distributed in MPEG-2 MP@HL fonnat. Due to its impressive coding efficiency, the H.264/AVC codec has rapidly replaced the MPEG-4 SP codec for mobile digital video terminal with low quality. For the bro ad distribution of digitial video contents produced in MPEG-2 format, the MPEG-2 to H.264/AVC transcoding is highly necessary nowadays. In this paper, we propose a fast intra MB prediction mode decision method to reduce the computational complexity in the transcoding, which is the main bottleneck in the transcoders. The proposed method is based on the several relationships such as DCT coefficients and edge orientation, correlation between prediction directions in the $Intra16{\times}16$ and $Intra4{\times}4$ modes, correlation between edge-orientations of luminance an d chrominance components. The simulation results show that the proposed method can reduce the computational complexity upto 70% and 40%, compared with the cascaded transcoder and the well-known fast intraframe transc oder, respectively.

Image Compression Using Edge Map And Multi-Sided Side Match Finite-State Vector Quantization (윤곽선 맵과 다중 면 사이드 매치 유한상태 벡터 양자화를 이용한 영상 압축)

  • Cho, Seong-Hwan;Kim, Eung-Sung
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.8 no.6
    • /
    • pp.1419-1427
    • /
    • 2007
  • In this paper, we propose an algorithm which implements a multi-sided side match finite-state vector quantization(MSMVQ). After extracting the edge information from an image and classifying the image into edge blocks or non-edge blocks, we construct an edge map. We subdivide edge blocks into sixteen classes using discrete cosine transform(DCT) AC coefficients. Based on edge map information, a state codebook is made from the master codebook, and side match calculation is done for two-sided or three-sided current block of image. For reducing transmitted bits, a decision is made whether or not to encode the non-edge blocks among the pre-coded blocks by using the master codebook. Also for reducing allocation bits of codeword indices to decoder, a variable length coder is used. Considering the comparison with side match finite-state vector quantization(SMVQ) and two-sided SMVQ(TSMVQ) algorithm about Zelda, Lenna, Bridge and Peppers image, the new algorithm shows better picture quality than SMVQ and TSMVQ respectively.

  • PDF

Key Frame Extraction and Region Segmentation-based Video Retrieval in Compressed Domain (압축영역에서의 대표프레임 추출 및 영역분할기반 비디오 검색 기법)

  • 강응관;김성주;송호근;최종수
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.9B
    • /
    • pp.1713-1720
    • /
    • 1999
  • This paper presents a new key frame extraction technique, for scene change detection, using the proposed AHIM (Accumulative Histogram Intersection Measure) from the DC image constructed by DCT DC coefficients in the compressed video sequence that is video compression standard such as MPEG. For fast content-based browsing and video retrieval in a video database, we also provide a novel coarse-to-fine video indexing scheme. In the extracted key frame, we perform the region segmentation as a preprocessing. First, the segmented image is projected with the horizontal direction, then we transform the result into a histogram, which is saved as a database index. In the second step, we calculate the moments and change them into a distance value. From the simulation results, the proposed method clearly shows the validity and superiority in respect of computation time and memory space, and that in conjunction with other techniques for indexing, such as color, can provide a powerful framework for image indexing and retrieval.

  • PDF

Tree structured wavelet transform coding scheme for digital HD-VCR (웨이브렛 변환계수의 트리구졸르 이용한 방송용 HD-VCR의 부호화 기법)

  • 김용규;정현민;이병래;강현철
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.8
    • /
    • pp.1790-1802
    • /
    • 1997
  • A wavelet transform coding method that fulfills the requirements of HD-VCR(high definition video casstte recorder) for studio applications in proposed. A constant bit rate is achieved by a forward rate control technique whcih determins the quantizer stepsize based on the coding results fo the previous frame. We also propose a two-level coder that consists of both the IDC(independently decodable code) and the DDC(dependently decodable code). To minimize error propagation, the transformed coefficients are restructured into transform blocks which are represented by a tree structure. The result shows thta the proposed coding scheme produces better picture quality with block effects than that of DCT(discrete cosine transform) based coding schemes at the same compression ratio. The proposed method meets most of the requirements of HD-VCR.

  • PDF

Content-based Shot Boundary Detection from MPEG Data using Region Flow and Color Information (영역 흐름 및 칼라 정보를 이용한 MPEG 데이타의 내용 기반 셧 경계 검출)

  • Kang, Hang-Bong
    • Journal of KIISE:Software and Applications
    • /
    • v.27 no.4
    • /
    • pp.402-411
    • /
    • 2000
  • It is an important step in video indexing and retrieval to detect shot boundaries on video data. Some approaches are proposed to detect shot changes by computing color histogram differences or the variances of DCT coefficients. However, these approaches do not consider the content or meaningful features in the image data which are useful in high level video processing. In particular, it is desirable to detect these features from compressed video data because this requires less processing overhead. In this paper, we propose a new method to detect shot boundaries from MPEG data using region flow and color information. First, we reconstruct DC images and compute region flow information and color histogram differences from HSV quantized images. Then, we compute the points at which region flow has discontinuities or color histogram differences are high. Finally, we decide those points as shot boundaries according to our proposed algorithm.

  • PDF

Rotation and Scale Invariant Face Detection Using Log-polar Mapping and Face Features (Log-polar변환과 얼굴특징추출을 이용한 크기 및 회전불변 얼굴인식)

  • Go Gi-Young;Kim Doo-Young
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.6 no.1
    • /
    • pp.15-22
    • /
    • 2005
  • In this paper, we propose a face recognition system by using the CCD color image. We first get the face candidate image by using YCbCr color model and adaptive skin color information. And we use it initial curve of active contour model to extract face region. We use the Eye map and mouth map using color information for extracting facial feature from the face image. To obtain center point of Log-polar image, we use extracted facial feature from the face image. In order to obtain feature vectors, we use extracted coefficients from DCT and wavelet transform. To show the validity of the proposed method, we performed a face recognition using neural network with BP learning algorithm. Experimental results show that the proposed method is robuster with higher recogntion rate than the conventional method for the rotation and scale variant.

  • PDF

Digital watermarking algorithm for authentication and detection of manipulated positions in MPEG-2 bit-stream (MPEG-2비트열에서의 인증 및 조작위치 검출을 위한 디지털 워터마킹 기법)

  • 박재연;임재혁;원치선
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.40 no.5
    • /
    • pp.378-387
    • /
    • 2003
  • Digital watermarking is the technique that embeds invisible signalsincluding owner identification information, specific code, or pattern into multimedia data such as image, video and audio. Watermarking techniques can be classified into two groups; robust watermarking and fragile(semi-fragile) watermarking. The main purpose of the robust watermarking is the protection of copyright, whereas fragile(semi-fragile) watermarking prevents image or video data from illegal modifications. To achieve this goal watermark should survive from unintentional modifications such as random noise or compression, but it should be fragile for malicious manipulations. In this paper, an invertible semi-fragile watermarkingalgorithm for authentication and detection of manipulated location in MPEG-2 bit-stream is proposed. The proposed algorithm embeds two kinds of watermarks, which are embedded into quantized DCT coefficients. So it can be applied directly to the compressed bit-stream. The first watermark is used for authentication of video data. The second one is used for detection of malicious manipulations. It can distinguish transcodingin bit-stream domain from malicious manipulation and detect the block-wise locations of manipulations in video data. Also, since the proposed algorithm has an invertible property, recovering original video data is possible if the watermarked video is authentic.

An Efficient Coding Technique of Holographic Video Signal using 3D Segment Scanning (분할영역의 3차원 스캐닝을 이용한 홀로그래픽 비디오 신호의 효율적인 부호화 기술)

  • Seo, Young-Ho;Choi, Hyun-Jun;Kim, Dong-Wook
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.2C
    • /
    • pp.132-140
    • /
    • 2007
  • In this paper, we proposed a new technique to encode and decode the digital hologram. Since the digital hologram (or fringe pattern) is generated by interference of light, it has much different property from natural 2D (2 dimensional) images. First, we acquisite optical-sensed or computer-generated hologram by digital type, and then extract a chrominance component. The extracted digital hologram for coding is separated into segments to use multi-view properties. The segmented hologram shows the similar characteristics with picturing an object with 2D cameras in various point of view. Since fringe pattern is visually observed like as noise, we expect that the fringe pattern has poor coding efficiency. To obtain high efficiency, the segment is transformed with DCT (Discrete Cosine Transform) which resembles hologram generation process with high performance. Each transformed segment passes the 3D scanning process according to time and spatial correlation, and is organized into a video stream. Since the segment which correspond to frame of a video stream consists of the transformed coefficients with wide range of value, it is classified and re-normalized. Finally it is compressed with coding tools. The proposed algorithm illustrated that it has better properties for reconstruction of 16 times higher compression rate than the previous researches.

Improvement of Image Compression Using EZW Based in HWT (HWT에 기초한 EZW를 이용한 영상압축 개선)

  • Kim, Jang-Won
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.12
    • /
    • pp.2641-2646
    • /
    • 2011
  • In this paper, we studied that the EZW algorithm based in HWT was proposed effective compression technique of wavelet transformed image. The proposed Haar-EZW algorithm is that image was coding by zerotree coding technique using self-similarity of HWT coefficients. If the HWT coefficient is larger than the threshold, that is coding to POS. If the HWT coefficient is smaller than the threshold, that is coding to NEG. If the HWT coefficient is larger than the root of zerotree, that is coding to ZTR. If the HWT coefficient is smaller then the threshold, and if that is not the root of zerotree, that is coding to IZ. This process is repeated until all the HWT coefficients have been encoded completely. This paper is compared Haar-EZW algorithm with Daubechies and Antonini. As the results of compare, it is shown that the PSNR of the Haar-EZW algorithm is better than Daubechies's and Antonini's.

Optimal Sub-bands Decision for Robust Watermarking (강건한 워터마킹을 위한 최적 부대역 결정)

  • Kim, Yoon-Ho;Kim, Tae-Gon
    • Journal of Advanced Navigation Technology
    • /
    • v.11 no.1
    • /
    • pp.105-111
    • /
    • 2007
  • This paper is concerned with fuzzy inference-based optimal sub-bands decision scheme which is to be embedded the watermark. It concentrated not only on design of fuzzy inference algorithm but also on human visual parameters (HVP), such as contrast sensitivity, texture degree. In the first, such human visual parameters as contrast sensitivity, texture degree as well as statistical characteristics are involved to select the optimal coefficients region. Secondly, fuzzy if - then rule which can be able to adapt the wide variety of environments is developed. The performance of proposed approach is evaluated with respect to the imperceptibility and correctness of watermark. According to some experimental results, contrast sensitivity function is superior in smooth image. On the other hand, statistical characteristics provide good results in rough images.

  • PDF