scholarly journals Classification of Hyperspectral In Vivo Brain Tissue Based on Linear Unmixing

2020 ◽  
Vol 10 (16) ◽  
pp. 5686
Author(s):  
Ines A. Cruz-Guerrero ◽  
Raquel Leon ◽  
Daniel U. Campos-Delgado ◽  
Samuel Ortega ◽  
Himar Fabelo ◽  
...  
Keyword(s):  
Brain Tissue ◽  
Classification Performance ◽  
Training Dataset ◽  
Support Vector ◽  
Svm Classifier ◽  
Tissue Classification ◽  
Processing Times ◽  
Main Challenge ◽  
Linear Unmixing

Hyperspectral imaging is a multidimensional optical technique with the potential of providing fast and accurate tissue classification. The main challenge is the adequate processing of the multidimensional information usually linked to long processing times and significant computational costs, which require expensive hardware. In this study, we address the problem of tissue classification for intraoperative hyperspectral images of in vivo brain tissue. For this goal, two methodologies are introduced that rely on a blind linear unmixing (BLU) scheme for practical tissue classification. Both methodologies identify the characteristic end-members related to the studied tissue classes by BLU from a training dataset and classify the pixels by a minimum distance approach. The proposed methodologies are compared with a machine learning method based on a supervised support vector machine (SVM) classifier. The methodologies based on BLU achieve speedup factors of ~459× and ~429× compared to the SVM scheme, while keeping constant and even slightly improving the classification performance.

Binary Spectrum Feature for Improved Classifier Performance

2020 ◽  
Author(s):  
Nalika Ulapane ◽  
Karthick Thiyagarajan ◽  
sarath kodagoda
Keyword(s):  
Machine Learning ◽  
Classification Performance ◽  
Feature Reduction ◽  
Sensor Data ◽  
Machine Learning Techniques ◽  
Support Vector ◽  
Svm Classifier ◽  
Monitoring Task ◽  
Classifier Performance ◽  
Spectrum Feature

<div>Classification has become a vital task in modern machine learning and Artificial Intelligence applications, including smart sensing. Numerous machine learning techniques are available to perform classification. Similarly, numerous practices, such as feature selection (i.e., selection of a subset of descriptor variables that optimally describe the output), are available to improve classifier performance. In this paper, we consider the case of a given supervised learning classification task that has to be performed making use of continuous-valued features. It is assumed that an optimal subset of features has already been selected. Therefore, no further feature reduction, or feature addition, is to be carried out. Then, we attempt to improve the classification performance by passing the given feature set through a transformation that produces a new feature set which we have named the “Binary Spectrum”. Via a case study example done on some Pulsed Eddy Current sensor data captured from an infrastructure monitoring task, we demonstrate how the classification accuracy of a Support Vector Machine (SVM) classifier increases through the use of this Binary Spectrum feature, indicating the feature transformation’s potential for broader usage.</div><div><br></div>

Shape-restricted support vector machine (SR-SVM): a SVM classifier taking supplementary shape information of input

2021 ◽  
Vol 40 (1) ◽  
pp. 1481-1494
Author(s):  
Geng Deng ◽  
Yaoguo Xie ◽  
Xindong Wang ◽  
Qiang Fu
Keyword(s):  
Support Vector Machine ◽  
Classification Performance ◽  
Research Literature ◽  
Support Vector ◽  
Svm Classifier ◽  
Classification Problems ◽  
Active Set ◽  
Shape Information ◽  
Convex Optimization Problem ◽  
Shape Restrictions

Many classification problems contain shape information from input features, such as monotonic, convex, and concave. In this research, we propose a new classifier, called Shape-Restricted Support Vector Machine (SR-SVM), which takes the component-wise shape information to enhance classification accuracy. There exists vast research literature on monotonic classification covering monotonic or ordinal shapes. Our proposed classifier extends to handle convex and concave types of features, and combinations of these types. While standard SVM uses linear separating hyperplanes, our novel SR-SVM essentially constructs non-parametric and nonlinear separating planes subject to component-wise shape restrictions. We formulate SR-SVM classifier as a convex optimization problem and solve it using an active-set algorithm. The approach applies basis function expansions on the input and effectively utilizes the standard SVM solver. We illustrate our methodology using simulation and real world examples, and show that SR-SVM improves the classification performance with additional shape information of input.

scholarly journals The Evaluation of Accuracy Performance in an Enhanced Embedded Feature Selection for Unstructured Text Classification

2020 ◽  
pp. 3397-3407
Author(s):  
Nur Syafiqah Mohd Nafis ◽  
Suryanti Awang
Keyword(s):  
Feature Selection ◽  
Text Classification ◽  
Training Dataset ◽  
Recursive Feature Elimination ◽  
High Dimensional ◽  
Significant Feature ◽  
Support Vector ◽  
Svm Classifier ◽  
Text Documents ◽  
Text Document

Text documents are unstructured and high dimensional. Effective feature selection is required to select the most important and significant feature from the sparse feature space. Thus, this paper proposed an embedded feature selection technique based on Term Frequency-Inverse Document Frequency (TF-IDF) and Support Vector Machine-Recursive Feature Elimination (SVM-RFE) for unstructured and high dimensional text classificationhis technique has the ability to measure the feature’s importance in a high-dimensional text document. In addition, it aims to increase the efficiency of the feature selection. Hence, obtaining a promising text classification accuracy. TF-IDF act as a filter approach which measures features importance of the text documents at the first stage. SVM-RFE utilized a backward feature elimination scheme to recursively remove insignificant features from the filtered feature subsets at the second stage. This research executes sets of experiments using a text document retrieved from a benchmark repository comprising a collection of Twitter posts. Pre-processing processes are applied to extract relevant features. After that, the pre-processed features are divided into training and testing datasets. Next, feature selection is implemented on the training dataset by calculating the TF-IDF score for each feature. SVM-RFE is applied for feature ranking as the next feature selection step. Only top-rank features will be selected for text classification using the SVM classifier. Based on the experiments, it shows that the proposed technique able to achieve 98% accuracy that outperformed other existing techniques. In conclusion, the proposed technique able to select the significant features in the unstructured and high dimensional text document.

scholarly journals Developing Support Vector Machine with New Fuzzy Selection for the Infringement of a Patent Rights Problem

Mathematics ◽  
2020 ◽  
Vol 8 (8) ◽  
pp. 1263
Author(s):  
Chih-Yao Chang ◽  
Kuo-Ping Lin
Keyword(s):  
Support Vector Machine ◽  
Data Quality ◽  
Classification Performance ◽  
Patent Infringement ◽  
Classification Method ◽  
Training Dataset ◽  
Support Vector ◽  
Classification Problems ◽  
Data Quality Management ◽  
Patent Rights

Classification problems are very important issues in real enterprises. In the patent infringement issue, accurate classification could help enterprises to understand court decisions to avoid patent infringement. However, the general classification method does not perform well in the patent infringement problem because there are too many complex variables. Therefore, this study attempts to develop a classification method, the support vector machine with new fuzzy selection (SVMFS), to judge the infringement of patent rights. The raw data are divided into training and testing sets. However, the data quality of the training set is not easy to evaluate. Effective data quality management requires a structural core that can support data operations. This study adopts new fuzzy selection based on membership values, which are generated from fuzzy c-means clustering, to select appropriate data to enhance the classification performance of the support vector machine (SVM). An empirical example based on the SVMFS shows that the proposed SVMFS can obtain a superior accuracy rate. Moreover, the new fuzzy selection also verifies that it can effectively select the training dataset.

scholarly journals Structuring of tactile sensory information for category formation in robotics palpation

2020 ◽  
Vol 44 (8) ◽  
pp. 1377-1393
Author(s):  
Luca Scimeca ◽  
Perla Maiolino ◽  
Ed Bray ◽  
Fumiya Iida
Keyword(s):  
Sensory Information ◽  
Tactile Sensor ◽  
Classification Performance ◽  
Support Vector ◽  
Svm Classifier ◽  
Category Formation ◽  
Physical Interactions ◽  
Robotic Palpation ◽  
Motion Strategy

Abstract This paper proposes a framework to investigate the influence of physical interactions to sensory information, during robotic palpation. We embed a capacitive tactile sensor on a robotic arm to probe a soft phantom and detect and classify hard inclusions within it. A combination of PCA and K-Means clustering is used to: first, reduce the dimensionality of the spatiotemporal data obtained through the probing of each area in the phantom; second categorize the re-encoded data into a given number of categories. Results show that appropriate probing interactions can be useful in compensating for the quality of the data, or lack thereof. Finally, we test the proposed framework on a palpation scenario where a Support Vector Machine classifier is trained to discriminate amongst different types of hard inclusions. We show the proposed framework is capable of predicting the best-performing motion strategy, as well as the relative classification performance of the SVM classifier, solely based on unsupervised cluster analysis methods.

scholarly journals DETERMINATION OF OPTIMUM CLASSIFICATION SYSTEM FOR HYPERSPECTRAL IMAGERY AND LIDAR DATA BASED ON BEES ALGORITHM

2015 ◽  
Vol XL-1-W5 ◽  
pp. 651-656
Author(s):  
F. Samadzadega ◽  
H. Hasani
Keyword(s):  
Urban Area ◽  
Hyperspectral Imagery ◽  
Feature Space ◽  
Classification Performance ◽  
Feature Subset Selection ◽  
Bees Algorithm ◽  
Support Vector ◽  
Svm Classifier ◽  
Lidar Data ◽  
Feature Subset

Hyperspectral imagery is a rich source of spectral information and plays very important role in discrimination of similar land-cover classes. In the past, several efforts have been investigated for improvement of hyperspectral imagery classification. Recently the interest in the joint use of LiDAR data and hyperspectral imagery has been remarkably increased. Because LiDAR can provide structural information of scene while hyperspectral imagery provide spectral and spatial information. The complementary information of LiDAR and hyperspectral data may greatly improve the classification performance especially in the complex urban area. In this paper feature level fusion of hyperspectral and LiDAR data is proposed where spectral and structural features are extract from both dataset, then hybrid feature space is generated by feature stacking. Support Vector Machine (SVM) classifier is applied on hybrid feature space to classify the urban area. In order to optimize the classification performance, two issues should be considered: SVM parameters values determination and feature subset selection. Bees Algorithm (BA) is powerful meta-heuristic optimization algorithm which is applied to determine the optimum SVM parameters and select the optimum feature subset simultaneously. The obtained results show the proposed method can improve the classification accuracy in addition to reducing significantly the dimension of feature space.

Brain MRI Intelligent Diagnostic Using an Improved Deep Convolutional Neural Network

2021 ◽  
Vol 11 (3) ◽  
pp. 836-845
Author(s):  
Xiangsheng Zhang ◽  
Feng Pan ◽  
Leyuan Zhou
Keyword(s):  
Neural Network ◽  
Convolutional Neural Network ◽  
Brain Tissue ◽  
Brain Mri ◽  
Deep Convolutional Neural Network ◽  
Brain Diseases ◽  
Support Vector ◽  
Svm Classifier ◽  
Intelligent Diagnosis ◽  
The Brain

The diagnosis of brain diseases based on magnetic resonance imaging (MRI) is a mainstream practice. In the course of practical treatment, medical personnel observe and analyze the changes in the size, position, and shape of various brain tissues in the brain MRI image, thereby judging whether the brain tissue has been diseased, and formulating the corresponding medical plan. The conclusion drawn after observing the image will be influenced by the subjective experience of the experts and is not objective. Therefore, it has become necessary to try to avoid subjective factors interfering with the diagnosis. This paper proposes an intelligent diagnosis model based on improved deep convolutional neural network (IDCNN). This model introduces integrated support vector machine (SVM) into IDCNN. During image segmentation, if IDCNN has problems such as irrational layer settings, too many parameters, etc., it will make its segmentation accuracy low. This study made a slight adjustment to the structure of IDCNN. First, adjust the number of convolution layers and down-sampling layers in the DCNN network structure, adjust the network’s activation function, and optimize the parameters to improve IDCNN’s non-linear expression ability. Then, use the integrated SVM classifier to replace the original Softmax classifier in IDCNN to improve its classification ability. The simulation experiment results tell that compared with the model before improvement and other classic classifiers, IDCNN improves segmentation results and promote the intelligent diagnosis of brain tissue.

Study on XML Retrieval Results Classification

2012 ◽  
Vol 263-266 ◽  
pp. 1773-1777
Author(s):  
Hong Yu ◽  
Xiao Lei Huang ◽  
Zhi Ling Wei ◽  
Chen Xia Yang
Keyword(s):  
Nearest Neighbor ◽  
Classification Performance ◽  
Feedback Mechanism ◽  
Support Vector ◽  
Svm Classifier ◽  
K Nearest Neighbor ◽  
Xml Retrieval ◽  
Text Documents ◽  
Plain Text ◽  
Xml Documents

Mining (classify or clustering) retrieval results to serve relevance feedback mechanism of search engine is an important solution to improve effectiveness of retrieval. Unlike plain text documents, since the XML documents are semi-structured data, for XML retrieval results classification, consider exploiting structure features of XML documents, such as tag paths and edges etc. We propose to use Support Vector Machine (SVM) classifier to classify XML retrieval results exploiting both their content and structure features. We implemented the classification method on XML retrieval results based on the IEEE SC corpus. Compared with k-nearest neighbor classification (KNN) on the same dataset in our application, SVM perform better. The experiment results have also shown that the use of structure features, especially tag paths and edges, can improve the classification performance significantly.

The recognition of plastic bottle using linear multi hierarchical SVM classifier

2021 ◽  
pp. 1-14
Author(s):  
LiHua Cai ◽  
Jin Cao ◽  
MingQiang Wang ◽  
Ta Zhou ◽  
HaiFeng Fang
Keyword(s):  
Loss Function ◽  
Deep Structure ◽  
Principal Component ◽  
Classification Performance ◽  
Support Vector ◽  
Svm Classifier ◽  
Input Matrix ◽  
Classification Rate ◽  
Pet Bottles ◽  
Combination Methods

Both classification rate and accuracy are crucial for the recyclable PET bottles, and the existing combination methods of SVM all simply use SVM as the unit classifier, ignoring the improvement of SVM’s classification performance in the training process of deep learning. A linear multi hierarchical deep structure based on Support Vector Machine (SVM) is proposed to cover this problem. A novel definition of the input matrix in each layer enhances the optimization of Lagrange multipliers in Sequential Minimal Optimization (SMO) algorithm, thus the datapoint in maximum interval of SVM hyperplane could be recognized, improving the classification performance of SVM classifier in this layer. The loss function defined in this paper could control the depth of Linear Multi Hierarchical SVM (LMHSVM), the generalization parameters are added in the loss function and the input matrix to enhance the generalization performance of LMHSVM. The process of creating Bottle dataset by Histogram of Oriented Gradient (HOG) and Principal Component Analysis (PCA) is introduced meanwhile, reducing the data size of bottles. Experiments are conducted on LMHSVM and multiple typical classification algorithms with Bottle dataset and UCI datasets, the results indicated that LMHSVM has excellent classification performances than FNN classifier, LIBSVM (Gaussian) and GFS-AdaBoost-C in KEEL.

scholarly journals Classifying smoke in laparoscopic videos using SVM

2017 ◽  
Vol 3 (2) ◽  
pp. 191-194 ◽  
Author(s):  
Tamer Abdulbaki Alshirbaji ◽  
Nour Aldeen Jalal ◽  
Lars Mündermann ◽  
Knut Möller
Keyword(s):  
Detection Algorithm ◽  
Classification Performance ◽  
Visual Features ◽  
Support Vector ◽  
Svm Classifier ◽  
Smoke Detection ◽  
Lighting Conditions ◽  
Event Based ◽  
Laparoscopic Videos ◽  
Smoke Removal

AbstractSmoke in laparoscopic videos usually appears due to the use of electrocautery when cutting or coagulating tissues. Therefore, detecting smoke can be used for event-based annotation in laparoscopic surgeries by retrieving the events associated with the electrocauterization. Furthermore, smoke detection can also be used for automatic smoke removal. However, detecting smoke in laparoscopic video is a challenge because of the changeability of smoke patterns, the moving camera and the different lighting conditions. In this paper, we present a video-based smoke detection algorithm to detect smoke of different densities such as fog, low and high density in laparoscopic videos. The proposed method depends on extracting various visual features from the laparoscopic images and providing them to support vector machine (SVM) classifier. Features are based on motion, colour and texture patterns of the smoke. We validated our algorithm using experimental evaluation on four laparoscopic cholecystectomy videos. These four videos were manually annotated by defining every frame as smoke or non-smoke frame. The algorithm was applied to the videos by using different feature combinations for classification. Experimental results show that the combination of all proposed features gives the best classification performance. The overall accuracy (i.e. correctly classified frames) is around 84%, with the sensitivity (i.e. correctly detected smoke frames) and the specificity (i.e. correctly detected non-smoke frames) are 89% and 80%, respectively.

Sign in / Sign up

Export Citation Format

Share Document