Speaker: Inge Jonassen (UiB, Uni Computing, Uni Research)

Place: Room 3137, floor 3, HIB (data blokk), Thormøhlensgate 55

Time: Friday 11 May 2012, from 11.00am to 12.00am

Abstract:
Bioinformatics is the application of computer science and information technology to the field of biology and medicine. Many applications of bioinformatics aim to extract information and gain insight from data. In experimental projects, a biological question is addressed by designing an experiment generating data that allows testing a hypothesis or extracting patterns relating to underlying biology. Data generated within one project should be interpreted in context of knowledge accumulated in the field and represented in biological databases or in the scientific literature. In order to help understanding it is highly useful to represent data and patterns using visualization techniques and statistics are essential to test whether identified patterns are likely to occur by chance. In this talk I will discuss how visualization including information visualization can be utilized to aid in understanding bioinformatics data and methods.

Additional material: Flyer, Inge Jonassen's webpage, Uni Computing webpage

Speaker: Dr. Klaus Johannsen

Place: Room 3137, floor 3, HIB (data blokk), Thormøhlensgate 55

Time: Friday 13 Apr 2012, from 11.00am to 12.00am

Abstract:
Uni Computing is a department of Uni Research, the research company of the University of Bergen. The department carries out research and development in basic and applied areas with a focus on computational techniques: Bio-informatics, computational linguistics and ecology and environmental flow mechanics. It furthermore develops and operates (corresponding) IT-solutions and e-infrastructures for the department, Uni Research, UiB, a.o.
In this presentation we will give an overview over the current activities and discuss some of the department's future plans. We will highlight the current and future needs regarding computational resources, data analysis and post-processing and will discuss in which way visualization is or could be of interest for our activities.

Additional material: Flyer, Dr. Johannsen's webpage, Uni Computing webpage, Slides

Speaker: Paolo Angelelli

Place: Room 3137, floor 3, HIB (data blokk), Thormøhlensgate 55

Time: Friday 9 Mar 2012, from 11.00am to 12.00am

Abstract:
For many years, medical visualization has focused on human anatomy. Comparably recent innovations in the fields of medical imaging, modeling and simulation made the generation of data related to physiological processes in the human body possible. Due to the complexity of this data, new visualization techniques have been proposed and employed, which go beyond the previous anatomy visualization methods. This talk will provide an overview of the current state of the art in the visualization of human physiology.

Additional material: Flyer, Slides

Speaker: Daniel Patel

Place: Room 3137, floor 3, HIB (data blokk), Thormøhlensgate 55

Time: Friday 10 Feb 2012, from 11.00am to 12.00am

Abstract:
The talk will touch upon topics such as:
1) Ground truth visualization of measured seismic data.
2) Automated object extraction for getting computer assistance in segmenting important structures in the seismic data such as horizons and faults.
3) Fast GPU-creation, visualizing and visual fusion of multiattribute seismic data.

Additional material: Flyer, Slides

Speaker: Professor Xue-Cheng Tai

Place: Room 3137, floor 3, HIB (data blokk), Thormøhlensgate 55

Time: Friday 20 Jan 2012, from 11.00am to 12.00am

Abstract:
A network can often be represented as a graph. Max-flow/min-cuts over a given graph can be used to find optimal solutions for many complicated network problems. It is known that these kind of problems are often NP-hard and they pose some very challenging minimization problems for simulations. In this talk, we will show how to use graph and cuts methods for some image processing and computer vision problems. Especially, we shall present our recent work extending the concept of max-flow/min-cuts to "networks" that are infinite dimension, i.e we will talk about continuous max-flow/min-cuts problems. When we discretize these continuous max-flow problems, we come back to the ordinary finite dimension max-flow problems. The continuous max-flow models can be solved through the solution of some partial differential equations. One advantage of the continuous max-flow problem is that we can use many convex optimization methods to solve it. We are released from some restricted searching algorithms for network problems.

Additional material: Flyer, Professor Xue-Cheng Tai webpage, Slides