• Title/Summary/Keyword: 가변 블록 크기

Search Result 118, Processing Time 0.027 seconds

Variable Block Size Motion Estimation Techniques for The Motion Sequence Coding (움직임 영상 부호화를 위한 가변 블록 크기 움직임 추정 기법)

  • 김종원;이상욱
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.30B no.4
    • /
    • pp.104-115
    • /
    • 1993
  • The motion compensated coding (MCC) technique, which exploits the temporal redundancies in the moving images with the motion estimation technique,is one of the most popular techniques currently used. Recently, a variable block size(VBS) motion estimation scheme has been utilized to improve the performance of the motion compensted coding. This scheme allows large blocks to the used when smaller blocks provide little gain, saving rates for areas containing more complex motion. Hence, a new VBS motion estimation scheme with a hierarchical structure is proposed in this paper, in order to combine the motion vector coding technique efficiently. Topmost level motion vector, which is obtained by the gain/cost motion estimation technique with selective motion prediction method, is always transmitted. Thus, the hierarchical VBS motion estimation scheme can efficiently exploit the redundancies among neighboring motion vectors, providing an efficient motion vector encoding scheme. Also, a restricted search with respect to the topmost level motion vector enables more flexible and efficient motion estimation for the remaining lower level blocks. Computer simulations on the high resolution image sequence show that, the VBS motion estimation scheme provides a performance improvement of 0.6~0.7 dB, in terms of PSNR, compared to the fixed block size motion estimation scheme.

  • PDF

An Improved Motion Compensated Temporal Filtering for Efficient Scalable Video Coding (효율적인 스케일러블 비디오 부호화를 위한 향상된 움직임 보상 시간적 필터링 방법)

  • Jeon, Ki-Cheol;Kim, Jong-Ho;Jeong, Je-Chang
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.5C
    • /
    • pp.520-529
    • /
    • 2007
  • In this paper, we study the characteristics of parameters which are related to performance of MCTF which is a key technique for wavelet-based scalable video coding, and propose an improved MCTF method. The proposed MCTF method adopts the motion estimation of which motion vector field is distributed more uniformly using variable block sizes. By using the proposed method, the decomposition performance of temporal filter is improved, and the energy in high-frequency frames is reduced. It can help the entropy coder to generate lower bitrate. From simulation results, we verify the decomposed energy on high-frequency frame using the proposed method is reduced by 25.86% at the most in terms of variance of the high-frequency frame.

A View Interpolation Method for Multi-view Video of Large Disparity (변위 범위가 큰 다시점 비디오에 적합한 영상보간법)

  • Lee, Cheon;Oh, Kwan-Jung;Ho, Yo-Sung
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2006.11a
    • /
    • pp.55-58
    • /
    • 2006
  • 차세대 방송서비스 개발의 일환으로 관심을 모으고 있는 다시점 비디오 부호화(multi-view video coding, MVC) 방식은 인접한 여러 대의 카메라로 동시에 획득한 영상을 효과적으로 압축하는데 그 목적이 있다. 이때, 중간시전 영상을 생성하여 부호화하는 과정의 참조영상으로 이용할 수 있으며, 이를 위해서는 다시점 비디오 특성에 맞는 영상보간 방법이 필요하다. 기존에 제안되었던 영상보간법은 변위의 검색범위를 초기에 설정하여 블록정합을 이용하여 화소 단위로 변위를 측정하기 때문에 카메라 사이의 거리가 크거나 객체의 움직임이 커서 변위의 변동이 심한 영상에서는 안정적인 화질의 영상을 얻기 어렵다. 또한, 고정된 크기의 블록을 이용하여 전체 변위를 측정하므로 객체의 변위차가 큰 영역에서 변위 오류가 많이 발생한다. 본 논문에서는 이와 같은 문제를 해결하여 보다 개선된 화질의 중간시점 영상을 얻기 위한 새로운 영상보간법을 제안한다. 영역분할을 이용한 초기의 변위측정 과정에서, 처음부터 최대 변위의 범위를 설정하는 대신에 블록 단위로 대략적인 변위륵 측정한 후에, 가변 블록을 이용하여 보다 세밀한 변위를 측정한다. 이 방법은 변위차가 큰 객체의 경계 부분에서 보다 정확하게 변위를 측정 할 수 있으므로, 화소 단위로 변위를 측정할 때 이전에 추한 변위 정보를 바탕으로 각 화소별로 검색 범위를 설정한다. 적응적으로 설정된 검색 범위를 이용하여 화소 단위의 변위를 측정하면 보다 개선된 변위를 얻을 수 있다. 추가적으로, 변위측정 과정에서 발생하는 변위의 오류를 최대한 줄이기 위해 각 단계별로 미디언 필터를 이용하여 변위 오류를 수정하였다. 본 논문에서 제안한 방법으로 실험한 결과 기존의 영상보간 방법보다 화질이 약 $1{\sim}4dB$ 정도 개선되었다.필, 투명도 등을 위성원격탐사 자료와 GIS를 이용하여 공간분석을 실시하고, 공간분포도를 작성함으로써 대상해역의 해양환경을 파악하였다. 본 연구결과, 분석된 위성자료가 현장조사에 의한 검증이 이루어지지 않을 경우, 영상자료분석을 통한 표층수온 추출은 대기 중의 수증기와 에어로졸에 의한 계산치의 오차가 반영되기 때문에 실측치 보다 낮게 평가 될 수 있으므로, 반드시 이에 대한 검증이 필요함을 알 수 있었다. 현지관측에 비해 막대한 비용과 시간을 절약할 수 있는 위성영상해석방법을 이용한 방법은 해양수질파악이 가능할 것으로 판단되며, GIS를 이용하여 다양하고 복잡한 자료를 데이터베이스화함으로써 가시화하고, 이를 기초로 공간분석을 실시함으로써 환경요소별 공간분포에 대한 파악을 통해 수치모형실험을 이용한 각종 환경영향의 평가 및 예측을 위한 기초자료로 이용이 가능할 것으로 사료된다.염총량관리 기본계획 시 구축된 모형 매개변수를 바탕으로 분석을 수행하였다. 일차오차분석을 이용하여 수리매개변수와 수질매개변수의 수질항목별 상대적 기여도를 파악해 본 결과, 수리매개변수는 DO, BOD, 유기질소, 유기인 모든 항목에 일정 정도의 상대적 기여도를 가지고 있는 것을 알 수 있었다. 이로부터 수질 모형의 적용 시 수리 매개변수 또한 수질 매개변수의 추정 시와 같이 보다 세심한 주의를 기울여 추정할 필요가 있을 것으로 판단된다.변화와 기흉 발생과의 인과관계를 확인하고 좀 더 구체화하기 위한 연구가 필요할 것이다.게 이루어질 수 있을 것으로 기대된다.는 초과수익률이 상승하지만, 이후로는 감소하므로, 반전거래전략을 활용하는 경우 주식투자기간은 24개월이하의 중단기가 적합함을 발견하였다. 이상의 행태적 측면과 투자성과측면의 실증결과를 통하여 한국주식시장에 있어서 시장수익률을 평균적으로 초과할 수 있는 거래전략은

  • PDF

Fractal Image Coding for Improve the Quality of Medical Images (의료영상의 화질개선을 위한 프랙탈 영상 부호화)

  • Park, Jaehong;Park, Cheolwoo;Yang, Wonseok
    • Journal of the Korean Society of Radiology
    • /
    • v.8 no.1
    • /
    • pp.19-26
    • /
    • 2014
  • This paper suggests techniques to enhance coding time which is a problem in traditional fractal compression and to improve fidelity of reconstructed images by determining fractal coefficient through adaptive selection of block approximation formula. First, to reduce coding time, we construct a linear list of domain blocks of which characteristics is given by their luminance and variance and then we control block searching time according to the first permissible threshold value. Next, when employing three-level block partition, if a range block of minimum partition level cannot find a domain block which has a satisfying approximation error, we choose new approximation coefficients using a non-linear approximation of luminance term. This boosts the fidelity. Our experiment employing the above methods shows enhancement in the coding time more than two times over traditional coding methods and shows improvement in PSNR value by about 1-3dB at the same compression rate.

Disparity estimation using wavelet transformation and reference points (웨이블릿 변환과 기준점을 이용한 변위 추정)

  • 노윤향;고병철;변혜란;유지상
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.2A
    • /
    • pp.137-145
    • /
    • 2002
  • In the method of 3D modeling, stereo matching method which obtains three dimensional depth information from the two images is taken from the different view points. In general, it is very essential work for the 3D modeling from 2D stereo images to estimate the exact disparity through fading the conjugate pair of pixel from the left and right image. In this paper to solve the problems of the stereo image disparity estimation, we introduce a novel approach method to improve the exactness and efficiency of the disparity. In the first place, we perform a wavelet transformation of the stereo images and set the reference points in the image by the feature-based matching method. This reference points have very high probability over 95 %. In the base of these reference points we can decide the size of the variable block searching windows for estimating dense disparity of area based method and perform the ordering constraint to prevent mismatching. By doing this, we could estimate the disparity in a short time and solve the occlusion caused by applying the fried-sized windows and probable error caused by repeating patterns.

An Early Termination Algorithm of Prediction Unit (PU) Search for Fast HEVC Encoding (HEVC 고속 부호화를 위한 PU 탐색 조기 종료 기법)

  • Kim, Jae-Wook;Kim, Dong-Hyun;Kim, Jae-Gon
    • Journal of Broadcast Engineering
    • /
    • v.19 no.5
    • /
    • pp.627-630
    • /
    • 2014
  • The latest video coding standard, high efficiency video coding (HEVC) achieves high coding efficiency by employing a quadtree-based coding unit (CU) block partitioning structure which allows recursive splitting into four equally sized blocks. At each depth level, each CU is partitioned into variable sized blocks of prediction units (PUs). However, the determination of the best CU partition for each coding tree unit (CTU) and the best PU mode for each CU causes a dramatic increase in computational complexity. To reduce such computational complexity, we propose a fast PU decision algorithm that early terminates PU search. The proposed method skips the computation of R-D cost for certain PU modes in the current CU based on the best mode and the rate-distortion (RD) cost of the upper depth CU. Experimental results show that the proposed method reduces the computational complexity of HM12.0 to 18.1% with only 0.2% increases in BD-rate.

A VLSI Design of High Performance H.264 CAVLC Decoder Using Pipeline Stage Optimization (파이프라인 최적화를 통한 고성능 H.264 CAVLC 복호기의 VLSI 설계)

  • Lee, Byung-Yup;Ryoo, Kwang-Ki
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.46 no.12
    • /
    • pp.50-57
    • /
    • 2009
  • This paper proposes a VLSI architecture of CAVLC hardware decoder which is a tool eliminating statistical redundancy in H.264/AVC video compression. The previous CAVLC hardware decoder used four stages to decode five code symbols. The previous CAVLC hardware architectures decreased decoding performance because there was an unnecessary idle cycle in between state transitions. Likewise, the computation of valid bit length includes an unnecessary idle cycle. This paper proposes hardware architecture to eliminate the idle cycle efficiently. Two methods are applied to the architecture. One is a method which eliminates an unnecessary things of buffers storing decoded codes and then makes efficient pipeline architecture. The other one is a shifter control to simplify operations and controls in the process of calculating valid bit length. The experimental result shows that the proposed architecture needs only 89 cycle in average for one macroblock decoding. This architecture improves the performance by about 29% than previous designs. The synthesis result shows that the design achieves the maximum operating frequency at 140Mhz and the hardware cost is about 11.5K under a 0.18um CMOS process. Comparing with the previous design, it can achieve low-power operation because this design is implemented with high throughputs and low gate count.

Study of Parallelization Methods for Software based Real-time HEVC Encoder Implementation (소프트웨어 기반 실시간 HEVC 인코더 구현을 위한 병렬화 기법에 관한 연구)

  • Ahn, Yong-Jo;Hwang, Tae-Jin;Lee, Dongkyu;Kim, Sangmin;Oh, Seoung-Jun;Sim, Dong-Gyu
    • Journal of Broadcast Engineering
    • /
    • v.18 no.6
    • /
    • pp.835-849
    • /
    • 2013
  • Joint Collaborative Team on Video Coding (JCT-VC), which have founded ISO/IEC MPEG and ITU-T VCEG, has standardized High Efficiency Video Coding (HEVC). Standardization of HEVC has started with purpose of twice or more coding performance compared to H.264/AVC. However, flexible and hierarchical coding block and recursive coding structure are problems to overcome of HEVC standard. Many fast encoding algorithms for reducing computational complexity of HEVC encoder have been proposed. However, it is hard to implement a real-time HEVC encoder only with those fast encoding algorithms. In this paper, for implementation of software-based real-time HEVC encoder, data-level parallelism using SIMD instructions and CPU/GPU multi-threading methods are proposed. And we also proposed appropriate operations and functional modules to apply the proposed methods on HM 10.0 software. Evaluation of the proposed methods implemented on HM 10.0 software showed 20-30fps for $832{\times}480$ sequences and 5-10fps for $1920{\times}1080$ sequences, respectively.