Object Tracking for Retrieval Application in MPEG-2 Lorenzo Favalli, Alessandro Mecocci, Fulvio Moschetti IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR.

Slides:



Advertisements
Similar presentations
Packet Video Error Concealment With Auto Regressive Model Yongbing Zhang, Xinguang Xiang, Debin Zhao, Siwe Ma, Student Member, IEEE, and Wen Gao, Fellow,
Advertisements

MPEG4 Natural Video Coding Functionalities: –Coding of arbitrary shaped objects –Efficient compression of video and images over wide range of bit rates.
Automatic Video Shot Detection from MPEG Bit Stream Jianping Fan Department of Computer Science University of North Carolina at Charlotte Charlotte, NC.
Basics of MPEG Picture sizes: up to 4095 x 4095 Most algorithms are for the CCIR 601 format for video frames Y-Cb-Cr color space NTSC: 525 lines per frame.
Graphs Graphs are the most general data structures we will study in this course. A graph is a more general version of connected nodes than the tree. Both.
MPEG-4 Objective Standardize algorithms for audiovisual coding in multimedia applications allowing for Interactivity High compression Scalability of audio.
September 10, 2013Computer Vision Lecture 3: Binary Image Processing 1Thresholding Here, the right image is created from the left image by thresholding,
December 5, 2013Computer Vision Lecture 20: Hidden Markov Models/Depth 1 Stereo Vision Due to the limited resolution of images, increasing the baseline.
Tracking Features with Large Motion. Abstract Problem: When frame-to-frame motion is too large, KLT feature tracker does not work. Solution: Estimate.
A New Block Based Motion Estimation with True Region Motion Field Jozef Huska & Peter Kulla EUROCON 2007 The International Conference on “Computer as a.
Fast Mode Decision for Multiview Video Coding Liquan Shen, Tao Yan, Zhi Liu, Zhaoyang Zhang, Ping An, Lei Yang ICIP
Ai-Mei Huang and Truong Nguyen Video Processing LabECE Dept, UCSD, La Jolla, CA This paper appears in: Image Processing, ICIP IEEE International.
1 Learning to Detect Objects in Images via a Sparse, Part-Based Representation S. Agarwal, A. Awan and D. Roth IEEE Transactions on Pattern Analysis and.
Efficient Moving Object Segmentation Algorithm Using Background Registration Technique Shao-Yi Chien, Shyh-Yih Ma, and Liang-Gee Chen, Fellow, IEEE Hsin-Hua.
Efficient Motion Vector Recovery Algorithm for H.264 Based on a Polynomial Model Jinghong Zheng and Lap-Pui Chau IEEE TRANSACTIONS ON MULTIMEDIA, June.
1 Static Sprite Generation Prof ︰ David, Lin Student ︰ Jang-Ta, Jiang
Department of Computer Engineering University of California at Santa Cruz Video Compression Hai Tao.
1 Single Reference Frame Multiple Current Macroblocks Scheme for Multiple Reference IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY Tung-Chien.
An Efficient Low Bit-Rate Video-coding Algorithm Focusing on Moving Regions Kwok-Wai Wong, Kin-Man Lam, Wan-Chi Siu IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS.
A neural approach to extract foreground from human movement images S.Conforto, M.Schmid, A.Neri, T.D’Alessio Compute Method and Programs in Biomedicine.
MPEG-7 Motion Descriptors. Reference ISO/IEC JTC1/SC29/WG11 N4031 ISO/IEC JTC1/SC29/WG11 N4062 MPEG-7 Visual Motion Descriptors (IEEE Transactions on.
A Cell-Loss Concealment Technique for MPEG-2 Coded Video Jian Zhang, John F. Arnold, and Michael R. Frater IEEE Transaction on Circuit and System for video.
Tracking Video Objects in Cluttered Background
MPEG-2 Error Concealment Based on Block-Matching Principles Sofia Tsekeridou and Ioannis Pitas IEEE Transactions on Circuits and Systems for Video Technology,
Automatic Camera Calibration for Image Sequences of a Football Match Flávio Szenberg (PUC-Rio) Paulo Cezar P. Carvalho (IMPA) Marcelo Gattass (PUC-Rio)
A Probabilistic Framework for Video Representation Arnaldo Mayer, Hayit Greenspan Dept. of Biomedical Engineering Faculty of Engineering Tel-Aviv University,
Fundamentals of Multimedia Chapter 10 Basic Video Compression Techniques Ze-Nian Li & Mark S. Drew 건국대학교 인터넷미디어공학부 임 창 훈.
Fundamentals of Multimedia Chapter 11 MPEG Video Coding I MPEG-1 and 2
Jacinto C. Nascimento, Member, IEEE, and Jorge S. Marques
January 26, Nick Feamster Development of a Transcoding Algorithm from MPEG to H.263.
 Coding efficiency/Compression ratio:  The loss of information or distortion measure:
MPEG MPEG-VideoThis deals with the compression of video signals to about 1.5 Mbits/s; MPEG-AudioThis deals with the compression of digital audio signals.
Video Coding. Introduction Video Coding The objective of video coding is to compress moving images. The MPEG (Moving Picture Experts Group) and H.26X.
1 TEMPLATE MATCHING  The Goal: Given a set of reference patterns known as TEMPLATES, find to which one an unknown pattern matches best. That is, each.
CS 6825: Binary Image Processing – binary blob metrics
Methods of Video Object Segmentation in Compressed Domain Cheng Quan Jia.
Digital Image Processing CCS331 Relationships of Pixel 1.
Adaptive Multi-path Prediction for Error Resilient H.264 Coding Xiaosong Zhou, C.-C. Jay Kuo University of Southern California Multimedia Signal Processing.
MPEG MPEG : Motion Pictures Experts Group MPEG : ISO Committee Widely Used Video Compression Standard.
June, 1999 An Introduction to MPEG School of Computer Science, University of Central Florida, VLSI and M-5 Research Group Tao.
General ideas to communicate Show one particular Example of localization based on vertical lines. Camera Projections Example of Jacobian to find solution.
Ai-Mei Huang, Student Member, IEEE, and Truong Nguyen, Fellow, IEEE.
MPEG-4 Systems Introduction & Elementary Stream Management
MPEG-4: Multimedia Coding Standard Supporting Mobile Multimedia System -MPEG-4 Natural Video Coding April, 2001.
Segmentation of Vehicles in Traffic Video Tun-Yu Chiang Wilson Lau.
© ACTS-MoMuSys All Rights Reserved. VOGUE The Video Object Generator with User Environment Ecole Nationale Supérieure des Mines de Paris, France.
Overview of Fine Granularity Scalability in MPEG-4 Video Standard Weiping Li Presented by : Brian Eriksson.
October 1, 2013Computer Vision Lecture 9: From Edges to Contours 1 Canny Edge Detector However, usually there will still be noise in the array E[i, j],
Block-based coding Multimedia Systems and Standards S2 IF Telkom University.
Robust Watermarking of 3D Mesh Models. Introduction in this paper, it proposes an algorithm that extracts 2D image from the 3D model and embed watermark.
Blind Quality Assessment System for Multimedia Communications Using Tracing Watermarking P. Campisi, M. Carli, G. Giunta and A. Neri IEEE Transactions.
Instructor : Dr. K. R. Rao Presented by : Vigneshwaran Sivaravindiran
BLOCK BASED MOTION ESTIMATION. Road Map Block Based Motion Estimation Algorithms. Procedure Of 3-Step Search Algorithm. 4-Step Search Algorithm. N-Step.
1/39 Motion Adaptive Search for Fast Motion Estimation 授課老師:王立洋老師 製作學生: M 蔡鐘葳.
Principles of Video Compression Dr. S. M. N. Arosha Senanayake, Senior Member/IEEE Associate Professor in Artificial Intelligence Room No: M2.06
Detection, Tracking and Recognition in Video Sequences Supervised By: Dr. Ofer Hadar Mr. Uri Perets Project By: Sonia KanOra Gendler Ben-Gurion University.
April 21, 2016Introduction to Artificial Intelligence Lecture 22: Computer Vision II 1 Canny Edge Detector The Canny edge detector is a good approximation.
H. 261 Video Compression Techniques 1. H.261  H.261: An earlier digital video compression standard, its principle of MC-based compression is retained.
Automatic Video Shot Detection from MPEG Bit Stream
Paper – Stephen Se, David Lowe, Jim Little
Data Compression.
Research Topic Error Concealment Techniques in H.264/AVC for Wireless Video Transmission Vineeth Shetty Kolkeri EE Graduate,UTA.
Motion Segmentation at Any Speed
ENEE 631 Project Video Codec and Shot Segmentation
MPEG4 Natural Video Coding
Ying Dai Faculty of software and information science,
Image and Video Processing
第 九 章 影像邊緣偵測 9-.
Li Li, Zhu Li, Vladyslav Zakharchenko, Jianle Chen, Houqiang Li
Presentation transcript:

Object Tracking for Retrieval Application in MPEG-2 Lorenzo Favalli, Alessandro Mecocci, Fulvio Moschetti IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, APRIL 2000

Introduction The work presented here describes a tool for object tracking and information retrieval applicable to MPEG-2 sequences. This tool is designed to act on already encoded MPEG-2 sequences without affecting the actual syntax of the coded stream that should remain fully compatible with any player. Features are included to alert the human operator when objects disappear, or must be considered lost, due to an excessive change in their shape. The way of tracking is to use the motion information already present in the bit-stream and generated by the encoder.

Marking Marker: the information creator We let the marker click his mouse to identify the image areas corresponding to the object to be tracked. The basic structure for motion estimation in MPEG-2 is the macroblock(MB), all the pixels in the MB corresponding to the click area are identified as being part of the object. Knowledge about the different object in terms of their MB ’ s is stored in a three-level matrix formed by as many elements as the number of MB ’ s in the frame.

Object layer : all cells are set to zero except those selected by the marker. Each object is identified through a label ( a simple integer) and this label is assigned to all cells of the object. The other two levels contain the information of the horizontal and vertical components of the motion vectors.

Object layer with 2 objects map is the three level matrix map[x][x][0] is 0 if MB does not belong to any object, Otherwise the value is associated to the object map[x][x][1] contains the horizontal vector map[x][x][2] contains the vertical vector

Tracking Tracking is performed at the decoder. A threshold has been set in order to determine whether the MB has moved or not onto the ideal grid of 16*16 squares into which we divide the frame. If the visual information of an MB overlaps that of an MB in a neighboring position by more than 25%, then the new MB will also be considered part of the object, and both MB ’ s will be tracked. If this quantity exceeds 75%, only the new one will be considered.

If MB n has a horizontal vector of 4 pixels left (25% of the MB moved left), in the next frame also MB (n-1) will be considered and tracked along with MB n.

If MB n has a horizontal vector of 12 pixels left (75% of original MB moved left), only MB (n-1) will be tracked.

The algorithm keeps track of the smooth transition of the MB visual information onto the ideal grid and updates the position of the object, ” switching on ” the new positions and “ switching off ” the previous in the data structure. By this procedure, objects can be “ inflated ” with respect to their original size.

The syntax restricts the information of the movement inside on GOP.How to follow an object until the next I frame? When the last two B frames of the GOP n have to be decoded, both the last P frame of the nth GOP and the I frame of the (n+1)th GOP are stored in the memory of the decoder.The solution then has been to add two blocks at the decoder. Two different GOP ’ s can be linked together.

I-type P-type

If the MB in a P-frame is coded intra(since block matching has failed), the information about the movement of that MB is lost in all subsequent frames and the structure of the structure of the object itself tends to become sparse. If some MB ’ s are lost, they are switched on again; we refer to this as “ connected shape ” hypothesis.

m-1 m ? m+1 Frame n m m ?m ? m Frame n-1Frame nFrame n+1

(m,n) MV?

An object can occupy only a fraction of the total 256 pixels in an MB.This may cause block-matching errors and may cause the object to disappear or be truncated. The only solution is to detect shape changes in the structure of the selected macroblocks. Shape changes may be revealed by comparing the motion vectors of the different MB ’ s forming the object: if their directions are not consistent for at least 25% of the MB ’ s forming the object, then a warning is raised requesting human intervention.

Tracking Results Flower Garden Mobile and Calendar The initial marking phase is performed at frame 1.

Frame 1

Frame 25

Frame 97

Frame 1

Frame 25

Frame 90

The goodness of tracking algorithm dynamically “ true ” macroblocks are those originally marked and still tracked. “ correct ” counts also those macroblocks that have been added due to the additional constraint. The hypothesis of connected shaped allows us to recover lost MB ’ s in the P frames and to observe a 20% improvement over the normal tracking.

Information Encoding An indexing file at the beginning is used to provide access to all the information related to each object. A textual description of the object is associated with the number that will identify it.The information can be accessed through both the frame number or the object number. Either the information about the object can be accessed by clicking on the object during the playback or given a textual description of the object we want to retrieve.

Conclusion The work presented here describes a tool for object tracking and information retrieval applicable to MPEG-2 sequences. No segmentation techniques are used for the extraction and tracking of the objects; it relies exclusively on the motion information. Allowing for automatic tracking of one object across different groups of pictures. Results show that the proposed algorithm is capable to track objects with a good degree of precision.