Image segmentation is the most basic and crucial process remembering the true objective to facilitate the characterization and representation of the structure of excitement for medical or basic images. Despite escalated research, segmentation remains a challenging issue because of the differing image content, cluttered objects, occlusion, non-uniform object surface, and different factors. There are numerous calculations and techniques accessible for image segmentation yet at the same time there requirements to build up an efficient, quick technique of medical image segmentation. This paper has focused on K-means and Fuzzy C means clustering algorithm to segment malaria blood samples in more accurate manner.
The document summarizes research on medical image segmentation algorithms. It discusses k-means clustering, fuzzy c-means clustering, and proposes enhancements to these algorithms. Specifically, it introduces an enhanced k-means algorithm that improves initial cluster center selection. It also presents a kernelized fuzzy c-means approach that maps data points into a feature space to perform clustering. The algorithms are tested on MRI brain images and evaluated based on segmentation accuracy. The enhanced methods aim to produce more precise segmentations for medical applications such as diagnosis and treatment planning.
This document summarizes a research paper on using a k-means clustering method to detect brain tumors in MRI images. The paper introduces brain tumors and MRI imaging. It then describes using k-means clustering for tumor segmentation, which groups similar image patterns into clusters to identify the tumor region. The paper presents results of applying k-means to two MRI images, including statistical measures of segmentation accuracy, tumor area comparison, and timing. The k-means method achieved average rand index of 0.8358, low average errors, and tumor areas close to manual segmentation in under 3 seconds, demonstrating potential for accurate and efficient brain tumor detection.
Performance Evaluation of Basic Segmented Algorithms for Brain Tumor DetectionIOSR Journals
In the field of computers segmentation of image plays a very important role. By this method the required
portion of object is traced from the image. In medical image segmentation, clustering is very famous
method . By clustering, an image is divided into a number of various groups or can also be called as clusters.
There are various methods of clustering and thresholding which have been proposed in this paper such as otsu
, region growing , K Means , fuzzy c means and Hierarchical self organizing mapping algorithm. Fuzzy c-means
(FCM) is a method of clustering which allows one piece of data to belong to two or more clusters. This method
(developed by Dunn in 1973 and improved by Bezdek in 1981) is frequently used in pattern recognition. As
process of fuzzy c mean is too slow, this drawback is then removed. In this paper by experimental analysis and
performance parameters the segmentation of hierarchical self organizing mapping method is done in a better
way as compared to other algorithms. The various parameters used for the evaluation of the performance are as follows: segmentation accuracy (Sa) , area (A), rand index (Ri),and global consistency error (Gce)
Automatic Unsupervised Data Classification Using Jaya Evolutionary Algorithmaciijournal
The document describes an automatic unsupervised data classification method using the Jaya evolutionary algorithm. It proposes using Jaya to optimize multiple cluster validity indices (CVIs) simultaneously to determine the optimal number of clusters and cluster assignments. Twelve real-world datasets from different domains are used to evaluate the method. The results show that the proposed AutoJAYA algorithm is able to accurately detect the number of clusters in each dataset and achieve good performance according to various CVIs, demonstrating its effectiveness at automatic unsupervised data classification.
IRJET- Fusion based Brain Tumor DetectionIRJET Journal
1. The document discusses a method for detecting brain tumors using medical image fusion and support vector machines (SVM).
2. It involves fusing two MRI images using SVM to create a single fused image with more information than the original images. Texture and wavelet features are then extracted from the fused image.
3. The SVM classifier classifies the brain tumors as benign or malignant based on the trained and tested features extracted from the fused image.
Automatic Unsupervised Data Classification Using Jaya Evolutionary Algorithmaciijournal
In this paper we attempt to solve an automatic clustering problem by optimizing multiple objectives such as automatic k-determination and a set of cluster validity indices concurrently. The proposed automatic clustering technique uses the most recent optimization algorithm Jaya as an underlying optimization stratagem. This evolutionary technique always aims to attain global best solution rather than a local best solution in larger datasets. The explorations and exploitations imposed on the proposed work results to detect the number of automatic clusters, appropriate partitioning present in data sets and mere optimal values towards CVIs frontiers. Twelve datasets of different intricacy are used to endorse the performance of aimed algorithm. The experiments lay bare that the conjectural advantages of multi objective clustering optimized with evolutionary approaches decipher into realistic and scalable performance paybacks.
Development of algorithm for identification of maligant growth in cancer usin...IJECEIAES
The precise identification and characterization of small pulmonary nodules at low-dose CT is a necessary requirement for the completion of valuable lung cancer screening. It is compulsory to develop some automated tool, in order to detect pulmonary nodules at low dose ct at the beginning stage itself. The various algorithms had been proposed earlier by many researchers within the past, but the accuracy of prediction is usually a challenging task. During this work, a man-made neural networ based methodology is proposed to seek out the irregular growth of lung tissues. Higher probability of detection is taken as a goal to urge an automatic tool, with great accuracy. The best feature sets derived from Haralick Gray level co occurrence Matrix and used because the dimension reduction way for feeding neural network. During this work, a binary Binary classifier neural network has been proposed to spot the traditional images out of all the images. The potential of the proposed neural network has been quantitatively computed using confusion matrix and located in terms of accuracy.
SEGMENTATION OF MAGNETIC RESONANCE BRAIN TUMOR USING INTEGRATED FUZZY K-MEANS...ijcsit
Segmentation is a process of partitioning the image into several objects. It plays a vital role in many fields
such as satellite, remote sensing, object identification, face tracking and most importantly in medical field.
In radiology, magnetic resonance imaging (MRI) is used to investigate the human body processes and
functions of organisms. In hospitals, this technique has been using widely for medical diagnosis, to find the
disease stage and follow-up without exposure to ionizing radiation.Here in this paper, we proposed a novel
MR brain image segmentation method for detecting the tumor and finding the tumor area with improved
performance over conventional segmentation techniques such as fuzzy c means (FCM), K-means and even
that of manual segmentation in terms of precision time and accuracy. Simulation performance shows that
the proposed scheme has performed superior to the existing segmentation methods.
The document summarizes research on medical image segmentation algorithms. It discusses k-means clustering, fuzzy c-means clustering, and proposes enhancements to these algorithms. Specifically, it introduces an enhanced k-means algorithm that improves initial cluster center selection. It also presents a kernelized fuzzy c-means approach that maps data points into a feature space to perform clustering. The algorithms are tested on MRI brain images and evaluated based on segmentation accuracy. The enhanced methods aim to produce more precise segmentations for medical applications such as diagnosis and treatment planning.
This document summarizes a research paper on using a k-means clustering method to detect brain tumors in MRI images. The paper introduces brain tumors and MRI imaging. It then describes using k-means clustering for tumor segmentation, which groups similar image patterns into clusters to identify the tumor region. The paper presents results of applying k-means to two MRI images, including statistical measures of segmentation accuracy, tumor area comparison, and timing. The k-means method achieved average rand index of 0.8358, low average errors, and tumor areas close to manual segmentation in under 3 seconds, demonstrating potential for accurate and efficient brain tumor detection.
Performance Evaluation of Basic Segmented Algorithms for Brain Tumor DetectionIOSR Journals
In the field of computers segmentation of image plays a very important role. By this method the required
portion of object is traced from the image. In medical image segmentation, clustering is very famous
method . By clustering, an image is divided into a number of various groups or can also be called as clusters.
There are various methods of clustering and thresholding which have been proposed in this paper such as otsu
, region growing , K Means , fuzzy c means and Hierarchical self organizing mapping algorithm. Fuzzy c-means
(FCM) is a method of clustering which allows one piece of data to belong to two or more clusters. This method
(developed by Dunn in 1973 and improved by Bezdek in 1981) is frequently used in pattern recognition. As
process of fuzzy c mean is too slow, this drawback is then removed. In this paper by experimental analysis and
performance parameters the segmentation of hierarchical self organizing mapping method is done in a better
way as compared to other algorithms. The various parameters used for the evaluation of the performance are as follows: segmentation accuracy (Sa) , area (A), rand index (Ri),and global consistency error (Gce)
Automatic Unsupervised Data Classification Using Jaya Evolutionary Algorithmaciijournal
The document describes an automatic unsupervised data classification method using the Jaya evolutionary algorithm. It proposes using Jaya to optimize multiple cluster validity indices (CVIs) simultaneously to determine the optimal number of clusters and cluster assignments. Twelve real-world datasets from different domains are used to evaluate the method. The results show that the proposed AutoJAYA algorithm is able to accurately detect the number of clusters in each dataset and achieve good performance according to various CVIs, demonstrating its effectiveness at automatic unsupervised data classification.
IRJET- Fusion based Brain Tumor DetectionIRJET Journal
1. The document discusses a method for detecting brain tumors using medical image fusion and support vector machines (SVM).
2. It involves fusing two MRI images using SVM to create a single fused image with more information than the original images. Texture and wavelet features are then extracted from the fused image.
3. The SVM classifier classifies the brain tumors as benign or malignant based on the trained and tested features extracted from the fused image.
Automatic Unsupervised Data Classification Using Jaya Evolutionary Algorithmaciijournal
In this paper we attempt to solve an automatic clustering problem by optimizing multiple objectives such as automatic k-determination and a set of cluster validity indices concurrently. The proposed automatic clustering technique uses the most recent optimization algorithm Jaya as an underlying optimization stratagem. This evolutionary technique always aims to attain global best solution rather than a local best solution in larger datasets. The explorations and exploitations imposed on the proposed work results to detect the number of automatic clusters, appropriate partitioning present in data sets and mere optimal values towards CVIs frontiers. Twelve datasets of different intricacy are used to endorse the performance of aimed algorithm. The experiments lay bare that the conjectural advantages of multi objective clustering optimized with evolutionary approaches decipher into realistic and scalable performance paybacks.
Development of algorithm for identification of maligant growth in cancer usin...IJECEIAES
The precise identification and characterization of small pulmonary nodules at low-dose CT is a necessary requirement for the completion of valuable lung cancer screening. It is compulsory to develop some automated tool, in order to detect pulmonary nodules at low dose ct at the beginning stage itself. The various algorithms had been proposed earlier by many researchers within the past, but the accuracy of prediction is usually a challenging task. During this work, a man-made neural networ based methodology is proposed to seek out the irregular growth of lung tissues. Higher probability of detection is taken as a goal to urge an automatic tool, with great accuracy. The best feature sets derived from Haralick Gray level co occurrence Matrix and used because the dimension reduction way for feeding neural network. During this work, a binary Binary classifier neural network has been proposed to spot the traditional images out of all the images. The potential of the proposed neural network has been quantitatively computed using confusion matrix and located in terms of accuracy.
SEGMENTATION OF MAGNETIC RESONANCE BRAIN TUMOR USING INTEGRATED FUZZY K-MEANS...ijcsit
Segmentation is a process of partitioning the image into several objects. It plays a vital role in many fields
such as satellite, remote sensing, object identification, face tracking and most importantly in medical field.
In radiology, magnetic resonance imaging (MRI) is used to investigate the human body processes and
functions of organisms. In hospitals, this technique has been using widely for medical diagnosis, to find the
disease stage and follow-up without exposure to ionizing radiation.Here in this paper, we proposed a novel
MR brain image segmentation method for detecting the tumor and finding the tumor area with improved
performance over conventional segmentation techniques such as fuzzy c means (FCM), K-means and even
that of manual segmentation in terms of precision time and accuracy. Simulation performance shows that
the proposed scheme has performed superior to the existing segmentation methods.
Graph Theory Based Approach For Image Segmentation Using Wavelet TransformCSCJournals
This paper presents the image segmentation approach based on graph theory and threshold. Amongst the various segmentation approaches, the graph theoretic approaches in image segmentation make the formulation of the problem more flexible and the computation more resourceful. The problem is modeled in terms of partitioning a graph into several sub-graphs; such that each of them represents a meaningful region in the image. The segmentation problem is then solved in a spatially discrete space by the well-organized tools from graph theory. After the literature review, the problem is formulated regarding graph representation of image and threshold function. The boundaries between the regions are determined as per the segmentation criteria and the segmented regions are labeled with random colors. In presented approach, the image is preprocessed by discrete wavelet transform and coherence filter before graph segmentation. The experiments are carried out on a number of natural images taken from Berkeley Image Database as well as synthetic images from online resources. The experiments are performed by using the wavelets of Haar, DB2, DB4, DB6 and DB8. The results are evaluated and compared by using the performance evaluation parameters like execution time, Performance Ratio, Peak Signal to Noise Ratio, Precision and Recall and obtained results are encouraging.
K Mean and Fuzzy Clustering Algorithm Predicated Brain Tumor Segmentation And...IRJET Journal
This document discusses using K-means and fuzzy clustering algorithms to segment and estimate the area of predicted brain tumors in MRI images. It begins with an introduction to brain tumors and MRI imaging. Then, it describes the related work on brain tumor detection and classification using techniques like artificial neural networks. The proposed method is outlined as applying K-means clustering initially for segmentation followed by fuzzy C-means clustering for more precise tumor shape extraction. Results from applying the algorithms to images are presented and analyzed, showing the processing time, estimated tumor area, and other metrics. The conclusion is that K-means works well for mass tumors while fuzzy C-means is better for segmenting malignant tumors to precisely estimate the shape and position.
Hybrid Multilevel Thresholding and Improved Harmony Search Algorithm for Segm...IJECEIAES
This paper proposes a new method for image segmentation is hybrid multilevel thresholding and improved harmony search algorithm. Improved harmony search algorithm which is a method for finding vector solutions by increasing its accuracy. The proposed method looks for a random candidate solution, then its quality is evaluated through the Otsu objective function. Furthermore, the operator continues to evolve the solution candidate circuit until the optimal solution is found. The dataset used in this study is the retina dataset, tongue, lenna, baboon, and cameraman. The experimental results show that this method produces the high performance as seen from peak signal-to-noise ratio analysis (PNSR). The PNSR result for retinal image averaged 40.342 dB while for the average tongue image 35.340 dB. For lenna, baboon and cameramen produce an average of 33.781 dB, 33.499 dB, and 34.869 dB. Furthermore, the process of object recognition and identification is expected to use this method to produce a high degree of accuracy.
A MIXTURE MODEL OF HUBNESS AND PCA FOR DETECTION OF PROJECTED OUTLIERSZac Darcy
With the Advancement of time and technology, Outlier Mining methodologies help to sift through the large
amount of interesting data patterns and winnows the malicious data entering in any field of concern. It has
become indispensible to build not only a robust and a generalised model for anomaly detection but also to
dress the same model with extra features like utmost accuracy and precision. Although the K-means
algorithm is one of the most popular, unsupervised, unique and the easiest clustering algorithm, yet it can
be used to dovetail PCA with hubness and the robust model formed from Guassian Mixture to build a very
generalised and a robust anomaly detection system. A major loophole of the K-means algorithm is its
constant attempt to find the local minima and result in a cluster that leads to ambiguity. In this paper, an
attempt has done to combine K-means algorithm with PCA technique that results in the formation of more
closely centred clusters that work more accurately with K-means algorithm
Predictive Data Mining with Normalized Adaptive Training Method for Neural Ne...IJERDJOURNAL
Abstract:- Predictive data mining is an upcoming and fast-growing field and offers a competitive edge for the benefit of organization. In recent decades, researchers have developed new techniques and intelligent algorithms for predictive data mining. In this research paper, we have proposed a novel training algorithm for optimizing neural networks for prediction purpose and to utilize it for the development of prediction models. Models developed in MATLAB Neural Network Toolbox have been tested for insurance datasets taken from a live data warehouse. A comparative study of the proposed algorithm with other popular first and second order algorithms has been presented to judge the predictive accuracy of the suggested technique. Various graphs have been presented to analyse the convergence behaviour of different algorithms towards point of minimum error.
This document summarizes a research paper that uses an artificial neural network approach to forecast stock market prices in India. The paper trains a feedforward neural network using a backpropagation algorithm on data from 5 Indian companies between 2004 and 2013. The network is tested in MATLAB to predict stock prices and calculate an error rate for accuracy. The neural network model is found to provide a computational method for predicting stock market movements based on historical price and volume data.
Texture Analysis As An Aid In CAD And Computational Logiciosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
Hybrid Approach for Brain Tumour Detection in Image Segmentationijtsrd
In this paper we have considered illustrating a few techniques. But the numbers of techniques are so large they cannot be all addressed. Image segmentation forms the basics of pattern recognition and scene analysis problems. The segmentation techniques are numerous in number but the choice of one technique over the other depends only on the application or requirements of the problem that is being considered. Analysis of cluster is a descriptive assignment that perceive homogenous group of objects and it is also one of the fundamental analytical method in facts mining. The main idea of this is to present facts about brain tumour detection system and various data mining methods used in this system. This is focuses on scalable data systems, which include a set of tools and mechanisms to load, extract, and improve disparate data power to perform complex transformations and analysis will be measured between the way of measuring the Furrier and Wavelet Transform distance. Sandeep | Jyoti Kataria "Hybrid Approach for Brain Tumour Detection in Image Segmentation" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-4 | Issue-6 , October 2020, URL: https://www.ijtsrd.com/papers/ijtsrd33409.pdf Paper Url: https://www.ijtsrd.com/medicine/other/33409/hybrid-approach-for-brain-tumour-detection-in-image-segmentation/sandeep
IRJET - Clustering Algorithm for Brain Image SegmentationIRJET Journal
The document presents a clustering algorithm for brain image segmentation using fuzzy c-means clustering. It aims to optimize the segmentation process and achieve higher accuracy rates when segmenting human MRI brain images. The fuzzy c-means algorithm is combined with rough set theory for segmentation. The algorithm segments images into homogeneous regions where adjacent regions are heterogeneous. This approach is evaluated on a set of brain images and demonstrates effectiveness as well as a comparison to other related algorithms. The goal of the algorithm is to simplify images and extract useful information for detecting brain tumors.
ESTIMATING PROJECT DEVELOPMENT EFFORT USING CLUSTERED REGRESSION APPROACHcscpconf
Due to the intangible nature of “software”, accurate and reliable software effort estimation is a challenge in the software Industry. It is unlikely to expect very accurate estimates of software
development effort because of the inherent uncertainty in software development projects and the complex and dynamic interaction of factors that impact software development. Heterogeneity exists in the software engineering datasets because data is made available from diverse sources.
This can be reduced by defining certain relationship between the data values by classifying them into different clusters. This study focuses on how the combination of clustering and
regression techniques can reduce the potential problems in effectiveness of predictive efficiency due to heterogeneity of the data. Using a clustered approach creates the subsets of data having a degree of homogeneity that enhances prediction accuracy. It was also observed in this study that ridge regression performs better than other regression techniques used in the analysis.
Estimating project development effort using clustered regression approachcsandit
Due to the intangible nature of “software”, accurate and reliable software effort estimation is a
challenge in the software Industry. It is unlikely to expect very accurate estimates of software
development effort because of the inherent uncertainty in software development projects and the
complex and dynamic interaction of factors that impact software development. Heterogeneity
exists in the software engineering datasets because data is made available from diverse sources.
This can be reduced by defining certain relationship between the data values by classifying
them into different clusters. This study focuses on how the combination of clustering and
regression techniques can reduce the potential problems in effectiveness of predictive efficiency
due to heterogeneity of the data. Using a clustered approach creates the subsets of data having
a degree of homogeneity that enhances prediction accuracy. It was also observed in this study
that ridge regression performs better than other regression techniques used in the analysis.
Paper Annotated: SinGAN-Seg: Synthetic Training Data Generation for Medical I...Devansh16
YouTube video: https://www.youtube.com/watch?v=Ao-19L0sLOI
SinGAN-Seg: Synthetic Training Data Generation for Medical Image Segmentation
Vajira Thambawita, Pegah Salehi, Sajad Amouei Sheshkal, Steven A. Hicks, Hugo L.Hammer, Sravanthi Parasa, Thomas de Lange, Pål Halvorsen, Michael A. Riegler
Processing medical data to find abnormalities is a time-consuming and costly task, requiring tremendous efforts from medical experts. Therefore, Ai has become a popular tool for the automatic processing of medical data, acting as a supportive tool for doctors. AI tools highly depend on data for training the models. However, there are several constraints to access to large amounts of medical data to train machine learning algorithms in the medical domain, e.g., due to privacy concerns and the costly, time-consuming medical data annotation process. To address this, in this paper we present a novel synthetic data generation pipeline called SinGAN-Seg to produce synthetic medical data with the corresponding annotated ground truth masks. We show that these synthetic data generation pipelines can be used as an alternative to bypass privacy concerns and as an alternative way to produce artificial segmentation datasets with corresponding ground truth masks to avoid the tedious medical data annotation process. As a proof of concept, we used an open polyp segmentation dataset. By training UNet++ using both the real polyp segmentation dataset and the corresponding synthetic dataset generated from the SinGAN-Seg pipeline, we show that the synthetic data can achieve a very close performance to the real data when the real segmentation datasets are large enough. In addition, we show that synthetic data generated from the SinGAN-Seg pipeline improving the performance of segmentation algorithms when the training dataset is very small. Since our SinGAN-Seg pipeline is applicable for any medical dataset, this pipeline can be used with any other segmentation datasets.
Subjects: Image and Video Processing (eess.IV); Computer Vision and Pattern Recognition (cs.CV); Machine Learning (cs.LG)
Cite as: arXiv:2107.00471 [eess.IV]
(or arXiv:2107.00471v1 [eess.IV] for this version)
Reach out to me:
Check out my other articles on Medium. : https://machine-learning-made-simple....
My YouTube: https://rb.gy/88iwdd
Reach out to me on LinkedIn: https://www.linkedin.com/in/devansh-d...
My Instagram: https://rb.gy/gmvuy9
My Twitter: https://twitter.com/Machine01776819
My Substack: https://devanshacc.substack.com/
Live conversations at twitch here: https://rb.gy/zlhk9y
Get a free stock on Robinhood: https://join.robinhood.com/fnud75
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Prediction of Default Customer in Banking Sector using Artificial Neural Networkrahulmonikasharma
The aim of this article is to present perdition and risk accuracy analysis of default customer in the banking sector. The neural network is a learning model inspired by biological neuron it is used to estimate and predict that can depend on a large number of inputs. The bank customer dataset from UCI repository, used for data analysis method to extract informative data set from a large volume of the dataset. This dataset is used in the neural network for training data and testing data. In a training of data, the data set is iterated till the desired output. This training data is cross check with test data. This paper focuses on predicting default customer by using deep learning neural network (DNN) algorithm.
When deep learners change their mind learning dynamics for active learningDevansh16
Abstract:
Active learning aims to select samples to be annotated that yield the largest performance improvement for the learning algorithm. Many methods approach this problem by measuring the informativeness of samples and do this based on the certainty of the network predictions for samples. However, it is well-known that neural networks are overly confident about their prediction and are therefore an untrustworthy source to assess sample informativeness. In this paper, we propose a new informativeness-based active learning method. Our measure is derived from the learning dynamics of a neural network. More precisely we track the label assignment of the unlabeled data pool during the training of the algorithm. We capture the learning dynamics with a metric called label-dispersion, which is low when the network consistently assigns the same label to the sample during the training of the network and high when the assigned label changes frequently. We show that label-dispersion is a promising predictor of the uncertainty of the network, and show on two benchmark datasets that an active learning algorithm based on label-dispersion obtains excellent results.
Development and Comparison of Image Fusion Techniques for CT&MRI ImagesIJERA Editor
Image processing techniques primarily focus upon enhancing the quality of an image or a set ofimages to derive
the maximum information from them. Image Fusion is a technique of producing a superior quality image from a
set of available images. It is the process of combining relevant information from two or more images into a
single image wherein the resulting image will be more informative and complete than any of the input images. A
lot of research is being done in this field encompassing areas of Computer Vision, Automatic object detection,
Image processing, parallel and distributed processing, Robotics and remote sensing. This project paves way to
explain the theoretical and implementation issues of seven image fusion algorithms and the experimental results
of the same. The fusion algorithms would be assessed based on the study and development of some image
quality metrics
An Experiment with Sparse Field and Localized Region Based Active Contour Int...CSCJournals
This paper discusses various experiments conducted on different types of Level Sets interactive segmentation techniques using Matlab software, on select images. The objective is to assess the effectiveness on specific natural images, which have complex image composition in terms of intensity, colour mix, indistinct object boundary, low contrast, etc. Besides visual assessment, measures such as Jaccard Index, Dice Coefficient and Hausdorrf Distance have been computed to assess the accuracy of these techniques, between segmented and ground truth images. This paper particularly discusses Sparse Field Matrix and Localized Region Based Active Contours, both based on Level Sets. These techniques were not found to be effective where object boundary is not very distinct and/or has low contrast with background. Also, the techniques were ineffective on such images where foreground object stretches up to the image boundary.
Brain Tumor Detection using Clustering Algorithms in MRI ImagesIRJET Journal
This document presents a novel brain tumor detection system using k-means clustering integrated with fuzzy c-means clustering and artificial neural networks. The system takes advantage of both algorithms for minimal computation time and accuracy. It accurately extracts the tumor region and calculates the tumor area by comparing the results to ground truths of the MRI images. K-means performs initial segmentation, then fuzzy c-means locates the approximate segmented tumor based on membership and cluster selection criteria. Features are extracted and an artificial neural network classifies MRI images as normal or containing a tumor. The system achieves high accuracy, sensitivity and specificity when validated against ground truths.
Geometric Correction for Braille Document Images csandit
Image processing is an important research area in computer vision. clustering is an unsupervised
study. clustering can also be used for image segmentation. there exist so many methods for image
segmentation. image segmentation plays an important role in image analysis.it is one of the first
and the most important tasks in image analysis and computer vision. this proposed system
presents a variation of fuzzy c-means algorithm that provides image clustering. the kernel fuzzy
c-means clustering algorithm (kfcm) is derived from the fuzzy c-means clustering
algorithm(fcm).the kfcm algorithm that provides image clustering and improves accuracy
significantly compared with classical fuzzy c-means algorithm. the new algorithm is called
gaussian kernel based fuzzy c-means clustering algorithm (gkfcm)the major characteristic of
gkfcm is the use of a fuzzy clustering approach ,aiming to guarantee noise insensitiveness and
image detail preservation.. the objective of the work is to cluster the low intensity in homogeneity
area from the noisy images, using the clustering method, segmenting that portion separately using
content level set approach. the purpose of designing this system is to produce better segmentation
results for images corrupted by noise, so that it can be useful in various fields like medical image
analysis, such as tumor detection, study of anatomical structure, and treatment planning.
GAUSSIAN KERNEL BASED FUZZY C-MEANS CLUSTERING ALGORITHM FOR IMAGE SEGMENTATIONcscpconf
Image processing is an important research area in computer vision. clustering is an unsupervised study. clustering can also be used for image segmentation. there exist so many methods for image segmentation. image segmentation plays an important role in image analysis.it is one of the first and the most important tasks in image analysis and computer vision. this proposed system presents a variation of fuzzy c-means algorithm that provides image clustering. the kernel fuzzy
c-means clustering algorithm (kfcm) is derived from the fuzzy c-means clustering algorithm(fcm).the kfcm algorithm that provides image clustering and improves accuracy significantly compared with classical fuzzy c-means algorithm. the new algorithm is called gaussian kernel based fuzzy c-means clustering algorithm (gkfcm)the major characteristic of gkfcm is the use of a fuzzy clustering approach ,aiming to guarantee noise insensitiveness and image detail preservation.. the objective of the work is to cluster the low intensity in homogeneity area from the noisy images, using the clustering method, segmenting that portion separately using content level set approach. the purpose of designing this system is to produce better segmentation results for images corrupted by noise, so that it can be useful in various fields like medical image analysis, such as tumor detection, study of anatomical structure, and treatment planning.
GAUSSIAN KERNEL BASED FUZZY C-MEANS CLUSTERING ALGORITHM FOR IMAGE SEGMENTATIONcsandit
Image processing is an important research area in computer vision. clustering is an unsupervised
study. clustering can also be used for image segmentation. there exist so many methods for image
segmentation. image segmentation plays an important role in image analysis.it is one of the first
and the most important tasks in image analysis and computer vision. this proposed system
presents a variation of fuzzy c-means algorithm that provides image clustering. the kernel fuzzy
c-means clustering algorithm (kfcm) is derived from the fuzzy c-means clustering
algorithm(fcm).the kfcm algorithm that provides image clustering and improves accuracy
significantly compared with classical fuzzy c-means algorithm. the new algorithm is called
gaussian kernel based fuzzy c-means clustering algorithm (gkfcm)the major characteristic of
gkfcm is the use of a fuzzy clustering approach ,aiming to guarantee noise insensitiveness and
image detail preservation.. the objective of the work is to cluster the low intensity in homogeneity
area from the noisy images, using the clustering method, segmenting that portion separately using
content level set approach. the purpose of designing this system is to produce better segmentation
results for images corrupted by noise, so that it can be useful in various fields like medical image
analysis, such as tumor detection, study of anatomical structure, and treatment planning.
Classification of MR medical images Based Rough-Fuzzy KMeansIOSRJM
The document summarizes a proposed algorithm for classifying MR medical images using Rough-Fuzzy K-Means (FRKM). It begins with an introduction to the challenges of medical image classification and a literature review of previous techniques. It then provides background on rough set theory, fuzzy set theory, and K-means clustering. The proposed FRKM algorithm is described as using rough set theory for feature selection and dimensionality reduction, followed by a K-means clustering with probabilities assigned based on rough set approximations to classify ambiguous areas. Experimental results show the FRKM approach achieves 94.4% accuracy, higher than other techniques.
Graph Theory Based Approach For Image Segmentation Using Wavelet TransformCSCJournals
This paper presents the image segmentation approach based on graph theory and threshold. Amongst the various segmentation approaches, the graph theoretic approaches in image segmentation make the formulation of the problem more flexible and the computation more resourceful. The problem is modeled in terms of partitioning a graph into several sub-graphs; such that each of them represents a meaningful region in the image. The segmentation problem is then solved in a spatially discrete space by the well-organized tools from graph theory. After the literature review, the problem is formulated regarding graph representation of image and threshold function. The boundaries between the regions are determined as per the segmentation criteria and the segmented regions are labeled with random colors. In presented approach, the image is preprocessed by discrete wavelet transform and coherence filter before graph segmentation. The experiments are carried out on a number of natural images taken from Berkeley Image Database as well as synthetic images from online resources. The experiments are performed by using the wavelets of Haar, DB2, DB4, DB6 and DB8. The results are evaluated and compared by using the performance evaluation parameters like execution time, Performance Ratio, Peak Signal to Noise Ratio, Precision and Recall and obtained results are encouraging.
K Mean and Fuzzy Clustering Algorithm Predicated Brain Tumor Segmentation And...IRJET Journal
This document discusses using K-means and fuzzy clustering algorithms to segment and estimate the area of predicted brain tumors in MRI images. It begins with an introduction to brain tumors and MRI imaging. Then, it describes the related work on brain tumor detection and classification using techniques like artificial neural networks. The proposed method is outlined as applying K-means clustering initially for segmentation followed by fuzzy C-means clustering for more precise tumor shape extraction. Results from applying the algorithms to images are presented and analyzed, showing the processing time, estimated tumor area, and other metrics. The conclusion is that K-means works well for mass tumors while fuzzy C-means is better for segmenting malignant tumors to precisely estimate the shape and position.
Hybrid Multilevel Thresholding and Improved Harmony Search Algorithm for Segm...IJECEIAES
This paper proposes a new method for image segmentation is hybrid multilevel thresholding and improved harmony search algorithm. Improved harmony search algorithm which is a method for finding vector solutions by increasing its accuracy. The proposed method looks for a random candidate solution, then its quality is evaluated through the Otsu objective function. Furthermore, the operator continues to evolve the solution candidate circuit until the optimal solution is found. The dataset used in this study is the retina dataset, tongue, lenna, baboon, and cameraman. The experimental results show that this method produces the high performance as seen from peak signal-to-noise ratio analysis (PNSR). The PNSR result for retinal image averaged 40.342 dB while for the average tongue image 35.340 dB. For lenna, baboon and cameramen produce an average of 33.781 dB, 33.499 dB, and 34.869 dB. Furthermore, the process of object recognition and identification is expected to use this method to produce a high degree of accuracy.
A MIXTURE MODEL OF HUBNESS AND PCA FOR DETECTION OF PROJECTED OUTLIERSZac Darcy
With the Advancement of time and technology, Outlier Mining methodologies help to sift through the large
amount of interesting data patterns and winnows the malicious data entering in any field of concern. It has
become indispensible to build not only a robust and a generalised model for anomaly detection but also to
dress the same model with extra features like utmost accuracy and precision. Although the K-means
algorithm is one of the most popular, unsupervised, unique and the easiest clustering algorithm, yet it can
be used to dovetail PCA with hubness and the robust model formed from Guassian Mixture to build a very
generalised and a robust anomaly detection system. A major loophole of the K-means algorithm is its
constant attempt to find the local minima and result in a cluster that leads to ambiguity. In this paper, an
attempt has done to combine K-means algorithm with PCA technique that results in the formation of more
closely centred clusters that work more accurately with K-means algorithm
Predictive Data Mining with Normalized Adaptive Training Method for Neural Ne...IJERDJOURNAL
Abstract:- Predictive data mining is an upcoming and fast-growing field and offers a competitive edge for the benefit of organization. In recent decades, researchers have developed new techniques and intelligent algorithms for predictive data mining. In this research paper, we have proposed a novel training algorithm for optimizing neural networks for prediction purpose and to utilize it for the development of prediction models. Models developed in MATLAB Neural Network Toolbox have been tested for insurance datasets taken from a live data warehouse. A comparative study of the proposed algorithm with other popular first and second order algorithms has been presented to judge the predictive accuracy of the suggested technique. Various graphs have been presented to analyse the convergence behaviour of different algorithms towards point of minimum error.
This document summarizes a research paper that uses an artificial neural network approach to forecast stock market prices in India. The paper trains a feedforward neural network using a backpropagation algorithm on data from 5 Indian companies between 2004 and 2013. The network is tested in MATLAB to predict stock prices and calculate an error rate for accuracy. The neural network model is found to provide a computational method for predicting stock market movements based on historical price and volume data.
Texture Analysis As An Aid In CAD And Computational Logiciosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
Hybrid Approach for Brain Tumour Detection in Image Segmentationijtsrd
In this paper we have considered illustrating a few techniques. But the numbers of techniques are so large they cannot be all addressed. Image segmentation forms the basics of pattern recognition and scene analysis problems. The segmentation techniques are numerous in number but the choice of one technique over the other depends only on the application or requirements of the problem that is being considered. Analysis of cluster is a descriptive assignment that perceive homogenous group of objects and it is also one of the fundamental analytical method in facts mining. The main idea of this is to present facts about brain tumour detection system and various data mining methods used in this system. This is focuses on scalable data systems, which include a set of tools and mechanisms to load, extract, and improve disparate data power to perform complex transformations and analysis will be measured between the way of measuring the Furrier and Wavelet Transform distance. Sandeep | Jyoti Kataria "Hybrid Approach for Brain Tumour Detection in Image Segmentation" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-4 | Issue-6 , October 2020, URL: https://www.ijtsrd.com/papers/ijtsrd33409.pdf Paper Url: https://www.ijtsrd.com/medicine/other/33409/hybrid-approach-for-brain-tumour-detection-in-image-segmentation/sandeep
IRJET - Clustering Algorithm for Brain Image SegmentationIRJET Journal
The document presents a clustering algorithm for brain image segmentation using fuzzy c-means clustering. It aims to optimize the segmentation process and achieve higher accuracy rates when segmenting human MRI brain images. The fuzzy c-means algorithm is combined with rough set theory for segmentation. The algorithm segments images into homogeneous regions where adjacent regions are heterogeneous. This approach is evaluated on a set of brain images and demonstrates effectiveness as well as a comparison to other related algorithms. The goal of the algorithm is to simplify images and extract useful information for detecting brain tumors.
ESTIMATING PROJECT DEVELOPMENT EFFORT USING CLUSTERED REGRESSION APPROACHcscpconf
Due to the intangible nature of “software”, accurate and reliable software effort estimation is a challenge in the software Industry. It is unlikely to expect very accurate estimates of software
development effort because of the inherent uncertainty in software development projects and the complex and dynamic interaction of factors that impact software development. Heterogeneity exists in the software engineering datasets because data is made available from diverse sources.
This can be reduced by defining certain relationship between the data values by classifying them into different clusters. This study focuses on how the combination of clustering and
regression techniques can reduce the potential problems in effectiveness of predictive efficiency due to heterogeneity of the data. Using a clustered approach creates the subsets of data having a degree of homogeneity that enhances prediction accuracy. It was also observed in this study that ridge regression performs better than other regression techniques used in the analysis.
Estimating project development effort using clustered regression approachcsandit
Due to the intangible nature of “software”, accurate and reliable software effort estimation is a
challenge in the software Industry. It is unlikely to expect very accurate estimates of software
development effort because of the inherent uncertainty in software development projects and the
complex and dynamic interaction of factors that impact software development. Heterogeneity
exists in the software engineering datasets because data is made available from diverse sources.
This can be reduced by defining certain relationship between the data values by classifying
them into different clusters. This study focuses on how the combination of clustering and
regression techniques can reduce the potential problems in effectiveness of predictive efficiency
due to heterogeneity of the data. Using a clustered approach creates the subsets of data having
a degree of homogeneity that enhances prediction accuracy. It was also observed in this study
that ridge regression performs better than other regression techniques used in the analysis.
Paper Annotated: SinGAN-Seg: Synthetic Training Data Generation for Medical I...Devansh16
YouTube video: https://www.youtube.com/watch?v=Ao-19L0sLOI
SinGAN-Seg: Synthetic Training Data Generation for Medical Image Segmentation
Vajira Thambawita, Pegah Salehi, Sajad Amouei Sheshkal, Steven A. Hicks, Hugo L.Hammer, Sravanthi Parasa, Thomas de Lange, Pål Halvorsen, Michael A. Riegler
Processing medical data to find abnormalities is a time-consuming and costly task, requiring tremendous efforts from medical experts. Therefore, Ai has become a popular tool for the automatic processing of medical data, acting as a supportive tool for doctors. AI tools highly depend on data for training the models. However, there are several constraints to access to large amounts of medical data to train machine learning algorithms in the medical domain, e.g., due to privacy concerns and the costly, time-consuming medical data annotation process. To address this, in this paper we present a novel synthetic data generation pipeline called SinGAN-Seg to produce synthetic medical data with the corresponding annotated ground truth masks. We show that these synthetic data generation pipelines can be used as an alternative to bypass privacy concerns and as an alternative way to produce artificial segmentation datasets with corresponding ground truth masks to avoid the tedious medical data annotation process. As a proof of concept, we used an open polyp segmentation dataset. By training UNet++ using both the real polyp segmentation dataset and the corresponding synthetic dataset generated from the SinGAN-Seg pipeline, we show that the synthetic data can achieve a very close performance to the real data when the real segmentation datasets are large enough. In addition, we show that synthetic data generated from the SinGAN-Seg pipeline improving the performance of segmentation algorithms when the training dataset is very small. Since our SinGAN-Seg pipeline is applicable for any medical dataset, this pipeline can be used with any other segmentation datasets.
Subjects: Image and Video Processing (eess.IV); Computer Vision and Pattern Recognition (cs.CV); Machine Learning (cs.LG)
Cite as: arXiv:2107.00471 [eess.IV]
(or arXiv:2107.00471v1 [eess.IV] for this version)
Reach out to me:
Check out my other articles on Medium. : https://machine-learning-made-simple....
My YouTube: https://rb.gy/88iwdd
Reach out to me on LinkedIn: https://www.linkedin.com/in/devansh-d...
My Instagram: https://rb.gy/gmvuy9
My Twitter: https://twitter.com/Machine01776819
My Substack: https://devanshacc.substack.com/
Live conversations at twitch here: https://rb.gy/zlhk9y
Get a free stock on Robinhood: https://join.robinhood.com/fnud75
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Prediction of Default Customer in Banking Sector using Artificial Neural Networkrahulmonikasharma
The aim of this article is to present perdition and risk accuracy analysis of default customer in the banking sector. The neural network is a learning model inspired by biological neuron it is used to estimate and predict that can depend on a large number of inputs. The bank customer dataset from UCI repository, used for data analysis method to extract informative data set from a large volume of the dataset. This dataset is used in the neural network for training data and testing data. In a training of data, the data set is iterated till the desired output. This training data is cross check with test data. This paper focuses on predicting default customer by using deep learning neural network (DNN) algorithm.
When deep learners change their mind learning dynamics for active learningDevansh16
Abstract:
Active learning aims to select samples to be annotated that yield the largest performance improvement for the learning algorithm. Many methods approach this problem by measuring the informativeness of samples and do this based on the certainty of the network predictions for samples. However, it is well-known that neural networks are overly confident about their prediction and are therefore an untrustworthy source to assess sample informativeness. In this paper, we propose a new informativeness-based active learning method. Our measure is derived from the learning dynamics of a neural network. More precisely we track the label assignment of the unlabeled data pool during the training of the algorithm. We capture the learning dynamics with a metric called label-dispersion, which is low when the network consistently assigns the same label to the sample during the training of the network and high when the assigned label changes frequently. We show that label-dispersion is a promising predictor of the uncertainty of the network, and show on two benchmark datasets that an active learning algorithm based on label-dispersion obtains excellent results.
Development and Comparison of Image Fusion Techniques for CT&MRI ImagesIJERA Editor
Image processing techniques primarily focus upon enhancing the quality of an image or a set ofimages to derive
the maximum information from them. Image Fusion is a technique of producing a superior quality image from a
set of available images. It is the process of combining relevant information from two or more images into a
single image wherein the resulting image will be more informative and complete than any of the input images. A
lot of research is being done in this field encompassing areas of Computer Vision, Automatic object detection,
Image processing, parallel and distributed processing, Robotics and remote sensing. This project paves way to
explain the theoretical and implementation issues of seven image fusion algorithms and the experimental results
of the same. The fusion algorithms would be assessed based on the study and development of some image
quality metrics
An Experiment with Sparse Field and Localized Region Based Active Contour Int...CSCJournals
This paper discusses various experiments conducted on different types of Level Sets interactive segmentation techniques using Matlab software, on select images. The objective is to assess the effectiveness on specific natural images, which have complex image composition in terms of intensity, colour mix, indistinct object boundary, low contrast, etc. Besides visual assessment, measures such as Jaccard Index, Dice Coefficient and Hausdorrf Distance have been computed to assess the accuracy of these techniques, between segmented and ground truth images. This paper particularly discusses Sparse Field Matrix and Localized Region Based Active Contours, both based on Level Sets. These techniques were not found to be effective where object boundary is not very distinct and/or has low contrast with background. Also, the techniques were ineffective on such images where foreground object stretches up to the image boundary.
Brain Tumor Detection using Clustering Algorithms in MRI ImagesIRJET Journal
This document presents a novel brain tumor detection system using k-means clustering integrated with fuzzy c-means clustering and artificial neural networks. The system takes advantage of both algorithms for minimal computation time and accuracy. It accurately extracts the tumor region and calculates the tumor area by comparing the results to ground truths of the MRI images. K-means performs initial segmentation, then fuzzy c-means locates the approximate segmented tumor based on membership and cluster selection criteria. Features are extracted and an artificial neural network classifies MRI images as normal or containing a tumor. The system achieves high accuracy, sensitivity and specificity when validated against ground truths.
Geometric Correction for Braille Document Images csandit
Image processing is an important research area in computer vision. clustering is an unsupervised
study. clustering can also be used for image segmentation. there exist so many methods for image
segmentation. image segmentation plays an important role in image analysis.it is one of the first
and the most important tasks in image analysis and computer vision. this proposed system
presents a variation of fuzzy c-means algorithm that provides image clustering. the kernel fuzzy
c-means clustering algorithm (kfcm) is derived from the fuzzy c-means clustering
algorithm(fcm).the kfcm algorithm that provides image clustering and improves accuracy
significantly compared with classical fuzzy c-means algorithm. the new algorithm is called
gaussian kernel based fuzzy c-means clustering algorithm (gkfcm)the major characteristic of
gkfcm is the use of a fuzzy clustering approach ,aiming to guarantee noise insensitiveness and
image detail preservation.. the objective of the work is to cluster the low intensity in homogeneity
area from the noisy images, using the clustering method, segmenting that portion separately using
content level set approach. the purpose of designing this system is to produce better segmentation
results for images corrupted by noise, so that it can be useful in various fields like medical image
analysis, such as tumor detection, study of anatomical structure, and treatment planning.
GAUSSIAN KERNEL BASED FUZZY C-MEANS CLUSTERING ALGORITHM FOR IMAGE SEGMENTATIONcscpconf
Image processing is an important research area in computer vision. clustering is an unsupervised study. clustering can also be used for image segmentation. there exist so many methods for image segmentation. image segmentation plays an important role in image analysis.it is one of the first and the most important tasks in image analysis and computer vision. this proposed system presents a variation of fuzzy c-means algorithm that provides image clustering. the kernel fuzzy
c-means clustering algorithm (kfcm) is derived from the fuzzy c-means clustering algorithm(fcm).the kfcm algorithm that provides image clustering and improves accuracy significantly compared with classical fuzzy c-means algorithm. the new algorithm is called gaussian kernel based fuzzy c-means clustering algorithm (gkfcm)the major characteristic of gkfcm is the use of a fuzzy clustering approach ,aiming to guarantee noise insensitiveness and image detail preservation.. the objective of the work is to cluster the low intensity in homogeneity area from the noisy images, using the clustering method, segmenting that portion separately using content level set approach. the purpose of designing this system is to produce better segmentation results for images corrupted by noise, so that it can be useful in various fields like medical image analysis, such as tumor detection, study of anatomical structure, and treatment planning.
GAUSSIAN KERNEL BASED FUZZY C-MEANS CLUSTERING ALGORITHM FOR IMAGE SEGMENTATIONcsandit
Image processing is an important research area in computer vision. clustering is an unsupervised
study. clustering can also be used for image segmentation. there exist so many methods for image
segmentation. image segmentation plays an important role in image analysis.it is one of the first
and the most important tasks in image analysis and computer vision. this proposed system
presents a variation of fuzzy c-means algorithm that provides image clustering. the kernel fuzzy
c-means clustering algorithm (kfcm) is derived from the fuzzy c-means clustering
algorithm(fcm).the kfcm algorithm that provides image clustering and improves accuracy
significantly compared with classical fuzzy c-means algorithm. the new algorithm is called
gaussian kernel based fuzzy c-means clustering algorithm (gkfcm)the major characteristic of
gkfcm is the use of a fuzzy clustering approach ,aiming to guarantee noise insensitiveness and
image detail preservation.. the objective of the work is to cluster the low intensity in homogeneity
area from the noisy images, using the clustering method, segmenting that portion separately using
content level set approach. the purpose of designing this system is to produce better segmentation
results for images corrupted by noise, so that it can be useful in various fields like medical image
analysis, such as tumor detection, study of anatomical structure, and treatment planning.
Classification of MR medical images Based Rough-Fuzzy KMeansIOSRJM
The document summarizes a proposed algorithm for classifying MR medical images using Rough-Fuzzy K-Means (FRKM). It begins with an introduction to the challenges of medical image classification and a literature review of previous techniques. It then provides background on rough set theory, fuzzy set theory, and K-means clustering. The proposed FRKM algorithm is described as using rough set theory for feature selection and dimensionality reduction, followed by a K-means clustering with probabilities assigned based on rough set approximations to classify ambiguous areas. Experimental results show the FRKM approach achieves 94.4% accuracy, higher than other techniques.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Mammogram image segmentation using rough clusteringeSAT Journals
This document discusses using rough clustering algorithms for mammogram image segmentation. It proposes using Rough K-Means clustering on Haralick texture features extracted from mammogram images. The Rough K-Means algorithm is compared to traditional K-Means and Fuzzy C-Means using metrics like mean square error and root mean square error. Preliminary results found that Rough K-Means produced better segmentation results than the other methods. The document provides background on rough set theory, image segmentation, feature extraction, and different clustering algorithms that can be used.
K-Medoids Clustering Using Partitioning Around Medoids for Performing Face Re...ijscmcj
Face recognition is one of the most unobtrusive biometric techniques that can be used for access control as well as surveillance purposes. Various methods for implementing face recognition have been proposed with varying degrees of performance in different scenarios. The most common issue with effective facial biometric systems is high susceptibility of variations in the face owing to different factors like changes in pose, varying illumination, different expression, presence of outliers, noise etc. This paper explores a novel technique for face recognition by performing classification of the face images using unsupervised learning approach through K-Medoids clustering. Partitioning Around Medoids algorithm (PAM) has been used for performing K-Medoids clustering of the data. The results are suggestive of increased robustness to noise and outliers in comparison to other clustering methods. Therefore the technique can also be used to increase the overall robustness of a face recognition system and thereby increase its invariance and make it a reliably usable biometric modality.
DETECTION OF HUMAN BLADDER CANCER CELLS USING IMAGE PROCESSINGprj_publication
Bladder cancer presents a spectrum of different diatheses. A precise assessment for
individualized treatment depends on the accuracy of the initial diagnosis. In this method the
performance of the level set segmentation is subject to appropriate initialization and optimal
configuration of controlling parameters, which require substantial manual intervention. A
new fuzzy level set algorithm is proposed in this paper to facilitate medical image
segmentation. It is able to directly evolve from the initial segmentation by spatial fuzzy
clustering. The Spatial induced fuzzy c-means using pixel classification and level set
methods are utilizing dynamic variational boundaries for image segmentation. The
controlling parameters of level set evolution are also estimated from the results of clustering.
The fuzzy level set algorithm is enhanced with locally regularized evolution. Such
improvements facilitate level set manipulation and lead to more robust segmentation.
Performance evaluation of the proposed algorithm was carried on medical images
International Journal of Research in Engineering and Science is an open access peer-reviewed international forum for scientists involved in research to publish quality and refereed papers. Papers reporting original research or experimentally proved review work are welcome. Papers for publication are selected through peer review to ensure originality, relevance, and readability.
K-MEDOIDS CLUSTERING USING PARTITIONING AROUND MEDOIDS FOR PERFORMING FACE R...ijscmc
Face recognition is one of the most unobtrusive biometric techniques that can be used for access control as well as surveillance purposes. Various methods for implementing face recognition have been proposed with varying degrees of performance in different scenarios. The most common issue with effective facial biometric systems is high susceptibility of variations in the face owing to different factors like changes in pose, varying illumination, different expression, presence of outliers, noise etc. This paper explores a novel technique for face recognition by performing classification of the face images using unsupervised learning approach through K-Medoids clustering. Partitioning Around Medoids algorithm (PAM) has been used for performing K-Medoids clustering of the data. The results are suggestive of increased robustness to noise and outliers in comparison to other clustering methods. Therefore the technique can also be used to increase the overall robustness of a face recognition system and thereby increase its invariance and make it a reliably usable biometric modality
Performance Analysis of SVM Classifier for Classification of MRI ImageIRJET Journal
This document discusses using support vector machines (SVM) to classify MRI brain images as normal, benign tumor, or malignant tumor. Key steps include preprocessing images using median and Gaussian filters, extracting features using gray level co-occurrence matrix (GLCM) analysis, and training and testing an SVM classifier on the extracted features to classify new MRI images. The methodology first segments regions of interest in the images using k-means clustering, then extracts GLCM texture features from those regions to train and test the SVM for tumor classification.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Abstract Learning Analytics by nature relies on computational information processing activities intended to extract from raw data some interesting aspects that can be used to obtain insights into the behaviors of learners, the design of learning experiences, etc. There is a large variety of computational techniques that can be employed, all with interesting properties, but it is the interpretation of their results that really forms the core of the analytics process. As a rising subject, data mining and business intelligence are playing an increasingly important role in the decision support activity of every walk of life. The Variance Rover System (VRS) mainly focused on the large data sets obtained from online web visiting and categorizing this into clusters according some similarity and the process of predicting customer behavior and selecting actions to influence that behavior to benefit the company, so as to take optimized and beneficial decisions of business expansion. Keywords: Analytics, Business intelligence, Clustering, Data Mining, Standard K-means, Optimized K-means
FUZZY SEGMENTATION OF MRI CEREBRAL TISSUE USING LEVEL SET ALGORITHMAM Publications
The current study investigated a median filter with the fuzzy level set method to propose fuzzy segmentation of magnetic resonance imaging (MRI) cerebral tissue images. An MRI image was used as an input image. A median filter and fuzzy c-means (FCM) clustering were utilized to remove image noise and create image clusters, respectively. The image clusters showed initial and final cluster centers. The level set method was then used for segmentation after separating and extracting white matter from gray matter. Fuzzy c-means was sensitive to the choice of the initial cluster center. Improper center selection caused the method to produce suboptimal solutions. The proposed algorithm was successfully utilized to segment MRI cerebral tissue images. The algorithm efficiently performed segmentation of test MRI cerebral tissue images compared with algorithms proposed in previous studies.
Human brain is the most complex structure where identifying the tumor like diseases are extremely challenging because differentiating the components of a brain is complex. In this paper, pillar k-means algorithm is used for segmentation of brain tumor from magnetic resonance image (MRI).Generally, the brain tumor is detected by radiologist through analysis of MR images which takes longer time. The pillar k-means algorithm’s experimental results clarify the effectiveness of our approach to improve the segmentation quality, accuracy, and computational time. Classify, the tumor from the brain MR images using Bayesian classification.
A Novel Approach to Mathematical Concepts in Data Miningijdmtaiir
-This paper describes three different fundamental
mathematical programming approaches that are relevant to
data mining. They are: Feature Selection, Clustering and
Robust Representation. This paper comprises of two clustering
algorithms such as K-mean algorithm and K-median
algorithms. Clustering is illustrated by the unsupervised
learning of patterns and clusters that may exist in a given
databases and useful tool for Knowledge Discovery in
Database (KDD). The results of k-median algorithm are used
to collecting the blood cancer patient from a medical database.
K-mean clustering is a data mining/machine learning algorithm
used to cluster observations into groups of related observations
without any prior knowledge of those relationships. The kmean algorithm is one of the simplest clustering techniques
and it is commonly used in medical imaging, biometrics and
related fields.
The document proposes a semi-supervised learning method called transfer learning with dual-task consistency (TL-DTC) for 3D left atrium segmentation from MRI scans. The method uses a V-Net backbone with a hybrid dilated convolution module. It is trained in two phases: first pre-training on sub-images, then fine-tuning on full images. Dual-task consistency is enforced between segmentation and signed distance map regression tasks to improve predictions. On the left atrium dataset, TL-DTC outperforms other semi-supervised methods with a Dice score of 90.72% using 20% labeled data.
CLUSTERING ALGORITHM FOR A HEALTHCARE DATASET USING SILHOUETTE SCORE VALUEijcsit
The huge amount of healthcare data, coupled with the need for data analysis tools has made data mining
interesting research areas. Data mining tools and techniques help to discover and understand hidden
patterns in a dataset which may not be possible by mainly visualization of the data. Selecting appropriate
clustering method and optimal number of clusters in healthcare data can be confusing and difficult most
times. Presently, a large number of clustering algorithms are available for clustering healthcare data, but
it is very difficult for people with little knowledge of data mining to choose suitable clustering algorithms.
This paper aims to analyze clustering techniques using healthcare dataset, in order to determine suitable
algorithms which can bring the optimized group clusters. Performances of two clustering algorithms (Kmeans
and DBSCAN) were compared using Silhouette score values. Firstly, we analyzed K-means
algorithm using different number of clusters (K) and different distance metrics. Secondly, we analyzed
DBSCAN algorithm using different minimum number of points required to form a cluster (minPts) and
different distance metrics. The experimental result indicates that both K-means and DBSCAN algorithms
have strong intra-cluster cohesion and inter-cluster separation. Based on the analysis, K-means algorithm
performed better compare to DBSCAN algorithm in terms of clustering accuracy and execution time.
The huge amount of healthcare data, coupled with the need for data analysis tools has made data mining interesting research areas. Data mining tools and techniques help to discover and understand hidden patterns in a dataset which may not be possible by mainly visualization of the data. Selecting appropriate clustering method and optimal number of clusters in healthcare data can be confusing and difficult most times. Presently, a large number of clustering algorithms are available for clustering healthcare data, but it is very difficult for people with little knowledge of data mining to choose suitable clustering algorithms. This paper aims to analyze clustering techniques using healthcare dataset, in order to determine suitable algorithms which can bring the optimized group clusters. Performances of two clustering algorithms (Kmeans and DBSCAN) were compared using Silhouette score values. Firstly, we analyzed K-means algorithm using different number of clusters (K) and different distance metrics. Secondly, we analyzed DBSCAN algorithm using different minimum number of points required to form a cluster (minPts) and different distance metrics. The experimental result indicates that both K-means and DBSCAN algorithms have strong intra-cluster cohesion and inter-cluster separation. Based on the analysis, K-means algorithm performed better compare to DBSCAN algorithm in terms of clustering accuracy and execution time.
Similar to Illustration of Medical Image Segmentation based on Clustering Algorithms (20)
Data Mining is a significant field in today’s data-driven world. Understanding and implementing its concepts can lead to discovery of useful insights. This paper discusses the main concepts of data mining, focusing on two main concepts namely Association Rule Mining and Time Series Analysis
A Review on Real Time Integrated CCTV System Using Face Detection for Vehicle...rahulmonikasharma
We are describes the technique for real time human face detection and counting the number of passengers in vehicle and also gender of the passengers.The Image processing technology is very popular,now at present all are going to use it for various purpose. It can be applied to various applications for detecting and processing the digital images. Face detection is a part of image processing. It is used for finding the face of human in a given area. Face detection is used in many applications such as face recognition, people tracking, or photography. In this paper,The webcam is installed in public vehicle and connected with Raspberry Pi model. We use face detection technique for detecting and counting the number of passengers in public vehicle via webcam with the help of image processing and Raspberry Pi.
Considering Two Sides of One Review Using Stanford NLP Frameworkrahulmonikasharma
Sentiment analysis is a type of natural language processing for tracking the mood of the public about a particular product or a topic and is useful in several ways. Polarity shift is the most classical task which aims at classifying the reviews either positive or negative. But in many cases, in addition to the positive and negative reviews, there still many neutral reviews exist. However, the performance sometimes limited due to the fundamental deficiencies in handling the polarity shift problem. We propose an Improvised Dual Sentiment Analysis (IDSA) model to address this problem for sentiment classification. We first propose a novel data expansion technique by creating sentiment-reversed review for each training and test review. We develop a corpus based method to construct a pseudo-antonym dictionary. It removes DSA’s dependency on an external antonym dictionary for review reversion. We conduct a range of experiments and the results demonstrates the effectiveness of DSA in addressing the polarity shift in sentiment classification. .
A New Detection and Decoding Technique for (2×N_r ) MIMO Communication Systemsrahulmonikasharma
The requirements of fifth generation new radio (5G- NR) access networks are very high capacity and ultra-reliability. In this paper, we proposed a V-BLAST2 × N_r MIMO system that is analyzed, improved, and expected to achieve both very high throughput and ultra- reliability simultaneously.A new detection technique called parallel detection algorithm is proposed. The performance of the proposed algorithm compared with existing linear detection algorithms. It was seen that the proposed technique increases the speed of signal transmission and prevents error propagation which may be present in serial decoding techniques. The new algorithm reduces the bit error probability and increases the capacity simultaneouslywithout using a standard STC technique. However, it was seen that the BER of systems using the proposed algorithm is slightly higher than a similar system using only STC technique. Simulation results show the advantages of using the proposed technique.
Broadcasting Scenario under Different Protocols in MANET: A Surveyrahulmonikasharma
A wireless network enables people to communicate and access applications and information without wires. This provides freedom of movement and the ability to extend applications to different parts of a building, city, or nearly anywhere in the world. Wireless networks allow people to interact with e-mail or browse the Internet from a location that they prefer. Adhoc Networks are self-organizing wireless networks, absent any fixed infrastructure. broadcasting of data through proper channel is essential. Various protocols are designed to avoid the loss of data. In this paper an overview of different broadcast protocols are discussed.
Sybil Attack Analysis and Detection Techniques in MANETrahulmonikasharma
Security is important for many sensor network applications. A particularly harmful attack against sensor and ad hoc networks is known as the Sybil attack [6], where a node Illegitimately claims multiple identities.Mobility cause a main problem when we talk about security in Mobile Ad-hoc networks. It doesn’t depend on fixed architecture, the nodes are continuously moving in a random fashion. In this article we will focus on identifying the Sybil attack in MANET. It uses air medium for communication so it is more prone to the attack. Sybil attack is one in which single node present multiple fake identities to other nodes, which cause destruction.
A Landmark Based Shortest Path Detection by Using A* and Haversine Formularahulmonikasharma
In 1900, less than 20 percent of the world populace lived in cities, in 2007, fair more than 50 percent of the world populace lived in cities. In 2050, it has been anticipated that more than 70 percent of the worldwide population (about 6.4 billion individuals) will be city tenants. There's more weight being set on cities through this increment in population [1]. With approach of keen cities, data and communication technology is progressively transforming the way city regions and city inhabitants organize and work in reaction to urban development. In this paper, we create a nonspecific plot for navigating a route throughout city A asked route is given by utilizing combination of A* Algorithm and Haversine equation. Haversine Equation gives least distance between any two focuses on spherical body by utilizing latitude and longitude. This least distance is at that point given to A* calculation to calculate minimum distance. The method for identifying the shortest path is specify in this paper.
Processing Over Encrypted Query Data In Internet of Things (IoTs) : CryptDBs,...rahulmonikasharma
This document discusses techniques for processing queries over encrypted data in Internet of Things (IoT) systems. It describes CryptDB and MONOMI, which are database systems that can execute SQL queries over encrypted data. CryptDB uses a database proxy to encrypt/decrypt data and rewrite queries to execute on encrypted data. MONOMI builds on CryptDB and introduces a split client/server approach to query execution to improve efficiency of analytical queries over encrypted data. The document also outlines various encryption schemes that can be used for encrypted query processing, including deterministic encryption, order-preserving encryption, homomorphic encryption, and others.
Quality Determination and Grading of Tomatoes using Raspberry Pirahulmonikasharma
This document describes a system for determining the quality and grading tomatoes using image processing techniques on a Raspberry Pi. The system uses a USB camera to capture images of tomatoes and then performs preprocessing, masking, contour detection, image enhancement and color detection algorithms to analyze features like shape, size, color and texture. It can grade tomatoes into four categories: red, orange, green, and turning green. The system was able to accurately determine tomato quality and estimate expiry dates with 90% accuracy and had low computational time of 0.52 seconds compared to other machine learning methods.
Comparative of Delay Tolerant Network Routings and Scheduling using Max-Weigh...rahulmonikasharma
Network management and Routing is supportively done by performing with the nodes, due to infrastructure-less nature of the network in Ad hoc networks or MANET. The nodes are maintained itself from the functioning of the network, for that reason the MANET security challenges several defects. Routing process and Scheduling is a significant idea to enhance the security in MANET. Other than, scheduling has been recognized to be a key issue for implementing throughput/capacity optimization in Ad hoc networks. Designed underneath conventional (LT) light tailed assumptions, traffic fundamentally faces Heavy-tailed (HT) assumption of the validity of scheduling algorithms. Scheduling policies are utilized for communication networks such as Max-Weight, backpressure and ACO, which are provably throughput optimality and the Pareto frontier of the feasible throughput region under maximal throughput vector. In wireless ad-hoc network, the issue of routing and optimal scheduling performs with time varying channel reliability and multiple traffic streams. Depending upon the security issues within MANETs in this paper presents a comparative analysis of existing scheduling policies based on their performance to progress the delay performance in most scenarios. The security issues of MANETs considered from this paper presents a relative analysis of existing scheduling policies depend on their performance to progress the delay performance in most developments.
DC Conductivity Study of Cadmium Sulfide Nanoparticlesrahulmonikasharma
The dc conductivity of consolidated nanoparticle of CdS has been studied over the temperature range from 303 K to 523 K and the conductivity has been found to be much larger than that of single crystals.
A Survey on Peak to Average Power Ratio Reduction Methods for LTE-OFDMrahulmonikasharma
OFDM (Orthogonal Frequency Division Multiplexing) is generally preferred for high data rate transmission in digital communication. The Long-Term Evolution (LTE) standards for the fourth generation (4G) wireless communication systems. Orthogonal Frequency Division Multiple Access (OFDMA) and Single Carrier Frequency Division Multiple Access (SC-FDMA) are the two multiple access techniques which are generally used in LTE.OFDM system has a major shortcoming of high peak to average power ratio (PAPR) value. This paper explains different PAPR reduction techniques and presents a comparison of the various techniques based on theoretical results. It also presents a survey of the various PAPR reduction techniques and the state of the art in this area.
IOT Based Home Appliance Control System, Location Tracking and Energy Monitoringrahulmonikasharma
Home automation has been a dream of sciences for so many years. It could wind up conceivable in twentieth century simply after power all family units and web administrations were begun being utilized on across the board level. The point of home robotization is to give enhanced accommodation, comfort, vitality effectiveness and security. Vitality checking and protection holds prime significance in this day and age in view of the irregularity between control age and request observing frameworks accessible in the market. Ordinarily, customers are disappointed with the power charge as it doesn't demonstrate the power devoured at the gadget level. This paper shows the outline and execution of a vitality meter utilizing Arduino microcontroller which can be utilized to gauge the power devoured by any individual electrical apparatus. The primary expectation of the proposed vitality meter is to screen the power utilization at the gadget level, transfer it to the server and build up remote control of any apparatus. So we can screen the power utilization remotely and close down gadgets if vital. The car segment is additionally one of the application spaces where vehicle can be made keen by utilizing "IOT". So a vehicle following framework is additionally executed to screen development of vehicles remotely.
Thermal Radiation and Viscous Dissipation Effects on an Oscillatory Heat and ...rahulmonikasharma
An anticipated outcome that is intended chapter is to investigate effects of magnetic field on an oscillatory flow of a viscoelastic fluid with thermal radiation, viscous dissipation with Ohmic heating which bounded by a vertical plane surface, have been studied. Analytical solutions for the quasi – linear hyperbolic partial differential equations are obtained by perturbation technique. Solutions for velocity and temperature distributions are discussed for various values of physical parameters involving in the problem. The effects of cooling and heating of a viscoelastic fluid compared to the Newtonian fluid have been discussed.
Advance Approach towards Key Feature Extraction Using Designed Filters on Dif...rahulmonikasharma
In fast growing database repository system, image as data is one of the important concern despite text or numeric. Still we can’t replace test on any cost but for advancement, information may be managed with images. Therefore image processing is a wide area for the researcher. Many stages of processing of image provide researchers with new ideas to keep information safe with better way. Feature extraction, segmentation, recognition are the key areas of the image processing which helps to enhance the quality of working with images. Paper presents the comparison between image formats like .jpg, .png, .bmp, .gif. This paper is focused on the feature extraction and segmentation stages with background removal process. There are two filters, one is integer filter and second one is floating point Filter, which is used for the key feature extraction from image. These filters applied on the different images of different formats and visually compare the results.
Alamouti-STBC based Channel Estimation Technique over MIMO OFDM Systemrahulmonikasharma
This document summarizes research on using Alamouti space-time block coding (STBC) for channel estimation in MIMO-OFDM wireless communication systems. The proposed system uses 16-PSK modulation with up to 4 transmit and 32 receive antennas. Simulation results show that the proposed approach reduces bit error rate and mean square error at higher signal-to-noise ratios, compared to existing MISO systems. Alamouti-STBC channel estimation improves performance for MIMO-OFDM by achieving full diversity gain from multiple transmit antennas.
Empirical Mode Decomposition Based Signal Analysis of Gear Fault Diagnosisrahulmonikasharma
A vibration investigation is about the specialty of searching for changes in the vibration example, and after that relating those progressions back to the machines mechanical outline. The level of vibration and the example of the vibration reveal to us something about the interior state of the turning segment. The vibration example can let us know whether the machine is out of adjust or twisted. Al-so blames with the moving components and coupling issues can be distinguished. This paper shows an approach for equip blame investigation utilizing signal handling plans. The information has been taken from college of ohio, joined states. The investigation has done utilizing MATLAB software.
1) The document discusses using the ARIMA technique for short term load forecasting of electricity demand in West Bengal, India.
2) It analyzed historical hourly load data from 2017 to build an ARIMA model and forecast demand for July 31, 2017, achieving a Mean Absolute Percentage Error of 2.1778%.
3) ARIMA is identified as an appropriate univariate time series method for short term load forecasting that provides more accurate results than other techniques.
Impact of Coupling Coefficient on Coupled Line Couplerrahulmonikasharma
The coupled line coupler is a type of directional coupler which finds practical utility. It is mainly used for sampling the microwave power. In this paper, 3 couplers A,B & C are designed with different values of coupling coefficient 6dB,10dB & 18dB respectively at a frequency of 2.5GHz using ADS tool. The return loss, isolation loss & transmission loss are determined. The design & simulation is done using microstrip line technology.
Design Evaluation and Temperature Rise Test of Flameproof Induction Motorrahulmonikasharma
The ignition of flammable gases, vapours or dust in presence of oxygen contained in the surrounding atmosphere may lead to explosion. Flameproof three phase induction motors are the most common and frequently used in the process industries such as oil refineries, oil rigs, petrochemicals, fertilizers, etc. The design of flameproof motor is such that it allows and sustain explosion within the enclosure caused by ignition of hazardous gases without transmitting it to the external flammable atmosphere. The enclosure is mechanically strong enough to withstand the explosion pressure developed inside it. To prevent an explosion due to hot spot on the surface of the motor, flameproof induction motors are subjected to heat run test to determine the maximum surface temperature and temperature class with respect to the ignition temperature of the surrounding flammable gas atmosphere. This paper highlights the design features of flameproof motors and their surface temperature classification for different sizes.
Harnessing WebAssembly for Real-time Stateless Streaming PipelinesChristina Lin
Traditionally, dealing with real-time data pipelines has involved significant overhead, even for straightforward tasks like data transformation or masking. However, in this talk, we’ll venture into the dynamic realm of WebAssembly (WASM) and discover how it can revolutionize the creation of stateless streaming pipelines within a Kafka (Redpanda) broker. These pipelines are adept at managing low-latency, high-data-volume scenarios.
DEEP LEARNING FOR SMART GRID INTRUSION DETECTION: A HYBRID CNN-LSTM-BASED MODELgerogepatton
As digital technology becomes more deeply embedded in power systems, protecting the communication
networks of Smart Grids (SG) has emerged as a critical concern. Distributed Network Protocol 3 (DNP3)
represents a multi-tiered application layer protocol extensively utilized in Supervisory Control and Data
Acquisition (SCADA)-based smart grids to facilitate real-time data gathering and control functionalities.
Robust Intrusion Detection Systems (IDS) are necessary for early threat detection and mitigation because
of the interconnection of these networks, which makes them vulnerable to a variety of cyberattacks. To
solve this issue, this paper develops a hybrid Deep Learning (DL) model specifically designed for intrusion
detection in smart grids. The proposed approach is a combination of the Convolutional Neural Network
(CNN) and the Long-Short-Term Memory algorithms (LSTM). We employed a recent intrusion detection
dataset (DNP3), which focuses on unauthorized commands and Denial of Service (DoS) cyberattacks, to
train and test our model. The results of our experiments show that our CNN-LSTM method is much better
at finding smart grid intrusions than other deep learning algorithms used for classification. In addition,
our proposed approach improves accuracy, precision, recall, and F1 score, achieving a high detection
accuracy rate of 99.50%.
Embedded machine learning-based road conditions and driving behavior monitoringIJECEIAES
Car accident rates have increased in recent years, resulting in losses in human lives, properties, and other financial costs. An embedded machine learning-based system is developed to address this critical issue. The system can monitor road conditions, detect driving patterns, and identify aggressive driving behaviors. The system is based on neural networks trained on a comprehensive dataset of driving events, driving styles, and road conditions. The system effectively detects potential risks and helps mitigate the frequency and impact of accidents. The primary goal is to ensure the safety of drivers and vehicles. Collecting data involved gathering information on three key road events: normal street and normal drive, speed bumps, circular yellow speed bumps, and three aggressive driving actions: sudden start, sudden stop, and sudden entry. The gathered data is processed and analyzed using a machine learning system designed for limited power and memory devices. The developed system resulted in 91.9% accuracy, 93.6% precision, and 92% recall. The achieved inference time on an Arduino Nano 33 BLE Sense with a 32-bit CPU running at 64 MHz is 34 ms and requires 2.6 kB peak RAM and 139.9 kB program flash memory, making it suitable for resource-constrained embedded systems.
CHINA’S GEO-ECONOMIC OUTREACH IN CENTRAL ASIAN COUNTRIES AND FUTURE PROSPECTjpsjournal1
The rivalry between prominent international actors for dominance over Central Asia's hydrocarbon
reserves and the ancient silk trade route, along with China's diplomatic endeavours in the area, has been
referred to as the "New Great Game." This research centres on the power struggle, considering
geopolitical, geostrategic, and geoeconomic variables. Topics including trade, political hegemony, oil
politics, and conventional and nontraditional security are all explored and explained by the researcher.
Using Mackinder's Heartland, Spykman Rimland, and Hegemonic Stability theories, examines China's role
in Central Asia. This study adheres to the empirical epistemological method and has taken care of
objectivity. This study analyze primary and secondary research documents critically to elaborate role of
china’s geo economic outreach in central Asian countries and its future prospect. China is thriving in trade,
pipeline politics, and winning states, according to this study, thanks to important instruments like the
Shanghai Cooperation Organisation and the Belt and Road Economic Initiative. According to this study,
China is seeing significant success in commerce, pipeline politics, and gaining influence on other
governments. This success may be attributed to the effective utilisation of key tools such as the Shanghai
Cooperation Organisation and the Belt and Road Economic Initiative.
Presentation of IEEE Slovenia CIS (Computational Intelligence Society) Chapte...University of Maribor
Slides from talk presenting:
Aleš Zamuda: Presentation of IEEE Slovenia CIS (Computational Intelligence Society) Chapter and Networking.
Presentation at IcETRAN 2024 session:
"Inter-Society Networking Panel GRSS/MTT-S/CIS
Panel Session: Promoting Connection and Cooperation"
IEEE Slovenia GRSS
IEEE Serbia and Montenegro MTT-S
IEEE Slovenia CIS
11TH INTERNATIONAL CONFERENCE ON ELECTRICAL, ELECTRONIC AND COMPUTING ENGINEERING
3-6 June 2024, Niš, Serbia
Understanding Inductive Bias in Machine LearningSUTEJAS
This presentation explores the concept of inductive bias in machine learning. It explains how algorithms come with built-in assumptions and preferences that guide the learning process. You'll learn about the different types of inductive bias and how they can impact the performance and generalizability of machine learning models.
The presentation also covers the positive and negative aspects of inductive bias, along with strategies for mitigating potential drawbacks. We'll explore examples of how bias manifests in algorithms like neural networks and decision trees.
By understanding inductive bias, you can gain valuable insights into how machine learning models work and make informed decisions when building and deploying them.
Low power architecture of logic gates using adiabatic techniquesnooriasukmaningtyas
The growing significance of portable systems to limit power consumption in ultra-large-scale-integration chips of very high density, has recently led to rapid and inventive progresses in low-power design. The most effective technique is adiabatic logic circuit design in energy-efficient hardware. This paper presents two adiabatic approaches for the design of low power circuits, modified positive feedback adiabatic logic (modified PFAL) and the other is direct current diode based positive feedback adiabatic logic (DC-DB PFAL). Logic gates are the preliminary components in any digital circuit design. By improving the performance of basic gates, one can improvise the whole system performance. In this paper proposed circuit design of the low power architecture of OR/NOR, AND/NAND, and XOR/XNOR gates are presented using the said approaches and their results are analyzed for powerdissipation, delay, power-delay-product and rise time and compared with the other adiabatic techniques along with the conventional complementary metal oxide semiconductor (CMOS) designs reported in the literature. It has been found that the designs with DC-DB PFAL technique outperform with the percentage improvement of 65% for NOR gate and 7% for NAND gate and 34% for XNOR gate over the modified PFAL techniques at 10 MHz respectively.
Low power architecture of logic gates using adiabatic techniques
Illustration of Medical Image Segmentation based on Clustering Algorithms
1. International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 8 122 – 127
_______________________________________________________________________________________________
122
IJRITCC | August 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
Illustration of Medical Image Segmentation based on Clustering Algorithms
Harsmeet Singh
Department of Computer Science
CGC-College of Engineering
Mohali, Punjab
er.harsmeet@gmail.com
Jagbir Singh Gill
Department of Computer Science
CGC-College of Engineering
Mohali, Punjab
Abstract- Image segmentation is the most basic and crucial process remembering the true objective to facilitate the characterization and
representation of the structure of excitement for medical or basic images. Despite escalated research, segmentation remains a challenging issue
because of the differing image content, cluttered objects, occlusion, non-uniform object surface, and different factors. There are numerous
calculations and techniques accessible for image segmentation yet at the same time there requirements to build up an efficient, quick technique
of medical image segmentation. This paper has focused on K-means and Fuzzy C means clustering algorithm to segment malaria blood samples
in more accurate manner.
Keywords: Image segmentation; K-means algorithms; fuzzy C-means algorithms.
__________________________________________________*****_________________________________________________
I. INTRODUCTION
Image processing is a technique to play out a few operations on
an image, so as to get an enhanced image or to extract some
valuable data from it. It is a kind of flag processing in which
information is an image and yield might be image or
characteristics/highlights associated with that image. Medical
imaging is the representation of body parts, tissues, or organs,
for use in clinical conclusion, treatment and ailment observing.
Imaging techniques encompass the fields of radiology, nuclear
medicine and optical imaging and image-guided mediation,
examples Radiology, Nuclear Medicine, Optical Imaging.
Image segmentation alludes to the process of apportioning a
digital image into numerous regions. The objective of
segmentation is to change the portrayal of an image to be more
meaningful and less demanding to break down. It is utilized as
a part of a request to locate objects and limits in images. The
aftereffect of image segmentation occurs as an arrangement of
regions that collectively cover the whole image [1]. In this
manner, medical image segmentation assumes a significant part
in clinical diagnosis. It can be considered as a difficult issue
because medical images commonly have poor contrasts,
diverse sorts of noise, and absent or diffusive boundaries [2].
Many approaches have been proposed for image
segmentation like boundary based, edge based, cluster based,
and neural framework based. From the different technique, a
champion among the most efficient procedures is the clustering
methodology. Again there are distinctive sorts of clustering: K-
means clustering, Fuzzy C-means clustering, mountain
clustering methodology and subtractive clustering procedure.
The clustering process discovers meaningful and
regular clusters in the datasets. The real obstacle in clustering is
that no earlier learning about the given dataset is accessible.
There are numerous information clustering calculations
accessible in the writing to perform clustering. Among them
most broadly utilized categories of the clustering are partitional
and hierarchical calculations. The most prevalent class of
partitional clustering is FCM clustering calculation.
In any case, FCM calculation relies on upon the underlying
seed indicates and converges local optima. FCM clustering
calculation is connected to a wide assortment of geostatistical
information examination issues [2]. Cannon recommended an
efficient execution of FCM clustering calculation. To enhance
and tackle the shortcoming of the FCM calculation, a brought
together a structure for performing thickness weighted FCM
clustering is created. A comparative examination of FCM
calculation is performed regarding the nature of clusters and
their computational time. They indicate that the significant
drawback of FCM calculation is that it generally converges to a
local least or a set point [3]. Hence, the researchers have
demonstrated their enthusiasm for advancement calculations to
overcome the difficulties in FCM clustering technique and to
enhance the nature of clusters.
K-means is one of the least difficult unsupervised
learning calculations that take care of the outstanding clustering
issue. The procedure takes a straightforward and simple
approach to classifying a given informational index through a
certain number of clusters (accept k clusters) settled from the
earlier [4]. The principle thought is to characterize k centroids,
one for each cluster. These centroids should be placed cleverly
because of various location causes the distinctive outcome.
Along these lines, the better choice is to place them however
much as could reasonably be expected far from each other. The
subsequent stage is to take each direct having a place toward a
given informational collection and associate it to the closest
centroids [5].
These days image segmentation becomes one of the
vital instrument in medical territory where it is utilized to
extract or area of enthusiasm from the background. So medical
2. International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 8 122 – 127
_______________________________________________________________________________________________
123
IJRITCC | August 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
images are sectioned utilizing diverse technique and process
yields are utilized for the further examination in medical. Be
that as it may, medical images in their crude frame are spoken
to by the varieties of numbers in the computer, with the number
indicating the estimations of important physical amounts that
show the contrast between various sorts of body parts.
Processing and investigation of medical images are valuable in
changing crude images into a quantifiable symbolic frame, in
extracting meaningful subjective data to help to find and in
coordinating complementary information from various imaging
modalities [6].
A. Related work:
Some of the existing recent works are discussed here.
Dhanachandra[7] et al. had proposed an image segmentation
utilizing K-means Clustering Algorithm and Subtractive
Clustering Algorithm, and the median filter is connected to
evacuate undesirable areas and then RMSE and PSNR are
checked and watched that they have small and large value
respective, which are the condition for good image
segmentation quality. Furthermore, comparison for RMSE and
PSNR are done for proposed method and classical K-mean
algorithms manditis found the proposed strategy has better
performance result later on.
Sandeep [8] et al. had implemented Fuzzy C means and Mean
Shift based segmentation in MATLAB with the help of image
processing tool box. Comparative analysis and results has
shown that the Fuzzy C means provides more accurate results
than Mean Shift algorithm because it contains highest values
for PSNR parameter and almost contains lowest values for
MSE parameter.
Cebeci [9] et al. Compared a K-means (KM) and the Fuzzy C-
means (FCM) algorithms for their computing performance and
clustering accuracy on different shaped cluster structures which
are regularly and irregularly scattered in two dimensional
space. While the accuracy of the KM with single pass was
lower than those of the FCM, the KM with multiple starts
showed nearly the same clustering accuracy with the FCM.
Moreover the KM with multiple starts was extremely superior
to the FCM in computing time in all datasets analyzed.
Maksoud [10] et al. presents an efficient image segmentation
approach utilizing K-means clustering technique integrated
with Fuzzy C-means algorithm. It is followed by thresholding
and level set segmentation stages to provide accurate brain
tumor detection. The proposed technique can get benefits of the
K-means clustering for image segmentation in the aspects of
insignificant computation time. In addition, it can get favorable
circumstances of the Fuzzy C-means in the aspects of accuracy.
The performance of the proposed image segmentation approach
was assessed by comparing it with some state of the art
segmentation algorithms in case of accuracy, processing time,
and performance.
Patil [11] et al. presented a detailed study and comparison of
different clustering based image segmentation algorithms. The
traditional clustering algorithms are the hard clustering
algorithm and the soft clustering algorithm and compared the
hard k-means algorithm with the soft fuzzy c- means (FCM)
algorithm. To overcome the limitations of conventional FCM
we have also studied Kernel fuzzy c- means (KFCM) algorithm
in detail. The K-means algorithm is sensitive to noise and
outliers so, an extension of K-means called as Fuzzy c- means
(FCM) are introduced.
II. K-MEANS CLUSTERING:
K-means clustering algorithm given by Macqueen is one of the
simplest unsupervised learning algorithm that solve the well
known clustering problem.
The procedure follows a simple and easy way to
classify a given data set through a certain number of clusters
(assume k clusters) fixed a prior.
The idea is to define k centroids, one for each cluster. These
centroids should be placed in a cunning way because of
different locations causes different results. So, the better choice
is to place them as much as possible for away from each other.
The next step is to take each point belonging to a
given data set and associate it to the nearest centroids. When no
point is pending, the first step is completed and an early group
age is done. At this point need to recalculate k new centroids as
bary centers of the cluster resulting from the previous steps.
After have these k new centroids, a new binding has to
be done between the same data set points and the nearest new
centroids. A loop has been generated. As a result of this loop.
K-centroids change locations step by step until no more
changes are done.
Algorithm:
Step1: Input k, set of points x1 … xn
(„k‟ as a input, „k‟ means need to tell it how many cluster you
find?)
Step2: Place centroids c1 … ck at random locations in a space.
Step3: Repeat until convergence:
For each point Xi:
Find nearest centroid Cj :
(Distance (Euclidean) between Individuals Xi and cluster Cj .)
Assign the point Xi to cluster j.
(For each cluster j = 1 ….. k)
New centroids Cj = mean of all points Xi assigned to
cluster j in previous step:
Cj a =
1
njxj−ncj
Xi a ; for a = 1. . d, . . (1)
Step4: Stop when none of the cluster assignments change.
3. International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 8 122 – 127
_______________________________________________________________________________________________
124
IJRITCC | August 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
III. FUZZY C-MEANS ALGORITHM:
The most well known fuzzy clustering algorithm is FCM, a
modification by „Bendex‟ of an original CRISP clustering
methodology.
„Bendex‟ introduced the idea of a fuzzification
parameters (M) in the range [1, N], which determines the
degree of fuzziness in the clusters. When M=1 the effect is a
crisp clustering of points. When M>1 is the degree of fuzziness
among points in the decision space increases.
Algorithm:
Step1: Randomly initializing the cluster center.
Step2: Creating distance matrix from a point Xi to each of the
cluster centers to with taking the Euclidean distance between
the point and the cluster center.
dj1 = (Xj − Cj)2 … . (2)
Step3: Creating membership matrix takes the fractional
distance from the point to the cluster center and makes this a
fuzzy measurement by raising the fraction to the inverse
fuzzification parameter. This is divided by the sum of all
fractional distances, thereby ensuring that the sum of all
memberships is 1.
μj X1 =
1
d1
1
m − 1
(
1
dj1
)
1
m−1P
K−1
… (3)
Step4: Creating membership matrix FCM imposes a direct
constraint of the fuzzy membership function associated with
each point, as follows. The total membership for a point in
sample or decision space must add to 1.
μj
P
J=1
Xi = 1 … (4)
Step5: Generating new centroid for each cluster.
Cj = [μj
1
X1 ]m
×
1
[μj(X1)]m
1
… (5)
Step6: Generating new centroid for each cluster with iteration
all this step optimize cluster centers will generate.
Step7: Weight acceleration cluster assignments.
IV. RESULTS AND DISCUSSIONS:
In a Result Section Firstly takes a infected blood samples
like malaria blood samples for the analysis and for estimate the
number of infections in blood using hybrid segmentation.
These samples datasets contains the blood samples have been
taken from the CDC (center of disease control and prevent)-
DPDx (Laboratory Identification of Parasitic Diseases of Public
Health Concern) database were sample from 20 different
patients are collected. The database contains around 500 blood
samples images.
Table1: Segmented images using K-means algorithms.
Sample Original image All clusters first cluster Second cluster Third cluster
1st
2nd
3rd
4. International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 8 122 – 127
_______________________________________________________________________________________________
125
IJRITCC | August 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
Both the clustering algorithms using with edge detection
technique shows very effective results when individually
applied on database images. From the results it can be seen
Fuzzy C-means algorithm matches greater numbers of clusters
as compared to K-means algorithm.
Table2: Segmentation using Fuzzy C-means algorithm
Samples Iteration Original Image Final Segmented Image
(FCM)
First blood
sample
7
Second
blood sample
9
Third blood
sample
5
A. Performance Parameters:
The quality of the segmented image is analyzed using the
measurement value of Mean Square Error, Root Mean Square
Error and Peak to Signal Noise Ratio.
1.Mean square error (MSE):
The MSE is a measure of the nature of an estimator or a
predictor (i.e., a function mapping subjective contributions to a
specimen of estimations of some arbitrary variable). it is
dependably non-negative, and qualities closer to zero is better.
For an image of size M x N the mean square error (MSE) is
defined as:
MSE =
1
MN
M−1
i=o
[x(i, j)
N−1
j=o
− y i, j ]2
(6)
where x( i, j ) is noise-free grayscale image and y( i, j ) is a
noisy approximation of x( i, j ).
2. Peak to Signal Noise Ratio (PSNR):
The peak to signal noise ratio is the proportion between most
extreme feasible forces and the corrupting noise that influence
resemblance of the image. It is utilized to measure the quality
of the output image.
PSNR = 10. log10
MAX I
2
MSE
= 20log10
MAX I
MSE
(7)
Here, MAXI is the maximum possible pixel value of the image.
When samples are represented using linear PCM with B bits
per sample, MAXI is 2B
− 1.
Table 3: PSNR values of K-means compared with the FCM.
Samples
K-means clustering algorithm Fuzzy C-means algorithm
PSNR PSNR
First blood Sample 34.99 34.74
Second Blood Sample 35.63 35.47
Third Blood Sample 34.86 34.61
The table3 displays the outcomes of evaluation of K-means and
Fuzzy C means based segmentation methods on the centre of
Peak Signal to Noise Resolution. The PSNR calculates the peak
signal to noise ratio, in decibels, among binary images. This
proportion is repeatedly castoff as a superiority capacity among
the original and a resultant image. The higher the PSNR, the
better is the quality of the output image.
5. International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 8 122 – 127
_______________________________________________________________________________________________
126
IJRITCC | August 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
Figure1: Outcomes of evaluation of K-M & FCM based on PSNR.
Table 4: represents the accuracy of FCM and K-Means clustering.
Algorithm Accuracy
FCM 86%
K-Means 78.26%
Figure2: accuracy of FCM and K-Means
V. CONCLUSION:
Fuzzy C-means is slower than K-means in efficiency and
lesser PSNR but gives better results in case where data is
incomplete or uncertain and has a wider applicability.
However the time taken by K-Means algorithm is less as
compared to fuzzy C-Means algorithm but after testing on
two different datasets which included 400 blood samples
images, Fuzzy C-Means clustering shows 86% accuracy and
K-means shows 78.26%. As a final conclusion, there is no
any algorithm which is the best for all cases. An important
factor in choosing an appropriate clustering algorithm is the
shape of clusters in datasets to be analyzed. Thus, the
datasets should be carefully examined for shapes and scatter
of clusters in order to decide for a suitable algorithm. To
achieve this, 2D and/or 3D scatter plots of datasets provide
good idea to understand the structure of clusters in datasets.
When multi-featured objects are analyzed, in order to
overcome to plot for multidimensional space, a dimension
reduction technique such as multidimensional scaling (MDS)
or principal components analysis (PCA) can be applied to
reduce dimensions of datasets. Moreover, by using a suitable
sampling method this process can be completed in shorter
execution times.
In future, medical image segmentation can perform more
accurate segmentation results by using both the clustering
techniques such as K-means & FCM or by using other
classification measures. Combination of different
Morphological operations can also be used to gain better
Final segmented image.
REFERENCES:
[1] R. Kaur, N. K. Mavi, and R. Singh, “Comparison of
Clustering Techniques for the Detection of
Microcalcifications in Mammograms,”International Journal of
Advanced Research in Computer Science and Software
Engineering, vol. 6, no. 8, pp. 99–104, 2016.
[2] A. Al Malki et al., “Hybrid Genetic Algorithm with K-Means
for Clustering Problems,” Open J. Optim., vol. 5, no. 02, p.
71, 2016.
[3] E. Abdel-maksoud, M. Elmogy, and R. Al-awadi, “Brain
tumor segmentation based on a hybrid clustering technique,”
Egypt. Informatics J., vol. 16, no. 1, pp. 71–81, 2015.
[4] S. Kaur and S. Chawla, “PERFORMANCE EVALUATION
OF IMPROVED IMAGE SEGMENTATION USING
FUZZY BASED MODIFIED MEAN SHIFT AND MST,”
International Journal of Emerging Trends & Technology in
Computer Science, vol. 4, no. 4, 2015.
[5] S. A. Christe, K. Malathy, and A. Kandaswamy,
“IMPROVED HYBRID SEGMENTATION OF BRAIN MRI
34.74
35.47
34.61
34
34.5
35
35.5
36
PSNR PSNR PSNR
K-Means
Fuzzy C-Means
FCM K-MEANS
Accuracy 86% 78.26%
70%
75%
80%
85%
90%
Accuracy
6. International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 8 122 – 127
_______________________________________________________________________________________________
127
IJRITCC | August 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
TISSUE AND TUMOR USING STATISTICAL
FEATURES,” vol. 9102, no. 2, 2010.
[6] H. Singh and J. S. Gill, “Enhancement Methods and
Techniques for Brain MR Imaging,” vol. 5, no. 2, pp. 38–44,
2017.
[7] N. Dhanachandra, K. Manglem, and Y. J. Chanu, “Image
Segmentation using K-means Clustering Algorithm and
Subtractive Clustering Algorithm,” Procedia - Procedia
Comput. Sci., vol. 54, pp. 764–771, 2015.
[8] S. Kaur, “Evaluation of Performance of Fuzzy C Means and
Mean Shift based Segmentation for Multi-Spectral Images,”
International Journal of Computer Applications, vol. 120, no.
16, pp. 25–28, 2015.
[9] Z. Cebeci and F. Yildiz, “Comparison of K-Means and Fuzzy
C-Means Algorithms on Different Cluster Structures,”Journal
of AI, vol. 6, no. 3, pp. 13–23, 2015.
[10] E. Abdel-maksoud, M. Elmogy, and R. Al-awadi, “Brain
tumor segmentation based on a hybrid clustering technique,”
Egypt. Informatics J., vol. 16, no. 1, pp. 71–81, 2015.
[11] A. J. Patil, C. S. Patil, R. R. Karhe, and M. A. Aher,
“Comparative Study of Different Clustering Algorithms,”
International Journal of Advanced Research in Electrical,
Electronics and Instrumentation Engineering, Vol. 3, Issue 7,
July 2014.
[12] R. D. Pai, P. S. Halvi, and P. B. Hiremath, “Medical Color
Image Enhancement using Wavelet Transform and Contrast
Stretching Technique,” Int. J. Sci. Res. Publ., vol. 5, no. 7, pp.
1–7, 2015.
[13] J. Agarwal and S. S. Bedi, “Implementation of hybrid image
fusion technique for feature enhancement in medical
diagnosis,” Springer Hum. Centric Comput. Inf. Sci., vol. 5,
no. 1, pp. 1–17, 2015.
[14] D. M. F. Al-Samaraie, “Medical Colored Image Enhancement
Using Wavelet Transform Followed By Image Sharpening,”
Ubiquitous Comput. Commun. J., vol. 6, no. 5, pp. 1–8, 2014.