1 / 40

Longin Jan Latecki ( latecki@temple ) Computer and Information Science s

Context-dependent Detection of Unusual Events in Videos by Geometric Analysis of Video Trajectories. Longin Jan Latecki ( latecki@temple.edu ) Computer and Information Science s Temple University, Philadelphia Nilesh Ghubade and Xiangdong Wen ( nileshg@temple.edu ). Agenda. Introduction

nan
Télécharger la présentation

Longin Jan Latecki ( latecki@temple ) Computer and Information Science s

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Context-dependent Detection of Unusual Events in VideosbyGeometric Analysis of Video Trajectories Longin Jan Latecki (latecki@temple.edu) Computer and Information Sciences Temple University, Philadelphia Nilesh Ghubade and Xiangdong Wen (nileshg@temple.edu)

  2. Agenda • Introduction • Mapping of video to a trajectory • Relation: motion trajectory  video trajectory • Discrete curve evolution • Polygon simplification • Key frames • Unusual events in surveillance videos • Results

  3. Main Tools • Mapping the video sequence to a polyline in a multi-dimensional space. • The automatic extraction of relevant frames from videos is based on polygon simplification by discrete curve evolution.

  4. Mapping of video to a trajectory • Mapping of the image stream to a trajectory (polyline) in a feature space. • Representing each frame as: ……… X-coord of the Bin’s centroid Y-coord of the Bin’s centroid Bin’s Frequency Count Frame 0 Bin0 Bin n Frame N Bin n

  5. Used in our experiments • Red-Green-Blue (rgb) Bins • Each frame as a 24-bit color image (8 bit per color intensity): • Bin 0 = color intensities from 0-31 • Bin 1 = color intensities from 32-63 • Bin 8 = color intensities from 224-255 • Three attributes per bin: - • Row of the bin’s centroid • Column of the bin’s centroid • Frequency count of the bin. • (8 bins per color level * 3 attributes/bin)*3 color levels = 72 feature

  6. Theoretical Results: Motion trajectory  Video trajectory Consider a video in which an object (a set of pixels) is moving on a uniformbackground. The object is visible in all framesand it is moving with a constant speed on a linear trajectory.Then the video trajectory in the feature space is a straight line. If n objects are moving with constant speeds on a linear trajectory,then the trajectory is a straight line in the feature space.

  7. Consider a video in which an object (a set ofpixels) is moving on a uniform background. Then the trajectoryvectors are containedin the plane. If n objects are moving, then the dimension of the trajectory is at most 2n. If a new object suddenly appears in the movie, the dimension of the trajectory increases at least by 1 and at most by 3.

  8. MovingDotMovieWithAdditionalDot.avi

  9. Robust Rank Computation Using singular value decomposition, based on: C. Rao, A. Yilmaz, and M.Shah.View-Invariant Representation and Recognition of actions.Int. J. of Computer Vision 50, 2002. M. Seitz and C. R. Dyer.View-invariant analysis of cyclic motion. Int. J. of Computer Vision 16, 1997. We compute err in a window of 11 consecutive frames in our experiments.

  10. MovingDotMovieWithAdditionalDot.avi

  11. Interpolation of video trajectory MovingDotMovie_Clockwise.avi

  12. MovingDotMovieWithAdditionalDot.avi

  13. Polygon simplification Relevance Ranking Frame Number 0 1 1 100 Frames with decreasing relevance 98 12 99 5

  14. Discrete Curve Evolution P=P0, ..., PmPi+1 is obtained from Pi by deleting the vertices of Pi that have minimal relevance measure K(v, Pi) = K(u,v,w) = |d(u,v)+d(v,w)-d(u,w)| v v w w u u

  15. Discrete Curve Evolution: Preservation of position, no blurring

  16. Discrete Curve Evolution: robustness with respect to noise

  17. Discrete Curve Evolution: extraction of linear segments

  18. Key Frame Extraction

  19. Key frames and rank Security1 • Bins Matrix • Distance Matrix

  20. err for seciurity1 video

  21. M. S. Drew and J. Au: http://www.cs.sfu.ca/~mark/ftp/AcmMM00/

  22. Predictability of video parts:Local Curveness computation We divide the video polygonal curve P into parts T_i. For videos with 25 fps:T_i contains 25 frames. We apply discrete curve evolution to each T_iuntil three points remain: a, b, c.Curveness measure of T_i: C(T_i,P) = |d(a, b) + d(b, c) - d(a, c)| b is the most relevant frame in T_i and the first vertex of T_i+1

  23. security7

  24. err for seciurity7

  25. 2D projection by PCA of video trajectory for security7

  26. Mov3

  27. Mov3: Rustam waving his hand. • Bins Matrix Keyframes = 1 378 52 142 253 235 148 31 155 167 • Distance Matrix Keyframes = 1 378 253 220 161 109 50 155 149 270

  28. Hall_monitor

  29. err for hall_monitor

  30. Hall Monitor: 2 persons entering-exiting in a hall. • Bins Matrix Keyframes = 1 300 35 240 221 215 265 241 278 280 • Distance Matrix Keyframes = 1 300 37 265 241 240 235 278 280 282

  31. CameraAtLightSignal.avi

  32. Multimodal Histogram Histogram of lena

  33. Segmented Image Image after segmentation – we get a outline of her face, hat etc

  34. Gray Scale Image - Multimodal Original Image of Lena

  35. Thank you

More Related