Jelenlegi hely
Segmentation
 The aim of this research is to study image features and processing methods for detection of visual code regions (1D barcode, 2D datamatrix, OCR characters), with special focus on highly accurate and efficient algorithms that can be adapted for real industrial applications. |
 A multi-layer binary Markov random field model for extracting an unknown number of possibly touching or overlapping near-circular objects.
|
 The `gas of circles' (GOC) model is a tool to describe a set of circles with an approximately fixed radius. The model is based on the higher-order active contour (HOAC) framework. The method has been succesfully applied to tree crown extraction on aerial images.
|
 Study and development of image segmentation algorithms for different organs from CT images for radiotherapy planning purposes.
|
 The human visual system is not treating different features sequentially. Instead, multiple cues are perceived simultaneously and then they are integrated by our visual system in order to explain the observations. Therefore different image features has to be handled in a parallel fashion. In this project, we attempt to develop such a model in a Markovian framework.
|
 The goal of this project is to propose a method which is able to segment a color image without any human intervention. The only input is the observed image, all other parameters are estimated during the segmentation process. The algorithm finds the most likely number of classes, their associated model parameters and generates a segmentation of the image by classifying the pixels into these classes.
|
 We developed an image processing method for MRI intensity standardization. We also introduced new, fast implementations of the fuzzy connectedness algorithm that allows segmentation at interactive speeds. We developed a new segmentation "workshop" for brain MRI segmentation using standardized MR images and the fast fuzzy connectedness algorithms.
|
 This project is about image segmentation algorithms using a Markovian approach. The main contribution is a new hierarchical MRF model and a Multi-Temperature Annealing (MTA) algorithm proposed for the energy minimization of the model. The convergence of the MTA algorithm has been proved towards a global optimum in the most general case, where each clique may have its own local temperature schedule.
|