13266891
Unified high-level synthesis and module placement for defect-tolerant microfluidic biochips
Microfluidic biochips promise to revolutionize biosensing and clinical diagnostics. As more bioassays are executed concurrently on a biochip, system integration and design complexity are expected to increase dramatically. This problem is also identified by the 2003 ITRS document as a major system-level design challenge beyond 2009. We focus here on the automated design of droplet-based microfluidic biochips. We present a synthesis methodology that unifies operation scheduling, resource binding, and module placement for such "digital" biochips. The proposed technique, which is based on parallel recombinative simulated annealing, can also be used after fabrication to bypass defective cells in the microfluidic array. A real-life protein assay is used to evaluate the synthesis methodology.
8296105
Concurrent testing of digital microfluidics-based biochips
We present a concurrent testing methodology for detecting catastrophic faults in digital microfluidics-based biochips and investigate the related problems of test planning and resource optimization. We first show that an integer linear programming model can be used to minimize testing time for a given hardware overhead, for example, droplet dispensing sources and capacitive sensing circuitry. Due to the NP-complete nature of the problem, we also develop efficient heuristic procedures to solve this optimization problem. We apply the proposed concurrent testing methodology to a droplet-based microfluidic array that was fabricated and used to perform multiplexed glucose and lactate assays. Experimental results show that the proposed test approach interleaves test application with the biomedical assays and prevents resource conflicts. The proposed method is therefore directed at ensuring high reliability and availability of bio-MEMS and lab-on-a-chip systems, as they are increasingly deployed for safety-critical applications.
2604877
A Biometric Key-Binding and Template Protection Framework Using Correlation Filters
We describe a new framework to bind cryptographic keys with biometric signatures using correlation filters. This scheme combines correlation filter based biometric recognition with biometric key-binding while offering template protection, revocability, diversity and security. We demonstrate the effectiveness of our scheme via numerical results on the CMU-PIE face database.
23911088
Robust Ridge Following in Fingerprints
In this paper, we presented an improved approach of minutiae detection by following the ridges Our algorithm is based on the two characteristics of the ridge points on the same ridge: connectivity and randomicity Because our algorithm takes full advantage of the characteristics of the ridge points, it is robust to noise Using our algorithm, good quality ridge images can be obtained which can be used to assist minutiae-based fingerprint matching, or directly used for fingerprint matching Experimental results are included.
35785382
Multi-UCAV Cooperative Path Planning Using Improved Coevolutionary Multi-Ant-Colony Algorithm
Teams of unmanned combat aerial vehicles (UCAVs) are well suited to perform cooperative mission in hostile environment, and cooperative path planning holds great attention for improving the efficiency of multi-UCAV combating. In this paper, a mathematical formulation for cooperative path planning problem is presented based on the analysis of typical constraints in the scenario. Different from previous studies, the formulation introduces cooperation coefficient to estimate how the UCAV flight paths fulfill the cooperative constraints. Then a coevolutionary multi-ant-colony algorithm is designed and implemented to solve the above-mentioned problem, based on multi-ant-colony algorithm and coevolutionary strategy. The state transition rule and pheromone updating strategy is modified to increase the algorithm performance. Finally, the proposed method is validated to be effective and feasible to solve the cooperative constraints efficiently, and is effective for the multi-UCAV cooperative path planning problem.
207778057
Encrypted Fuzzy Vault Based on Fingerprint
13557739
A Robust Fingerprint Minutiae Matching Algorithm Based on the Support Model
A novel method to match two minutiae point-sets based on the support model we proposed is presented in this paper. In this method, coarse matching is first performed from a number of seeds, and the results are then fused to obtain a constrained corresponding relationship of minutiae in two point-sets. By using the support degree of the elements in the constrained relations, the one-to-one correspondence is finally determined by comparison of similarity of local structures. Experiments show that this algorithm is robust and can deal with the translation, rotation, distortion and outlier problems well.