• Title/Summary/Keyword: Image Coding

Search Result 1,162, Processing Time 0.032 seconds

Hybrid Down-Sampling Method of Depth Map Based on Moving Objects (움직임 객체 기반의 하이브리드 깊이 맵 다운샘플링 기법)

  • Kim, Tae-Woo;Kim, Jung Hun;Park, Myung Woo;Shin, Jitae
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37A no.11
    • /
    • pp.918-926
    • /
    • 2012
  • In 3D video transmission, a depth map being used for depth image based rendering (DIBR) is generally compressed by reducing resolution for coding efficiency. Errors in resolution reduction are recovered by an appropriate up-sampling method after decoding. However, most previous works only focus on up-sampling techniques to reduce errors. In this paper, we propose a novel down-sampling technique of depth map that applies different down-sampling rates on moving objects and background in order to enhance human perceptual quality. Experimental results demonstrate that the proposed scheme provides both higher visual quality and peak signal-to-noise ratio (PSNR). Also, our method is compatible with other up-sampling techniques.

An Algorithm with Low Complexity for Fast Motion Estimation in Digital Video Coding (디지털 비디오 부호화에서의 고속 움직임 추정을 위한 저복잡도 알고리즘)

  • Lee, Seung-Chul;Kim, Min-Ki;Jeong, Je-Chang
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.12C
    • /
    • pp.1232-1239
    • /
    • 2006
  • In video standards such as MPEG-1/2/4 and H.264/AVC, motion estimation / compensation(ME/MC) process causes the most encoding complexity of video encoder. The full search method, which is used in general video codecs, exhausts much encoding time because it compares current macroblock with those at all positions within search window for searching a matched block. For the alleviation of this problem, the fast search methods such as TSS, NTSS, DS and HEXBS are exploited at first. Thereafter, DS based MVFAST, PMVFAST, MAS and FAME, which utilize temporal or spacial correlation characteristics of motion vectors, are developed. But there remain the problems of image quality degradation and algorithm complexity increase. In this thesis, the proposed algorithm maximizes search speed and minimizes the degradation of image quality by determining initial search point correctly and using simple one-dimension search patterns considering motion characteristics of each frame.

The Technique of Blocking Artifacts Reduction Method Based on Spatially Adaptive Image Restoration (공간 적응적 영상복원을 이용한 블록화 현상 제거 기법)

  • Kim, Tae-Keun;Woo, Hun-Bae;Paik, Joon-Ki
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.35S no.12
    • /
    • pp.46-54
    • /
    • 1998
  • In this paper we propose a fast adaptive image restoration filter using DCT-based block classification for reducing block artifacts in compressed images. In order to efficiently reduce block artifacts, edge direction of each block is classified by using the DCT coefficients, and the constrained least square (CLS) on the observation that the quantization operation in a series of coding process is a nonlinear and many-to-one mapping operator. And then we propose an approximated version of constrained optimization technique as a restoration process for removing the nonlinear and space-varying degradation operator. For real-time implementation, the proposed restoration filter can be realized in the form of a truncated FIR filter, which is suitable for postprocessing reconstructed images in HDTV, DVD, or video conference systems.

  • PDF

A Study on the Interframe Image Coding Using Motion Compensated and Classified Vector Quantizer (Ⅱ : Hardware Implementation) (이동 보상과 분류 벡터 양자화기를 이용한 영상 부호화에 관한 연구 (Ⅱ: 하드웨어 실현))

  • Jeon, Joong-Nam;Shin, Tae-Min;Choi, Sung-Nam;Park, Kyu-Tae
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.27 no.3
    • /
    • pp.21-30
    • /
    • 1990
  • This paper describes a hardware implementation of the interframe monochrome video CODEC using a MC-CVQ(Motion Compensated and Classified Vector Quantization) algorithm. The specifications of this CODEC are (1) the resolution of image is $128{\times}128$ pixels, and (2) the transmission rates are about 10frames/sec at the 64Kbps channel. In order to design the CODEC under these conditions, it is implemented by a multiprocessor system composed of MC unit, CVQ nuit and decoder unit, which are controlled by microprogramming technique. And the 3~stage pipelined ALU(Arithmetic and Logic Unit) is adopted to calculate the minimum error distance in the MC unit and CVQ nuit. The realized system shows that the transmission rates are 6-15 frames/sec according to the relative motion of the video signal.

  • PDF

A Balanced Binary Search Tree for Huffman Decoding (허프만 복호화를 위한 균형이진 검색 트리)

  • Kim Hyeran;Jung Yeojin;Yim Changhun;Lim Hyesook
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.5C
    • /
    • pp.382-390
    • /
    • 2005
  • Huffman codes are widely used for image and video data transmission. As the increase of real-time data, a lot of studies on effective decoding algorithms and architectures have been done. In this paper, we proposed a balanced binary search tree for Huffman decoding and compared the performance of the proposed architecture with that of previous works. Based on definitions of the comparison of codewords with different lengths, the proposed architecture constructs a balanced binary tree which does not include empty internal nodes, and hence it is very efficient in the memory requirement. Performance evaluation results using actual image data show that the proposed architecture requires small number of table entries, and the decoding time is 1, 5, and 2.41 memory accesses in minimum, maximum, and average, respectively.

DEVELOPMENT OF PRECISION ATTITUDE DETERMINATION SYSTEM FOR KOMPSAT-2

  • Yoon Jae-Cheol;Shin Dongseok;Lee Hungu;Lee Young-Ran;Lee Hyunjae;Bang Hyo-Choong;Cheon Yee-Jin;Shin Jae-Min;Moon Hong-Youl;Lee Sang-Ryool;Jeun Gab-Ho
    • Bulletin of the Korean Space Science Society
    • /
    • 2004.10b
    • /
    • pp.296-299
    • /
    • 2004
  • KARI precision attitude determination system has been developed for high accurate geo-coding of KOMPSAT-2 image. Sensor data from two star trackers and a IRU are used as measurement and dynamic data. Sensor data from star tracker are composed of QUEST and unit vector filter. Filter algorithms consists of extended Kalman filter, unscented Kalman filter, and least square batch filter. The type of sensor data and filter algorithm can be chosen by user options. Estimated parameters are Euler angle from 12000 frame to optical bench frame, gyro drift rate bias, gyro scale factor, misalignment angle of star tracker coordinate frame with respect to optical bench frame, and misalignment angle of gyro coordinate frame with respect to optical bench frame. In particular, ground control point data can be applied for estimating misalignment angle of star tracker coordinate frame. Through the simulation, KPADS is able to satisfy the KOMPSAT-2 mission requirement in which geo-location accuracy of image is 80 m (CE90) without ground control point.

  • PDF

Intra 16$\times$16 Mode Decision Using Subset of Transform Coefficients in H.264/AVC (H.264/AVC에서 변환계수의 부분집합을 사용한 인트라 16$\times$16 예측 모드 선택 방법)

  • Lim, Sang-Hee;Lee, Seong-Won;Paik, Joon-Ki
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.44 no.6
    • /
    • pp.54-62
    • /
    • 2007
  • In this paper, we significantly reduces the amount of computation for intra 16$\times$16 mode decision in H.264 by applying the fast algorithm, which obtains the transformed prediction residual with fewer computations. By extending the existing intra 4$\times$4 mode decision, we propose the new algorithm for fast intra 16$\times$16 mode decision. The proposed algorithm uses partial transform coefficients which consist of one DC and three adjacent AC coefficients after 4$\times$4 transform in the intra 16$\times$16 mode decision. Theoretical analysis and experimental results show that the proposed algorithm can reduce computations up to 50% in the intra 16$\times$16 mode decision process with unnoticeable degradation.

A Robust Algorithm for Moving Object Segmentation and VOP Extraction in Video Sequences (비디오 시퀸스에서 움직임 객체 분할과 VOP 추출을 위한 강력한 알고리즘)

  • Kim, Jun-Ki;Lee, Ho-Suk
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.8 no.4
    • /
    • pp.430-441
    • /
    • 2002
  • Video object segmentation is an important component for object-based video coding scheme such as MPEG-4. In this paper, a robust algorithm for segmentation of moving objects in video sequences and VOP(Video Object Planes) extraction is presented. The points of this paper are detection, of an accurate object boundary by associating moving object edge with spatial object edge and generation of VOP. The algorithm begins with the difference between two successive frames. And after extracting difference image, the accurate moving object edge is produced by using the Canny algorithm and morphological operation. To enhance extracting performance, we app]y the morphological operation to extract more accurate VOP. To be specific, we apply morphological erosion operation to detect only accurate object edges. And moving object edges between two images are generated by adjusting the size of the edges. This paper presents a robust algorithm implementation for fast moving object detection by extracting accurate object boundaries in video sequences.

A Fast Full Search Motion Estimation Algorithm using Partitioned Search Window (세분화된 탐색 영역을 이용한 고속 전영역 움직임 예측 알고리즘)

  • Park, Sang-Jun;Jin, Soon-Jong;Jeong, Je-Chang
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.1C
    • /
    • pp.9-15
    • /
    • 2007
  • We propose the fast full search algorithm that reduces the computation of the block matching algorithm which is used for motion estimation of the video coding. Since the conventional spiral search method starts searching at the center of the search window and then moves search point to estimate the motion vector pixel by pixel, it is good for the slow motion pictures. However the proposed method is good for the fast and slow motion because it estimates the motion in the new search order after partitioning the search window. Also, when finding the motion vector, this paper presents the method that reduces the complexity by computing the matching error in the order which is determined by local image complexity. The proposed algorithm reduces the computation up to 99% for block matching error compared with the conventional spiral full search algorithm without any loss of image quality.

Biomechanical Evaluation of Cement type hip Implants as Conditions of bone Cement and Variations of Stem Design (골시멘트 특성 및 스템 형상에 따른 시멘트 타입 인공관절의 생체역학적 평가)

  • Park, H.S.;Chun, H.J.;Youn, I.C.;Lee, M.K.;Choi, K.W.
    • Journal of Biomedical Engineering Research
    • /
    • v.29 no.3
    • /
    • pp.212-221
    • /
    • 2008
  • The total hip replacement (THR) has been used as the most effective way to restore the function of damaged hip joint. However, various factors have caused some side effects after the THR. Unfortunately, the success of the THR have been decided only by the proficiency of surgeons so far. Hence, It is necessary to find the way to minimize the side effect caused by those factors. The purpose of this study was to suggest the definite data, which can be used to design and choose the optimal hip implant. Using finite element analysis (FEA), the biomechanical condition of bone cement was evaluated. Stress patterns were analyzed in three conditions: cement mantle, procimal femur and stem-cement contact surface. Additionally, micro-motion was analyzed in the stem-cement contact surface. The 3-D femur model was reconstructed from 2-D computerized tomography (CT) images. Raw CT images were preprocessed by image processing technique (i.e. edge detection). In this study, automated edge detection system was created by MATLAB coding for effective and rapid image processing. The 3-D femur model was reconstructed based on anatomical parameters. The stem shape was designed using that parameters. The analysis of the finite element models was performed with the variation of parameters. The biomechanical influence of each parameter was analyzed and derived optimal parameters. Moreover, the results of FE A using commercial stem model (Zimmer's V erSys) were similar to the results of stem model that was used in this study. Through the study, the improved designs and optimal factors for clinical application were suggested. We expect that the results can suggest solutions to minimize various side effects.