High-resolution fingerprint identification system (HRFIS) has become a hot topic in the field of academic research. Compared to traditional automatic fingerprint identification system, HRFIS reduces the risk of being ...
详细信息
High-resolution fingerprint identification system (HRFIS) has become a hot topic in the field of academic research. Compared to traditional automatic fingerprint identification system, HRFIS reduces the risk of being faked by using level 3 features, such as pores, which cannot be detected in lower resolution images. However, there is a serious problem in HRFIS: there are hundreds of sweat pores in one fingerprint image, which will spend a considerable amount of time for direct fingerprint matching. The authors propose a method to match pores in two fingerprint images based on deterministic annealing algorithm. In this method, fingerprints are aligned using singular points. Then minutiae are matched based on the alignment result. To reduce the impact of deformation, they build a convex hull for each of these fingerprints. Pores in these convex hulls are used for matching. In the experiments, their method is compared with random sample consensus method, minutia and ICP-based method, and direct pore matching method. The results show that the proposed method is more efficient.
Nowadays, a promising solution to the demand for high capacity wireless services is provided by the high altitude platforms (HAPs), which can exploit the advantages of both satellites and terrestrial networks. However...
详细信息
ISBN:
(纸本)9781424492688
Nowadays, a promising solution to the demand for high capacity wireless services is provided by the high altitude platforms (HAPs), which can exploit the advantages of both satellites and terrestrial networks. However, due to the limited energy of the communication nodes on HAPs, energy-efficient deployment of airships for HAPs becomes increasingly important. In this paper, a heterogeneous network system comprising mission layer, HAP layer and satellite layer is presented. In the system, the mission space is partitioned according to the assumption of one-hop relay which guarantees that all the users are effectively covered by airships in HAP layer. Then, we model an expected energy consumption function of airships, which is minimized using deterministic annealing algorithm. Furthermore, the optimal solution to this approach is analyzed and proved. Simulation results demonstrate that the proposed method can get the goal of the minimum energy consumption and achieve a near optimal deployment of airships.
A fast and robust front-view object location algorithm based on point pattern matching is proposed. It transforms the problem of front-view object location to the problem of matching between a 2-d point set and a 3-d ...
详细信息
A fast and robust front-view object location algorithm based on point pattern matching is proposed. It transforms the problem of front-view object location to the problem of matching between a 2-d point set and a 3-d point set. The matching matrix and the transformation parameter are solved through minimizing the object function restricted bi-directionally by matching one to one in the two point sets. The fuzzy degree of matching matrix is controlled by the temperature of deterministic annealing algorithm, which improves the robustness of the algorithm and reduces the possibility of getting trapped in local minima. The effectiveness and robustness of algorithm are indicated through experiments.
We have proposed an optimization method for a combinatorial optimization problem using replicator equations. To improve the solution further, a deterministic annealing algorithm may be applied. During the annealing pr...
详细信息
We have proposed an optimization method for a combinatorial optimization problem using replicator equations. To improve the solution further, a deterministic annealing algorithm may be applied. During the annealing process, bifurcations of equilibrium solutions will occur and affect the performance of the deterministic annealing algorithm. In this paper, the bifurcation structure of the proposed model is analyzed in detail. It is shown that only pitchfork bifurcations occur in the annealing process, and the solution obtained by the annealing is the branch uniquely connected with the uniform solution. It is also shown experimentally that in many cases, this solution corresponds to a good approximate solution of the optimization problem. Based on the results, a deterministic annealing algorithm is proposed and applied to the quadratic assignment problem to verify its performance. (C) 2001 Elsevier Science B.V. All rights reserved.
暂无评论