scholarly journals Quantitative Measurement of Breast Tumors Using Intravoxel Incoherent Motion (IVIM) MR Images

2021 ◽  
Vol 11 (7) ◽  
pp. 656
Author(s):  
Si-Wa Chan ◽  
Wei-Hsuan Hu ◽  
Yen-Chieh Ouyang ◽  
Hsien-Chi Su ◽  
Chin-Yao Lin ◽  
...  
Keyword(s):  
Quantitative Measurement ◽  
Hyperspectral Image ◽  
Clustering Algorithms ◽  
Ground Truth ◽  
Breast Tumors ◽  
Tumor Detection ◽  
Intravoxel Incoherent Motion ◽  
Detection Methods ◽  
Clustering Methods ◽  
Fuzzy C Means Clustering

Breast magnetic resonance imaging (MRI) is currently a widely used clinical examination tool. Recently, MR diffusion-related technologies, such as intravoxel incoherent motion diffusion weighted imaging (IVIM-DWI), have been extensively studied by breast cancer researchers and gradually adopted in clinical practice. In this study, we explored automatic tumor detection by IVIM-DWI. We considered the acquired IVIM-DWI data as a hyperspectral image cube and used a well-known hyperspectral subpixel target detection technique: constrained energy minimization (CEM). Two extended CEM methods—kernel CEM (K-CEM) and iterative CEM (I-CEM)—were employed to detect breast tumors. The K-means and fuzzy C-means clustering algorithms were also evaluated. The quantitative measurement results were compared to dynamic contrast-enhanced T1-MR imaging as ground truth. All four methods were successful in detecting tumors for all the patients studied. The clustering methods were found to be faster, but the CEM methods demonstrated better performance according to both the Dice and Jaccard metrics. These unsupervised tumor detection methods have the advantage of potentially eliminating operator variability. The quantitative results can be measured by using ADC, signal attenuation slope, D*, D, and PF parameters to classify tumors of mass, non-mass, cyst, and fibroadenoma types.

scholarly journals Leaf Segmentation of Rosette Plants using Rough K-Means in CIELab Color Space

2021 ◽  
Author(s):  
Arunita Das ◽  
Daipayan Ghosal ◽  
Krishna Gopal Dhal
Keyword(s):  
Clustering Algorithms ◽  
Color Space ◽  
Ground Truth ◽  
Accurate Analysis ◽  
Partitional Clustering ◽  
Modern Agriculture ◽  
Cielab Color Space ◽  
Fuzzy C Means Clustering ◽  
Leaf Segmentation ◽  
Cielab Color

Segmentation of Plant Images plays an important role in modern agriculture where it can provide accurate analysis of a plant’s growth and possi-ble anomalies. In this paper, rough set based partitional clustering technique called Rough K-Means has been utilized in CIELab color space for the proper leaf segmentation of rosette plants. The eÿcacy of the proposed technique have been analysed by comparing it with the results of tra-ditional K-Means and Fuzzy C-Means clustering algorithms. The visual and numerical results re-veal that the RKM in CIELab provides the near-est result to the ideal ground truth, hence the most eÿcient one.

scholarly journals Clustering assessment in weighted networks

2021 ◽  
Vol 7 ◽  
pp. e600
Author(s):  
Argimiro Arratia ◽  
Martí Renedo Mirambell
Keyword(s):  
Community Structure ◽  
Bootstrap Method ◽  
Clustering Algorithms ◽  
Ground Truth ◽  
Scoring Functions ◽  
Clustering Methods ◽  
Weighted Networks ◽  
Validation Methods ◽  
Clustering Quality ◽  
Clustering Validation

We provide a systematic approach to validate the results of clustering methods on weighted networks, in particular for the cases where the existence of a community structure is unknown. Our validation of clustering comprises a set of criteria for assessing their significance and stability. To test for cluster significance, we introduce a set of community scoring functions adapted to weighted networks, and systematically compare their values to those of a suitable null model. For this we propose a switching model to produce randomized graphs with weighted edges while maintaining the degree distribution constant. To test for cluster stability, we introduce a non parametric bootstrap method combined with similarity metrics derived from information theory and combinatorics. In order to assess the effectiveness of our clustering quality evaluation methods, we test them on synthetically generated weighted networks with a ground truth community structure of varying strength based on the stochastic block model construction. When applying the proposed methods to these synthetic ground truth networks’ clusters, as well as to other weighted networks with known community structure, these correctly identify the best performing algorithms, which suggests their adequacy for cases where the clustering structure is not known. We test our clustering validation methods on a varied collection of well known clustering algorithms applied to the synthetically generated networks and to several real world weighted networks. All our clustering validation methods are implemented in R, and will be released in the upcoming package clustAnalytics.

scholarly journals Edge Computing for Data Anomaly Detection of Multi-Sensors in Underground Mining

Electronics ◽  
2021 ◽  
Vol 10 (3) ◽  
pp. 302
Author(s):  
Chunde Liu ◽  
Xianli Su ◽  
Chuanwen Li
Keyword(s):  
Energy Consumption ◽  
Anomaly Detection ◽  
Underground Mining ◽  
Heterogeneous Data ◽  
Edge Computing ◽  
Sensor Nodes ◽  
Detection Methods ◽  
Detection Accuracy ◽  
Clustering Methods ◽  
Safety Warning

There is a growing interest in safety warning of underground mining due to the huge threat being faced by those working in underground mining. Data acquisition of sensors based on Internet of Things (IoT) is currently the main method, but the data anomaly detection and analysis of multi-sensors is a challenging task: firstly, the data that are collected by different sensors of underground mining are heterogeneous; secondly, real-time is required for the data anomaly detection of safety warning. Currently, there are many anomaly detection methods, such as traditional clustering methods K-means and C-means. Meanwhile, Artificial Intelligence (AI) is widely used in data analysis and prediction. However, K-means and C-means cannot directly process heterogeneous data, and AI algorithms require equipment with high computing and storage capabilities. IoT equipment of underground mining cannot perform complex calculation due to the limitation of energy consumption. Therefore, many existing methods cannot be directly used for IoT applications in underground mining. In this paper, a multi-sensors data anomaly detection method based on edge computing is proposed. Firstly, an edge computing model is designed, and according to the computing capabilities of different types of devices, anomaly detection tasks are migrated to different edge devices, which solve the problem of insufficient computing capabilities of the devices. Secondly, according to the requirements of different anomaly detection tasks, edge anomaly detection algorithms for sensor nodes and sink nodes are designed respectively. Lastly, an experimental platform is built for performance comparison analysis, and the experimental results show that the proposed algorithm has better performance in anomaly detection accuracy, delay, and energy consumption.

scholarly journals Evaluating effects of focal length and viewing angle in a comparison of recent face landmark and alignment methods

2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Xiang Li ◽  
Jianzheng Liu ◽  
Jessica Baron ◽  
Khoa Luu ◽  
Eric Patterson
Keyword(s):  
Focal Length ◽  
Ground Truth ◽  
Detection Methods ◽  
Viewing Angle ◽  
Deep Convolutional Neural Networks ◽  
Landmark Detection ◽  
High Performing ◽  
Detection Techniques ◽  
And Performance ◽  
Lens Focal Length

AbstractRecent attention to facial alignment and landmark detection methods, particularly with application of deep convolutional neural networks, have yielded notable improvements. Neither these neural-network nor more traditional methods, though, have been tested directly regarding performance differences due to camera-lens focal length nor camera viewing angle of subjects systematically across the viewing hemisphere. This work uses photo-realistic, synthesized facial images with varying parameters and corresponding ground-truth landmarks to enable comparison of alignment and landmark detection techniques relative to general performance, performance across focal length, and performance across viewing angle. Recently published high-performing methods along with traditional techniques are compared in regards to these aspects.

scholarly journals MF2C3: Multi-Feature Fuzzy Clustering to Enhance Cell Colony Detection in Automated Clonogenic Assay Evaluation

Symmetry ◽  
2020 ◽  
Vol 12 (5) ◽  
pp. 773 ◽  
Author(s):  
Carmelo Militello ◽  
Leonardo Rundo ◽  
Luigi Minafra ◽  
Francesco Paolo Cammarata ◽  
Marco Calvaruso ◽  
...  
Keyword(s):  
Clonogenic Assay ◽  
Ground Truth ◽  
General Purpose ◽  
Computational Method ◽  
Counting Procedure ◽  
Proliferative Effect ◽  
Biological Studies ◽  
Biological Technique ◽  
Fuzzy C Means Clustering ◽  
Cell Colony

A clonogenic assay is a biological technique for calculating the Surviving Fraction (SF) that quantifies the anti-proliferative effect of treatments on cell cultures: this evaluation is often performed via manual counting of cell colony-forming units. Unfortunately, this procedure is error-prone and strongly affected by operator dependence. Besides, conventional assessment does not deal with the colony size, which is generally correlated with the delivered radiation dose or administered cytotoxic agent. Relying upon the direct proportional relationship between the Area Covered by Colony (ACC) and the colony count and size, along with the growth rate, we propose MF2C3, a novel computational method leveraging spatial Fuzzy C-Means clustering on multiple local features (i.e., entropy and standard deviation extracted from the input color images acquired by a general-purpose flat-bed scanner) for ACC-based SF quantification, by considering only the covering percentage. To evaluate the accuracy of the proposed fully automatic approach, we compared the SFs obtained by MF2C3 against the conventional counting procedure on four different cell lines. The achieved results revealed a high correlation with the ground-truth measurements based on colony counting, by outperforming our previously validated method using local thresholding on L*u*v* color well images. In conclusion, the proposed multi-feature approach, which inherently leverages the concept of symmetry in the pixel local distributions, might be reliably used in biological studies.

scholarly journals A Distributed Parallel Algorithm Based on Low-Rank and Sparse Representation for Anomaly Detection in Hyperspectral Images

Sensors ◽  
2018 ◽  
Vol 18 (11) ◽  
pp. 3627 ◽  
Author(s):  
Yi Zhang ◽  
Zebin Wu ◽  
Jin Sun ◽  
Yan Zhang ◽  
Yaoqin Zhu ◽  
...  
Keyword(s):  
Anomaly Detection ◽  
Sparse Representation ◽  
Parallel Algorithm ◽  
Hyperspectral Image ◽  
Hyperspectral Images ◽  
Low Rank ◽  
Detection Methods ◽  
Matrix Computations ◽  
Hyperspectral Image Processing ◽  
Mapreduce Model

Anomaly detection aims to separate anomalous pixels from the background, and has become an important application of remotely sensed hyperspectral image processing. Anomaly detection methods based on low-rank and sparse representation (LRASR) can accurately detect anomalous pixels. However, with the significant volume increase of hyperspectral image repositories, such techniques consume a significant amount of time (mainly due to the massive amount of matrix computations involved). In this paper, we propose a novel distributed parallel algorithm (DPA) by redesigning key operators of LRASR in terms of MapReduce model to accelerate LRASR on cloud computing architectures. Independent computation operators are explored and executed in parallel on Spark. Specifically, we reconstitute the hyperspectral images in an appropriate format for efficient DPA processing, design the optimized storage strategy, and develop a pre-merge mechanism to reduce data transmission. Besides, a repartitioning policy is also proposed to improve DPA’s efficiency. Our experimental results demonstrate that the newly developed DPA achieves very high speedups when accelerating LRASR, in addition to maintaining similar accuracies. Moreover, our proposed DPA is shown to be scalable with the number of computing nodes and capable of processing big hyperspectral images involving massive amounts of data.

scholarly journals Towards Expert-Inspired Automatic Criterion to Cut a Dendrogram for Real-Industrial Applications

2021 ◽  
Author(s):  
Shikha Suman ◽  
Ashutosh Karna ◽  
Karina Gibert
Keyword(s):  
Hierarchical Clustering ◽  
Clustering Algorithms ◽  
Computational Cost ◽  
Real Life ◽  
Ground Truth ◽  
Industrial Applications ◽  
Underlying Structure ◽  
Cluster Validity ◽  
Cluster Validity Index ◽  
Number Of Clusters

Hierarchical clustering is one of the most preferred choices to understand the underlying structure of a dataset and defining typologies, with multiple applications in real life. Among the existing clustering algorithms, the hierarchical family is one of the most popular, as it permits to understand the inner structure of the dataset and find the number of clusters as an output, unlike popular methods, like k-means. One can adjust the granularity of final clustering to the goals of the analysis themselves. The number of clusters in a hierarchical method relies on the analysis of the resulting dendrogram itself. Experts have criteria to visually inspect the dendrogram and determine the number of clusters. Finding automatic criteria to imitate experts in this task is still an open problem. But, dependence on the expert to cut the tree represents a limitation in real applications like the fields industry 4.0 and additive manufacturing. This paper analyses several cluster validity indexes in the context of determining the suitable number of clusters in hierarchical clustering. A new Cluster Validity Index (CVI) is proposed such that it properly catches the implicit criteria used by experts when analyzing dendrograms. The proposal has been applied on a range of datasets and validated against experts ground-truth overcoming the results obtained by the State of the Art and also significantly reduces the computational cost.

scholarly journals A Bi-directional Fuzzy C-Means Clustering Ensemble Algorithm Considering Local Information

2021 ◽  
Vol 14 (1) ◽  
Author(s):  
Chunhua Ren ◽  
Linfu Sun
Keyword(s):  
Clustering Algorithms ◽  
Real Data ◽  
Local Information ◽  
Data Sets ◽  
Clustering Ensemble ◽  
K Nearest Neighbors ◽  
Fuzzy C Means ◽  
Clustering Quality ◽  
Fuzzy C Means Clustering ◽  
Fcm Clustering

AbstractThe classic Fuzzy C-means (FCM) algorithm has limited clustering performance and is prone to misclassification of border points. This study offers a bi-directional FCM clustering ensemble approach that takes local information into account (LI_BIFCM) to overcome these challenges and increase clustering quality. First, various membership matrices are created after running FCM multiple times, based on the randomization of the initial cluster centers, and a vertical ensemble is performed using the maximum membership principle. Second, after each execution of FCM, multiple local membership matrices of the sample points are created using multiple K-nearest neighbors, and a horizontal ensemble is performed. Multiple horizontal ensembles can be created using multiple FCM clustering. Finally, the final clustering results are obtained by combining the vertical and horizontal clustering ensembles. Twelve data sets were chosen for testing from both synthetic and real data sources. The LI_BIFCM clustering performance outperformed four traditional clustering algorithms and three clustering ensemble algorithms in the experiments. Furthermore, the final clustering results has a weak correlation with the bi-directional cluster ensemble parameters, indicating that the suggested technique is robust.

Sign in / Sign up

Export Citation Format

Share Document