The Experts below are selected from a list of 28485 Experts worldwide ranked by ideXlab platform

F Kossentini - One of the best experts on this subject based on the ideXlab platform.

  • an efficient computation constrained block based Motion Estimation Algorithm for low bit rate video coding
    IEEE Transactions on Image Processing, 1999
    Co-Authors: M Gallant, G Cote, F Kossentini
    Abstract:

    We present an efficient computation constrained block-based Motion vector Estimation Algorithm for low bit rate video coding that yields good tradeoffs between Motion Estimation distortion and number of computations. A reliable predictor determines the search origin, localizing the search process. An efficient search pattern exploits structural constraints within the Motion field. A flexible cost measure used to terminate the search allows simultaneous control of the Motion Estimation distortion and the computational cost. Experimental results demonstrate the viability of the proposed Algorithm in low bit rate video coding applications. The resulting low bit rate video encoder yields essentially the same levels of rate-distortion performance and subjective quality achieved by the UBC H.263+ video coding reference software. However, the proposed Motion Estimation Algorithm provides substantially higher encoding speed as well as graceful computational degradation capabilities.

  • An efficient computation-constrained block-based Motion Estimation Algorithm for low bit rate video coding
    Conference Record of Thirty-Second Asilomar Conference on Signals Systems and Computers (Cat. No.98CH36284), 1998
    Co-Authors: M Gallant, F Kossentini
    Abstract:

    We present an efficient computation constrained block-based Motion vector Estimation Algorithm for low bit rate video coding that offers good tradeoffs between Motion Estimation distortion and number of computations. A reliable predictor determines the search origin. An efficient search pattern exploits structural constraints within the Motion field. A flexible cost measure used to terminate the search allows simultaneous control of the Motion Estimation distortion and the computational cost. Experimental results demonstrate the viability of the proposed Algorithm in low bit rate video coding applications, achieving essentially the same levels of rate-distortion performance and subjective quality as that of the full search Algorithm when used by the UBC H.263+ video coding reference software. However the proposed Motion Estimation Algorithm provides substantially higher encoding speed as well as graceful computational degradation capabilities.

Tzidar Chiueh - One of the best experts on this subject based on the ideXlab platform.

  • one dimensional full search Motion Estimation Algorithm for video coding
    IEEE Transactions on Circuits and Systems for Video Technology, 1994
    Co-Authors: Meijuan Chen, Lianggee Chen, Tzidar Chiueh
    Abstract:

    A new hardware-oriented Algorithm called the one-dimensional full search (1DFS) is presented for block-matching Motion Estimation in video compression. The simulation for this Algorithm follows H.261 and MPEG international standards. In MPEG simulation, structures with 1-, 2- and 3-frame interpolation are compared. The performance of 1DFS is superior to that of other fast search Algorithms. And it has more regular data flow, data reuse and less control overhead. It is an alternative for 2D full search block matching and achieves a good compromise between computational complexity and performance. With competent performance and reasonable computation complexity, the proposed method is more suitable for real-time hardware realization of a VLSI Motion estimator for video applications. >

  • parallel architectures for 3 step hierarchical search block matching Algorithm
    IEEE Transactions on Circuits and Systems for Video Technology, 1994
    Co-Authors: Herming Jong, Tzidar Chiueh
    Abstract:

    The paper describes fully pipelined parallel architectures for the 3-step hierarchical search block-matching Algorithm, a fast Motion Estimation Algorithm for video coding. The advantage of this Algorithm was completely utilized by use of intelligent data arrangement and memory configuration. Techniques for reducing interconnections and external memory accesses were also developed. Because of their low costs, high speeds, and low memory bandwidth requirements, the proposed 3-PE, 9-PE, and 27-PE architectures provide efficient solutions for real-time Motion Estimations required by video applications of various data rates, from low bit-rate video to HDTV systems. >

M Gallant - One of the best experts on this subject based on the ideXlab platform.

  • an efficient computation constrained block based Motion Estimation Algorithm for low bit rate video coding
    IEEE Transactions on Image Processing, 1999
    Co-Authors: M Gallant, G Cote, F Kossentini
    Abstract:

    We present an efficient computation constrained block-based Motion vector Estimation Algorithm for low bit rate video coding that yields good tradeoffs between Motion Estimation distortion and number of computations. A reliable predictor determines the search origin, localizing the search process. An efficient search pattern exploits structural constraints within the Motion field. A flexible cost measure used to terminate the search allows simultaneous control of the Motion Estimation distortion and the computational cost. Experimental results demonstrate the viability of the proposed Algorithm in low bit rate video coding applications. The resulting low bit rate video encoder yields essentially the same levels of rate-distortion performance and subjective quality achieved by the UBC H.263+ video coding reference software. However, the proposed Motion Estimation Algorithm provides substantially higher encoding speed as well as graceful computational degradation capabilities.

  • An efficient computation-constrained block-based Motion Estimation Algorithm for low bit rate video coding
    Conference Record of Thirty-Second Asilomar Conference on Signals Systems and Computers (Cat. No.98CH36284), 1998
    Co-Authors: M Gallant, F Kossentini
    Abstract:

    We present an efficient computation constrained block-based Motion vector Estimation Algorithm for low bit rate video coding that offers good tradeoffs between Motion Estimation distortion and number of computations. A reliable predictor determines the search origin. An efficient search pattern exploits structural constraints within the Motion field. A flexible cost measure used to terminate the search allows simultaneous control of the Motion Estimation distortion and the computational cost. Experimental results demonstrate the viability of the proposed Algorithm in low bit rate video coding applications, achieving essentially the same levels of rate-distortion performance and subjective quality as that of the full search Algorithm when used by the UBC H.263+ video coding reference software. However the proposed Motion Estimation Algorithm provides substantially higher encoding speed as well as graceful computational degradation capabilities.

Qingshan Liu - One of the best experts on this subject based on the ideXlab platform.

  • fast progressive model refinement global Motion Estimation Algorithm with prediction
    International Conference on Multimedia and Expo, 2006
    Co-Authors: Haifeng Wang, Jia Wang, Qingshan Liu
    Abstract:

    Global Motion Estimation (GME) is an important part in the object-based applications. In this paper, a fast progressive model refinement (FPMR) GME Algorithm is proposed. It can select the appropriate Motion model according to the complexity of the camera Motion. Two techniques are used to accelerate the procedure of FPMR. The first is an outlier prediction based feature point selection method. It can predict outliers from that of the last frame and therefore can effectively remove the influence of outliers on parameter calculation. The second is an intermediate-level model prediction method, which is used to fast the model selection and the parameter calculation procedure. Experiments show that the proposed Algorithm is above two times faster than that of the Feature-based Fast and Robust GME technique.

  • progressive model refinement global Motion Estimation Algorithm for video coding
    International Conference on Signal Processing, 2006
    Co-Authors: Haifeng Wang, Jia Wang, Qingshan Liu
    Abstract:

    This paper presents a Progressive Model Refinement (PMR) method for Global Motion Estimation (GME) in MPEG-4 video coding. Our contributions consist of two aspects. Firstly, a method of feature point selection is proposed based on the analysis of spatial distribution. It can effectively guarantee the number of feature point won’t become too large and avoid most feature points congregated on a small region. Secondly, a PMR Algorithm is proposed to select Motion models progressively according to the complexity of the camera Motion, which improves the convergence performance of GME and makes the PMR Algorithm much more robust and faster than single-model based GME Algorithms. Experiments show that the presented Algorithm can always select the appropriate model to describe the camera Motion.

Jong-nam Kim - One of the best experts on this subject based on the ideXlab platform.

  • Fast full search Motion Estimation Algorithm using early detection of impossible candidate vectors
    IEEE Transactions on Signal Processing, 2002
    Co-Authors: Jong-nam Kim, Sung-cheal Byun, Yong-hoon Kim, Byung-ha Ahn
    Abstract:

    To reduce the amount of computations for a full search (FS) Algorithm for fast Motion Estimation, we propose a new and fast FS Motion Estimation Algorithm. The computational reduction of our FS Motion Estimation Algorithm comes from fast elimination of impossible Motion vectors. We obtain faster elimination of inappropriate Motion vectors using efficient matching units from localization of a complex area in image data. In this paper, we show three properties in block matching of Motion Estimation. We suggest two fast matching scan Algorithms: one from adaptive matching scan and the other from fixed dithering order. Experimentally, we remove the unnecessary computations by about 30% with our proposed Algorithm compared with the conventional fast FS Algorithms.

  • a fast full search Motion Estimation Algorithm using representative pixels and adaptive matching scan
    IEEE Transactions on Circuits and Systems for Video Technology, 2000
    Co-Authors: Jong-nam Kim, Taesun Choi
    Abstract:

    A full-search based block-matching Algorithm for Motion Estimation has a major problem of significant computational load. To solve this problem, extensive research in fast-Motion Estimation Algorithms have been carried out. However, most of them have some degradation in the predicted image from the reduced computation. To decrease the amount of significant computation of the full-search Algorithm, we propose a fast block-matching Algorithm based on an adaptive matching scan and representative pixels without any degradation of the predicted image. By using Taylor series expansion, we obtain the representative pixels and show that the block-matching errors from the reference block and candidate blocks are proportional to the block complexity. With the derived result, we propose a fast full-search Algorithm with adaptive scan direction in block matching. Experimentally, our proposed Algorithm is very efficient in terms of computational speedup, and is the fastest among all the conventional full-search Algorithms. Therefore, our Algorithm is useful in VLSI implementation of video encoders for real-time encoding.