Hierarchical Kernel Stick-Breaking Process for Multi-Task Image Analysis
Description
The kernel stick-breaking process (KSBP) is employed to segment general imagery, imposing the condition that patches (small blocks of pixels) that are spatially proximate are more likely to be associated with the same cluster (segment). The number of clusters is not set a priori and is inferred from the hierarchical Bayesian model. Further, KSBP is integrated with a shared Dirichlet process prior to simultaneously model multiple images, inferring their inter-relationships. This latter application may be useful for sorting and learning relationships between multiple images. The Bayesian inference algorithm is based on a hybrid of variational Bayesian analysis and local sampling. In addition to providing details on the model and associated inference framework, example results are presented for several image-analysis problems.
| Slides | |
| 0:00 | Hierarchical Kernel Stick-Breaking Process for Multi-Task Image Analysis |
| 0:17 | Image Segmentation (1) |
| 1:30 | Hierarchical Kernel Stick-Breaking Process for Multi-Task Image Analysis |
| 1:36 | Image Segmentation (1) |
| 1:52 | Image Segmentation (2) |
| 3:03 | Dirichlet process (DP) |
| 5:36 | Kernel stick-breaking process (KSBP) |
| 6:24 | KSBP for image analysis |
| 7:03 | Dirichlet process (DP) |
| 7:11 | KSBP for image analysis |
| 9:27 | DP and KSBP (1) |
| 9:29 | DP and KSBP (2) |
| 10:45 | Spatial correlation property |
| 12:13 | Multi-task image segmentation (1) |
| 12:48 | Multi-task image segmentation (2) |
| 13:40 | Multi-task image segmentation (3) |
| 14:04 | Multi-task image segmentation (4) |
| 14:12 | Posterior inference |
| 14:42 | Experiments (1) |
| 14:44 | Experiments (2) |
| 14:57 | Experiments (3) |
| 15:37 | Demonstration of different atoms as inferred by an example run |
| 16:31 | A representative set of segmentation results |
| 17:35 | Experiments |
| 18:33 | Conclusions |
| 19:51 | - Questions |
| 20:48 | - Questions |
Lecture rating
| People found this lecture: | ||
| Worth seeing | ||
| because it is: | ||
| Valuable and informative | ||
| Well presented | ||
| Easily understandable | ||
| Acceptably recorded | ||
| You need to login to cast your vote. | ||
Report a problem or upload files
If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Related content
Link this page
Would you like to put a link to this lecture on your homepage?Go ahead! Copy the HTML snippet !





