The Two-Stage Recognition Method Based on Texture Signals of the Heterogeneous Unsteady Iris

2021 ◽  
Author(s):  
Shuai Liu ◽  
Yuanning Liu ◽  
Xiaodong Zhu ◽  
Jing Liu ◽  
Guang Huo ◽  
...  
Keyword(s):  
Iris Recognition ◽  
Recognition Accuracy ◽  
Texture Features ◽  
Unsteady State ◽  
Recognition Method ◽  
Two Stage ◽  
Second Stage ◽  
Highly Efficient ◽  
Training Samples ◽  
Gray Values

In this paper, a two-stage multi-category recognition structure based on texture features is proposed. This method can solve the problem of the decline in recognition accuracy in the scene of lightweight training samples. Besides, the problem of recognition effect different in the same recognition structure caused by the unsteady iris can also be solved. In this paper’s structure, digitized values of the edge shape in the iris texture of the image are set as the texture trend feature, while the differences between the gray values of the image obtained by convolution are set as the grayscale difference feature. Furthermore, the texture trend feature is used in the first-stage recognition. The template category that does not match the tested iris is the elimination category, and the remaining categories are uncertain categories. Whereas, in the second-stage recognition, uncertain categories are adopted to determine the iris recognition conclusion through the grayscale difference feature. Then, the experiment results using the JLU iris library show that the method in this paper can be highly efficient in multi-category heterogeneous iris recognition under lightweight training samples and unsteady state.

scholarly journals Multi-Aspect SAR Target Recognition Based on Prototypical Network with a Small Number of Training Samples

Sensors ◽  
2021 ◽  
Vol 21 (13) ◽  
pp. 4333
Author(s):  
Pengfei Zhao ◽  
Lijia Huang ◽  
Yu Xin ◽  
Jiayi Guo ◽  
Zongxu Pan
Keyword(s):  
Deep Learning ◽  
Feature Fusion ◽  
Recognition Accuracy ◽  
Target Recognition ◽  
Automatic Target Recognition ◽  
Small Sample ◽  
Recognition Method ◽  
Training Samples ◽  
Model Training ◽  
Sar Target Recognition

At present, synthetic aperture radar (SAR) automatic target recognition (ATR) has been deeply researched and widely used in military and civilian fields. SAR images are very sensitive to the azimuth aspect of the imaging geomety; the same target at different aspects differs greatly. Thus, the multi-aspect SAR image sequence contains more information for classification and recognition, which requires the reliable and robust multi-aspect target recognition method. Nowadays, SAR target recognition methods are mostly based on deep learning. However, the SAR dataset is usually expensive to obtain, especially for a certain target. It is difficult to obtain enough samples for deep learning model training. This paper proposes a multi-aspect SAR target recognition method based on a prototypical network. Furthermore, methods such as multi-task learning and multi-level feature fusion are also introduced to enhance the recognition accuracy under the case of a small number of training samples. The experiments by using the MSTAR dataset have proven that the recognition accuracy of our method can be close to the accruacy level by all samples and our method can be applied to other feather extraction models to deal with small sample learning problems.

scholarly journals AN EXPERIMENTAL STUDY OF FACE RECOGNITION METHOD

2020 ◽  
Vol 1 (2) ◽  
pp. 52-58
Author(s):  
Paula Pereira ◽  
Tanara Kuhn
Keyword(s):  
Face Recognition ◽  
Wavelet Transformation ◽  
Euclidean Distance ◽  
Recognition Accuracy ◽  
Recognition Method ◽  
Training Images ◽  
Spectral Graph ◽  
Training Samples ◽  
The Face ◽  
Improved Methods

The increased use of face recognition techniques leads to the development of improved methods with higher accuracy and efficiency. Currently, there are various face recognition techniques based on different algorithm. In this study, a new method of face recognition is proposed based on the idea of wavelet operators for creating spectral graph wavelet transformation. The proposed idea relies on the spectral graph wavelet kernel procedure. In this proposed method, feature extraction is based on transformation into SGWT by means of spatial domain. For recognition purpose, the feature vectors are used for computation of selected training samples which makes the classification. The decomposition of face image is done using the SGWT. The system identifies the test image by calculating the Euclidean distance. Finally, the study conducted an experiment using the ORL face database. The result states that the recognition accuracy is higher in the proposed system which can be further improved using the number of training images. Overall, the result shows that the proposed method has good performance in terms of accuracy of the face recognition

A TWO-STAGE SYNERGETIC APPROACH FOR FACE RECOGNITION

2004 ◽  
Vol 18 (06) ◽  
pp. 1007-1017
Author(s):  
WEIGANG CHEN ◽  
FEIHU QI ◽  
ZHAOZHONG WANG
Keyword(s):  
Face Recognition ◽  
Potential Function ◽  
Order Parameter ◽  
Test Pattern ◽  
Face Image ◽  
Recognition Method ◽  
Two Stage ◽  
Second Stage ◽  
Definition Of ◽  
Global Similarity

A two-stage face recognition method is presented in this paper. In the first stage, the set of candidate patterns is narrowed down with the global similarity being taken into account. In the second stage, synergetic approach is employed to perform further recognition. Face image is segmented into meaningful regions, each of which is represented as a prototype vector. The similarity between a given region of the test pattern and a stored sample is obtained as the order parameter which serves as an element of the order vector. Finally, a modified definition of the potential function is given, and the dynamic model of recognition is derived from it. The effectiveness of the proposed method is experimentally confirmed.

A Shape-Based Two-Stage Product Image Retrieval Method

2012 ◽  
Vol 466-467 ◽  
pp. 1050-1054
Author(s):  
Shang Fu Gong ◽  
Juan Du
Keyword(s):  
Image Retrieval ◽  
Texture Features ◽  
Two Stage ◽  
Retrieval Method ◽  
Second Stage ◽  
Product Image ◽  
Feature Based ◽  
Large Product ◽  
Product Image Retrieval ◽  
Salient Edges

Product image retrieval using content of the image is valuable for E-commerce application. But both search efficiency and accuracy are challenging the implementation of content-based image retrieval in large product image database. We present a two-stage product image retrieval method, with fully consideration of individual features of product images. In the initial pruning stage, shape feature based on salient edges of product object is used to generate a moderate number of candidates; in the second stage, the proposed detail feature combined with color and texture features is used for fully retrieval. Experiments show that this two-stage retrieval method accelerates search process with a high accuracy.

An Enhanced Two Stage MMSE Equalizer for Coded FBMC/OQAM Systems

2019 ◽  
Vol 10 (1) ◽  
pp. 69-82 ◽  
Author(s):  
Mohammad Rizk Assaf ◽  
Abdel-Nasser Assimi
Keyword(s):  
Error Propagation ◽  
Channel Model ◽  
Error Correcting Codes ◽  
Two Stage ◽  
Probability Of Error ◽  
Second Stage ◽  
Different Types ◽  
Mmse Equalizer ◽  
And Performance ◽  
Ici Cancellation

In this article, the authors investigate the enhanced two stage MMSE (TS-MMSE) equalizer in bit-interleaved coded FBMC/OQAM system which gives a tradeoff between complexity and performance, since error correcting codes limits error propagation, so this allows the equalizer to remove not only ICI but also ISI in the second stage. The proposed equalizer has shown less design complexity compared to the other MMSE equalizers. The obtained results show that the probability of error is improved where SNR gain reaches 2 dB measured at BER compared with ICI cancellation for different types of modulation schemes and ITU Vehicular B channel model. Some simulation results are provided to illustrate the effectiveness of the proposed equalizer.

Personalised attraction recommendation for enhancing topic diversity and accuracy

2021 ◽  
pp. 016555152199980
Author(s):  
Yuanyuan Lin ◽  
Chao Huang ◽  
Wei Yao ◽  
Yifei Shao
Keyword(s):  
Real World ◽  
Information Overload ◽  
Two Stage ◽  
Misclassification Cost ◽  
Second Stage ◽  
Low Visibility ◽  
Recommendation Diversity ◽  
Optimisation Model ◽  
Definition Of ◽  
Improved Methods

Attraction recommendation plays an important role in tourism, such as solving information overload problems and recommending proper attractions to users. Currently, most recommendation methods are dedicated to improving the accuracy of recommendations. However, recommendation methods only focusing on accuracy tend to recommend popular items that are often purchased by users, which results in a lack of diversity and low visibility of non-popular items. Hence, many studies have suggested the importance of recommendation diversity and proposed improved methods, but there is room for improvement. First, the definition of diversity for different items requires consideration for domain characteristics. Second, the existing algorithms for improving diversity sacrifice the accuracy of recommendations. Therefore, the article utilises the topic ‘features of attractions’ to define the calculation method of recommendation diversity. We developed a two-stage optimisation model to enhance recommendation diversity while maintaining the accuracy of recommendations. In the first stage, an optimisation model considering topic diversity is proposed to increase recommendation diversity and generate candidate attractions. In the second stage, we propose a minimisation misclassification cost optimisation model to balance recommendation diversity and accuracy. To assess the performance of the proposed method, experiments are conducted with real-world travel data. The results indicate that the proposed two-stage optimisation model can significantly improve the diversity and accuracy of recommendations.

scholarly journals Two-stage multi-tasking transform framework for large-scale many-objective optimization problems

2021 ◽  
Author(s):  
Lu Chen ◽  
Handing Wang ◽  
Wenping Ma
Keyword(s):  
Large Scale ◽  
Original Problem ◽  
Optimization Problems ◽  
Reference Points ◽  
Optimization Strategy ◽  
Two Stage ◽  
Decision Space ◽  
Second Stage ◽  
Decision Variables ◽  
Objective Space

AbstractReal-world optimization applications in complex systems always contain multiple factors to be optimized, which can be formulated as multi-objective optimization problems. These problems have been solved by many evolutionary algorithms like MOEA/D, NSGA-III, and KnEA. However, when the numbers of decision variables and objectives increase, the computation costs of those mentioned algorithms will be unaffordable. To reduce such high computation cost on large-scale many-objective optimization problems, we proposed a two-stage framework. The first stage of the proposed algorithm combines with a multi-tasking optimization strategy and a bi-directional search strategy, where the original problem is reformulated as a multi-tasking optimization problem in the decision space to enhance the convergence. To improve the diversity, in the second stage, the proposed algorithm applies multi-tasking optimization to a number of sub-problems based on reference points in the objective space. In this paper, to show the effectiveness of the proposed algorithm, we test the algorithm on the DTLZ and LSMOP problems and compare it with existing algorithms, and it outperforms other compared algorithms in most cases and shows disadvantage on both convergence and diversity.

scholarly journals A Two-Stage Mono- and Multi-Objective Method for the Optimization of General UPS Parallel Manipulators

Mathematics ◽  
2021 ◽  
Vol 9 (5) ◽  
pp. 543
Author(s):  
Alejandra Ríos ◽  
Eusebio E. Hernández ◽  
S. Ivvan Valdez
Keyword(s):  
Genetic Algorithm ◽  
Performance Metrics ◽  
Tracking Error ◽  
Parallel Manipulators ◽  
Optimization Method ◽  
Statistical Hypothesis ◽  
Two Stage ◽  
Multi Objective ◽  
Second Stage ◽  
Conflicting Objectives

This paper introduces a two-stage method based on bio-inspired algorithms for the design optimization of a class of general Stewart platforms. The first stage performs a mono-objective optimization in order to reach, with sufficient dexterity, a regular target workspace while minimizing the elements’ lengths. For this optimization problem, we compare three bio-inspired algorithms: the Genetic Algorithm (GA), the Particle Swarm Optimization (PSO), and the Boltzman Univariate Marginal Distribution Algorithm (BUMDA). The second stage looks for the most suitable gains of a Proportional Integral Derivative (PID) control via the minimization of two conflicting objectives: one based on energy consumption and the tracking error of a target trajectory. To this effect, we compare two multi-objective algorithms: the Multiobjective Evolutionary Algorithm based on Decomposition (MOEA/D) and Non-dominated Sorting Genetic Algorithm-III (NSGA-III). The main contributions lie in the optimization model, the proposal of a two-stage optimization method, and the findings of the performance of different bio-inspired algorithms for each stage. Furthermore, we show optimized designs delivered by the proposed method and provide directions for the best-performing algorithms through performance metrics and statistical hypothesis tests.

scholarly journals A Robot Object Recognition Method Based on Scene Text Reading in Home Environments

Sensors ◽  
2021 ◽  
Vol 21 (5) ◽  
pp. 1919
Author(s):  
Shuhua Liu ◽  
Huixin Xu ◽  
Qi Li ◽  
Fei Zhang ◽  
Kun Hou
Keyword(s):  
Object Recognition ◽  
Recognition Accuracy ◽  
Multiple Objects ◽  
Recognition Method ◽  
Home Environments ◽  
Complex Scenes ◽  
Scene Text ◽  
Text Reading ◽  
Text Images ◽  
Chinese And English

With the aim to solve issues of robot object recognition in complex scenes, this paper proposes an object recognition method based on scene text reading. The proposed method simulates human-like behavior and accurately identifies objects with texts through careful reading. First, deep learning models with high accuracy are adopted to detect and recognize text in multi-view. Second, datasets including 102,000 Chinese and English scene text images and their inverse are generated. The F-measure of text detection is improved by 0.4% and the recognition accuracy is improved by 1.26% because the model is trained by these two datasets. Finally, a robot object recognition method is proposed based on the scene text reading. The robot detects and recognizes texts in the image and then stores the recognition results in a text file. When the user gives the robot a fetching instruction, the robot searches for corresponding keywords from the text files and achieves the confidence of multiple objects in the scene image. Then, the object with the maximum confidence is selected as the target. The results show that the robot can accurately distinguish objects with arbitrary shape and category, and it can effectively solve the problem of object recognition in home environments.

scholarly journals Fast Two-Stage Computation of an Index Policy for Multi-Armed Bandits with Setup Delays

Mathematics ◽  
2020 ◽  
Vol 9 (1) ◽  
pp. 52
Author(s):  
José Niño-Mora
Keyword(s):  
Numerical Study ◽  
Arithmetic Operation ◽  
Bandit Problem ◽  
Index Policy ◽  
Two Stage ◽  
Second Stage ◽  
Whittle Index ◽  
Set Up ◽  
Computing Method ◽  
Special Case

We consider the multi-armed bandit problem with penalties for switching that include setup delays and costs, extending the former results of the author for the special case with no switching delays. A priority index for projects with setup delays that characterizes, in part, optimal policies was introduced by Asawa and Teneketzis in 1996, yet without giving a means of computing it. We present a fast two-stage index computing method, which computes the continuation index (which applies when the project has been set up) in a first stage and certain extra quantities with cubic (arithmetic-operation) complexity in the number of project states and then computes the switching index (which applies when the project is not set up), in a second stage, with quadratic complexity. The approach is based on new methodological advances on restless bandit indexation, which are introduced and deployed herein, being motivated by the limitations of previous results, exploiting the fact that the aforementioned index is the Whittle index of the project in its restless reformulation. A numerical study demonstrates substantial runtime speed-ups of the new two-stage index algorithm versus a general one-stage Whittle index algorithm. The study further gives evidence that, in a multi-project setting, the index policy is consistently nearly optimal.

Sign in / Sign up

Export Citation Format

Share Document