Tuyển tập báo cáo các nghiên cứu khoa học quốc tế ngành hóa học dành cho các bạn yêu hóa học tham khảo đề tài: Face Tracking in the Compressed Domain Pedro Miguel Fonseca and Jan Nesvadba | Hindawi Publishing Corporation EURASIP Journal on Applied Signal Processing Volume 2006 Article ID 59451 Pages 1-11 DOI ASP 2006 59451 Face Tracking in the Compressed Domain Pedro Miguel Fonseca and Jan Nesvadba Philips Research 5656AA Eindhoven The Netherlands Received 30 August 2004 Revised 23 March 2005 Accepted 4 May 2005 A compressed domain generic object tracking algorithm offers in combination with a face detection algorithm a low-computational-cost solution to the problem of detecting and locating faces in frames of compressed video sequences such as MPEG-1 or MPEG-2 . Objects such as faces can thus be tracked through a compressed video stream using motion information provided by existing forward and backward motion vectors. The described solution requires only low computational resources on CE devices and offers at one and the same time sufficiently good location rates. Copyright 2006 P. M. Fonseca and J. Nesvadba. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use distribution and reproduction in any medium provided the original work is properly cited. 1. INTRODUCTION The problem of tracking objects over time is a complex one in computer vision and has been an important topic of research over the last few years. Such importance comes from the fact that object tracking enables important applications in areas such as security and surveillance . tracking people in restricted areas using security cameras content management . in video abstraction to automatically annotate video content content improvement . helping stabilize images in handheld mobile videophones by tracking the location of faces human-machine interface . to automatically recognize hand gestures to automatically execute commands interactive gaming and so forth. Requirement constraints such as reliability and computational complexity characterize the boundary conditions for a successful and .
