Geometric graph-based Methods for High Dimensional Data

Duration: 1 hour 11 mins
Share this media item:
Embed this media item:


About this item
Description: Professor Andrea Bertozzi (University of California, Los Angeles)
23rd November 2021 | 16:30 - 17:30
 
Created: 2021-11-26 15:57
Collection: Mathematics of deep learning
Publisher: Isaac Newton Institute for Mathematical Sciences
Copyright: Professor Andrea Bertozzi
Language: eng (English)
 
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.
Available Formats
Format Quality Bitrate Size
MPEG-4 Video 1080x720    2.95 Mbits/sec 1.54 GB View Download
MPEG-4 Video 540x360    1.55 Mbits/sec 828.77 MB View Download
WebM 1080x720    1.99 Mbits/sec 1.04 GB View Download
WebM 540x360    500.22 kbits/sec 260.13 MB View Download
iPod Video 480x270    485.65 kbits/sec 252.55 MB View Download
MP3 44100 Hz 250.84 kbits/sec 130.44 MB Listen Download
Auto * (Allows browser to choose a format it supports)