Walsh Hadamard Transform for Simple Linear Iterative Clustering (SLIC) Superpixel Based Spectral Clustering of Multimodal MRI Brain Tumor Segmentation

The automated brain tumor segmentation methods are challenging due to the diverse nature of tumors. Recently, the graph based spectral clustering method is utilized for brain tumor segmentation to make high-quality segmentation output. In this paper, a new Walsh Hadamard Transform (WHT) texture for superpixel based spectral clustering is proposed for segmentation of a brain tumor from multimodal MRI images. First, the selected kernels of WHT are utilized for creating texture saliency maps and it becomes the input for the Simple Linear Iterative Clustering (SLIC) algorithm, to generate more precise texture based superpixels. Then the texture superpixels become nodes in the graph of spectral clustering for segmenting brain tumors of MRI images. Finally, the original members of superpixels are recovered to represent Complete Tumor (CT), Tumor Core (TC) and Enhancing Tumor (ET) tissues. The observational results are taken out on BRATS 2015 datasets and evaluated using the Dice Score (DS), Hausdorff Distance (HD) and Volumetric Difference (VD) metrics. The proposed method produces competitive results than other existing clustering methods.     

A novel multiphoton microscopy images segmentation method based on superpixel and watershed

Multiphoton microscopy (MPM) imaging technique based on two‐photon excited fluorescence (TPEF) and second harmonic generation (SHG) shows fantastic performance for biological imaging. The automatic segmentation of cellular architectural properties for biomedical diagnosis based on MPM images is still a challenging issue. A novel multiphoton microscopy images segmentation method based on superpixels and watershed (MSW) is presented here to provide good segmentation results for MPM images. The proposed method uses SLIC superpixels instead of pixels to analyze MPM images for the first time. The superpixels segmentation based on a new distance metric combined with spatial, CIE Lab color space and phase congruency features, divides the images into patches which keep the details of the cell boundaries. Then the superpixels are used to reconstruct new images by defining an average value of superpixels as image pixels intensity level. Finally, the marker‐controlled watershed is utilized to segment the cell boundaries from the reconstructed images. Experimental results show that cellular boundaries can be extracted from MPM images by MSW with higher accuracy and robustness.

     

A Context-Aware Delayed Agglomeration Framework for Electron Microscopy Segmentation

Electron Microscopy (EM) image (or volume) segmentation has become significantly important in recent years as an instrument for connectomics. This paper proposes a novel agglomerative framework for EM segmentation. In particular, given an over-segmented image or volume, we propose a novel framework for accurately clustering regions of the same neuron. Unlike existing agglomerative methods, the proposed context-aware algorithm divides superpixels (over-segmented regions) of different biological entities into different subsets and agglomerates them separately. In addition, this paper describes a “delayed” scheme for agglomerative clustering that postpones some of the merge decisions, pertaining to newly formed bodies, in order to generate a more confident boundary prediction. We report significant improvements attained by the proposed approach in segmentation accuracy over existing standard methods on 2D and 3D datasets.     

Segmentation of Extrapulmonary Tuberculosis Infection Using Modified Automatic Seeded Region Growing

In the image segmentation process of positron emission tomography combined with computed tomography (PET/CT) imaging, previous works used information in CT only for segmenting the image without utilizing the information that can be provided by PET. This paper proposes to utilize the hot spot values in PET to guide the segmentation in CT, in automatic image segmentation using seeded region growing (SRG) technique. This automatic segmentation routine can be used as part of automatic diagnostic tools. In addition to the original initial seed selection using hot spot values in PET, this paper also introduces a new SRG growing criterion, the sliding windows. Fourteen images of patients having extrapulmonary tuberculosis have been examined using the above-mentioned method. To evaluate the performance of the modified SRG, three fidelity criteria are measured: percentage of under-segmentation area, percentage of over-segmentation area, and average time consumption. In terms of the under-segmentation percentage, SRG with average of the region growing criterion shows the least error percentage (51.85%). Meanwhile, SRG with local averaging and variance yielded the best results (2.67%) for the over-segmentation percentage. In terms of the time complexity, the modified SRG with local averaging and variance growing criterion shows the best performance with 5.273 s average execution time. The results indicate that the proposed methods yield fairly good performance in terms of the over- and under-segmentation area. The results also demonstrated that the hot spot values in PET can be used to guide the automatic segmentation in CT image.     

A Split-and-Merge-Based Uterine Fibroid Ultrasound Image Segmentation Method in HIFU Therapy

High-intensity focused ultrasound (HIFU) therapy has been used to treat uterine fibroids widely and successfully. Uterine fibroid segmentation plays an important role in positioning the target region for HIFU therapy. Presently, it is completed by physicians manually, reducing the efficiency of therapy. Thus, computer-aided segmentation of uterine fibroids benefits the improvement of therapy efficiency. Recently, most computer-aided ultrasound segmentation methods have been based on the framework of contour evolution, such as snakes and level sets. These methods can achieve good performance, although they need an initial contour that influences segmentation results. It is difficult to obtain the initial contour automatically; thus, the initial contour is always obtained manually in many segmentation methods. A split-and-merge-based uterine fibroid segmentation method, which needs no initial contour to ensure less manual intervention, is proposed in this paper. The method first splits the image into many small homogeneous regions called superpixels. A new feature representation method based on texture histogram is employed to characterize each superpixel. Next, the superpixels are merged according to their similarities, which are measured by integrating their Quadratic-Chi texture histogram distances with their space adjacency. Multi-way Ncut is used as the merging criterion, and an adaptive scheme is incorporated to decrease manual intervention further. The method is implemented using Matlab on a personal computer (PC) platform with Intel Pentium Dual-Core CPU E5700. The method is validated on forty-two ultrasound images acquired from HIFU therapy. The average running time is 9.54 s. Statistical results showed that SI reaches a value as high as 87.58%, and normHD is 5.18% on average. It has been demonstrated that the proposed method is appropriate for segmentation of uterine fibroids in HIFU pre-treatment imaging and planning.     

A Combinational Clustering Based Method for cDNA Microarray Image Segmentation

Microarray technology plays an important role in drawing useful biological conclusions by analyzing thousands of gene expressions simultaneously. Especially, image analysis is a key step in microarray analysis and its accuracy strongly depends on segmentation. The pioneering works of clustering based segmentation have shown that k-means clustering algorithm and moving k-means clustering algorithm are two commonly used methods in microarray image processing. However, they usually face unsatisfactory results because the real microarray image contains noise, artifacts and spots that vary in size, shape and contrast. To improve the segmentation accuracy, in this article we present a combination clustering based segmentation approach that may be more reliable and able to segment spots automatically. First, this new method starts with a very simple but effective contrast enhancement operation to improve the image quality. Then, an automatic gridding based on the maximum between-class variance is applied to separate the spots into independent areas. Next, among each spot region, the moving k-means clustering is first conducted to separate the spot from background and then the k-means clustering algorithms are combined for those spots failing to obtain the entire boundary. Finally, a refinement step is used to replace the false segmentation and the inseparable ones of missing spots. In addition, quantitative comparisons between the improved method and the other four segmentation algorithms--edge detection, thresholding, k-means clustering and moving k-means clustering--are carried out on cDNA microarray images from six different data sets. Experiments on six different data sets, 1) Stanford Microarray Database (SMD), 2) Gene Expression Omnibus (GEO), 3) Baylor College of Medicine (BCM), 4) Swiss Institute of Bioinformatics (SIB), 5) Joe DeRisi’s individual tiff files (DeRisi), and 6) University of California, San Francisco (UCSF), indicate that the improved approach is more robust and sensitive to weak spots. More importantly, it can obtain higher segmentation accuracy in the presence of noise, artifacts and weakly expressed spots compared with the other four methods.     

Effective algorithm for determining the number of clusters and its application in image segmentation

The k-means algorithm is a popular clustering method for image segmentation. However, the main disadvantage of this algorithm is its dependence on the number of initial clusters. In this paper, we present an optimal criterion which can select the best segmentation result with less number of clusters. The optimal criterion overcomes the shortcoming of initialization based on the intra-class and inter-class difference. Eight digital images were employed to verify the segmentation results of the optimal criterion. Simultaneously, we have improved the traditional k-means algorithm to find the initial clustering centers efficiently. Experimental results show that the segmented images selected by the optimal criterion have sufficient stability and robustness. In addition, we verify the consistency of results by two kinds of objective assessment measures. The proposed optimal criterion can successfully display the best segmentation results precisely and efficiently so as to instead of artificial selection.     

Robust Spectral Clustering Using Statistical Sub-Graph Affinity Model

Spectral clustering methods have been shown to be effective for image segmentation. Unfortunately, the presence of image noise as well as textural characteristics can have a significant negative effect on the segmentation performance. To accommodate for image noise and textural characteristics, this study introduces the concept of sub-graph affinity, where each node in the primary graph is modeled as a sub-graph characterizing the neighborhood surrounding the node. The statistical sub-graph affinity matrix is then constructed based on the statistical relationships between sub-graphs of connected nodes in the primary graph, thus counteracting the uncertainty associated with the image noise and textural characteristics by utilizing more information than traditional spectral clustering methods. Experiments using both synthetic and natural images under various levels of noise contamination demonstrate that the proposed approach can achieve improved segmentation performance when compared to existing spectral clustering methods.     

Colorization and automated segmentation of human T2 MR brain images for characterization of soft tissues

Characterization of tissues like brain by using magnetic resonance (MR) images and colorization of the gray scale image has been reported in the literature, along with the advantages and drawbacks. Here, we present two independent methods; (i) a novel colorization method to underscore the variability in brain MR images, indicative of the underlying physical density of bio tissue, (ii) a segmentation method (both hard and soft segmentation) to characterize gray brain MR images. The segmented images are then transformed into color using the above-mentioned colorization method, yielding promising results for manual tracing. Our color transformation incorporates the voxel classification by matching the luminance of voxels of the source MR image and provided color image by measuring the distance between them. The segmentation method is based on single-phase clustering for 2D and 3D image segmentation with a new auto centroid selection method, which divides the image into three distinct regions (gray matter (GM), white matter (WM), and cerebrospinal fluid (CSF) using prior anatomical knowledge). Results have been successfully validated on human T2-weighted (T2) brain MR images. The proposed method can be potentially applied to gray-scale images from other imaging modalities, in bringing out additional diagnostic tissue information contained in the colorized image processing approach as described.     

Computer vision system for superpixel classification and segmentation of sheep

This paper presents an experiment with four different convolutional neural networks architectures that aim to classify segments of a sheep using a dataset of superpixels. The proposal used an image dataset with 512 images of 32 sheep. In this dataset of images, we applied the Simple Linear Iterative Clustering technique with a K number parameter of 600 to generate the dataset of superpixels that was later processed in the deep neural networks. We selected four architectures for training the models: VGG16, ResNet152V2, InceptionV3, and DenseNet201. The experiment was conducted using cross-validation with five-folds separating the dataset into training (60%), validation (20%), and testing (20%). The best result presented was from the approach with the DenseNet201 technique with an F-score of 0.928. When applying ANOVA, the P-value was 0.0000000000329 (3.29e-11***) between the tested architectures, which shows that the results are statistically significant. Therefore, DenseNet201 presented itself as a relevant architecture for this problem that aims to classify the superpixels referring to a sheep and the image's background, and the average IoU with post-processing for image segmentation with DenseNet201 obtained 0.8332. Thus, we can highlight the contributions of this research as a methodology to segment images of mixed-breed sheep of the Texel and Santa Inês breeds using convolutional neural networks and provide a non-invasive method that can support other implementations such as animal tracking and weight prediction.     

基于K-means聚类算法的叶螨图像分割与识别

【目的】叶螨(spider mite)是为害多种农作物的主要害虫,叶螨识别传统方法依靠肉眼,比较费时费力,为研究快速自动识别方法,引入计算机图像分析算法。【方法】该方法基于K-means聚类算法对田间作物上的叶螨图像进行分割与识别。【结果】对比传统RGB彩色分割方法,K-means聚类算法能够有效地对叶片上叶螨图像进行分割和识别。K-means聚类算法平均识别时间为3.56 s,平均识别准确率93.95%。识别时间 T 随图像总像素 Pi 的增加而增加。【结论】K-means聚类组合算法能够应用于叶螨图像分割与识别。     

A diabetic retinopathy detection method using an improved pillar K-means algorithm

The paper presents a new approach for medical image segmentation. Exudates are a visible sign of diabetic retinopathy that is the major reason of vision loss in patients with diabetes. If the exudates extend into the macular area, blindness may occur. Automated detection of exudates will assist ophthalmologists in early diagnosis. This segmentation process includes a new mechanism for clustering the elements of high-resolution images in order to improve precision and reduce computation time. The system applies K-means clustering to the image segmentation after getting optimized by Pillar algorithm; pillars are constructed in such a way that they can withstand the pressure. Improved pillar algorithm can optimize the K-means clustering for image segmentation in aspects of precision and computation time. This evaluates the proposed approach for image segmentation by comparing with Kmeans and Fuzzy C-means in a medical image. Using this method, identification of dark spot in the retina becomes easier and the proposed algorithm is applied on diabetic retinal images of all stages to identify hard and soft exudates, where the existing pillar K-means is more appropriate for brain MRI images. This proposed system help the doctors to identify the problem in the early stage and can suggest a better drug for preventing further retinal damage.     

Hierarchical Dirichlet process model for gene expression clustering

Clustering is an important data processing tool for interpreting microarray data and genomic network inference. In this article, we propose a clustering algorithm based on the hierarchical Dirichlet processes (HDP). The HDP clustering introduces a hierarchical structure in the statistical model which captures the hierarchical features prevalent in biological data such as the gene express data. We develop a Gibbs sampling algorithm based on the Chinese restaurant metaphor for the HDP clustering. We apply the proposed HDP algorithm to both regulatory network segmentation and gene expression clustering. The HDP algorithm is shown to outperform several popular clustering algorithms by revealing the underlying hierarchical structure of the data. For the yeast cell cycle data, we compare the HDP result to the standard result and show that the HDP algorithm provides more information and reduces the unnecessary clustering fragments.     

一种基于信息理论的距离系数

给出了一种基于信息理论的距离系数,这一新的信息系数是通过对信息论中的离散增量系数改进而得,并证明其满足距离系数的三个性质．将其应用于一组同源辅助蛋白的聚类分析,表明是可行的．与离散增量系数及经典的欧氏距离系数的聚类结果进行比较,应用相干系数对聚类结果进行评价,结果表明由新信息距离系数所确定的聚类结构与聚类数据问的拟合程度最好.     

Using Hierarchical Clustering and Dendrograms to Quantify the Clustering of Membrane Proteins

Cell biologists have developed methods to label membrane proteins with gold nanoparticles and then extract spatial point patterns of the gold particles from transmission electron microscopy images using image processing software. Previously, the resulting patterns were analyzed using the Hopkins statistic, which distinguishes nonclustered from modestly and highly clustered distributions, but is not designed to quantify the number or sizes of the clusters. Clusters were defined by the partitional clustering approach which required the choice of a distance. Two points from a pattern were put in the same cluster if they were closer than this distance. In this study, we present a new methodology based on hierarchical clustering to quantify clustering. An intrinsic distance is computed, which is the distance that produces the maximum number of clusters in the biological data, eliminating the need to choose a distance. To quantify the extent of clustering, we compare the clustering distance between the experimental data being analyzed with that from simulated random data. Results are then expressed as a dimensionless number, the clustering ratio that facilitates the comparison of clustering between experiments. Replacing the chosen cluster distance by the intrinsic clustering distance emphasizes densely packed clusters that are likely more important to downstream signaling events.     

A supervised visual model for finding regions of interest in basal cell carcinoma images

Background

Expectation maximizing (EM) is one of the common approaches for image segmentation.

Methods

an improvement of the EM algorithm is proposed and its effectiveness for MRI brain image segmentation is investigated. In order to improve EM performance, the proposed algorithms incorporates neighbourhood information into the clustering process. At first, average image is obtained as neighbourhood information and then it is incorporated in clustering process. Also, as an option, user-interaction is used to improve segmentation results. Simulated and real MR volumes are used to compare the efficiency of the proposed improvement with the existing neighbourhood based extension for EM and FCM.

Results

the findings show that the proposed algorithm produces higher similarity index.

Conclusions

experiments demonstrate the effectiveness of the proposed algorithm in compare to other existing algorithms on various noise levels.     

基于多源遥感数据的面向对象林分类型识别

林分类型的识别是森林资源监测的核心问题之一.为研究多源遥感数据协同的面向对象林分类型分类识别,采用Radarsat-2数据和QuickBird遥感影像协同进行面向对象分类.在面向对象分类过程中,采用3种分割方案:单独使用QuickBird遥感影像分割;单独使用Radarsat-2数据分割;Radarsat-2&QuickBird协同分割.3种分割方案均采用10种分割尺度(25～250,步长25),应用修正的欧式距离3指标评价不同分割方案的分割结果,确定最优分割方案及最优分割尺度.在最优分割结果的基础上,基于地形、高度、光谱及共同特征的不同特征组合,应用带有径向基(RBF)核函数的支持向量机(SVM)分类器进行杉木林、马尾松林、阔叶林3种林分类型识别.结果表明:与单独使用一种数据相比,Radarsat-2数据和QuickBird遥感影像协同方案在面向对象林分类型分类方面具有优势.Radarsat-2&QuickBird协同分割方案,以最优尺度参数100进行分割时,分割结果最好.在最优分割结果的基础上,应用两种数据源提取的全部特征进行面向对象林分类型识别的精度最高(总精度为86%,Kappa值为0.86).本研究结果不仅可为多源遥感数据结合进行林分类型识别提供参考和借鉴,而且对于森林资源调查和监测有现实意义.     

Accurate Image Analysis of the Retina Using Hessian Matrix and Binarisation of Thresholded Entropy with Application of Texture Mapping

In this paper, we demonstrate a comprehensive method for segmenting the retinal vasculature in camera images of the fundus. This is of interest in the area of diagnostics for eye diseases that affect the blood vessels in the eye. In a departure from other state-of-the-art methods, vessels are first pre-grouped together with graph partitioning, using a spectral clustering technique based on morphological features. Local curvature is estimated over the whole image using eigenvalues of Hessian matrix in order to enhance the vessels, which appear as ridges in images of the retina. The result is combined with a binarized image, obtained using a threshold that maximizes entropy, to extract the retinal vessels from the background. Speckle type noise is reduced by applying a connectivity constraint on the extracted curvature based enhanced image. This constraint is varied over the image according to each region''s predominant blood vessel size. The resultant image exhibits the central light reflex of retinal arteries and veins, which prevents the segmentation of whole vessels. To address this, the earlier entropy-based binarization technique is repeated on the original image, but crucially, with a different threshold to incorporate the central reflex vessels. The final segmentation is achieved by combining the segmented vessels with and without central light reflex. We carry out our approach on DRIVE and REVIEW, two publicly available collections of retinal images for research purposes. The obtained results are compared with state-of-the-art methods in the literature using metrics such as sensitivity (true positive rate), selectivity (false positive rate) and accuracy rates for the DRIVE images and measured vessel widths for the REVIEW images. Our approach out-performs the methods in the literature.     

Rough-Fuzzy Clustering and Unsupervised Feature Selection for Wavelet Based MR Image Segmentation

Image segmentation is an indispensable process in the visualization of human tissues, particularly during clinical analysis of brain magnetic resonance (MR) images. For many human experts, manual segmentation is a difficult and time consuming task, which makes an automated brain MR image segmentation method desirable. In this regard, this paper presents a new segmentation method for brain MR images, integrating judiciously the merits of rough-fuzzy computing and multiresolution image analysis technique. The proposed method assumes that the major brain tissues, namely, gray matter, white matter, and cerebrospinal fluid from the MR images are considered to have different textural properties. The dyadic wavelet analysis is used to extract the scale-space feature vector for each pixel, while the rough-fuzzy clustering is used to address the uncertainty problem of brain MR image segmentation. An unsupervised feature selection method is introduced, based on maximum relevance-maximum significance criterion, to select relevant and significant textural features for segmentation problem, while the mathematical morphology based skull stripping preprocessing step is proposed to remove the non-cerebral tissues like skull. The performance of the proposed method, along with a comparison with related approaches, is demonstrated on a set of synthetic and real brain MR images using standard validity indices.     

Estimation of carbon storage based on individual tree detection in <Emphasis Type="Italic">Pinus densiflora</Emphasis> stands using a fusion of aerial photography and LiDAR data

The objective of this study was to estimate the carbon storage capacity of Pinus densiflora stands using remotely sensed data by combining digital aerial photography with light detection and ranging (LiDAR) data. A digital canopy model (DCM), generated from the LiDAR data, was combined with aerial photography for segmenting crowns of individual trees. To eliminate errors in over and under-segmentation, the combined image was smoothed using a Gaussian filtering method. The processed image was then segmented into individual trees using a marker-controlled watershed segmentation method. After measuring the crown area from the segmented individual trees, the individual tree diameter at breast height (DBH) was estimated using a regression function developed from the relationship observed between the field-measured DBH and crown area. The above ground biomass of individual trees could be calculated by an image-derived DBH using a regression function developed by the Korea Forest Research Institute. The carbon storage, based on individual trees, was estimated by simple multiplication using the carbon conversion index (0.5), as suggested in guidelines from the Intergovernmental Panel on Climate Change. The mean carbon storage per individual tree was estimated and then compared with the field-measured value. This study suggested that the biomass and carbon storage in a large forest area can be effectively estimated using aerial photographs and LiDAR data.