Review of the mathematical foundations of data fusion techniques in surface metrology

The recent proliferation of engineered surfaces, including freeform and structured surfaces, is challenging current metrology techniques. Measurement using multiple sensors has been proposed to achieve enhanced benefits, mainly in terms of spatial frequency bandwidth, which a single sensor cannot provide. When using data from different sensors, a process of data fusion is required and there is much active research in this area. In this paper, current data fusion methods and applications are reviewed, with a focus on the mathematical foundations of the subject. Common research questions in the fusion of surface metrology data are raised and potential fusion algorithms are discussed

Performance of a novel wafer scale CMOS active pixel sensor for bio-medical imaging

Recently CMOS Active Pixels Sensors (APSs) have become a valuable alternative to amorphous Silicon and Selenium Flat Panel Imagers (FPIs) in bio-medical imaging applications. CMOS APSs can now be scaled up to the standard 20 cm diameter wafer size by means of a reticle stitching block process. However despite wafer scale CMOS APS being monolithic, sources of non-uniformity of response and regional variations can persist representing a significant challenge for wafer scale sensor response. Non-uniformity of stitched sensors can arise from a number of factors related to the manufacturing process, including variation of amplification, variation between readout components, wafer defects and process variations across the wafer due to manufacturing processes. This paper reports on an investigation into the spatial non-uniformity and regional variations of a wafer scale stitched CMOS APS. For the first time a per-pixel analysis of the electro-optical performance of a wafer CMOS APS is presented, to address inhomogeneity issues arising from the stitching techniques used to manufacture wafer scale sensors. A complete model of the signal generation in the pixel array has been provided and proved capable of accounting for noise and gain variations across the pixel array. This novel analysis leads to readout noise and conversion gain being evaluated at pixel level, stitching block level and in regions of interest, resulting in a coefficient of variation ≤ 1.9%. The uniformity of the image quality performance has been further investigated in a typical X-ray application, i.e. mammography, showing a uniformity in terms of CNR among the highest when compared with mammography detectors commonly used in clinical practise. Finally, in order to compare the detection capability of this novel APS with the currently used technology (i.e. FPIs), theoretical evaluation of the Detection Quantum Efficiency (DQE) at zero-frequency has been performed, resulting in a higher DQE for this detector compared to FPIs. Optical characterization, X-ray contrast measurements and theoretical DQE evaluation suggest that a trade off can be found between the need of a large imaging area and the requirement of a uniform imaging performance, making the DynAMITe large area CMOS APS suitable for a range of bio-medical applications

Automatic Crack Detection in Built Infrastructure Using Unmanned Aerial Vehicles

This paper addresses the problem of crack detection which is essential for health monitoring of built infrastructure. Our approach includes two stages, data collection using unmanned aerial vehicles (UAVs) and crack detection using histogram analysis. For the data collection, a 3D model of the structure is first created by using laser scanners. Based on the model, geometric properties are extracted to generate way points necessary for navigating the UAV to take images of the structure. Then, our next step is to stick together those obtained images from the overlapped field of view. The resulting image is then clustered by histogram analysis and peak detection. Potential cracks are finally identified by using locally adaptive thresholds. The whole process is automatically carried out so that the inspection time is significantly improved while safety hazards can be minimised. A prototypical system has been developed for evaluation and experimental results are included.Comment: In proceeding of The 34th International Symposium on Automation and Robotics in Construction (ISARC), pp. 823-829, Taipei, Taiwan, 201

Advanced optical imaging in living embryos

Developmental biology investigations have evolved from static studies of embryo anatomy and into dynamic studies of the genetic and cellular mechanisms responsible for shaping the embryo anatomy. With the advancement of fluorescent protein fusions, the ability to visualize and comprehend how thousands to millions of cells interact with one another to form tissues and organs in three dimensions (xyz) over time (t) is just beginning to be realized and exploited. In this review, we explore recent advances utilizing confocal and multi-photon time-lapse microscopy to capture gene expression, cell behavior, and embryo development. From choosing the appropriate fluorophore, to labeling strategy, to experimental set-up, and data pipeline handling, this review covers the various aspects related to acquiring and analyzing multi-dimensional data sets. These innovative techniques in multi-dimensional imaging and analysis can be applied across a number of fields in time and space including protein dynamics to cell biology to morphogenesis

New algorithms for the dual of the convex cost network flow problem with application to computer vision

Motivated by various applications to computer vision, we consider an integer convex optimization problem which is the dual of the convex cost network flow problem. In this paper, we first propose a new primal algorithm for computing an optimal solution of the problem. Our primal algorithm iteratively updates primal variables by solving associated minimum cut problems. The main contribution in this paper is to provide a tight bound for the number of the iterations. We show that the time complexity of the primal algorithm is K ¢ T(n;m) where K is the range of primal variables and T(n;m) is the time needed to compute a minimum cut in a graph with n nodes and m edges. We then propose a primal-dual algorithm for the dual of the convex cost network flow problem. The primal-dual algorithm can be seen as a refined version of the primal algorithm by maintaining dual variables (flow) in addition to primal variables. Although its time complexity is the same as that for the primal algorithm, we can expect a better performance practically. We finally consider an application to a computer vision problem called the panoramic stitching problem. We apply several implementations of our primal-dual algorithm to some instances of the panoramic stitching problem and test their practical performance. We also show that our primal algorithm as well as the proofs can be applied to the L\-convex function minimization problem which is a more general problem than the dual of the convex cost network flow problem