Time filter

Source Type

Yub P.,Wuhan Naval University of Engineering | Yub P.,PLA Academy of Communication Command
Procedia Engineering | Year: 2012

A novel fingerprint recognition algorithm based on the probabilistic graphical model is proposed in this paper. First, minutiae in query fingerprint are viewed as random variables with the minutiae in template print as the realizations. According to the random variables, a 2-tree model is built by selecting two signal points from the query set. Second, the model is converted into a Junction Tree, and the potentials of the tree nodes are defined according to the intrinsic characters of fingerprint. After that, Junction Tree (J.T.) algorithm is performed to obtain the correspondence of the two sets of minutiae. To deal with many-to-one corresponding problem caused by the outliers, we repeat the process by exchanging two sets. Finally, the similarity of the two fingerprints is evaluated using the number of common matching pairs and the maximal posteriori probability generated by the J.T. algorithm. Experiments performed on databases of FVC2004 achieve the perfect performance. © 2011 Published by Elsevier Ltd. Source

Peng Y.,PLA Academy of Communication Command | Peng Y.,Wuhan Naval University of Engineering | Li X.,South China Sea Fleet
Proceedings of SPIE - The International Society for Optical Engineering | Year: 2013

Most minutiae-based matching algorithms consist of two phases, local match and global match. In the local phase, some corresponding pairs are obtained by comparing the affine-invariable features of minutiae. And then two images are aligned based on the candidate pairs. However, some spurious candidate pairs and the large nonlinear deformation in images lead to the failure in global match. In this paper, we proposed a novel minutiae-based matching scheme which insert a filtering step after the local match to discard the incompatible pairs and renovate the global match by dividing the whole image into small areas according to the location of the candidate pairs. Results on databases of FVC2004 validate our algorithm. Source

Zhang N.,Communication Network Technology Management Center | Chen Y.,PLA Academy of Communication Command | Xiong N.,Georgia State University | Yang L.T.,St. Francis Xavier University | And 2 more authors.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2010

Fiber optic communication transmission network is the basis for communication networks, responsible for a large number of long-distance transmissions of voice, data, images, and other business. Man-made construction, natural disasters and other unexpected events are important factors in fiber optic cable line blocking. Occasional and sudden onset also leads to the unpredictability of fiber optic cable line blocking. This paper proposes an algorithm for faults acquiring and locating on fiber optic cable line, which can effectively reduce search time and processing time of fault point, and establishes a fault point database. © Springer-Verlag Berlin Heidelberg 2010. Source

Discover hidden collaborations