University of Birmingham > Talks@bham > Artificial Intelligence and Natural Computation seminars > Variational methods for diffusive optical tomography and data clustering

## Variational methods for diffusive optical tomography and data clusteringAdd to your list(s) Download to your calendar using vCal - Prof Ke Yin (Associate Professor, Center of Mathematical Sciences, Huazhong University of Science and Technology, Wuhan, Hubei, China)
- Friday 19 July 2019, 14:00-15:00
- Computer Science, The Sloman Lounge (UG).
If you have a question about this talk, please contact Hector Basevi. Host: Dr Jinming Duan Abstract: Variational method has been successfully applied to computer vision and image processing tasks, through defining energy functionals on design variables, unknown parameters and image features. Variational method has also been extended to the field of machine learning. This talk is about variational methods developed for solving inverse source problems in medical imaging as well as data clustering problems. It consists of two parts. In the first part, we present a new approach to solve the inverse source problem arising in image reconstruction problems. First, we find a particular solution called the orthogonal solution that satisfies the data fitting term. Then we add to it a correction function in the kernel space so that the final solution fulfils the regularization and other physical requirements. The key idea is that the correction function in the kernel has no impact to the data fitting, and the regularization is imposed in a smaller space. In addition, we use an efficient basis to represent the source function to form a hybrid strategy using spectral methods and finite element methods in the algorithm. The resulting algorithm can drastically improve the computation speed over the existing methods. As a case study, we apply the proposed method to Fluorescence Tomography (FT). Second, we report our work on data clustering, in particular semi-supervised clustering method inspire by Pottâ€™s model and Chan-Vese model. The algorithm is proposed as a minimization of a convex functional of the labelling function. The functional combines the total variation of the labelling function and a region-force term. The gradient operator used to define the total variation is based on the nonlocal operator recently arises in nonlocal diffusion problems in computational physics. The region-force term is calculated by the affinity between each data point and the labelled data points, which can be interpreted as the prior probability of each data point belonging to each class. The numerical methods for minimizing this functional is described and is tested on benchmark data sets. Experiments indicate that the accuracy and speed are competitive with the state-of-the-art in multi-class semi-supervised clustering algorithms. Website: http://mathcenter.hust.edu.cn/info/1042/1299.htm This talk is part of the Artificial Intelligence and Natural Computation seminars series. ## This talk is included in these lists:- Artificial Intelligence and Natural Computation seminars
- Computer Science Departmental Series
- Computer Science Distinguished Seminars
- Computer Science, The Sloman Lounge (UG)
Note that ex-directory lists are not shown. |
## Other listsTopology and Dynamics seminar Postgraduate Seminars in the School of Computer Science Condensed Matter Group Meetings## Other talksStellar population models School Seminar Extending and applying DFT: large scale calculations and applications to charge density waves in TiSe2 Diagonal structures and primitive permutation groups The Griess Algebra and the Monster Plundervolt: Pillaging and plundering SGX with Software-based Fault Injection Attacks |