Transrectal ultrasound image processing for brachytherapy applications

In this thesis, we propose a novel algorithm for detecting needles and their corresponding implanted radioactive seed locations in the prostate. The seed localization process is carried out efficiently using separable Gaussian filters in a probabilistic Gibbs random field framework. An approximation of the needle path through the prostate volume is obtained using a polynomial fit. The seeds are then detected and assigned to their corresponding needles by calculating local maxima of the voronoi region around the needle position. In our experiments, we were able to successfully localize over 85% of the implanted seeds. Furthermore, as a regular part of a brachytherapy cancer treatment, patient’s prostate is scanned using a trans-rectal ultrasound probe, its boundary is manually outlined, and its volume is estimated for dosimetry purposes. In this thesis, we also propose a novel semi-automatic segmentation algorithm for prostate boundary detection that requires a reduced amount of radiologist’s input, and thus speeds up the surgical procedure. Saved time can be used to re-scan the prostate during the operation and accordingly adjust the treatment plan. The proposed segmentation algorithm utilizes texture differences between ultrasound images of the prostate tissue and the surrounding tissues. It is carried out in 5 the polar coordinate system and it uses three-dimensional data correlation to improve the smoothness and reliability of the segmentation. Test results show that the boundary segmentation obtained from the algorithm can reduce manual input by the factor of 3, without significantly affecting the accuracy of the segmentation (i.e. semi-automatically estimated prostate volume is within 90% of the original estimate)

Remotely Sensed Data Segmentation under a Spatial Statistics Framework

In remote sensing, segmentation is a procedure of partitioning the domain of a remotely sensed dataset into meaningful regions which correspond to different land use and land cover (LULC) classes or part of them. So far, the remotely sensed data segmentation is still one of the most challenging problems addressed by the remote sensing community, partly because of the availability of remotely sensed data from diverse sensors of various platforms with very high spatial resolution (VHSR). Thus, there is a strong motivation to propose a sophisticated data representation that can capture the significant amount of details presented in a VHSR dataset and to search for a more powerful scheme suitable for multiple remotely sensed data segmentations. This thesis focuses on the development of a segmentation framework for multiple VHSR remotely sensed data. The emphases are on VHSR data model and segmentation strategy. Starting with the domain partition of a given remotely sensed dataset, a hierarchical data model characterizing the structures hidden in the dataset locally, regionally and globally is built by three random fields: Markova random field (MRF), strict stationary random field (RF) and label field. After defining prior probability distributions which should capture and characterize general and scene-specific knowledge about model parameters and the contextual structure of accurate segmentations, the Bayesian based segmentation framework, which can lead to algorithmic implementation for multiple remotely sensed data, is developed by integrating both the data model and the prior knowledge. To verify the applicability and effectiveness of the proposed segmentation framework, the segmentation algorithms for different types of remotely sensed data are designed within the proposed segmentation framework. The first application relates to SAR intensity image processing, including segmentation and dark spot detection by marked point process. In the second application, the algorithms for LiDAR point cloud segmentation and building detection are developed. Finally, texture and colour texture segmentation problems are tackled within the segmentation framework. All applications demonstrate that the proposed data model provides efficient representations for hierarchical structures hidden in remotely sensed data and the developed segmentation framework leads to successful data processing algorithms for multiple data and task such as segmentation and object detection

Image partitioning into convex polygons

International audienceThe over-segmentation of images into atomic regions has become a standard and powerful tool in Vision. Traditional superpixel methods, that operate at the pixel level, cannot directly capture the geometric information disseminated into the images. We propose an alternative to these methods by operating at the level of geometric shapes. Our algorithm partitions images into convex polygons. It presents several interesting properties in terms of geometric guarantees , region compactness and scalability. The overall strategy consists in building a Voronoi diagram that conforms to preliminarily detected line-segments, before homogenizing the partition by spatial point process distributed over the image gradient. Our method is particularly adapted to images with strong geometric signatures, typically man-made objects and environments. We show the potential of our approach with experiments on large-scale images and comparisons with state-of-the-art superpixel methods