Computer and Robot Vision Vol. 1, by R.M. Haralick and Linda G. Shapiro, Addison-Wesley, 1992, ISBN 0-201-10887-1.

Computer and Robot Vision

Computational geometry

http://user.it.uu.se/~jarst116/slides/week4.pdf

Graph-Based Algorithms for Boolean Function Manipulation

Laboratory-based courses play a critical role in scientific education. Automation is changing the nature of these laboratories, and there is a long-running debate about the value of hands-on versus simulated laboratories. In addition, the introduction of remote laboratories adds a third category to the debate. Through a review of the literature related to these labs in education, the authors draw several conclusions about the state of current research. The debate over different technologies is confounded by the use of different educational objectives as criteria for judging the laboratories: Hands-on advocates emphasize design skills, while remote lab advocates focus on conceptual understanding. We observe that the boundaries among the three labs are blurred in the sense that most laboratories are mediated by computers, and that the psychology of presence may be as important as technology. We also discuss areas for future research.

/pdf/hands-on-simulated-and-remote-laboratories-a-comparative-3v7rg9fjcz.pdf

Hands-on, simulated, and remote laboratories: A comparative literature review

Morphometric tools for landmark data: geometry and biology

The recent emergence of lab-on-a-chip (LoC) technology has led to a paradigm shift in many healthcare-related application areas, e.g., point-of-care clinical diagnostics, high-throughput sequencing, and proteomics. A promising category of LoCs is digital microfluidic (DMF)-based biochips, in which nanoliter-volume fluid droplets are manipulated on a 2-D electrode array. A key challenge in designing such chips and mapping lab-bench protocols to a LoC is to carry out the dilution process of biochemical samples efficiently. As an optimization and automation technique, we present a dilution/mixing algorithm that significantly reduces the production of waste droplets. This algorithm takes O(n) time to compute at most n sequential mix/split operations required to achieve any given target concentration with an error in concentration factor less than [1/(2n)]. To implement the algorithm, we design an architectural layout of a DMF-based LoC consisting of two O(n)-size rotary mixers and O(n) storage electrodes. Simulation results show that the proposed technique always yields nonnegative savings in the number of waste droplets and also in the total number of input droplets compared to earlier methods.

Optimization of Dilution and Mixing of Biochemical Samples Using Digital Microfluidic Biochips

The Illinois Scan Architecture (ILS) consists of several scan path segments and is useful in reducing test application time and test data volume for high density chips. In this paper, we propose a scheme of layout-aware as well as coverage-driven ILS design. The partitioning of the flip-flops into ILS segments is determined by their geometric locations, whereas the set of the flip-flops to be placed in parallel is determined by the minimum incompatibility relations among the corresponding bits of a test set, to enhance fault coverage in broadcast mode. As a result, the number of serial test patterns also reduces.

A Routing-Aware ILS Design Technique

Several existing digital straight line segment (DSS) recognition algorithms can be used to determine the digital straightness of a given one-pixel-thick digital curve. Because of the inherent geometric constraints of digital straightness, these algorithms often produce a large number of segments to cover a given digital curve representing a real-life object/image. Thus, a curve segment, which is not exactly digitally straight but appears to be visually straight, is fragmented into multiple DSS when these algorithms are run. In this paper, a new concept of approximate straightness is introduced by relaxing certain conditions of DSS, and an algorithm is described to extract those segments from a digital curve. The number of such segments required to cover the curve is found to be significantly fewer than that of the exact DSS cover. As a result, the data set required for representing a curve also reduces to a large extent. The extracted set of segments can further be combined to determine a compact polygonal approximation of a digital curve based on certain approximation criteria and a specified error tolerance. The proposed algorithm involves only primitive integer operations and, thus, runs very fast compared to those based on exact DSS. The overall time complexity becomes linear in the number of points present in the representative set. Experimental results on several digital curves demonstrate the speed, elegance, and efficacy of the proposed method.

Fast Polygonal Approximation of Digital Curves Using Relaxed Straightness Properties

Given a set of n points in R 2 bounded within a rectangular floor F, and a rectangular plate P of specified size, we consider the following two problems: find an isothetic position of P such that it encloses (i) maximum and (ii) minimum number of points, keeping P totally contained within F. For both of these problems, a new algorithm based on interval tree data structure is presented, which runs in O(nlogn) time and consumes O(n) space. If polygonal objects of arbitrary size and shape are distributed in R 2, the proposed algorithm can be tailored for locating the position of the plate to enclose maximum or minimum number of objects with the same time and space complexity. Finally, the algorithm is extended for identifying a cuboid, i.e., a rectangular parallelepiped that encloses maximum number of polyhedral objects in R 3. Thus, the proposed technique serves as a unified paradigm for solving a general class of enclosure problems encountered in computational geometry and pattern recognition.

Bhargab B. Bhattacharya

Papers

Optimization of Dilution and Mixing of Biochemical Samples Using Digital Microfluidic Biochips

A Routing-Aware ILS Design Technique

Fast Polygonal Approximation of Digital Curves Using Relaxed Straightness Properties

A unified algorithm for finding maximum and minimum object enclosing rectangles and cuboids

Method and apparatus to reduce false minutiae in a binary fingerprint image