University of Cambridge > Talks.cam > Machine Learning @ CUED > Shared Segmentation of Natural Scenes using Dependent Pitman-Yor Processes

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Shared Segmentation of Natural Scenes using Dependent Pitman-Yor Processes

Download to your calendar using vCal

If you have a question about this talk, please contact Zoubin Ghahramani .

We explore statistical frameworks for the simultaneous, unsupervised segmentation and discovery of visual object categories from image databases. Examining a large set of manually segmented scenes, we show that object frequencies and segment sizes both follow power law distributions, which are poorly captured by standard methods. Motivated by this, we develop an alternative family of models based on the Pitman-Yor (PY) process, a generalization of the Dirichlet process. This nonparametric prior distribution leads to learning algorithms which discover an unknown set of objects, and segmentation methods which automatically adapt their resolution to each image. Generalizing previous applications of PY priors, we use non-Markov Gaussian processes to infer spatially contiguous segments which respect image boundaries. Using a novel family of variational approximations, our approach produces segmentations which compare favorably to state-of-the-art methods, while simultaneously discovering categories shared among natural scenes.

This talk is part of the Machine Learning @ CUED series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

http://tinyurl.com/domzum German Society Speaker Events Bawden Room, West Court, Jesus College

Other talks

The organisational management of traumatic stress Title to be confirmed Title to be confirmed Title TBC Fairy Tales Group Work
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity