The Experts below are selected from a list of 149001 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, 1999Co-Authors: M Gallant, G Cote, F KossentiniAbstract: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), 1998Co-Authors: M Gallant, F KossentiniAbstract: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.
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, 1999Co-Authors: M Gallant, G Cote, F KossentiniAbstract: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), 1998Co-Authors: M Gallant, F KossentiniAbstract: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.
A P Liavas - One of the best experts on this subject based on the ideXlab platform.
-
Efficient Computation of the binary vector that maximizes a rank-deficient quadratic form
2010Co-Authors: George N Karystinos, A P LiavasAbstract:The maximization of a full-rank quadratic form over a finite alphabet is NP-hard in both a worst-case sense and an average sense. Interestingly, if the rank of the form is not a function of the problem size, then it can be maximized in polynomial time. An algorithm for the Efficient Computation of the binary vector that maximizes a rank-deficient quadratic form is developed based on an analytic procedure. Auxiliary spherical coordinates are introduced and the multi-dimensional space is partitioned into a polynomial-size set of regions; each region corresponds to a distinct binary vector. The binary vector that maximizes the rank-deficient quadratic form is shown to belong to the polynomial-size set of candidate vectors. Thus, the size of the feasible set is Efficiently reduced from exponential to polynomial. Index Terms — Optimization. 1
-
Efficient Computation of the binary vector that maximizes a rank deficient quadratic form
International Conference on Acoustics Speech and Signal Processing, 2008Co-Authors: George N Karystinos, A P LiavasAbstract:The maximization of a full-rank quadratic form over a finite alphabet is NP-hard in both a worst-case sense and an average sense. Interestingly, if the rank of the form is not a function of the problem size, then it can be maximized in polynomial time. An algorithm for the Efficient Computation of the binary vector that maximizes a rank-deficient quadratic form is developed based on an analytic procedure. Auxiliary spherical coordinates are introduced and the multi-dimensional space is partitioned into a polynomial-size set of regions; each region corresponds to a distinct binary vector. The binary vector that maximizes the rank-deficient quadratic form is shown to belong to the polynomial-size set of candidate vectors. Thus, the size of the feasible set is Efficiently reduced from exponential to polynomial.
G Cote - 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, 1999Co-Authors: M Gallant, G Cote, F KossentiniAbstract: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.
George N Karystinos - One of the best experts on this subject based on the ideXlab platform.
-
Efficient Computation of the binary vector that maximizes a rank-deficient quadratic form
2010Co-Authors: George N Karystinos, A P LiavasAbstract:The maximization of a full-rank quadratic form over a finite alphabet is NP-hard in both a worst-case sense and an average sense. Interestingly, if the rank of the form is not a function of the problem size, then it can be maximized in polynomial time. An algorithm for the Efficient Computation of the binary vector that maximizes a rank-deficient quadratic form is developed based on an analytic procedure. Auxiliary spherical coordinates are introduced and the multi-dimensional space is partitioned into a polynomial-size set of regions; each region corresponds to a distinct binary vector. The binary vector that maximizes the rank-deficient quadratic form is shown to belong to the polynomial-size set of candidate vectors. Thus, the size of the feasible set is Efficiently reduced from exponential to polynomial. Index Terms — Optimization. 1
-
Efficient Computation of the binary vector that maximizes a rank deficient quadratic form
International Conference on Acoustics Speech and Signal Processing, 2008Co-Authors: George N Karystinos, A P LiavasAbstract:The maximization of a full-rank quadratic form over a finite alphabet is NP-hard in both a worst-case sense and an average sense. Interestingly, if the rank of the form is not a function of the problem size, then it can be maximized in polynomial time. An algorithm for the Efficient Computation of the binary vector that maximizes a rank-deficient quadratic form is developed based on an analytic procedure. Auxiliary spherical coordinates are introduced and the multi-dimensional space is partitioned into a polynomial-size set of regions; each region corresponds to a distinct binary vector. The binary vector that maximizes the rank-deficient quadratic form is shown to belong to the polynomial-size set of candidate vectors. Thus, the size of the feasible set is Efficiently reduced from exponential to polynomial.
