Random local region descriptor (RLRD): A new method for fixed-length feature representation of fingerprint image and its application to template protection

2012 ◽  
Vol 28 (1) ◽  
pp. 236-243 ◽  
Author(s):  
Eryun Liu ◽  
Heng Zhao ◽  
Jimin Liang ◽  
Liaojun Pang ◽  
Hongtao Chen ◽  
...  
Keyword(s):  
Local Region ◽  
Feature Representation ◽  
New Method ◽  
Fingerprint Image ◽  
Fixed Length ◽  
Template Protection ◽  
Region Descriptor

scholarly journals A Novel Point Cloud Encoding Method Based on Local Information for 3D Classification and Segmentation

Sensors ◽  
2020 ◽  
Vol 20 (9) ◽  
pp. 2501 ◽  
Author(s):  
Yanan Song ◽  
Liang Gao ◽  
Xinyu Li ◽  
Weiming Shen
Keyword(s):  
Deep Learning ◽  
Point Cloud ◽  
Semantic Segmentation ◽  
Local Information ◽  
Local Region ◽  
Feature Representation ◽  
Learning Network ◽  
Feature Representations ◽  
Encoding Method ◽  
Deep Learning Network

Deep learning is robust to the perturbation of a point cloud, which is an important data form in the Internet of Things. However, it cannot effectively capture the local information of the point cloud and recognize the fine-grained features of an object. Different levels of features in the deep learning network are integrated to obtain local information, but this strategy increases network complexity. This paper proposes an effective point cloud encoding method that facilitates the deep learning network to utilize the local information. An axis-aligned cube is used to search for a local region that represents the local information. All of the points in the local region are available to construct the feature representation of each point. These feature representations are then input to a deep learning network. Two well-known datasets, ModelNet40 shape classification benchmark and Stanford 3D Indoor Semantics Dataset, are used to test the performance of the proposed method. Compared with other methods with complicated structures, the proposed method with only a simple deep learning network, can achieve a higher accuracy in 3D object classification and semantic segmentation.

scholarly journals The method of vicinity minutiae decomposition with higher level graphs for fingerprint verification

2021 ◽  
pp. 92-102
Author(s):  
Sergiy Rassomakhin ◽  
Olha Melkozerova ◽  
Oleksii Nariezhnii
Keyword(s):  
Real Number ◽  
Classical Method ◽  
Rejection Rate ◽  
New Method ◽  
Fingerprint Verification ◽  
Biometric Technology ◽  
Local Structures ◽  
Biometric Template ◽  
Device Applications ◽  
Template Protection

The subject matter of the paper is the development of fingerprint local structures based on the new method of the minutia vicinity decomposition (MVD) for the solution to the task of fingerprint verification. It is an essential task because it is produced attempts to introduce biometric technology in different areas of social and state life: criminology, access control system, mobile device applications, banking. The goal is to develop real number vectors that can respond to criteria for biometric template protection schemes such as irreversibility with the corresponding accuracy of equal error rate (EER). The problem to be solved is the problem of accuracy in the case of verification because there are false minutiae, disappearing of truth minutiae and there are also linear and angular deformations. The method is the new method of MVD that used the level of graphs with many a point from 7 to 3. This scheme of decomposition is shown in this paper; such a variant of decomposition is never used in science articles. The following results were obtained: description of a new method for fingerprint verification. The new metric for creating vectors of real numbers were suggested – a minimal path for points in the graphs. Also, the algorithm for finding out minimal paths for points was proposed in the graphs because the classic algorithm has a problem in some cases with many points being 6. These problems are crossing and excluding arcs are in the path. The way of sorting out such problems was suggested and examples are given for several points are 20. Results of false rejection rate (FRR), false acceptance rate (FAR), EER are shown in the paper. In this paper, the level of EER is 33 % with full search. 78400 false and 1400 true tests were conducted. The method does not use such metrics as distances and angles, which are used in the classical method of MVD and will be used in future papers. This result is shown for total coincidences of real number, not a similarity that it is used at verifications. It is a good result in this case because the result from the method index-of-max is 40 %.

scholarly journals Method of protecting software code from analysis by obfuscation means

2020 ◽  
Vol 69 (4) ◽  
Author(s):  
A. P. Bondarchuk ◽  
◽  
Ya. I. Kornaga ◽  
M. Yu. Bazaliy ◽  
P. A. Serhiyenko ◽  
...  
Keyword(s):  
Mixed Strategy ◽  
Optimization Problems ◽  
New Method ◽  
Lexical Analysis ◽  
Program Code ◽  
Code Obfuscation ◽  
Fixed Length ◽  
Fixed Set ◽  
Software Code

The considered method of program code protection with the use of obfuscation mechanisms allows to confuse the code during development and refactoring. This method protects against decompilation methods that can be applied both manually and automatically. The aim of the study is to develop a method of obfuscating software code to provide protection against decompilation. To achieve this goal, the following tasks are solved: analyzed algorithms of deobfuscation in various practical methods; a new method of obfuscating program code is proposed; submit obfuscated code. The main stages of the proposed approach to obfuscation of programs are formulated: lexical analysis; code destructuring; code obfuscation; obfuscation of variables; obfuscation of constants. Different strategies for the synthesis of obfuscated identifiers are defined: generation of names, consisting of admissible random (pseudo-random) symbols, length from the set interval (fixed length); generating names consisting of a certain number of repeated valid characters, in conditions where the plurality of characters is specified and the specified length of the lengths of the identifiers; mixed strategy with equal choice of strategies 1 and 2. Two optimization problems are formulated: the task of minimizing the number of operations when generating a given set of constants with a fixed set of directly defined constants; the task of minimizing the number of directly defined constants among the options with minimal complexity of formulas. The proposed approach can be used in programs that have a number of routines with the same interface. In this case, regardless of the complexity of implementation, the code of each subroutine can be converted into destructured code. After that, it is possible to calculate the total number of feasible operators, taking into account (operator) output for all routines.

DSAR: A New Segmentation Scheme for Input Buffered Switches

2010 ◽  
Vol 159 ◽  
pp. 682-685
Author(s):  
Zhi Jiang Gao ◽  
Hua Xin Zeng ◽  
Yu Xia
Keyword(s):  
Significant Loss ◽  
Variable Length ◽  
New Method ◽  
Traffic Model ◽  
Variable Size ◽  
Delay Performance ◽  
Fixed Length ◽  
Segment Size ◽  
Cell Merging ◽  
Speed Up

Input Buffered switches can not directly deal with variable size packets. The variable length packets need to be segmented into fixed length cells before scheduling. Then segmentation and reassembly (SAR) must be used. The traditional SAR scheme can lead to significant loss of fabric bandwidth due to the padding bytes, which requires speed up in switch fabric to compensate for this bandwidth loss. The improved scheme called cell merging can reduce the bandwidth loss greatly but it has low scalability and it is difficult to select suitable merging size. In this paper, we propose a new method of SAR for Input buffered switches using the queue information of switches and can adjust the segment size dynamically. New scheme is suitable for different traffic model and can provide an excellent delay performance. We evaluate DSAR scheme using simulation, the results show that it outperforms existing segmentation schemes in Input Buffered switches.

Sign in / Sign up

Export Citation Format

Share Document