Feature and weight selection using Tabu search for improving the recognition rate of duct anomaly

2014 ◽  
Author(s):  
Wang Yongxiong ◽  
Kai Li
Keyword(s):  
Tabu Search ◽  
Recognition Rate

scholarly journals TABU SEARCH MODEL SELECTION FOR SVM

2008 ◽  
Vol 18 (01) ◽  
pp. 19-31 ◽  
Author(s):  
GILLES LEBRUN ◽  
CHRISTOPHE CHARRIER ◽  
OLIVIER LEZORAY ◽  
HUBERT CARDOT
Keyword(s):  
Support Vector Machines ◽  
Model Selection ◽  
Tabu Search ◽  
Recognition Rate ◽  
Decision Function ◽  
Support Vector ◽  
Feature Subset ◽  
Binary Decision ◽  
Vector Machines ◽  
Decision Functions

A model selection method based on tabu search is proposed to build support vector machines (binary decision functions) of reduced complexity and efficient generalization. The aim is to build a fast and efficient support vector machines classifier. A criterion is defined to evaluate the decision function quality which blends recognition rate and the complexity of a binary decision functions together. The selection of the simplification level by vector quantization, of a feature subset and of support vector machines hyperparameters are performed by tabu search method to optimize the defined decision function quality criterion in order to find a good sub-optimal model on tractable times.

A Study of Different Methodologies Helpful in the Identification of Offline Handwritten Script

2018 ◽  
Vol 6 (6) ◽  
pp. 307
Author(s):  
Manish M. Kayasth ◽  
Bharat C. Patel
Keyword(s):  
Feature Extraction ◽  
Character Recognition ◽  
Recognition Rate ◽  
Recognition System ◽  
Post Processing ◽  
Classification Technique ◽  
Scanned Image ◽  
Gujarati Language ◽  
High Degree ◽  
Selection Of

The entire character recognition system is logically characterized into different sections like Scanning, Pre-processing, Classification, Processing, and Post-processing. In the targeted system, the scanned image is first passed through pre-processing modules then feature extraction, classification in order to achieve a high recognition rate. This paper describes mainly on Feature extraction and Classification technique. These are the methodologies which play an important role to identify offline handwritten characters specifically in Gujarati language. Feature extraction provides methods with the help of which characters can identify uniquely and with high degree of accuracy. Feature extraction helps to find the shape contained in the pattern. Several techniques are available for feature extraction and classification, however the selection of an appropriate technique based on its input decides the degree of accuracy of recognition. 

GESTURE RECOGNITION SYSTEM FOR NIGERIAN TRIBAL GREETING POSTURES USING SUPPORT VECTOR MACHINE

2020 ◽  
Vol 5 (2) ◽  
pp. 609
Author(s):  
Segun Aina ◽  
Kofoworola V. Sholesi ◽  
Aderonke R. Lawal ◽  
Samuel D. Okegbile ◽  
Adeniran I. Oluwaranti
Keyword(s):  
Support Vector Machine ◽  
Gesture Recognition ◽  
Recognition Rate ◽  
Recognition Task ◽  
Recognition System ◽  
Human Interaction ◽  
Support Vector ◽  
System A ◽  
Extraction Algorithm ◽  
Gaussian Blur

This paper presents the application of Gaussian blur filters and Support Vector Machine (SVM) techniques for greeting recognition among the Yoruba tribe of Nigeria. Existing efforts have considered different recognition gestures. However, tribal greeting postures or gestures recognition for the Nigerian geographical space has not been studied before. Some cultural gestures are not correctly identified by people of the same tribe, not to mention other people from different tribes, thereby posing a challenge of misinterpretation of meaning. Also, some cultural gestures are unknown to most people outside a tribe, which could also hinder human interaction; hence there is a need to automate the recognition of Nigerian tribal greeting gestures. This work hence develops a Gaussian Blur – SVM based system capable of recognizing the Yoruba tribe greeting postures for men and women. Videos of individuals performing various greeting gestures were collected and processed into image frames. The images were resized and a Gaussian blur filter was used to remove noise from them. This research used a moment-based feature extraction algorithm to extract shape features that were passed as input to SVM. SVM is exploited and trained to perform the greeting gesture recognition task to recognize two Nigerian tribe greeting postures. To confirm the robustness of the system, 20%, 25% and 30% of the dataset acquired from the preprocessed images were used to test the system. A recognition rate of 94% could be achieved when SVM is used, as shown by the result which invariably proves that the proposed method is efficient.

Human action recognition using simple geometric features and a finite state machine

2013 ◽  
Vol 18 (2-3) ◽  
pp. 49-60 ◽  
Author(s):  
Damian Dudzńiski ◽  
Tomasz Kryjak ◽  
Zbigniew Mikrut
Keyword(s):  
Action Recognition ◽  
Finite State Machine ◽  
Recognition Rate ◽  
Human Action Recognition ◽  
Human Action ◽  
Video Stream ◽  
State Machine ◽  
Recognition Algorithm ◽  
Finite State ◽  
Correct Recognition Rate

Abstract In this paper a human action recognition algorithm, which uses background generation with shadow elimination, silhouette description based on simple geometrical features and a finite state machine for recognizing particular actions is described. The performed tests indicate that this approach obtains a 81 % correct recognition rate allowing real-time image processing of a 360 X 288 video stream.

Determination of Optimal Public Transportation Routes Using Firefly and Tabu Search Algorithms

2020 ◽  
Vol 4 (5) ◽  
pp. 884-891
Author(s):  
Salwa Salsabila Mansur ◽  
Sri Widowati ◽  
Mahmud Imrona
Keyword(s):  
Tabu Search ◽  
Public Transportation ◽  
Traffic Congestion ◽  
Search Algorithm ◽  
Urban Transportation ◽  
The Public ◽  
Comparison Results ◽  
Congestion Problems ◽  
Transportation Routes

Traffic congestion problems generally caused by the increasing use of private vehicles and public transportations. In order to overcome the situation, the optimization of public transportation’s route is required particularly the urban transportation. In this research, the performance analysis of Firefly and Tabu Search algorithm is conducted to optimize eleven public transportation’s routes in Bandung. This optimization aims to increase the dispersion of public transportation’s route by expanding the scope of route that are crossed by public transportation so that it can reach the entire Bandung city and increase the driver’s income by providing the passengers easier access to public transportations in order to get to their destinations. The optimal route is represented by the route with most roads and highest number of incomes. In this research, the comparison results between the reference route and the public transportation’s optimized route increasing the dispersion of public transportation’s route to 60,58% and increasing the driver’s income to 20,03%.

Gray-Level Co-occurrence Matrix and Random Forest Based Off-line Odia Handwritten Character Recognition

2019 ◽  
Vol 13 (2) ◽  
pp. 136-141 ◽  
Author(s):  
Abhisek Sethy ◽  
Prashanta Kumar Patra ◽  
Deepak Ranjan Nayak
Keyword(s):  
Feature Extraction ◽  
Random Forest ◽  
Character Recognition ◽  
Recognition Rate ◽  
Discrete Wavelet ◽  
Gray Level ◽  
Handwritten Character Recognition ◽  
Handwritten Character ◽  
Wide Range ◽  
Occurrence Matrix

Background: In the past decades, handwritten character recognition has received considerable attention from researchers across the globe because of its wide range of applications in daily life. From the literature, it has been observed that there is limited study on various handwritten Indian scripts and Odia is one of them. We revised some of the patents relating to handwritten character recognition. Methods: This paper deals with the development of an automatic recognition system for offline handwritten Odia character recognition. In this case, prior to feature extraction from images, preprocessing has been done on the character images. For feature extraction, first the gray level co-occurrence matrix (GLCM) is computed from all the sub-bands of two-dimensional discrete wavelet transform (2D DWT) and thereafter, feature descriptors such as energy, entropy, correlation, homogeneity, and contrast are calculated from GLCMs which are termed as the primary feature vector. In order to further reduce the feature space and generate more relevant features, principal component analysis (PCA) has been employed. Because of the several salient features of random forest (RF) and K- nearest neighbor (K-NN), they have become a significant choice in pattern classification tasks and therefore, both RF and K-NN are separately applied in this study for segregation of character images. Results: All the experiments were performed on a system having specification as windows 8, 64-bit operating system, and Intel (R) i7 – 4770 CPU @ 3.40 GHz. Simulations were conducted through Matlab2014a on a standard database named as NIT Rourkela Odia Database. Conclusion: The proposed system has been validated on a standard database. The simulation results based on 10-fold cross-validation scenario demonstrate that the proposed system earns better accuracy than the existing methods while requiring least number of features. The recognition rate using RF and K-NN classifier is found to be 94.6% and 96.4% respectively.

Sign in / Sign up

Export Citation Format

Share Document