Pulse or digital communications – Bandwidth reduction or expansion – Television or motion video signal
Reexamination Certificate
2005-05-20
2010-12-28
Diep, Nhon T (Department: 2483)
Pulse or digital communications
Bandwidth reduction or expansion
Television or motion video signal
Reexamination Certificate
active
07860165
ABSTRACT:
Motion-compensated video coding that employs fine-granular computational complexity scalable motion estimation is described. The scalable motion estimation technique adapts to varying computational limitations of the device performing the video coding technique. The scalable motion estimation technique calculates a predicted priority for each macroblock in a frame and identifies a set of macroblocks based on the predicted priority. A pass is then performed on each macroblock within the set. The pass checks a set of candidate motion vectors for each macroblock in the set and determines a new starting point for the next pass of the macroblocks during processing of the same frame. The predicted priority for each macroblock within the set of macroblocks is re-calculated and the process repeats by identifying another set of macroblocks and performing a pass on them. These repeats until a computation limit associated with the device performing the passes has been reached.
REFERENCES:
patent: 4992869 (1991-02-01), Samad et al.
patent: 5699129 (1997-12-01), Tayama
patent: 6128047 (2000-10-01), Chang et al.
patent: 6859494 (2005-02-01), Panusopone et al.
Li, R., Zeng, B., and Liou, M.L. “A new three-step search algorithm for block motion estimation,” IEEE Transactions on Circuits and Systems for Video Technology, Aug. 1994, pp. 438-442, vol. 4, No. 4.
Zhu, S. and Ma, K.K., “A New Diamond Search Algorithm for Fast Block-Matching Motion Estimation,” IEEE Transactions on Image Processing, Feb. 2000, pp. 287-290, vol. 9, No. 2.
Tourapis, A.M, Au, O.C., and Liou, M.L., “Highly Efficient Predictive Zonal Algorithms for Fast Block-Matching Motion Estimation,” IEEE Transactions on Circuits and Systems for Video Technology, Oct. 2002, pp. 934-947, vol. 12, No. 10.
Chimienti, A., Ferraris, C., and Pau, D., “A Complexity-Bounded Motion Estimation Algorithm,” IEEE Transactions on Image Processing, Apr. 2002, pp. 387-392, vol. 11, No. 4.
Lengwehasatit, K. and Ortega, A., “Computationally scalable partial distance based fast search motion estimation,” IEEE Proceeding of International Conference on Image Processing, Sep. 2000, pp. 824-827, vol. 1.
Mietens, S., De With, P.H.N., and Hentschel, C. “Computational-Complexity Scalable Motion Estimation for Mobile MPEG Encoding,” IEEE Transactions on Consumer Electronics, Feb. 2004, pp. 281-291, vol. 50, No. 1.
Cai Hua
Li Jiang
Diep Nhon T
Lee & Hayes PLLC
Microsoft Corporation
LandOfFree
Framework for fine-granular computational-complexity... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Framework for fine-granular computational-complexity..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Framework for fine-granular computational-complexity... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4195258