Search

Two datasets images: the Sheffield (UK) dataset and Piracicaba (Brazil) dataset. These images were obtained after appropriate ethical approvals. Ethical approval for the Sheffield cohort was obtained for this study from the HRA and Health and CareResearch Wales (HCRW), Reference number 18/WM/0335’ on 19th October, 2018. This study was approved by the Piracicaba Dental Ethical Committee, Registration number 42235421.9.0000.5418.

Pair of eardrum images.

The liver vessels, which have low signal and run next to brighter bile ducts, are difficult to segment from MR images. This study presents a fully automated and adaptive method to segment portal and hepatic veins on magnetic resonance images. In the proposed approach, segmentation of these vessels is achieved in four stages: (i) initial segmentation, (ii) refinement, (iii) reconstruction, and (iv) post-processing. In the initial segmentation stage, k-means clustering is used, the results of which are refined iteratively with linear contrast stretching algorithm in the next stage, generating a mask image. In the reconstruction stage, vessel regions are reconstructed with the marker image from the first stage and the mask image from the second stage. Experimental data sets include slices that show fat tissues, which have the same gray level values with vessels, outside the margin of the liver. These structures are removed in the last stage. Results show that the proposed approach is more efficient than other thresholding-based methods. Copyright (c) 2016 John Wiley & Sons, Ltd.

The automatic analysis of digital pathology images is becoming of increasing interest for the development of novel therapeutic drugs and of the associated companion diagnostic tests in oncology. A precise quantification of the tumor microenvironment and therefore an accurate segmentation of the tumor extent are critical in this context. In this paper, we present a new approach based on visual context random forest to generate precise segmentation maps from deep learning coarse segmentation maps. Applied to the detection of cytokeratin positive (CK) epithelium regions in immunofluorescence (IF) images, we show that this method enables an accurate and fast detection of detailled structures in terms of qualitative and quantitative evaluation against three baseline approaches. For the method to be resilient to the high variability of staining intensity, a novel normalization algorithm for IF images is moreover introduced.

Algorithms for subspace clustering (SC) are effective in terms of the accuracy but exhibit high computational complexity. We propose algorithm for SC of (highly) similar data points drawn from union of linear one- dimensional subspaces that are possibly dependent in the input data space. The algorithm finds a dictionary that represents data in reproducible kernel Hilbert space (RKHS). Afterwards, data are projected into RKHS by using empirical kernel map (EKM). Due to dimensionality expansion effect of the EKM one-dimensional subspaces become independent in RKHS. Segmentation into subspaces is realized by applying the max operator on projected data which yields the computational complexity of the algorithm that is linear in number of data points. We prove that for noise free data proposed approach yields exact clustering into subspaces. We also prove that EKM-based projection yields less correlated data points. Due to nonlinear projection, the proposed method can adopt to linearly nonseparable data points. We demonstrate accuracy and computational efficiency of the proposed algorithm on synthetic dataset as well as on segmentation of the image of unstained specimen in histopathology. © (2017) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.