A High Speed Autofocusing System for Micro System Applications

In this paper,we present a high speed autofocus system for micro system applications and design a look-up-table based autofocusing algorithm for applications when a target object is always visible,e.g.,manufacturing parts with alignment fiducials.We perform an evaluation of 24 focus measures to verify that which focus measure is the best for the look-up-table based method.From the evaluation,we find that the Chebyshev moments-based focus measure（CHEB） is the most suitable.Furthermore,we also develop a look-up-table based autofocus system that uses CHEB as the focus measure.In training phase,we offline construct a table from training images of an object that are captured at several lens distances.Each entry of table consists of focus measure computed from image and lens distance.In working phase,given an input image,the algorithm first computes the focus measure and then finds the best match focus measure from the table and looks up the corresponding lens position for moving it into the in-focus position.Our algorithm can perform autofocusing within only 2 steps of lens moving.The experiment shows that the system can perform high speed autofocusing of micro objects.

A novel and effective multi-constrained QoS routing scheme in WMNs

Multi-constrained quality of service(QoS)routing aims at finding an optimal path that satisfies a set of QoS parameters,as an NP complete problem,which is also a big challenge for wireless mesh networks(WMNs).Heuristic algorithms with polynomial and pseudo-polynomial-time complexities are often used to deal with this problem.However,existing solutions,most of which suffered either from excessive computational complexities or from low performance,were proposed only for wired networks and cannot be used directly in wireless mesh networks.In this paper,we propose a novel routing scheme based on mean field annealing(MFA-RS)to solve this problem.MFA-RS first uses a function of two QoS parameters,wireless link’s delay and transmission success rate as the cost function,and then seeks to find a feasible path by MFA.Because MFA-RS uses a set of deterministic equations to replace the stochastic process in simulated annealing(SA)and uses saddle point approximation in the calculation of the stationary probability distribution at equilibrium,the convergence time is much less than the routing scheme based on SA(SA-RS).Simulation results demonstrate that MFA-RS is an effective algorithm and is very fit for WMNs.