COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Euler's elastica based segmentation models and the fast algorithms
Euler's elastica based segmentation models and the fast algorithmsAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact INI IT. This talk has been canceled/deleted In this talk, we will discuss two image segmentation models that employ L1 and L2 Euler's elastica respectively as the regularization of active contour. When compared with the conventional contour length based regularization, these high order regularizations lead to new features, including connecting broken parts of objects automatically and being well-suited for fine elongate structures. More interestingly, with the L^1 Euler's elastica as the contour regularization, the segmentation model is able to single out objects with convex shapes. We will also discuss the fast algorithms for dealing with these models by using augmented Lagrangian method. Numerical experiments will be presented to illustrate the features of these Euler's elastica based segmentation models. This talk is part of the Isaac Newton Institute Seminar Series series. This talk is included in these lists:This talk is not included in any other list Note that ex-directory lists are not shown. |
Other listsClare College Student Investment Fund The Cambridge Group for the History of Population and Social Structure - seminar series Laboratory for Scientific ComputingOther talksStatistical Learning Theory Making Refuge: Academics at Risk Colorectal cancer. Part 1. Presentation, Diagnosis and Intervention. Part 2. Cellular signalling networks in colon cancer and the models to study them - a basic research perspective |