1 / 23

Detecting and Naming Actors in Movies using Generative Appearance Models

Detecting and Naming Actors in Movies using Generative Appearance Models. CVPR2013 Poster. Outline. 1.Introduction 2. Generative model 3 . Actor detection 4 . Experiments 5. Conclusions. 1.Introduction.

akio
Download Presentation

Detecting and Naming Actors in Movies using Generative Appearance Models

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. Detecting and Naming Actors in Movies using Generative Appearance Models CVPR2013 Poster

  2. Outline • 1.Introduction • 2. Generative model • 3. Actor detection • 4. Experiments • 5. Conclusions

  3. 1.Introduction ․Detecting and naming actors in movies is importantfor content-based indexing and retrieval of movie scenesand can also be used to support statistical analysis of film style. ․Detecting and naming actors in uneditedfootage can be useful for post-production. ․Methods for learning such features are desired to improve the recall and precision of actor detection in long movie scenes

  4. 1.Introduction • Contributions 1.We propose a complete framework to learn view-independent actor models (using maximally stable color regions (MSCR) [10]) 2.The actor’s head and shoulders are represented as constellations of color blobs (9 dimensional =>color, size, shape and position relative to the actor’s coordinate system) 3.Detection framework with two stages Stage1:search space reduction using the KNN-search Stage2:Sliding window search for the best localization of the actor in position and scale 4.We obtain detection windows and actor names that maximize the posterior likelihood of each video frame.

  5. 2. Generative model Our appearance of actors models ․Incorporate the costume of the actor and to be robust to changes in viewpoint and pose. ․Learning from a small number of individual keyframes or short video tracks. ․Important assumption : Actor is in an upright position and that both the head and the shoulders are visible Normalized coordinate system ․Origin point : at the actor’s neck ․Unit size : twice the height of the actor’s eyes relative to the origin head region extends from (−1,−1) to (1, 0) shoulder region extends from (−1, 0) to (1, 3)

  6. 2. Generative model Normalized coordinates: xi, yi sizes : si ․color blobs Ci Shapes :mi colors : ci frequencies :Hi ․generative model for each actor consists in the following three steps 1.Choose screen location and window size for the actor on the screen, using the detections in the previous frame as a prior. 2.Choose visible features Ci in the ”head” and ”shoulder” regions independently, each with a probability Hi 3.For all visible features Ci , generate color blob Bi from a gaussian distribution with mean Ci and covariance Σi, then translate and scale to the chosen screen location and size

  7. 2. Generative model • Maximally stable color regions(MSCR) color MSCR [10] ․maximally stable extremalregion (MSER) ․It is an affine covariant region detector which uses successive time steps of an agglomerative clustering of pixels to define a region

  8. 2. Generative model • Clustering ․we try to keep the training set equally sampled across different views ․We manually draw the upper body bounding boxes for all training examples and label them with the actor’s names

  9. 2. Generative model ․We cluster the blobs for all actors using a constrained agglomerative clustering ․For every actor in n training images we get n set of blobs (f1, f2, ...., fn) with varying number of blobs in each set ․Each blob in the first set f1 is initialized as a singleton cluster. We then compute pairwise matching between those clusters and the blobs in the next set f2. At each step, for each cluster, we assign at most one blob (its nearest neighbor) if it is closer than a threshold ․Each cluster is represented by the meanvalue of its blobs

  10. 2. Generative model

  11. 3. Actor detection ․Our framework searches for actorsover a variety of scales, from foreground (larger scales) tobackground (smaller scales). 1.For each actor we first perform a search space reduction using kNN-search 2.We scan a sliding window and search for the most likely location for the actor 3.we perform a multi-actor non maxima suppression over all the detected actors 4.We report the best position and scale for each detected actor (e) Binary map which can be used to reject some of the windows without processing, in practice we use separate binary mapsfor head and torso features.

  12. 3. Actor detection • Search space reduction ․This pre-refinement is done only based on the color, size and shape parameters. ․IDX and D7: N × k matrices N : number of clusters in the given actor model. ․Each row in IDX contains the indices of the k closest neighbours in B corresponding to the k smallest distances in D7. ․Build inverted indices This is further used to build inverted indices i.e. for eachunique blob B in the kNN refined set IDX, we store correspondingclusters in Ca and respective distances, ensuringthat the distance is less then a threshold τ1 Firstly for each blob within the sliding window we only require to compare it with its corresponding entries in the inverted index table instead of doing an exhaustive search

  13. 3. Actor detection • Sliding window search many windows can be rejected without any processing using a importance term based on a binary map ․In practice we compute MSCR features in the best available scale and then shift and scale the blobs respectively while searching at different scales B : the set of all blobs detected in the image Ca :the set of cluster centers in the model for a given actor a sliding window at position (x, y)and scale s,

  14. 3. Actor detection similarity function between the modelcluster Ca iand the corresponding matched blob Bj in nine dimensional space Caiis the center for cluster i in the actor model and Σaiis its covariance matrix ․we compute mijsuch that each blob in the sliding window is assigned to at most one cluster, each cluster is assigned to at most one blob

  15. 3. Actor detection Dt−1 : previous frame detections Σpos: covariance term (we have found that the terms l1,1, l1,0 and Σposare in fact independent on the choice of actor or movie) t0 is used to reject all the detections with score below a threshold value.

  16. 4. Experiments • Dataset : ROPE (443 frame)

  17. 4. Experiments • Result

  18. 4. Experiments

  19. 4. Experiments

  20. 4. Experiments

  21. 5.Conclusions • We have presented a generative appearance model for detecting and naming actors in movies that can be learned from a small number of training examples • Results show significant increase in coverage (recall) for actor detection maintaining high precision. • We also plan to investigate weakly supervised methods by extracting actor labels

More Related