recognition algorithms
Recently Published Documents


TOTAL DOCUMENTS

727
(FIVE YEARS 170)

H-INDEX

33
(FIVE YEARS 4)

Author(s):  
Song Li ◽  
Mustafa Ozkan Yerebakan ◽  
Yue Luo ◽  
Ben Amaba ◽  
William Swope ◽  
...  

Abstract Voice recognition has become an integral part of our lives, commonly used in call centers and as part of virtual assistants. However, voice recognition is increasingly applied to more industrial uses. Each of these use cases has unique characteristics that may impact the effectiveness of voice recognition, which could impact industrial productivity, performance, or even safety. One of the most prominent among them is the unique background noises that are dominant in each industry. The existence of different machinery and different work layouts are primary contributors to this. Another important characteristic is the type of communication that is present in these settings. Daily communication often involves longer sentences uttered under relatively silent conditions, whereas communication in industrial settings is often short and conducted in loud conditions. In this study, we demonstrated the importance of taking these two elements into account by comparing the performances of two voice recognition algorithms under several background noise conditions: a regular Convolutional Neural Network (CNN) based voice recognition algorithm to an Auto Speech Recognition (ASR) based model with a denoising module. Our results indicate that there is a significant performance drop between the typical background noise use (white noise) and the rest of the background noises. Also, our custom ASR model with the denoising module outperformed the CNN based model with an overall performance increase between 14-35% across all background noises. . Both results give proof that specialized voice recognition algorithms need to be developed for these environments to reliably deploy them as control mechanisms.


2022 ◽  
Vol 30 (1) ◽  
pp. 641-654
Author(s):  
Ali Abd Almisreb ◽  
Nooritawati Md Tahir ◽  
Sherzod Turaev ◽  
Mohammed A. Saleh ◽  
Syed Abdul Mutalib Al Junid

Arabic handwriting is slightly different from the handwriting of other languages; hence it is possible to distinguish the handwriting written by the native or non-native writer based on their handwriting. However, classifying Arabic handwriting is challenging using traditional text recognition algorithms. Thus, this study evaluated and validated the utilisation of deep transfer learning models to overcome such issues. Hence, seven types of deep learning transfer models, namely the AlexNet, GoogleNet, ResNet18, ResNet50, ResNet101, VGG16, and VGG19, were used to determine the most suitable model for classifying the handwritten images written by the native or non-native. Two datasets comprised of Arabic handwriting images were used to evaluate and validate the newly developed deep learning models used to classify each model’s output as either native or foreign (non-native) writers. The training and validation sets were conducted using both original and augmented datasets. Results showed that the highest accuracy is using the GoogleNet deep learning model for both normal and augmented datasets, with the highest accuracy attained as 93.2% using normal data and 95.5% using augmented data in classifying the native handwriting.


2022 ◽  
Vol 4 ◽  
Author(s):  
Reuth Mirsky ◽  
Ran Galun ◽  
Kobi Gal ◽  
Gal Kaminka

Plan recognition deals with reasoning about the goals and execution process of an actor, given observations of its actions. It is one of the fundamental problems of AI, applicable to many domains, from user interfaces to cyber-security. Despite the prevalence of these approaches, they lack a standard representation, and have not been compared using a common testbed. This paper provides a first step towards bridging this gap by providing a standard plan library representation that can be used by hierarchical, discrete-space plan recognition and evaluation criteria to consider when comparing plan recognition algorithms. This representation is comprehensive enough to describe a variety of known plan recognition problems and can be easily used by existing algorithms in this class. We use this common representation to thoroughly compare two known approaches, represented by two algorithms, SBR and Probabilistic Hostile Agent Task Tracker (PHATT). We provide meaningful insights about the differences and abilities of these algorithms, and evaluate these insights both theoretically and empirically. We show a tradeoff between expressiveness and efficiency: SBR is usually superior to PHATT in terms of computation time and space, but at the expense of functionality and representational compactness. We also show how different properties of the plan library affect the complexity of the recognition process, regardless of the concrete algorithm used. Lastly, we show how these insights can be used to form a new algorithm that outperforms existing approaches both in terms of expressiveness and efficiency.


Author(s):  
Sourabh Kumar ◽  
Bhaskar Kapoor Kapoor

Proposing a security system for surveillance of home alone children for safety purpose and send an alert to the register mobile number if some kind of intrusion is detected. I have used Viola-Jones algorithm to detect human face from the live camera and then frame is resized then resized image is processed by the Local Binary Pattern Histograms (LBPH) algorithm and save the model in a YML file and then it is implemented on live cam feed in which the algorithm will detect the face and if some unknown face has been identified it will trigger a notification to the registered mobile number using a python library named [Pywhatkit] so the user can perform security measures. Keywords: Face recognition, Open-CV, HAAR cascade, face recognition.


Mathematics ◽  
2021 ◽  
Vol 10 (1) ◽  
pp. 4
Author(s):  
Mobeen Ahmad ◽  
Usman Cheema ◽  
Muhammad Abdullah ◽  
Seungbin Moon ◽  
Dongil Han

Applications for facial recognition have eased the process of personal identification. However, there are increasing concerns about the performance of these systems against the challenges of presentation attacks, spoofing, and disguises. One of the reasons for the lack of a robustness of facial recognition algorithms in these challenges is the limited amount of suitable training data. This lack of training data can be addressed by creating a database with the subjects having several disguises, but this is an expensive process. Another approach is to use generative adversarial networks to synthesize facial images with the required disguise add-ons. In this paper, we present a synthetic disguised face database for the training and evaluation of robust facial recognition algorithms. Furthermore, we present a methodology for generating synthetic facial images for the desired disguise add-ons. Cycle-consistency loss is used to generate facial images with disguises, e.g., fake beards, makeup, and glasses, from normal face images. Additionally, an automated filtering scheme is presented for automated data filtering from the synthesized faces. Finally, facial recognition experiments are performed on the proposed synthetic data to show the efficacy of the proposed methodology and the presented database. Training on the proposed database achieves an improvement in the rank-1 recognition rate (68.3%), over a model trained on the original nondisguised face images.


Author(s):  
H. M. Gray

High-energy physics is facing a daunting computing challenge with the large datasets expected from the upcoming High-Luminosity Large Hadron Collider in the next decade and even more so at future colliders. A key challenge in the reconstruction of events of simulated data and collision data is the pattern recognition algorithms used to determine the trajectories of charged particles. The field of quantum computing shows promise for transformative capabilities and is going through a cycle of rapid development and hence might provide a solution to this challenge. This article reviews current studies of quantum computers for charged particle pattern recognition in high-energy physics. This article is part of the theme issue ‘Quantum technologies in particle physics’.


2021 ◽  
Author(s):  
Michael Greeff ◽  
Max Caspers ◽  
Vincent Kalkman ◽  
Luc Willemse ◽  
Barry Sunderland ◽  
...  

Natural history collections play a vital role in biodiversity research and conservation by providing a window to the past. The usefulness of the vast amount of historical data depends on their quality, with correct taxonomic identifications being the most critical. The identification of many of the objects of natural history collections, however, is wanting, doubtful or outdated. Providing correct identifications is difficult given the sheer number of objects and the scarcity of expertise. Here we outline the construction of an ecosystem for the collaborative development and exchange of image recognition algorithms designed to support the identification of objects. Such an ecosystem will facilitate sharing taxonomic expertise among institutions by offering image datasets that are correctly identified by their in-house taxonomic experts. Together with openly accessible machine learning algorithms and easy to use workbenches, this will allow other institutes to train image recognition algorithms and thereby compensate for the lacking expertise.


2021 ◽  
Vol 27 (11) ◽  
pp. 835-844
Author(s):  
Jae Hoon Son ◽  
Dong Hwi Kang ◽  
Dong-Hwan Hwang

Sign in / Sign up

Export Citation Format

Share Document