Learning to Detect A Salient Object Reporter: 鄭綱 (3/2)

Slides:



Advertisements
Similar presentations
Mean-Field Theory and Its Applications In Computer Vision1 1.
Advertisements

Algorithms for MAP estimation in Markov Random Fields Vladimir Kolmogorov University College London Tutorial at GDR (Optimisation Discrète, Graph Cuts.
Bayesian Belief Propagation
HOPS: Efficient Region Labeling using Higher Order Proxy Neighborhoods Albert Y. C. Chen 1, Jason J. Corso 1, and Le Wang 2 1 Dept. of Computer Science.
Weakly supervised learning of MRF models for image region labeling Jakob Verbeek LEAR team, INRIA Rhône-Alpes.
Change Detection C. Stauffer and W.E.L. Grimson, “Learning patterns of activity using real time tracking,” IEEE Trans. On PAMI, 22(8): , Aug 2000.
SOFT SCISSORS: AN INTERACTIVE TOOL FOR REALTIME HIGH QUALITY MATTING International Conference on Computer Graphics and Interactive Techniques ACM SIGGRAPH.
Graph cut Chien-chi Chen.
ICCV 2007 tutorial Part III Message-passing algorithms for energy minimization Vladimir Kolmogorov University College London.
Lecture 07 Segmentation Lecture 07 Segmentation Mata kuliah: T Computer Vision Tahun: 2010.
電腦視覺 Computer and Robot Vision I Chapter2: Binary Machine Vision: Thresholding and Segmentation Instructor: Shih-Shinh Huang 1.
Foreground Modeling The Shape of Things that Came Nathan Jacobs Advisor: Robert Pless Computer Science Washington University in St. Louis.
Markov Networks.
IEEE TCSVT 2011 Wonjun Kim Chanho Jung Changick Kim
Yilin Wang 11/5/2009. Background Labeling Problem Labeling: Observed data set (X) Label set (L) Inferring the labels of the data points Most vision problems.
1 Image Completion using Global Optimization Presented by Tingfan Wu.
1 On the Statistical Analysis of Dirty Pictures Julian Besag.
Abstract We present a model of curvilinear grouping using piecewise linear representations of contours and a conditional random field to capture continuity.
1 Markov random field: A brief introduction Tzu-Cheng Jen Institute of Electronics, NCTU
Abstract Extracting a matte by previous approaches require the input image to be pre-segmented into three regions (trimap). This pre-segmentation based.
1 Integration of Background Modeling and Object Tracking Yu-Ting Chen, Chu-Song Chen, Yi-Ping Hung IEEE ICME, 2006.
An Iterative Optimization Approach for Unified Image Segmentation and Matting Hello everyone, my name is Jue Wang, I’m glad to be here to present our paper.
Cue Integration in Figure/Ground Labeling Xiaofeng Ren, Charless Fowlkes and Jitendra Malik, U.C. Berkeley We present a model of edge and region grouping.
Introduction of Saliency Map
Graph-based Segmentation
Image Segmentation Image segmentation is the operation of partitioning an image into a collection of connected sets of pixels. 1. into regions, which usually.
Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR’04) /04 $20.00 c 2004 IEEE 1 Li Hong.
Extracting Places and Activities from GPS Traces Using Hierarchical Conditional Random Fields Yong-Joong Kim Dept. of Computer Science Yonsei.
MRFs and Segmentation with Graph Cuts Computer Vision CS 543 / ECE 549 University of Illinois Derek Hoiem 03/31/15.
Michael Bleyer LVA Stereo Vision
MRFs and Segmentation with Graph Cuts Computer Vision CS 543 / ECE 549 University of Illinois Derek Hoiem 02/24/10.
Object Stereo- Joint Stereo Matching and Object Segmentation Computer Vision and Pattern Recognition (CVPR), 2011 IEEE Conference on Michael Bleyer Vienna.
黃文中 Introduction The Model Results Conclusion 2.
Background Subtraction based on Cooccurrence of Image Variations Seki, Wada, Fujiwara & Sumi Presented by: Alon Pakash & Gilad Karni.
Markov Random Fields Probabilistic Models for Images
EECS 274 Computer Vision Segmentation by Clustering II.
Digital Camera and Computer Vision Laboratory Department of Computer Science and Information Engineering National Taiwan University, Taipei, Taiwan, R.O.C.
Algorithms for MAP estimation in Markov Random Fields Vladimir Kolmogorov University College London.
Update any set S of nodes simultaneously with step-size We show fixed point update is monotone for · 1/|S| Covering Trees and Lower-bounds on Quadratic.
Region-Based Saliency Detection and Its Application in Object Recognition IEEE TRANSACTIONS ON CIRCUITS AND SYSTEM FOR VIDEO TECHNOLOGY, VOL. 24 NO. 5,
1 Markov random field: A brief introduction (2) Tzu-Cheng Jen Institute of Electronics, NCTU
Approximate Inference: Decomposition Methods with Applications to Computer Vision Kyomin Jung ( KAIST ) Joint work with Pushmeet Kohli (Microsoft Research)
Presenter : Kuang-Jui Hsu Date : 2011/3/24(Thur.).
Real-Time Tracking with Mean Shift Presented by: Qiuhua Liu May 6, 2005.
A Dynamic Conditional Random Field Model for Object Segmentation in Image Sequences Duke University Machine Learning Group Presented by Qiuhua Liu March.
Towards Total Scene Understanding: Classification, Annotation and Segmentation in an Automatic Framework N 工科所 錢雅馨 2011/01/16 Li-Jia Li, Richard.
Journal of Visual Communication and Image Representation
A Model of Saliency-Based Visual Attention for Rapid Scene Analysis
CS654: Digital Image Analysis Lecture 28: Advanced topics in Image Segmentation Image courtesy: IEEE, IJCV.
Contextual models for object detection using boosted random fields by Antonio Torralba, Kevin P. Murphy and William T. Freeman.
Efficient Belief Propagation for Image Restoration Qi Zhao Mar.22,2006.
Learning video saliency from human gaze using candidate selection CVPR2013 Poster.
Discriminative Training and Machine Learning Approaches Machine Learning Lab, Dept. of CSIE, NCKU Chih-Pin Liao.
Digital Camera and Computer Vision Laboratory Department of Computer Science and Information Engineering National Taiwan University, Taipei, Taiwan, R.O.C.
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.
 Mentor : Prof. Amitabha Mukerjee Learning to Detect Salient Objects Team Members - Avinash Koyya Diwakar Chauhan.
Markov Random Fields in Vision
Jianchao Yang, John Wright, Thomas Huang, Yi Ma CVPR 2008 Image Super-Resolution as Sparse Representation of Raw Image Patches.
Learning Hierarchical Features for Scene Labeling Cle’ment Farabet, Camille Couprie, Laurent Najman, and Yann LeCun by Dong Nie.
Image segmentation.
MRFs and Segmentation with Graph Cuts Computer Vision CS 543 / ECE 549 University of Illinois Derek Hoiem 03/27/12.
Course : T Computer Vision
Nonparametric Semantic Segmentation
Saliency detection Donghun Yeo CV Lab..
Learning to Detect a Salient Object
Learning to Combine Bottom-Up and Top-Down Segmentation
Inferring Edges by Using Belief Propagation
Expectation-Maximization & Belief Propagation
A Block Based MAP Segmentation for Image Compression
“Traditional” image segmentation
Presentation transcript:

Learning to Detect A Salient Object Reporter: 鄭綱 (3/2)

Outline  Introduction  CRF  Formulation of Static Salient Object  Strong Contrast  Center-Surround Histogram  Color Spatial-Distribution  Learning & Inference for the Model  Formulation of Dynamic Salient Object  Results  Conclusion  References

Introduction  Image Labeling Problem Sky Building Lawn Plane Tree

Introduction  Which kinds of information can be used for labeling? Features from individual sites Intensity, color, texture, … Interactions with neighboring sites Contextual information Vegetation Sky or Building?

Introduction  Contextual information: 2 types of interactions Interaction with neighboring labels (Spatial smoothness of labels) neighboring sites tend to have similar labels(except at the discontinuities) Interactions with neighboring observed data Building Sky

Introduction  Let be the label of the node of the image set S, and N i be the neighboring nodes of node i.  Three kinds of information for image labeling  Features from local node  Interaction with neighboring labels  Interaction with neighboring observed data node iS-{i}NiNi

Introduction  General formulation: where and are called association potential and interaction potential.

Introduction Labels in Spatial Data are NOT independent! – spatially adjacent labels are often the same (Markov Random Fields and Conditional Random Fields) – spatially adjacent elements that have similar features often receive the same label (Conditional Random Fields) – spatially adjacent elements that have different features may not have correlated labels (Conditional Random Fields)

Salient Object? Salience Map?

Formulation of Static Salient Object Detection  CRF model (static image): Salient object featurePairwise feature Strong contrast Center- surround histogram Color spatial- distribution Maximize!! Minimize!!

Strong Contrast  Generate contrast map for each level of 6- level Gaussian pyramid. Then do linear combination. Input imageLevel 1 Level 4

Center-Surround Histogram  Salient object usually has a “huge” difference from local area. ……. More different between 2 rectangles !

Center-Surround Histogram where …... ??

Color Spatial-Distribution  The wider a color is distributed in the image, the less possible a salient object contains this color.  Each pixel is assigned to a color component with the probability:

Color Spatial-Distribution  Then the feature can be defined as a weighted sum:

Formulation of Static Salient Object Detection  CRF model (static image): Salient object featurePairwise feature Strong contrast Center- surround histogram Color spatial- distribution Maximize!! Minimize!!

Learning & Inference for the Model  The goal of CRF learning is to estimate the linear weights. Gradient descent Training images

Learning & Inference for the Model A training image for example: where An training image Label inferred this iterate Possible label Label per pixel

Learning & Inference for the Model Gradient descent: How to use ground-truth information? Where is the labeled ground-truth. t: iteration

Learning & Inference for the Model  Situations: Ground-truth mistake!!!

Ground-Truth Mistake  Solution: apply Gaussian function to weight every pixel in the rectangle.

Inference  We should find the most probable labeling to maximize in training & detection.  BP – Max-product Belief Propagation [Pearl ‘86] + Can be applied to any energy function – In vision results are usually worse than that of graph cuts – Does not always converge  TRW - Max-product Tree-reweighted Message Passing [Wainwright, Jaakkola, Willsky ‘02], [Kolmogorov ‘05] + Can be applied to any energy function + Convergence guarantees for the algorithm in [Kolmogorov ’05]

Formulation of Dynamic Salient Object Detection  Similar as static salient object detection! Static Salient feature Maximize!! Contrast of motion Center- surround histogram Spatial- distribution of motion Penalty term of motion

Results From left to right: input image, multi-scale contrast, center- surround histogram, color spatial distribution, and binary mask by CRF.

Results From left to right: Fuzzy growing based method Salience map Their approach Ground-truth

Results 1. multi-scale contrast 2. center-surround histogram 3. color spatial distribution 4. combination all Image set AImage set B 1. FG 2. SM 3. their approach

Conclusion  They model the salient object detection by CRF, where a group of salient features are combined through CRF learning.  It’s a set of novel local, regional & global salient features to define a generic salient object.  Multi-object & no object cases are left as future work.

References (paper & book)  “Learning to Detect A Salient Object”, CVPR 2007, PAMI   “A Model of Saliency-Based Visual Attention for Rapid Scene Analysis”, PAMI,   “Pattern Recognition and Machine Learning”, C. M. Bishop. 

References (about CRF)  “Discriminative Random Fields”, IJCV,  i= &rep=rep1&type=pdf i= &rep=rep1&type=pdf  “Conditional Random Fields: An Introduction”, H. M. Wallach.  i= &rep=rep1&type=pdf i= &rep=rep1&type=pdf  “Log-linear models & conditional random fields”, C. Elkan,  l.pdf l.pdf

References (about TRW)  “MAP estimation via agreement on (hyper) trees: Message-passing and linear programming approaches”, IEEE transaction on Information Theory,   “Convergent Tree-Reweighted Message Passing for Energy Minimization”, PAMI,  &rep=rep1&type=pdf &rep=rep1&type=pdf  “A Comparative Study of Energy Minimization Methods for Markov Random Fields with Smoothness-Based Priors”, PAMI,  &rep=rep1&type=pdf &rep=rep1&type=pdf