Scheduling Top- Down and Bo4om- Up Processes
|
|
- Isaac Walters
- 5 years ago
- Views:
Transcription
1 Scheduling Top- Down and Bo4om- Up Processes Song- Chun Zhu, Sinisa Todorovic, and Ales Leonardis At CVPR, Providence, Rhode Island June 16,
2 α, β and γ computing processes in AoG The And-Or graph is a recursive structure. So, consider a node A. 1. Node A at a coarse scale terminates to leaf nodes (ground) 2. Node A is connected to the root. EsJmate the α/β/γ channels when they are applicable an opjmal scheduling problem α β γ
3 Example: Human Faces are Computed in 3 Channels α-channel β-channel γ-channel
4 Human faces in real scenarios α-channel β-channel γ-channel
5 Hierarchical modeling and α, β and γ compujng And-node terminate-node γ: p(face parents) Headshoulder 1. Each node has its own α, β and γ computing processes. β: p(face parts) Face α: p(face compact image data) 2. How much does each channel contribute? Left eye Right eye Nose Mouse Wu & Zhu IJCV11
6 Hierarchical modeling and α, β and γ compujng pg l = arg max pg + log " p( (t(^l)) t(^l)) q( (t(^l))) {z } h X N + p(n) log p( log p(^l _ l )+p(n) NX i=1 log p(x(^l+ i ) X(^l)) {z } parse graph connecjvity = detector (t(^l+ )) t(^l+ i i )) q( (t(^l+ i ))) + X i6=j log p(x(^l+ i i ),X(^l+ j )) i=1 {z } = zoom- in Wu & Zhu IJCV11 + log p( (t(^l )) t(^l )) q( (t(^l )) + log p(x(^l) X(^l {z } = zoom- out ))
7 α processes for the face node α-channels: p(face compact image data) Headshoulder Face Left eye Right eye Nose Mouse
8 β processes for the face node(when its α is off) β-channels: p(face parts), binding Headshoulder Face Left eye Right eye Nose Mouse α-channels of some parts are on
9 β processes for the face node(when its α is off) β-channels: p(face parts), binding Headshoulder Face Left eye Right eye Nose Mouse α-channels of some parts are on
10 β processes for the face node(when its α is off) β-channels: p(face parts), binding Headshoulder Face Left eye Right eye Nose Mouse α-channels of some parts are on
11 β processes for the face node(when its α is off) β-channels: p(face parts), binding Headshoulder Face Left eye Right eye Nose Mouse α-channels of some parts are on
12 γ processes for the face node(when it s α and β is off) γ-channels: p(face parents), predicting α-channels of some parents are on Headshoulder Face Left eye Right eye Nose Mouse
13 γ processes for the face node(when it s α and β is off) γ-channels: p(face parents), predicting α-channels of some parents are on Headshoulder Face Left eye Right eye Nose Mouse
14 γ processes for the face node(when it s α and β is off) γ-channels: p(face parents), predicting α-channels of some parents are on Headshoulder Face Left eye Right eye Nose Mouse
15 γ processes for the face node(when it s α and β is off) γ-channels: p(face parents), predicting α-channels of some parents are on Headshoulder Face Left eye Right eye Nose Mouse
16 In general: recursive α, β and γ channels α β γ
17 α-channel: head-shoulder
18 α-channel: head-shoulder
19 α-channel: head-shoulder
20 α-channel: face
21 α-channel: face
22 α-channel: face
23 α-channel: eye
24 α-channel: eye
25 α-channel: eye
26 α-channel: nose
27 α-channel: nose
28 α-channel: nose
29 α-channel: mouth
30 α-channel: mouth
31 α-channel: mouth
32 All α channels keep things and throw away stuffs by integra(ng α, β and γ channels
33 Integrating α, β and γ channels Thresholds
34 Integrating α, β and γ channels
35 Integrating α, β and γ channels
36 Integrating α, β and γ channels
37 Integrating α, β and γ channels
38 Integrating α, β and γ channels
39 Integrating α, β and γ channels
40 Integrating α, β and γ channels
41 Integrating α, β and γ channels
42 Integrating α, β and γ channels
43 Integrating α, β and γ channels
44 Integrating α, β and γ channels
45 Integrating α, β and γ channels
46 Integrating α, β and γ channels
47 Integrating α, β and γ channels
48 Integrating α, β and γ channels
49 Information contribution α channels
50 Performance improvement red for α, blue for α+β, green for α+γ, cyan for α+β+γ channels
51 Cost- SensiJve and Goal- Guided Inference in AoG Song- Chun Zhu, Sinisa Todorovic, and Ales Leonardis At CVPR, Providence, Rhode Island June 16,
52 Problem Given a high- resolujon and long video, showing SpaJally large scenes, Many people engaged in a wide range of individual acjons group acjvijes
53 Problem Goal: Answer WHAT, WHERE, and WHEN queries about individual acjons group acjvijes
54 MulJscale Event Understanding
55 A Principled Framework Needed for Goal- driven zooming- in or zooming- out, Cost- sensi(ve inference via Scheduling of the bo4om- up and top- down inference Any- Jme inference - - adapt to a given Jme budget
56 And- Or Graph and Parse Graph pg l = arg max pg + log " p( (t(^l)) t(^l)) q( (t(^l))) {z } h X N + p(n) log p( log p(^l _ l )+p(n) NX i=1 log p(x(^l+ i ) X(^l)) {z } parse graph connecjvity = detector (t(^l+ )) t(^l+ i i )) q( (t(^l+ i ))) + X i6=j log p(x(^l+ i i ),X(^l+ j )) i=1 {z } = zoom- in + log p( (t(^l )) t(^l )) q( (t(^l )) + log p(x(^l) X(^l {z } = zoom- out ))
57 Inference - - Alpha of Individual AcJon WaiJng
58 Inference - - Alpha of Individual AcJon WaiJng Walking
59 Inference - - Alpha of Individual AcJon WaiJng Walking
60 Inference - - Bo4om Up (Beta) Group Walking Group Discuss
61 Inference Alpha of Group AcJviJes Group Walking Group Discuss
62 Inference - - Top Down (Gamma) Group Walking Group Discuss
63 Inference - - Top Down (Gamma) WaiJng Walking
64 Inference - - Alpha of Objects Stairs Chairs Food bus
65 Inference - - Bo4om Up (Beta) WaiJng Walking
66 Inference WaiJng Walking
67 Queries about Individual AcJons Only Alpha Zoom- out Zoom- in and Zoom- out
68 Scheduling V ( ) Q (s) =E[G(s, a)] + X T(s, Q (s, ),s 0 ) V Q (s 0 ), =1,...,B s 0 States (s) = Query, All previous acjons, Their rewards unjl this point AcJons (a) = ( 1) Run detector and terminate (Alpha) Bo4om- up (Beta) Top- down (Gamma)
69 Policies, Given a Query (Q) 1. Alpha(Q) 2. Alpha(Q), Bo4om- up, Alpha(Context), Top- down 3. Alpha(Q), Top- down, Alpha(Details), Bo4om- up 4. Alpha(Q), Bo4om- up, Alpha(Context), Top- down, Alpha(Details), Bo4om- up 5. Alpha(Q), Top- down, Alpha(Details), Bo4om- up Alpha(Context), Top- down
70 Group Query
71 Group Query Policy #1 Group Walking Group Discuss
72 Group Query Policy #1 Group Walking Group Discuss
73 Group Query Policy #1 WaiJng Walking
74 Group Query Policy #1 Group Walking Group Discuss
75 Group Query Policy #2 Group Walking Group Discuss
76 Group Query Policy #2 Group Walking Group Discuss
77 Group Query Policy #2
78 Group Query Policy #2
79 Group Query Policy #2 Stairs Chairs Food bus
80 Group Query Policy #2 WaiJng Walking
81 Group Query Policy #2 Group Walking Group Discuss
82 Group Query Policy #2 Group Walking Group Discuss
83 Group Query Alpha Policy #1 Policy #2
84 New Dataset Footage: 106min Frames: 12 fps Res.: 2560x1920 pixels Portable acquisijon system VIRAT Benchmark datasets: single actor single group single acjon
85 Domain Knowledge 5 Group AcJviJes: Walking together, Queuing, Campus tour, Individual AcJons: Walking, Siing, Riding a bike, 16 Objects: Food truck, Vending machine, Bike, Backpack,...
Probabilistic Logic CNF for Reasoning
Probabilistic Logic CNF for Reasoning Song- Chun Zhu, Sinisa Todorovic, and Ales Leonardis At CVPR, Providence, Rhode Island June 16, 2012 Goal input tracking parsing reasoning activity recognition in
More informationModels of Computation. by Costas Busch, LSU
Models of Computation by Costas Busch, LSU 1 Computation CPU memory 2 temporary memory input memory CPU output memory Program memory 3 Example: f ( x) x 3 temporary memory input memory Program memory compute
More informationPictorial Structures Revisited: People Detection and Articulated Pose Estimation. Department of Computer Science TU Darmstadt
Pictorial Structures Revisited: People Detection and Articulated Pose Estimation Mykhaylo Andriluka Stefan Roth Bernt Schiele Department of Computer Science TU Darmstadt Generic model for human detection
More informationIntelligent Systems:
Intelligent Systems: Undirected Graphical models (Factor Graphs) (2 lectures) Carsten Rother 15/01/2015 Intelligent Systems: Probabilistic Inference in DGM and UGM Roadmap for next two lectures Definition
More informationTHis paper addresses inference of why and how people
FOR REVIEW: IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE 1 Learning and Inferring Dark Matter and Predicting Human Intents and Trajectories in Videos Dan Xie, Tianmin Shu, Sinisa Todorovic
More informationInferring Dark Matter and Dark Energy from Videos
2013 IEEE International Conference on Computer Vision Inferring Dark Matter and Dark Energy from Videos Dan Xie, Sinisa Todorovic, and Song-Chun Zhu Center for Vision, Cognition, Learning and Art Depts.
More informationLearning Spa+otemporal Graphs of Human Ac+vi+es
Learning Spa+otemporal Graphs of Human Ac+vi+es William Brendel Sinisa Todorovic Our Goal Long Jump Triple Jump Recognize all occurrences of activities Identify the start and end frames Parse the video
More informationMessage Passing Algorithms and Junction Tree Algorithms
Message Passing lgorithms and Junction Tree lgorithms Le Song Machine Learning II: dvanced Topics S 8803ML, Spring 2012 Inference in raphical Models eneral form of the inference problem P X 1,, X n Ψ(
More informationJesus Heals a Blind Man
Jesus Heals a Blind Man Goal: To wonder at Jesus power to heal a man born blind. RECOGNIZING GOD S GRACE...... In Mark 8:22 26 Jesus healed a blind man in two stages. When the blind man was brought to
More informationDeep Reinforcement Learning for Unsupervised Video Summarization with Diversity- Representativeness Reward
Deep Reinforcement Learning for Unsupervised Video Summarization with Diversity- Representativeness Reward Kaiyang Zhou, Yu Qiao, Tao Xiang AAAI 2018 What is video summarization? Goal: to automatically
More informationEnergy Lab. Types of Energy What is Energy? 1. What is Energy? 2. Name the 9 kinds of energy in the song.
Name: Types of Energy What is Energy? 1. What is Energy? Energy Lab Period: 2. Name the 9 kinds of energy in the song. 3. What did the discovery of Nuclear Energy tell scientists? 4. What does the law
More informationDirected Graphical Models or Bayesian Networks
Directed Graphical Models or Bayesian Networks Le Song Machine Learning II: Advanced Topics CSE 8803ML, Spring 2012 Bayesian Networks One of the most exciting recent advancements in statistical AI Compact
More informationGraphical Object Models for Detection and Tracking
Graphical Object Models for Detection and Tracking (ls@cs.brown.edu) Department of Computer Science Brown University Joined work with: -Ying Zhu, Siemens Corporate Research, Princeton, NJ -DorinComaniciu,
More informationLevel-Set Person Segmentation and Tracking with Multi-Region Appearance Models and Top-Down Shape Information Appendix
Level-Set Person Segmentation and Tracking with Multi-Region Appearance Models and Top-Down Shape Information Appendix Esther Horbert, Konstantinos Rematas, Bastian Leibe UMIC Research Centre, RWTH Aachen
More informationPMR Learning as Inference
Outline PMR Learning as Inference Probabilistic Modelling and Reasoning Amos Storkey Modelling 2 The Exponential Family 3 Bayesian Sets School of Informatics, University of Edinburgh Amos Storkey PMR Learning
More informationGraphical Models 101. Biostatistics 615/815 Lecture 12: Hidden Markov Models. Example probability distribution. An example graphical model
101 Biostatistics 615/815 Lecture 12: Hidden Markov Models Hyun Min Kang February 15th, 2011 Marriage between probability theory and graph theory Each random variable is represented as vertex Dependency
More informationObject Detection Grammars
Object Detection Grammars Pedro F. Felzenszwalb and David McAllester February 11, 2010 1 Introduction We formulate a general grammar model motivated by the problem of object detection in computer vision.
More informationLeaving Some Stones Unturned: Dynamic Feature Prioritization for Activity Detection in Streaming Video
In Proceedings of the European Conference on Computer Vision (ECCV), 26 Leaving Some Stones Unturned: Dynamic Feature Prioritization for Activity Detection in Streaming Video Yu-Chuan Su and Kristen Grauman
More informationECE 6504: Advanced Topics in Machine Learning Probabilistic Graphical Models and Large-Scale Learning
ECE 6504: Advanced Topics in Machine Learning Probabilistic Graphical Models and Large-Scale Learning Topics Summary of Class Advanced Topics Dhruv Batra Virginia Tech HW1 Grades Mean: 28.5/38 ~= 74.9%
More informationSemi-Supervised Learning with Graphs
Semi-Supervised Learning with Graphs Xiaojin (Jerry) Zhu LTI SCS CMU Thesis Committee John Lafferty (co-chair) Ronald Rosenfeld (co-chair) Zoubin Ghahramani Tommi Jaakkola 1 Semi-supervised Learning classifiers
More informationExercises NP-completeness
Exercises NP-completeness Exercise 1 Knapsack problem Consider the Knapsack problem. We have n items, each with weight a j (j = 1,..., n) and value c j (j = 1,..., n) and an integer B. All a j and c j
More informationAlpha-Beta Pruning: Algorithm and Analysis
Alpha-Beta Pruning: Algorithm and Analysis Tsan-sheng Hsu tshsu@iis.sinica.edu.tw http://www.iis.sinica.edu.tw/~tshsu 1 Introduction Alpha-beta pruning is the standard searching procedure used for 2-person
More informationRNNLIB: Connectionist Temporal Classification and Transcription Layer
RNNLIB: Connectionist Temporal Classification and Transcription Layer Wantee Wang 2015-02-08 16:56:40 +0800 Contents 1 The Name 2 2 The Theory 2 2.1 List of Symbols............................ 2 2.2 Training
More information1 Write the subject pronoun for each picture. Use the words in the box.
1 Write the subject pronoun for each picture. Use the words in the box. I he she it we they 1 2_ 3 4 5_ 6 2. Label the pictures. Use the words in the box. Add the. chairs blackboard book desks rubber ruler
More informationAlpha-Beta Pruning: Algorithm and Analysis
Alpha-Beta Pruning: Algorithm and Analysis Tsan-sheng Hsu tshsu@iis.sinica.edu.tw http://www.iis.sinica.edu.tw/~tshsu 1 Introduction Alpha-beta pruning is the standard searching procedure used for 2-person
More informationParsing Video Events with Goal inference and Intent Prediction
Parsing Video Events with Goal inference and Intent Prediction Mingtao Pei a,b, Yunde Jia a, Song-Chun Zhu b a Lab of Intelligent Info. Technology, Beijing Institute of Technology b Department of Statistics,
More informationA Tour of Reinforcement Learning The View from Continuous Control. Benjamin Recht University of California, Berkeley
A Tour of Reinforcement Learning The View from Continuous Control Benjamin Recht University of California, Berkeley trustable, scalable, predictable Control Theory! Reinforcement Learning is the study
More informationA Learning Perceptual Causality from Video
A Learning Perceptual Causality from Video AMY FIRE and SONG-CHUN ZHU, University of California, Los Angeles Perceptual causality is the perception of causal relationships from observation. Humans, even
More informationFunctions Study Guide
Functions Study Guide Name Give the BEST classification for each function: relation or function. Explain why. 1. 2. {(4,-2), (5,-7), (-8,2), (1,-1)} 3. f(x) = 7x + 8 4. 5. 6. 7. What is the range of the
More informationGraph Cut based Inference with Co-occurrence Statistics. Ľubor Ladický, Chris Russell, Pushmeet Kohli, Philip Torr
Graph Cut based Inference with Co-occurrence Statistics Ľubor Ladický, Chris Russell, Pushmeet Kohli, Philip Torr Image labelling Problems Assign a label to each image pixel Geometry Estimation Image Denoising
More informationComplexity of Representation and Inference in Compositional Models with Part Sharing
Journal of Machine Learning Research 17 (2016) 1-28 Submitted 7/13; Revised 5/15; Published 4/16 Complexity of Representation and Inference in Compositional Models with Part Sharing Alan Yuille Departments
More informationCourse 10. Kernel methods. Classical and deep neural networks.
Course 10 Kernel methods. Classical and deep neural networks. Kernel methods in similarity-based learning Following (Ionescu, 2018) The Vector Space Model ò The representation of a set of objects as vectors
More informationCognitive Systems 300: Probability and Causality (cont.)
Cognitive Systems 300: Probability and Causality (cont.) David Poole and Peter Danielson University of British Columbia Fall 2013 1 David Poole and Peter Danielson Cognitive Systems 300: Probability and
More informationReadings: K&F: 16.3, 16.4, Graphical Models Carlos Guestrin Carnegie Mellon University October 6 th, 2008
Readings: K&F: 16.3, 16.4, 17.3 Bayesian Param. Learning Bayesian Structure Learning Graphical Models 10708 Carlos Guestrin Carnegie Mellon University October 6 th, 2008 10-708 Carlos Guestrin 2006-2008
More informationReview: Bayesian learning and inference
Review: Bayesian learning and inference Suppose the agent has to make decisions about the value of an unobserved query variable X based on the values of an observed evidence variable E Inference problem:
More informationContext Free Grammars: Introduction. Context Free Grammars: Simplifying CFGs
Context Free Grammars: Introduction CFGs are more powerful than RGs because of the following 2 properties: 1. Recursion Rule is recursive if it is of the form X w 1 Y w 2, where Y w 3 Xw 4 and w 1, w 2,
More informationBayesian network modeling. 1
Bayesian network modeling http://springuniversity.bc3research.org/ 1 Probabilistic vs. deterministic modeling approaches Probabilistic Explanatory power (e.g., r 2 ) Explanation why Based on inductive
More informationLecture 15. Probabilistic Models on Graph
Lecture 15. Probabilistic Models on Graph Prof. Alan Yuille Spring 2014 1 Introduction We discuss how to define probabilistic models that use richly structured probability distributions and describe how
More informationMeasuring Motion. Day 1
Measuring Motion Day 1 Objectives I will identify the relationship between motion and a reference point I will identify the two factors that speed depends on I will determine the difference between speed
More informationENERGY + FORCES STUDY GUIDE. 9 Weeks Test Date: Parent Signature (BONUS!): energy - Kinetic energy - WITHOUT
WITH KINETIC WITHOUT KINETIC Name: Pd: ENERGY + FORCES STUDY GUIDE 9 Weeks Test Date: Parent Signature (BONUS!): 6.8A FORMS of ENERGY energy - Energy exists in two forms: KINETIC or POTENTIAL. Kinetic
More informationChapter 4 - Functions and Relations
Warm Up In your notebook, write down a relationship between two different quantities that could be represented by this graph: Quantity 2 Quantity 1 Sep 21 7:55 AM Chapter 4 - Functions and Relations Vocabulary
More informationTracking Human Heads Based on Interaction between Hypotheses with Certainty
Proc. of The 13th Scandinavian Conference on Image Analysis (SCIA2003), (J. Bigun and T. Gustavsson eds.: Image Analysis, LNCS Vol. 2749, Springer), pp. 617 624, 2003. Tracking Human Heads Based on Interaction
More informationMotion and Forces study Guide
Motion and Forces study Guide Completion Complete each statement. 1. The motion of an object looks different to observers in different. 2. The SI unit for measuring is the meter. 3. The direction and length
More informationAnnouncements. H6 posted 2 days ago (due on Tue) Midterm went well: Very nice curve. Average 65% High score 74/75
Announcements H6 posted 2 days ago (due on Tue) Mterm went well: Average 65% High score 74/75 Very nice curve 80 70 60 50 40 30 20 10 0 1 6 11 16 21 26 31 36 41 46 51 56 61 66 71 76 81 86 91 96 101 106
More informationInteger Linear Programming (ILP)
Integer Linear Programming (ILP) Zdeněk Hanzálek, Přemysl Šůcha hanzalek@fel.cvut.cz CTU in Prague March 8, 2017 Z. Hanzálek (CTU) Integer Linear Programming (ILP) March 8, 2017 1 / 43 Table of contents
More informationDEKDIV: A Linked-Data-Driven Web Portal for Learning Analytics Data Enrichment, Interactive Visualization, and Knowledge Discovery
DEKDIV: A Linked-Data-Driven Web Portal for Learning Analytics Data Enrichment, Interactive Visualization, and Knowledge Discovery Yingjie Hu, Grant McKenzie, Jiue-An Yang, Song Gao, Amin Abdalla, and
More informationContents. Reinforcement & Extension worksheets
Contents Reinforcement & Extension worksheets Reinforcement? Unit? Look and circle. jump / run rollerblade / dance climb / jump ride a bike / dance jump / rollerblade run / ride a bike ride a bike dance
More informationStochastic Search: Part 2. Genetic Algorithms. Vincent A. Cicirello. Robotics Institute. Carnegie Mellon University
Stochastic Search: Part 2 Genetic Algorithms Vincent A. Cicirello Robotics Institute Carnegie Mellon University 5000 Forbes Avenue Pittsburgh, PA 15213 cicirello@ri.cmu.edu 1 The Genetic Algorithm (GA)
More informationThe exam is closed book, closed calculator, and closed notes except your one-page crib sheet.
CS 188 Fall 2015 Introduction to Artificial Intelligence Final You have approximately 2 hours and 50 minutes. The exam is closed book, closed calculator, and closed notes except your one-page crib sheet.
More informationRobust Motion Segmentation by Spectral Clustering
Robust Motion Segmentation by Spectral Clustering Hongbin Wang and Phil F. Culverhouse Centre for Robotics Intelligent Systems University of Plymouth Plymouth, PL4 8AA, UK {hongbin.wang, P.Culverhouse}@plymouth.ac.uk
More informationLearning in State-Space Reinforcement Learning CIS 32
Learning in State-Space Reinforcement Learning CIS 32 Functionalia Syllabus Updated: MIDTERM and REVIEW moved up one day. MIDTERM: Everything through Evolutionary Agents. HW 2 Out - DUE Sunday before the
More informationThis lecture covers Chapter 5 of HMU: Context-free Grammars
This lecture covers Chapter 5 of HMU: Context-free rammars (Context-free) rammars (Leftmost and Rightmost) Derivations Parse Trees An quivalence between Derivations and Parse Trees Ambiguity in rammars
More informationTutorial 2. Fall /21. CPSC 340: Machine Learning and Data Mining
1/21 Tutorial 2 CPSC 340: Machine Learning and Data Mining Fall 2016 Overview 2/21 1 Decision Tree Decision Stump Decision Tree 2 Training, Testing, and Validation Set 3 Naive Bayes Classifier Decision
More informationChapter 9: Relations Relations
Chapter 9: Relations 9.1 - Relations Definition 1 (Relation). Let A and B be sets. A binary relation from A to B is a subset R A B, i.e., R is a set of ordered pairs where the first element from each pair
More informationSFM-11:CONNECT Summer School, Bertinoro, June 2011
SFM-:CONNECT Summer School, Bertinoro, June 20 EU-FP7: CONNECT LSCITS/PSS VERIWARE Part 3 Markov decision processes Overview Lectures and 2: Introduction 2 Discrete-time Markov chains 3 Markov decision
More informationThe Exciting Guide To Probability Distributions Part 2. Jamie Frost v1.1
The Exciting Guide To Probability Distributions Part 2 Jamie Frost v. Contents Part 2 A revisit of the multinomial distribution The Dirichlet Distribution The Beta Distribution Conjugate Priors The Gamma
More informationCMPS 6630: Introduction to Computational Biology and Bioinformatics. Structure Comparison
CMPS 6630: Introduction to Computational Biology and Bioinformatics Structure Comparison Protein Structure Comparison Motivation Understand sequence and structure variability Understand Domain architecture
More informationFinal. Introduction to Artificial Intelligence. CS 188 Spring You have approximately 2 hours and 50 minutes.
CS 188 Spring 2014 Introduction to Artificial Intelligence Final You have approximately 2 hours and 50 minutes. The exam is closed book, closed notes except your two-page crib sheet. Mark your answers
More informationMoment-based Availability Prediction for Bike-Sharing Systems
Moment-based Availability Prediction for Bike-Sharing Systems Jane Hillston Joint work with Cheng Feng and Daniël Reijsbergen LFCS, School of Informatics, University of Edinburgh http://www.quanticol.eu
More informationStatistical Filters for Crowd Image Analysis
Statistical Filters for Crowd Image Analysis Ákos Utasi, Ákos Kiss and Tamás Szirányi Distributed Events Analysis Research Group, Computer and Automation Research Institute H-1111 Budapest, Kende utca
More informationIS-ZC444: ARTIFICIAL INTELLIGENCE
IS-ZC444: ARTIFICIAL INTELLIGENCE Lecture-07: Beyond Classical Search Dr. Kamlesh Tiwari Assistant Professor Department of Computer Science and Information Systems, BITS Pilani, Pilani, Jhunjhunu-333031,
More informationradio, riding This curriculum
NERGY RADE ASSESSMENT PACKET Energy is the mover and shaker of the universe. Heat from the sun, sounds from your radio, riding a bike and watching a movie are all expressionss of different forms of energy.
More informationMachine Learning 4771
Machine Learning 4771 Instructor: Tony Jebara Topic 16 Undirected Graphs Undirected Separation Inferring Marginals & Conditionals Moralization Junction Trees Triangulation Undirected Graphs Separation
More informationVocabulary. 1. the product of nine and y 2. the sum of m and six
Review Block 4 Vocabulary algebraic expression equivalent expressions simplify an expression coefficient evaluate solution constant inequality term equation like terms variable Lesson 4.1 ~ Expressions
More informationDistributed detection of topological changes in communication networks. Riccardo Lucchese, Damiano Varagnolo, Karl H. Johansson
1 Distributed detection of topological changes in communication networks Riccardo Lucchese, Damiano Varagnolo, Karl H. Johansson Thanks to... 2 The need: detecting changes in topological networks 3 The
More informationSelf-Tuning Semantic Image Segmentation
Self-Tuning Semantic Image Segmentation Sergey Milyaev 1,2, Olga Barinova 2 1 Voronezh State University sergey.milyaev@gmail.com 2 Lomonosov Moscow State University obarinova@graphics.cs.msu.su Abstract.
More informationSupplementary Material Accompanying Geometry Driven Semantic Labeling of Indoor Scenes
Supplementary Material Accompanying Geometry Driven Semantic Labeling of Indoor Scenes Salman H. Khan 1, Mohammed Bennamoun 1, Ferdous Sohel 1 and Roberto Togneri 2 School of CSSE 1, School of EECE 2 The
More information1. Type your first name. * 2. Type your last name. * 3. Choose the block I teach you for science. * Mark only one oval. Block 1.
Hippenmeyer Physics Assessment 1 Your email address (khippenmeyer@ncmcs.net) will be recorded when you submit this form. Not khippenmeyer? Sign out * Required 1. Type your first name. * 2. Type your last
More informationInference in Graphical Models Variable Elimination and Message Passing Algorithm
Inference in Graphical Models Variable Elimination and Message Passing lgorithm Le Song Machine Learning II: dvanced Topics SE 8803ML, Spring 2012 onditional Independence ssumptions Local Markov ssumption
More informationOn the Complexity of Mapping Pipelined Filtering Services on Heterogeneous Platforms
On the Complexity of Mapping Pipelined Filtering Services on Heterogeneous Platforms Anne Benoit, Fanny Dufossé and Yves Robert LIP, École Normale Supérieure de Lyon, France {Anne.Benoit Fanny.Dufosse
More informationStatistics and Sampling distributions
Statistics and Sampling distributions a statistic is a numerical summary of sample data. It is a rv. The distribution of a statistic is called its sampling distribution. The rv s X 1, X 2,, X n are said
More informationAdaptive Crowdsourcing via EM with Prior
Adaptive Crowdsourcing via EM with Prior Peter Maginnis and Tanmay Gupta May, 205 In this work, we make two primary contributions: derivation of the EM update for the shifted and rescaled beta prior and
More informationMilestone Review Contract
MATTER PART 1 1) Chemical Change 2) Chemical Property 3) Condensation 4) Density 5) Endothermic Reaction 6) Evaporation 7) Exothermic Reaction 8) Freezing 9) Inertia 10) Mass 11) Matter 12) Melting 13)
More informationSemi-Supervised Learning with Graphs. Xiaojin (Jerry) Zhu School of Computer Science Carnegie Mellon University
Semi-Supervised Learning with Graphs Xiaojin (Jerry) Zhu School of Computer Science Carnegie Mellon University 1 Semi-supervised Learning classification classifiers need labeled data to train labeled data
More informationReinforcement Learning
1 Reinforcement Learning Chris Watkins Department of Computer Science Royal Holloway, University of London July 27, 2015 2 Plan 1 Why reinforcement learning? Where does this theory come from? Markov decision
More informationA C E. Answers Investigation 4. Applications. Shape Number Number of Toothpicks
Applications 1. a. (See Figure 1.) b. possible equation: T = 3s, where s is the shape number and T is the number of toothpicks c. There are many equations: for example, T = s + s + s or T = s + 2s would
More informationFinal Exam, Machine Learning, Spring 2009
Name: Andrew ID: Final Exam, 10701 Machine Learning, Spring 2009 - The exam is open-book, open-notes, no electronics other than calculators. - The maximum possible score on this exam is 100. You have 3
More informationLecture Notes 4 Vector Detection and Estimation. Vector Detection Reconstruction Problem Detection for Vector AGN Channel
Lecture Notes 4 Vector Detection and Estimation Vector Detection Reconstruction Problem Detection for Vector AGN Channel Vector Linear Estimation Linear Innovation Sequence Kalman Filter EE 278B: Random
More informationSpatial Bayesian Nonparametrics for Natural Image Segmentation
Spatial Bayesian Nonparametrics for Natural Image Segmentation Erik Sudderth Brown University Joint work with Michael Jordan University of California Soumya Ghosh Brown University Parsing Visual Scenes
More informationCollective Activity Detection using Hinge-loss Markov Random Fields
Collective Activity Detection using Hinge-loss Markov Random Fields Ben London, Sameh Khamis, Stephen H. Bach, Bert Huang, Lise Getoor, Larry Davis University of Maryland College Park, MD 20742 {blondon,sameh,bach,bert,getoor,lsdavis}@cs.umd.edu
More informationSpeed and velocity. Objectives. Physics terms. Assessment. Speed versus velocity. Equations 5/15/14
Speed and Objectives Describe one dimensional motion using equations for speed and. Analyze one dimensional motion using equations for speed and. Define and identify positive and negative velocities. 1.
More informationSum-Product Networks: A New Deep Architecture
Sum-Product Networks: A New Deep Architecture Pedro Domingos Dept. Computer Science & Eng. University of Washington Joint work with Hoifung Poon 1 Graphical Models: Challenges Bayesian Network Markov Network
More informationMining of Massive Datasets Jure Leskovec, AnandRajaraman, Jeff Ullman Stanford University
Note to other teachers and users of these slides: We would be delighted if you found this our material useful in giving your own lectures. Feel free to use these slides verbatim, or to modify them to fit
More informationPart I. C. M. Bishop PATTERN RECOGNITION AND MACHINE LEARNING CHAPTER 8: GRAPHICAL MODELS
Part I C. M. Bishop PATTERN RECOGNITION AND MACHINE LEARNING CHAPTER 8: GRAPHICAL MODELS Probabilistic Graphical Models Graphical representation of a probabilistic model Each variable corresponds to a
More informationEven More on Dynamic Programming
Algorithms & Models of Computation CS/ECE 374, Fall 2017 Even More on Dynamic Programming Lecture 15 Thursday, October 19, 2017 Sariel Har-Peled (UIUC) CS374 1 Fall 2017 1 / 26 Part I Longest Common Subsequence
More informationCS221 Practice Midterm
CS221 Practice Midterm Autumn 2012 1 ther Midterms The following pages are excerpts from similar classes midterms. The content is similar to what we ve been covering this quarter, so that it should be
More informationDefinition A transition system S is a pair of the form. where C is the set of configurations and T C C is a relation, the
Transition system Definition 1.3.1 transition system S is a pair of the form = S T) (, where is the set of configurations and T is a relation, the transition relation. lgorithms and Data Structures hapter
More informationIntroduction. next up previous Next: Problem Description Up: Bayesian Networks Previous: Bayesian Networks
Next: Problem Description Up: Bayesian Networks Previous: Bayesian Networks Introduction Autonomous agents often find themselves facing a great deal of uncertainty. It decides how to act based on its perceived
More informationClustering with k-means and Gaussian mixture distributions
Clustering with k-means and Gaussian mixture distributions Machine Learning and Category Representation 2012-2013 Jakob Verbeek, ovember 23, 2012 Course website: http://lear.inrialpes.fr/~verbeek/mlcr.12.13
More informationOn the Generation of Circuits and Minimal Forbidden Sets
Mathematical Programming manuscript No. (will be inserted by the editor) Frederik Stork Marc Uetz On the Generation of Circuits and Minimal Forbidden Sets January 31, 2004 Abstract We present several complexity
More informationScale & Affine Invariant Interest Point Detectors
Scale & Affine Invariant Interest Point Detectors KRYSTIAN MIKOLAJCZYK AND CORDELIA SCHMID [2004] Shreyas Saxena Gurkirit Singh 23/11/2012 Introduction We are interested in finding interest points. What
More informationAlpha-Beta Pruning: Algorithm and Analysis
Alpha-Beta Pruning: Algorithm and Analysis Tsan-sheng Hsu tshsu@iis.sinica.edu.tw http://www.iis.sinica.edu.tw/~tshsu 1 Introduction Alpha-beta pruning is the standard searching procedure used for solving
More informationFINAL EXAM CHEAT SHEET/STUDY GUIDE. You can use this as a study guide. You will also be able to use it on the Final Exam on
FINAL EXAM CHEAT SHEET/STUDY GUIDE You can use this as a study guide. You will also be able to use it on the Final Exam on Tuesday. If there s anything else you feel should be on this, please send me email
More informationKepler photometric accuracy with degraded attitude control
Kepler photometric accuracy with degraded attitude control Hans Kjeldsen, Torben Arentoft and Jørgen Christensen-Dalsgaard KASOC, Stellar Astrophysics Centre, Aarhus University, Denmark - 25 July 2013
More informationThe Off Switch Dylan Hadfield- Menell University of California, Berkeley Joint work with Anca Dragan, Pieter Abbeel, and Stuart Russell
The Off Switch Dylan Hadfield- Menell University of California, Berkeley Joint work with Anca Dragan, Pieter Abbeel, and Stuart Russell AI Agents in Society Goal: Design incenjve schemes for arjficial
More informationOVERVIEW PLANTS AND ANIMALS GRADES 1 2 CONTENT GOALS OVERVIEW CONTENTS
GRADES 1 2 OVERVIEW CONTENT GOALS The Plants and Animals Module provides experiences that heighten young students awareness of the different ways that plants and animals meet their needs. Students care
More informationGraphical Models for Automatic Speech Recognition
Graphical Models for Automatic Speech Recognition Advanced Signal Processing SE 2, SS05 Stefan Petrik Signal Processing and Speech Communication Laboratory Graz University of Technology GMs for Automatic
More informationFinal. CS 188 Fall Introduction to Artificial Intelligence
CS 188 Fall 2012 Introduction to Artificial Intelligence Final You have approximately 3 hours. The exam is closed book, closed notes except your three one-page crib sheets. Please use non-programmable
More informationStable and Efficient Representation Learning with Nonnegativity Constraints. Tsung-Han Lin and H.T. Kung
Stable and Efficient Representation Learning with Nonnegativity Constraints Tsung-Han Lin and H.T. Kung Unsupervised Representation Learning Layer 3 Representation Encoding Sparse encoder Layer 2 Representation
More informationCONVOLUTIONAL DEEP BELIEF NETWORKS
CONVOLUTIONAL DEEP BELIEF NETWORKS Talk by Emanuele Coviello Convolutional Deep Belief Networks for Scalable Unsupervised Learning of Hierarchical Representations Honglak Lee Roger Grosse Rajesh Ranganath
More information