Counting in High-Density Crowd Videos

Slides:

Advertisements

Similar presentations

Pose Estimation and Segmentation of People in 3D Movies Karteek Alahari, Guillaume Seguin, Josef Sivic, Ivan Laptev Inria, Ecole Normale Superieure ICCV.

Advertisements

Interactively Co-segmentating Topically Related Images with Intelligent Scribble Guidance Dhruv Batra, Carnegie Mellon University Adarsh Kowdle, Cornell.

Spectral graph reduction for image and streaming video segmentation Fabio Galasso 1 Margret Keuper 2 Thomas Brox 2 Bernt Schiele 1 1 Max Planck Institute.

Segmentation from Examples By: A’laa Kryeem Lecturer: Hagit Hel-Or.

Tracking Multiple Occluding People by Localizing on Multiple Scene Planes Saad M. Khan and Mubarak Shah, PAMI, VOL. 31, NO. 3, MARCH 2009, Donguk Seo

Markov Nets Dhruv Batra, Recitation 10/30/2008.

Deformable Contours Dr. E. Ribeiro.

Markov Random Fields (MRF)

Segmentation of Dog Elbow Bones Using Max Flow/Min Cut Graph Cuts Based on "An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization.

Segmentation Using Max Flow/Min Cut Graph Cuts Based on "An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision.“

Robust Higher Order Potentials For Enforcing Label Consistency

More on Stereo. Outline Fast window-based correlationFast window-based correlation DiffusionDiffusion Energy minimizationEnergy minimization Graph cutsGraph.

Today: Image Segmentation Image Segmentation Techniques Snakes Scissors Graph Cuts Mean Shift Wednesday (2/28) Texture analysis and synthesis Multiple.

Stereo & Iterative Graph-Cuts Alex Rav-Acha Vision Course Hebrew University.

Stereo Binocular Stereo Calibration (finish up) Next Time Motivation

MRF Labeling With Graph Cut CMPUT 615 Nilanjan Ray.

Stereo Computation using Iterative Graph-Cuts

Object Based Video Coding - A Multimedia Communication Perspective Muhammad Hassan Khan

Graph-Cut Algorithm with Application to Computer Vision Presented by Yongsub Lim Applied Algorithm Laboratory.

Perceptual Organization: Segmentation and Optical Flow.

IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 20, NO. 11, NOVEMBER 2011 Qian Zhang, King Ngi Ngan Department of Electronic Engineering, the Chinese university.

Manhattan-world Stereo Y. Furukawa, B. Curless, S. M. Seitz, and R. Szeliski 2009 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp.

Automatic User Interaction Correction via Multi-label Graph-cuts Antonio Hernández-Vela, Carlos Primo and Sergio Escalera Workshop on Human Interaction.

Image Renaissance Using Discrete Optimization Cédric AllèneNikos Paragios ENPC – CERTIS ESIEE – A²SI ECP - MAS France.

What have we leaned so far? Camera structure Eye structure Project 1: High Dynamic Range Imaging.

Structure from images. Calibration Review: Pinhole Camera.

Fast Approximate Energy Minimization via Graph Cuts

Graph Cut & Energy Minimization

Object Based Video Coding - A Multimedia Communication Perspective Muhammad Hassan Khan

MRFs and Segmentation with Graph Cuts Computer Vision CS 543 / ECE 549 University of Illinois Derek Hoiem 02/24/10.

Graph Cut Algorithms for Binocular Stereo with Occlusions

Graph Cut 韋弘 2010/2/22. Outline Background Graph cut Ford–Fulkerson algorithm Application Extended reading.

Interactive Graph Cuts for Optimal Boundary & Region Segmentation of Objects in N-D Images (Fri) Young Ki Baik, Computer Vision Lab.

Computer Vision Lab Seoul National University Keyframe-Based Real-Time Camera Tracking Young Ki BAIK Vision seminar : Mar Computer Vision Lab.

CS 4487/6587 Algorithms for Image Analysis

1 Markov Random Fields with Efficient Approximations Yuri Boykov, Olga Veksler, Ramin Zabih Computer Science Department CORNELL UNIVERSITY.

Computer Vision Stereo Vision. Bahadir K. Gunturk2 Pinhole Camera.

Segmentation of Vehicles in Traffic Video Tun-Yu Chiang Wilson Lau.

Gaussian Mixture Models and Expectation-Maximization Algorithm.

Non-Ideal Iris Segmentation Using Graph Cuts

AAM based Face Tracking with Temporal Matching and Face Segmentation Mingcai Zhou 1 、 Lin Liang 2 、 Jian Sun 2 、 Yangsheng Wang 1 1 Institute of Automation.

Solving for Stereo Correspondence Many slides drawn from Lana Lazebnik, UIUC.

Pseudo-Bound Optimization for Binary Energies Meng Tang 1 Ismail Ben Ayed 2 Yuri Boykov 1 1 University of Western Ontario, Canada 2 GE Healthcare Canada.

A global approach Finding correspondence between a pair of epipolar lines for all pixels simultaneously Local method: no guarantee we will have one to.

Dynamic Programming (DP), Shortest Paths (SP)

Lecture 05 29/11/2011 Shai Avidan Roy Josef Jevnisek הבהרה : החומר המחייב הוא החומר הנלמד בכיתה ולא זה המופיע / לא מופיע במצגת.

Occlusion Tracking Using Logical Models Summary. A Variational Partial Differential Equations based model is used for tracking objects under occlusions.

Photoconsistency constraint C2 q C1 p l = 2 l = 3 Depth labels If this 3D point is visible in both cameras, pixels p and q should have similar intensities.

Motion Segmentation at Any Speed Shrinivas J. Pundlik Department of Electrical and Computer Engineering, Clemson University, Clemson, SC.

Energy minimization Another global approach to improve quality of correspondences Assumption: disparities vary (mostly) smoothly Minimize energy function:

Digital Visual Effects, Spring 2009 Yung-Yu Chuang 2009/5/21

Advanced Appearance and Shape Models

Markov Random Fields with Efficient Approximations

Nonparametric Semantic Segmentation

Paper Presentation: Shape and Matching

Counting In High Density Crowd Videos

Counting in High-Density Crowd Videos

Multiway Cut for Stereo and Motion with Slanted Surfaces

Efficient Graph Cut Optimization for Full CRFs with Quantized Edges

Normalized Cut meets MRF

Automatic User Interaction Correction via Multi-label Graph-cuts

Counting in High-Density Crowd Videos

Clustering appearance and shape by Jigsaw, and comparing it with Epitome. Papers (1) Clustering appearance and shape by learning jigsaws (2006 NIPS) (2)

“Traditional” image segmentation

Exact Voxel Occupancy with Graph Cuts

Stereo vision Many slides adapted from Steve Seitz.

Ivette Carreras Haroon Idrees

Progress Report Alvaro Velasquez.

Counting in High-Density Crowd Videos

Presentation transcript:

Counting in High-Density Crowd Videos Edgar Lopez Mentor: Dr. Haroon Idrees

Video Annotations Method Compute forward tracks. Compute backward tracks. Match forward and backward tracks. Compute average tracks by using weighting system. t frame t+step frame

Video Annotations 𝑇 𝑖 = 𝑠𝑡𝑒𝑝−𝑖+𝑡 𝑠𝑡𝑒𝑝 𝐹𝑇+ 𝑖−𝑡 𝑠𝑡𝑒𝑝 𝐵𝑇 step = 6 t = 1 𝑇 𝑖 = 𝑠𝑡𝑒𝑝−𝑖+𝑡 𝑠𝑡𝑒𝑝 𝐹𝑇+ 𝑖−𝑡 𝑠𝑡𝑒𝑝 𝐵𝑇 step = 6 t = 1 i = 2 i = 3 i = 4 i = 5 i = 6 𝑇 3 = 4 6 𝐹𝑇+ 2 6 𝐵𝑇 𝑇 4 = 3 6 𝐹𝑇+ 3 6 𝐵𝑇 𝑇 5 = 2 6 𝐹𝑇+ 4 6 𝐵𝑇 𝑇 3 = 1 6 𝐹𝑇+ 5 6 𝐵𝑇 𝑇 2 = 6−2+1 6 𝐹𝑇+ 2−1 6 𝐵𝑇 𝑇 2 = 5 6 𝐹𝑇+ 1 6 𝐵𝑇

Video Annotation Results

Video Annotation Results

Video Annotation Results Every 5th frame annotated

Video Annotation Results Every 30th frame annotated

Crowd Segmentation in Images Superpixels Region Size Regularizer value Density Map Patch size Graph Cuts Multi-label Energy Minimization Lambda (how much weight we add to the constraint that neighboring superpixels must have a similar density)

Crowd Segmentation in Images 1 Graph Cuts Multi-label Energy Minimization u = 𝑢 1 𝑢 2 𝑢 3 . . . 𝑢 𝑛 𝒊=𝟏 𝒏 ( 𝒙 𝒊 − 𝒖 𝒊 ) 𝟐 +λ 𝒋=𝟏 𝒎 ( 𝒙 𝒊 − 𝒙 𝒋 ) 𝟐 GCMex function gives a label to each superpixel 𝟏− 𝒖 𝒊 𝒖 𝒊 𝑢 1 𝑢 2 𝑢 3 λ(𝒖 𝒊 − 𝒖 𝒋 ) 𝟐 𝑢 4 𝑢 5 𝑢 6 𝑢 7 𝑢 8 𝑢 𝑛

Crowd Segmentation in Images Zabih, Ramin D., Olga Veksler, and Yuri Boykov. "System and method for fast approximate energy minimization via graph cuts." U.S. Patent No. 6,744,923. 1 Jun. 2004.

Experiment #1 Region Size = 50, Regularizer = 3000, Patch size = 192, Lambda = 0.25

Experiment #1 Region Size = 50, Regularizer = 3000, Patch size = 192, Lambda = 0.25

Experiment #1 Region Size = 50, Regularizer = 3000, Patch size = 192, Lambda = 0.25

Experiment #1 Region Size = 50, Regularizer = 3000, Patch size = 192, Lambda = 0.25

Experiment #1 Region Size = 50, Regularizer = 3000, Patch size = 192, Lambda = 0.25

Experiment #1 Region Size = 50, Regularizer = 3000, Patch size = 192, Lambda = 0.25

Experiment #2 Same parameters except patch size. PS = 96 PS = 192

Experiment #2 Same parameters except patch size. PS = 96 PS = 192

Experiment #2 Same parameters except patch size. PS = 96 PS = 192

Crowd Segmentation in Images Different image resolutions affect the parameters. Add appearance features to improve segmentation. Mean Intensity of superpixel HOG Features