scholarly journals An Image-Based Class Retrieval System for Roman Republican Coins

Entropy ◽  
2020 ◽  
Vol 22 (8) ◽  
pp. 799
Author(s):  
Hafeez Anwar ◽  
Serwah Sabetghadam ◽  
Peter Bell
Keyword(s):  
Classification Accuracy ◽  
Retrieval System ◽  
Online Auctions ◽  
Search Space ◽  
Reference Book ◽  
Query Image ◽  
Force Matching ◽  
User Friendly ◽  
Friendly Graphical User Interface

We propose an image-based class retrieval system for ancient Roman Republican coins that can be instrumental in various archaeological applications such as museums, Numismatics study, and even online auctions websites. For such applications, the aim is not only classification of a given coin, but also the retrieval of its information from standard reference book. Such classification and information retrieval is performed by our proposed system via a user friendly graphical user interface (GUI). The query coin image gets matched with exemplar images of each coin class stored in the database. The retrieved coin classes are then displayed in the GUI along with their descriptions from a reference book. However, it is highly impractical to match a query image with each of the class exemplar images as there are 10 exemplar images for each of the 60 coin classes. Similarly, displaying all the retrieved coin classes and their respective information in the GUI will cause user inconvenience. Consequently, to avoid such brute-force matching, we incrementally vary the number of matches per class to find the least matches attaining the maximum classification accuracy. In a similar manner, we also extend the search space for coin class to find the minimal number of retrieved classes that achieve maximum classification accuracy. On the current dataset, our system successfully attains a classification accuracy of 99% for five matches per class such that the top ten retrieved classes are considered. As a result, the computational complexity is reduced by matching the query image with only half of the exemplar images per class. In addition, displaying the top 10 retrieved classes is far more convenient than displaying all 60 classes.

Improving Image Retrieval by Clustering

2011 ◽  
pp. 20-43 ◽  
Author(s):  
Dany Gebara ◽  
Reda Alhajj
Keyword(s):  
Image Retrieval ◽  
Feature Vector ◽  
Search Space ◽  
Query Image ◽  
Novel Approach ◽  
Density Based Clustering ◽  
Clustering Approach ◽  
Classification Of Images ◽  
Single Cluster

This chapter presents a novel approach for content-fbased image retrieval and demonstrates its applicability on non-texture images. The process starts by extracting a feature vector for each image; wavelets are employed in the process. Then the images (each represented by its feature vector) are classified into groups by employing a density-based clustering approach, namely OPTICS. This highly improves the querying facility by limiting the search space to a single cluster instead of the whole database. The cluster to be searched is determined by applying on the query image the same clustering process OPTICS. This leads to the closest cluster to the query image, and hence, limits the search to the latter cluster without adding the query image to the cluster, except if such request is explicitly specified. The power of this system is demonstrated on non-texture images from the Corel dataset. The achieved results demonstrate that the classification of images is extremely fast and accurate.

scholarly journals Image-Based Localization Using Context

2015 ◽  
Vol 1 (1) ◽  
Author(s):  
Charbel Azzi ◽  
John Zelek ◽  
Daniel Asmar ◽  
Adel Fakih
Keyword(s):  
Point Cloud ◽  
Feature Matching ◽  
State Of The Art ◽  
Search Space ◽  
Brute Force ◽  
Localization Problem ◽  
Query Image ◽  
Local Descriptors ◽  
Force Matching ◽  
Space Reduction

<p>Image-based localization problem consists of estimating the 6 DoF<br />camera pose by matching the image to a 3D point cloud (or equivalent)<br />representing a 3D environment. The robustness and accuracy<br />of current solutions is not objective and quantifiable. We<br />have completed a comparative analysis of the main state of the art<br />approaches, namely Brute Force Matching, Approximate Nearest<br />Neighbour Matching, Embedded Ferns Classification, ACG Localizer(<br />Using Visual Vocabulary) and Keyframe Matching Approach.<br />The results of the study revealed major deficiencies in each approach<br />mainly in search space reduction, clustering, feature matching<br />and sensitivity to where the query image was taken. Then, we<br />choose to focus on one common major problem that is reducing<br />the search space. We propose to create a new image-based localization<br />approach based on reducing the search space by using<br />global descriptors to find candidate keyframes in the database then<br />search against the 3D points that are only seen from these candidates<br />using local descriptors stored in a 3D cloud map.</p>

scholarly journals Artificial Intelligence in Fractured Dental Implant Detection and Classification: Evaluation Using Dataset from Two Dental Hospitals

Diagnostics ◽  
2021 ◽  
Vol 11 (2) ◽  
pp. 233
Author(s):  
Dong-Woon Lee ◽  
Sung-Yong Kim ◽  
Seong-Nyum Jeong ◽  
Jae-Hong Lee
Keyword(s):  
Dental Implant ◽  
Classification Accuracy ◽  
Reliability And Validity ◽  
Mechanical Complication ◽  
Radiographic Images ◽  
Acceptable Accuracy ◽  
Reliable Detection ◽  
Classification Evaluation ◽  
Accuracy Performance

Fracture of a dental implant (DI) is a rare mechanical complication that is a critical cause of DI failure and explantation. The purpose of this study was to evaluate the reliability and validity of a three different deep convolutional neural network (DCNN) architectures (VGGNet-19, GoogLeNet Inception-v3, and automated DCNN) for the detection and classification of fractured DI using panoramic and periapical radiographic images. A total of 21,398 DIs were reviewed at two dental hospitals, and 251 intact and 194 fractured DI radiographic images were identified and included as the dataset in this study. All three DCNN architectures achieved a fractured DI detection and classification accuracy of over 0.80 AUC. In particular, automated DCNN architecture using periapical images showed the highest and most reliable detection (AUC = 0.984, 95% CI = 0.900–1.000) and classification (AUC = 0.869, 95% CI = 0.778–0.929) accuracy performance compared to fine-tuned and pre-trained VGGNet-19 and GoogLeNet Inception-v3 architectures. The three DCNN architectures showed acceptable accuracy in the detection and classification of fractured DIs, with the best accuracy performance achieved by the automated DCNN architecture using only periapical images.

scholarly journals An Imbalanced Image Classification Method for the Cell Cycle Phase

Information ◽  
2021 ◽  
Vol 12 (6) ◽  
pp. 249
Author(s):  
Xin Jin ◽  
Yuanwen Zou ◽  
Zhongbing Huang
Keyword(s):  
Cell Cycle ◽  
Deep Learning ◽  
Image Classification ◽  
Classification Accuracy ◽  
Data Augmentation ◽  
Cycle Phase ◽  
Generative Adversarial Network ◽  
Adversarial Network ◽  
Cellular Life

The cell cycle is an important process in cellular life. In recent years, some image processing methods have been developed to determine the cell cycle stages of individual cells. However, in most of these methods, cells have to be segmented, and their features need to be extracted. During feature extraction, some important information may be lost, resulting in lower classification accuracy. Thus, we used a deep learning method to retain all cell features. In order to solve the problems surrounding insufficient numbers of original images and the imbalanced distribution of original images, we used the Wasserstein generative adversarial network-gradient penalty (WGAN-GP) for data augmentation. At the same time, a residual network (ResNet) was used for image classification. ResNet is one of the most used deep learning classification networks. The classification accuracy of cell cycle images was achieved more effectively with our method, reaching 83.88%. Compared with an accuracy of 79.40% in previous experiments, our accuracy increased by 4.48%. Another dataset was used to verify the effect of our model and, compared with the accuracy from previous results, our accuracy increased by 12.52%. The results showed that our new cell cycle image classification system based on WGAN-GP and ResNet is useful for the classification of imbalanced images. Moreover, our method could potentially solve the low classification accuracy in biomedical images caused by insufficient numbers of original images and the imbalanced distribution of original images.

scholarly journals Feature Extraction and Classification of Citrus Juice by Using an Enhanced L-KSVD on Data Obtained from Electronic Nose

Sensors ◽  
2019 ◽  
Vol 19 (4) ◽  
pp. 916 ◽  
Author(s):  
Wen Cao ◽  
Chunmei Liu ◽  
Pengfei Jia
Keyword(s):  
Feature Extraction ◽  
Kernel Function ◽  
Electronic Nose ◽  
Classification Accuracy ◽  
Extraction Methods ◽  
Object Function ◽  
Optimal Value ◽  
Processed Products

Aroma plays a significant role in the quality of citrus fruits and processed products. The detection and analysis of citrus volatiles can be measured by an electronic nose (E-nose); in this paper, an E-nose is employed to classify the juice which is stored for different days. Feature extraction and classification are two important requirements for an E-nose. During the training process, a classifier can optimize its own parameters to achieve a better classification accuracy but cannot decide its input data which is treated by feature extraction methods, so the classification result is not always ideal. Label consistent KSVD (L-KSVD) is a novel technique which can extract the feature and classify the data at the same time, and such an operation can improve the classification accuracy. We propose an enhanced L-KSVD called E-LCKSVD for E-nose in this paper. During E-LCKSVD, we introduce a kernel function to the traditional L-KSVD and present a new initialization technique of its dictionary; finally, the weighted coefficients of different parts of its object function is studied, and enhanced quantum-behaved particle swarm optimization (EQPSO) is employed to optimize these coefficients. During the experimental section, we firstly find the classification accuracy of KSVD, and L-KSVD is improved with the help of the kernel function; this can prove that their ability of dealing nonlinear data is improved. Then, we compare the results of different dictionary initialization techniques and prove our proposed method is better. Finally, we find the optimal value of the weighted coefficients of the object function of E-LCKSVD that can make E-nose reach a better performance.

scholarly journals Classification of SSVEP-based BCIs using Genetic Algorithm

2021 ◽  
Vol 8 (1) ◽  
Author(s):  
Hamideh Soltani ◽  
Zahra Einalou ◽  
Mehrdad Dadgostar ◽  
Keivan Maghooli
Keyword(s):  
Genetic Algorithm ◽  
Dimension Reduction ◽  
Classification Accuracy ◽  
Bayesian Method ◽  
Computer Interface ◽  
Support Vector ◽  
Svm Classifier ◽  
Effective Dimension ◽  
Effective Dimension Reduction

AbstractBrain computer interface (BCI) systems have been regarded as a new way of communication for humans. In this research, common methods such as wavelet transform are applied in order to extract features. However, genetic algorithm (GA), as an evolutionary method, is used to select features. Finally, classification was done using the two approaches support vector machine (SVM) and Bayesian method. Five features were selected and the accuracy of Bayesian classification was measured to be 80% with dimension reduction. Ultimately, the classification accuracy reached 90.4% using SVM classifier. The results of the study indicate a better feature selection and the effective dimension reduction of these features, as well as a higher percentage of classification accuracy in comparison with other studies.

Improved differentiation classification of variable precision artificial intelligence higher education management

2021 ◽  
pp. 1-10
Author(s):  
Chao Dong ◽  
Yan Guo
Keyword(s):  
Artificial Intelligence ◽  
Higher Education ◽  
Data Mining ◽  
Decision Tree ◽  
Classification Accuracy ◽  
Attribute Selection ◽  
Higher Education Management ◽  
Education Management ◽  
Decision Tree Classification

The wide application of artificial intelligence technology in various fields has accelerated the pace of people exploring the hidden information behind large amounts of data. People hope to use data mining methods to conduct effective research on higher education management, and decision tree classification algorithm as a data analysis method in data mining technology, high-precision classification accuracy, intuitive decision results, and high generalization ability make it become a more ideal method of higher education management. Aiming at the sensitivity of data processing and decision tree classification to noisy data, this paper proposes corresponding improvements, and proposes a variable precision rough set attribute selection standard based on scale function, which considers both the weighted approximation accuracy and attribute value of the attribute. The number improves the anti-interference ability of noise data, reduces the bias in attribute selection, and improves the classification accuracy. At the same time, the suppression factor threshold, support and confidence are introduced in the tree pre-pruning process, which simplifies the tree structure. The comparative experiments on standard data sets show that the improved algorithm proposed in this paper is better than other decision tree algorithms and can effectively realize the differentiated classification of higher education management.

NEURO-FUZZY BASED SEARCH ROBOT FOR SOFTWARE COMPONENTS

1999 ◽  
Vol 08 (02) ◽  
pp. 119-135
Author(s):  
YAU-HWANG KUO ◽  
JANG-PONG HSU ◽  
MONG-FONG HORNG
Keyword(s):  
Retrieval System ◽  
Software Component ◽  
Software Components ◽  
Personalized Search ◽  
Component Retrieval ◽  
Reusable Software ◽  
Major Mechanism ◽  
Fuzzy Models ◽  
Neuro Fuzzy

A personalized search robot is developed as one major mechanism of a personalized software component retrieval system. This search robot automatically finds out the Web servers providing reusable software components, extracts needed software components from servers, classifies the extracted components, and finally establishes their indexing information for local component retrieval in the future. For adaptively tuning the performance of software component extraction and classification, an adaptive thesaurus and an adaptive classifier, realized by neuro-fuzzy models, are embedded in this search robot, and their learning algorithms are also developed. A prototype of the personalized software component retrieval system including the search robot has been implemented to confirm its validity and evaluate the performance. Furthermore, the framework of proposed personalized search robot could be extended to the search and classification of other kinds of Internet documents.

scholarly journals A new pipeline for structural characterization and classification of RNA-Seq microbiome data

2021 ◽  
Vol 14 (1) ◽  
Author(s):  
Sebastian Racedo ◽  
Ivan Portnoy ◽  
Jorge I. Vélez ◽  
Homero San-Juan-Vergara ◽  
Marco Sanjuan ◽  
...  
Keyword(s):  
Classification Accuracy ◽  
High Throughput Sequencing ◽  
Compositional Data ◽  
Graphical Representation ◽  
Synthetic Data ◽  
Gene Sequencing ◽  
Rrna Gene ◽  
Interaction Patterns ◽  
Simulation Experiments

Abstract Background High-throughput sequencing enables the analysis of the composition of numerous biological systems, such as microbial communities. The identification of dependencies within these systems requires the analysis and assimilation of the underlying interaction patterns between all the variables that make up that system. However, this task poses a challenge when considering the compositional nature of the data coming from DNA-sequencing experiments because traditional interaction metrics (e.g., correlation) produce unreliable results when analyzing relative fractions instead of absolute abundances. The compositionality-associated challenges extend to the classification task, as it usually involves the characterization of the interactions between the principal descriptive variables of the datasets. The classification of new samples/patients into binary categories corresponding to dissimilar biological settings or phenotypes (e.g., control and cases) could help researchers in the development of treatments/drugs. Results Here, we develop and exemplify a new approach, applicable to compositional data, for the classification of new samples into two groups with different biological settings. We propose a new metric to characterize and quantify the overall correlation structure deviation between these groups and a technique for dimensionality reduction to facilitate graphical representation. We conduct simulation experiments with synthetic data to assess the proposed method’s classification accuracy. Moreover, we illustrate the performance of the proposed approach using Operational Taxonomic Unit (OTU) count tables obtained through 16S rRNA gene sequencing data from two microbiota experiments. Also, compare our method’s performance with that of two state-of-the-art methods. Conclusions Simulation experiments show that our method achieves a classification accuracy equal to or greater than 98% when using synthetic data. Finally, our method outperforms the other classification methods with real datasets from gene sequencing experiments.

The Classification of Skateboarding Tricks : A Transfer Learning and Machine Learning Approach

Mekatronika ◽  
2020 ◽  
Vol 2 (2) ◽  
pp. 1-12
Author(s):  
Muhammad Nur Aiman Shapiee ◽  
Muhammad Ar Rahim Ibrahim ◽  
Muhammad Amirul Abdullah ◽  
Rabiu Muazu Musa ◽  
Noor Azuan Abu Osman ◽  
...  
Keyword(s):  
Machine Learning ◽  
Classification Accuracy ◽  
Nearest Neighbor ◽  
Olympic Games ◽  
Learning Approach ◽  
K Nearest Neighbor ◽  
Test Dataset ◽  
Machine Learning Approach ◽  
Competitive Games

The skateboarding scene has arrived at new statures, particularly with its first appearance at the now delayed Tokyo Summer Olympic Games. Hence, attributable to the size of the game in such competitive games, progressed creative appraisal approaches have progressively increased due consideration by pertinent partners, particularly with the enthusiasm of a more goal-based assessment. This study purposes for classifying skateboarding tricks, specifically Frontside 180, Kickflip, Ollie, Nollie Front Shove-it, and Pop Shove-it over the integration of image processing, Trasnfer Learning (TL) to feature extraction enhanced with tradisional Machine Learning (ML) classifier. A male skateboarder performed five tricks every sort of trick consistently and the YI Action camera captured the movement by a range of 1.26 m. Then, the image dataset were features built and extricated by means of  three TL models, and afterward in this manner arranged to utilize by k-Nearest Neighbor (k-NN) classifier. The perception via the initial experiments showed, the MobileNet, NASNetMobile, and NASNetLarge coupled with optimized k-NN classifiers attain a classification accuracy (CA) of 95%, 92% and 90%, respectively on the test dataset. Besides, the result evident from the robustness evaluation showed the MobileNet+k-NN pipeline is more robust as it could provide a decent average CA than other pipelines. It would be demonstrated that the suggested study could characterize the skateboard tricks sufficiently and could, over the long haul, uphold judges decided for giving progressively objective-based decision.

Sign in / Sign up

Export Citation Format

Share Document