scholarly journals Unsteady State Lightweight Iris Certification Based on Multi-Algorithm Parallel Integration

Algorithms ◽  
2019 ◽  
Vol 12 (9) ◽  
pp. 194 ◽  
Author(s):  
Shuai ◽  
Yuanning ◽  
Xiaodong ◽  
Kuo ◽  
Tong ◽  
...  

Aimed at the one-to-one certification problem of unsteady state iris at different shooting times, a multi-algorithm parallel integration general model structure is proposed in this paper. The iris in the lightweight constrained state affected by defocusing, deflection, and illumination is taken as the research object, the existing algorithms are combined into the model structure effectively, and a one-to-one certification algorithm for lightweight constrained state unsteady iris was designed based on multi-algorithm integration and maximum trusted decision. In this algorithm, a sufficient number of iris internal feature points from the unstable state texture were extracted as effective iris information through the image processing layer composed of various filtering processing algorithms, thereby eliminating defocused interference. In the feature recognition layer, iris deflection interference was excluded by the improved methods of Gabor and Hamming and Haar and BP for the stable features extracted by the image processing layer, and two certification results were obtained by means of parallel recognition. The correct number of certifications for an algorithm under a certain lighting condition were counted. The method with the most correct number was set as the maximum trusted method under this lighting condition, and the results of the maximum trusted method were taken as the final decision, thereby eliminating the effect of illumination. Experiments using the JLU and CASIA iris libraries under the prerequisites in this paper show that the correct recognition rate of the algorithm can reach a high level of 98% or more, indicating that the algorithm can effectively improve the accuracy of the one-to-one certification of lightweight constrained state unsteady iris. Compared with the latest architecture algorithms, such as CNN and deep learning, the proposed algorithm is more suitable for the prerequisites presented in this paper, which has good environmental inclusiveness and can better improve existing traditional algorithms’ effectiveness through the design of a parallel integration model structure.

Author(s):  
O. Kuebler ◽  
H. Gross

The complementarity of periodic features on the fracture faces of the yeast plasmalemma has been established to a resolution 20Å by ultrahigh vaccum (UHV, p≤10-9Torr) freeze-fracturing at -196°C and subsequent digital image processing. The structural record is considered reliable because of the one-to-one correspondence of volcano-like practicles on the plasmic fracture face (PF) and of ring-like depressions on the extraplasmic face (EF). The PF-particles were tentatively related to intrinsic proteins. Nevertheless experience with specimens which are biochemically and structurally more well defined than yeast appears indispensable in learing how to interpret the structural record. For this purpose the purple membrane of Halobacterium halobium appeared attractive.


1994 ◽  
Vol 22 (2) ◽  
pp. 99-120 ◽  
Author(s):  
T. B. Rhyne ◽  
R. Gall ◽  
L. Y. Chang

Abstract An analytical membrane model is used to study how wheel imperfections are converted into radial force variation of the tire-wheel assembly. This model indicates that the radial run-out of the rim generates run-out of the tire-wheel assembly at slightly less than the one to one ratio that was expected. Lateral run-out of the rim is found to generate radial run-out of the tire-wheel assembly at a ratio that is dependent on the tire design and the wheel width. Finite element studies of a production tire validate and quantify the results of the membrane model. Experiments using a specially constructed precision wheel demonstrate the behavior predicted by the models. Finally, a population of production tires and wheels show that the lateral run-out of the rims contribute a significant portion to the assembly radial force variation. These findings might be used to improve match-mounting results by taking lateral rim run-out into account.


1982 ◽  
Vol 5 (3-4) ◽  
pp. 279-299
Author(s):  
Alberto Pettorossi

In this paper we consider combinators as tree transducers: this approach is based on the one-to-one correspondence between terms of Combinatory Logic and trees, and on the fact that combinators may be considered as transformers of terms. Since combinators are terms themselves, we will deal with trees as objects to be transformed and tree transformers as well. Methods for defining and studying tree rewriting systems inside Combinatory Weak Reduction Systems and Weak Combinatory Logic are also analyzed and particular attention is devoted to the problem of finiteness and infinity of the generated tree languages (here defined). This implies the study of the termination of the rewriting process (i.e. reduction) for combinators.


2005 ◽  
Vol 7 (2) ◽  
pp. 139-163 ◽  
Author(s):  
Richard L. Venezky

Philologists, linguists, and educators have insisted for several centuries that the ideal orthography has a one-to-one correspondence between grapheme and phoneme. Others, however, have suggested deviations for such functions as distinguishing homophones, displaying popular alternative spellings, and retaining morpheme identity. If, indeed, the one-to-one ideal were accepted, the International Phonetic Alphabet should become the orthographic standard for all enlightened nations, yet the failure of even a single country to adopt it for practical writing suggests that other factors besides phonology are considered important for a writing system. Whatever the ideal orthography might be, the practical writing systems adopted upon this earth reflect linguistic, psychological, and cultural considerations. Knowingly or unknowingly, countries have adopted orthographies that favour either the early stages of learning to read or the advanced stages, that is, the experienced reader. The more a system tends towards a one-to-one relationship between graphemes and phonemes, the more it assists the new reader and the non-speaker of the language while the more it marks etymology and morphology, the more it favours the experienced reader. The study of psychological processing in reading demonstrates that human capacities for processing print are so powerful that complex patterns and irregularities pose only a small challenge. Orthographic regularity is extracted from lexical input and used to recognise words during reading. To understand how such a system develops, researchers should draw on the general mechanisms of perceptual learning.


2000 ◽  
Vol 11 (3) ◽  
pp. 261-264 ◽  
Author(s):  
Tricia S. Clement ◽  
Thomas R. Zentall

We tested the hypothesis that pigeons could use a cognitively efficient coding strategy by training them on a conditional discrimination (delayed symbolic matching) in which one alternative was correct following the presentation of one sample (one-to-one), whereas the other alternative was correct following the presentation of any one of four other samples (many-to-one). When retention intervals of different durations were inserted between the offset of the sample and the onset of the choice stimuli, divergent retention functions were found. With increasing retention interval, matching accuracy on trials involving any of the many-to-one samples was increasingly better than matching accuracy on trials involving the one-to-one sample. Furthermore, following this test, pigeons treated a novel sample as if it had been one of the many-to-one samples. The data suggest that rather than learning each of the five sample-comparison associations independently, the pigeons developed a cognitively efficient single-code/default coding strategy.


1970 ◽  
Vol 70 (11) ◽  
pp. 2450
Author(s):  
Ilse S. Wolff ◽  
Joyce Travelbee

2014 ◽  
Vol 687-691 ◽  
pp. 3861-3868
Author(s):  
Zheng Hong Deng ◽  
Li Tao Jiao ◽  
Li Yan Liu ◽  
Shan Shan Zhao

According to the trend of the intelligent monitoring system, on the basis of the study of gait recognition algorithm, the intelligent monitoring system is designed based on FPGA and DSP; On the one hand, FPGA’s flexibility and fast parallel processing algorithms when designing can be both used to avoid that circuit can not be modified after designed; On the other hand, the advantage of processing the digital signal of DSP is fully taken. In the feature extraction and recognition, Zernike moment is selected, at the same time the system uses the nearest neighbor classification method which is more mature and has good real-time performance. Experiments show that the system has high recognition rate.


2014 ◽  
Vol 47 (1) ◽  
pp. 46-62 ◽  
Author(s):  
Mark Warschauer ◽  
Binbin Zheng ◽  
Melissa Niiya ◽  
Shelia Cotten ◽  
George Farkas

Sign in / Sign up

Export Citation Format

Share Document