Geometric graph-based methods for high dimensional data
- 👤 Speaker: Andrea Bertozzi (Mathematics, UCLA) 🔗 Website
- 📅 Date & Time: Monday 02 November 2015, 16:00 - 17:00
- 📍 Venue: MR 13, CMS
Abstract
We present new methods for segmentation of large datasets with graph based structure. The method combines ideas from classical nonlinear PDE -based image segmentation with fast and accessible linear algebra methods for computing information about the spectrum of the graph Laplacian. The goal of the algorithms is to solve semi-supervised and unsupervised graph cut optimization problems. I will present results for image processing applications such as image labeling and hyperspectral video segmentation, and results from machine learning and community detection in social networks, including modularity optimization posed as a graph total variation minimization problem.
Series This talk is part of the Applied and Computational Analysis series.
Included in Lists
- All CMS events
- All Talks (aka the CURE list)
- Applied and Computational Analysis
- bld31
- CMS Events
- DAMTP info aggregator
- DPMMS info aggregator
- DPMMS lists
- DPMMS Lists
- DPMMS Pure Maths Seminar
- Fav
- Featured lists
- Geometric Analysis & Partial Differential Equations seminar
- Hanchen DaDaDash
- Interested Talks
- MR 13, CMS
- My seminars
- School of Physical Sciences
- Type the title of a new list here
Note: Ex-directory lists are not shown.
![[Talks.cam]](/static/images/talkslogosmall.gif)

Andrea Bertozzi (Mathematics, UCLA) 
Monday 02 November 2015, 16:00-17:00