Object Recognition By Alignment Using Invariant Projections of Planar Surfaces

In order to recognize an object in an image, we must determine the best transformation from object model to the image. In this paper, we show that for features from coplanar surfaces which undergo linear transformations in space, there exist projections invariant to the surface motions up to rotations in the image field. To use this property, we propose a new alignment approach to object recognition based on centroid alignment of corresponding feature groups. This method uses only a single pair of 2D model and data. Experimental results show the robustness of the proposed method against perturbations of feature positions.

Robust and Efficient 3D Recognition by Alignment

Alignment is a prevalent approach for recognizing 3D objects in 2D images. A major problem with current implementations is how to robustly handle errors that propagate from uncertainties in the locations of image features. This thesis gives a technique for bounding these errors. The technique makes use of a new solution to the problem of recovering 3D pose from three matching point pairs under weak-perspective projection. Furthermore, the error bounds are used to demonstrate that using line segments for features instead of points significantly reduces the false positive rate, to the extent that alignment can remain reliable even in cluttered scenes.

Information Processing and Transmission in Cellular Automata

A cellular automaton is an iterative array of very simple identical information processing machines called cells. Each cell can communicate with neighboring cells. At discrete moments of time the cells can change from one state to another as a function of the states of the cell and its neighbors. Thus on a global basis, the collection of cells is characterized by some type of behavior. The goal of this investigation was to determine just how simple the individual cells could be while the global behavior achieved some specified criterion of complexity ??ually the ability to perform a computation or to reproduce some pattern. The chief result described in this thesis is that an array of identical square cells (in two dimensions), each cell of which communicates directly with only its four nearest edge neighbors and each of which can exist in only two states, can perform any computation. This computation proceeds in a straight forward way. A configuration is a specification of the states of all the cells in some area of the iterative array. Another result described in this thesis is the existence of a self-reproducing configuration in an array of four-state cells, a reduction of four states from the previously known eight-state case. The technique of information processing in cellular arrays involves the synthesis of some basic components. Then the desired behaviors are obtained by the interconnection of these components. A chapter on components describes some sets of basic components. Possible applications of the results of this investigation, descriptions of some interesting phenomena (for vanishingly small cells), and suggestions for further study are given later.

A new cellular model for in vitro biocompatibility evaluation of microcapsule materials

Fibrosis caused by the host response to long-term transplanted microcapsules and the limitation of traditional L929 cell model for biocompatibility testing inspire the development of an assay of biocompatibility based on macrophage behavior. In this paper, the human monocytic cell line THP-1 was utilized for biocompatibility evaluation of microcapsule materials. The cell viability and secretion of nitric oxide (NO) and cytokines served as index of biocompatibility were assayed. It was found that the evaluated microcapsule materials had no effect on the stimulation of NO and cytokines secretion, which meant that these materials were biocompatible. Furthermore, it suggests the THP-1 cell a convenient in vitro experimental model that might be useful for long-term predictions of material biocompatibility.

Copper phthalocyanine on InSb(111)A?interface bonding, growth mode and energy band alignment

Copper phthalocyanine on InSb(111)A?interface bonding, growth mode and energy band alignment, D.A. Evans, H.J. Steiner, S. Evans, R. Middleton, T.S. Jones, S. Park, T.U. Kampen, D.R.T. Zahn, G. Cabailh and I.T. McGovern, J. Phys.: Condens. Matter, 15, S2729?S2740, (2003)

Cellular automata and non-static image processing for embodied robot systems on a massively parallel processor array

Huelse, M, Barr, D R W, Dudek, P: Cellular Automata and non-static image processing for embodied robot systems on a massively parallel processor array. In: Adamatzky, A et al. (eds) AUTOMATA 2008, Theory and Applications of Cellular Automata. Luniver Press, 2008, pp. 504-510. Sponsorship: EPSRC

Alignment of the genomes of brachypodium distachyon and temperate cereals and grasses using bacterial artificial chromosome landing with fluorescence in situ hybridization

Robert Hasterok, Agnieszka Marasek, Iain S. Donnison, Ian Armstead, Ann Thomas, Ian P. King, Elzbieta Wolny, Dominika Idziak, John Draper and Glyn Jenkins (2006). Alignment of the genomes of brachypodium distachyon and temperate cereals and grasses using bacterial artificial chromosome landing with fluorescence in situ hybridization.Genetics, 73 (1), 349-362. Sponsorship: Royal Society / BBSRC;BBSRC RAE2008

Comparative proteomics of excretory-secretory proteins released by the liver fluke Fasciola hepatica in sheep host bile and during in vitro culture ex host

Russell M. Morphew, Hazel A. Wright, E. James LaCourse, Debra J. Woods and Peter M. Brophy (2007). Comparative proteomics of excretory-secretory proteins released by the liver fluke Fasciola hepatica in sheep host bile and during in vitro culture ex host. Molecular and Cellular Proteomics, 6 (6), 963-972. Sponsorship: BBSRC / EU RAE2008

Ergodicity and Mixing Rate of One-Dimensional Cellular Automata

One-and two-dimensional cellular automata which are known to be fault-tolerant are very complex. On the other hand, only very simple cellular automata have actually been proven to lack fault-tolerance, i.e., to be mixing. The latter either have large noise probability ε or belong to the small family of two-state nearest-neighbor monotonic rules which includes local majority voting. For a certain simple automaton L called the soldiers rule, this problem has intrigued researchers for the last two decades since L is clearly more robust than local voting: in the absence of noise, L eliminates any finite island of perturbation from an initial configuration of all 0's or all 1's. The same holds for a 4-state monotonic variant of L, K, called two-line voting. We will prove that the probabilistic cellular automata Kε and Lε asymptotically lose all information about their initial state when subject to small, strongly biased noise. The mixing property trivially implies that the systems are ergodic. The finite-time information-retaining quality of a mixing system can be represented by its relaxation time Relax(⋅), which measures the time before the onset of significant information loss. This is known to grow as (1/ε)^c for noisy local voting. The impressive error-correction ability of L has prompted some researchers to conjecture that Relax(Lε) = 2^(c/ε). We prove the tight bound 2^(c1log^21/ε) ＜ Relax(Lε) ＜ 2^(c2log^21/ε) for a biased error model. The same holds for Kε. Moreover, the lower bound is independent of the bias assumption. The strong bias assumption makes it possible to apply sparsity/renormalization techniques, the main tools of our investigation, used earlier in the opposite context of proving fault-tolerance.

A Geometric Approach to Slot Alignment in Wireless Sensor Networks

Traditionally, slotted communication protocols have employed guard times to delineate and align slots. These guard times may expand the slot duration significantly, especially when clocks are allowed to drift for longer time to reduce clock synchronization overhead. Recently, a new class of lightweight protocols for statistical estimation in wireless sensor networks have been proposed. This new class requires very short transmission durations (jam signals), thus the traditional approach of using guard times would impose significant overhead. We propose a new, more efficient algorithm to align slots. Based on geometrical properties of space, we prove that our approach bounds the slot duration by only a constant factor of what is needed. Furthermore, we show by simulation that this bound is loose and an even smaller slot duration is required, making our approach even more efficient.

An alignment based similarity measure for hand detection in cluttered sign language video

Locating hands in sign language video is challenging due to a number of factors. Hand appearance varies widely across signers due to anthropometric variations and varying levels of signer proficiency. Video can be captured under varying illumination, camera resolutions, and levels of scene clutter, e.g., high-res video captured in a studio vs. low-res video gathered by a web cam in a user’s home. Moreover, the signers’ clothing varies, e.g., skin-toned clothing vs. contrasting clothing, short-sleeved vs. long-sleeved shirts, etc. In this work, the hand detection problem is addressed in an appearance matching framework. The Histogram of Oriented Gradient (HOG) based matching score function is reformulated to allow non-rigid alignment between pairs of images to account for hand shape variation. The resulting alignment score is used within a Support Vector Machine hand/not-hand classifier for hand detection. The new matching score function yields improved performance (in ROC area and hand detection rate) over the Vocabulary Guided Pyramid Match Kernel (VGPMK) and the traditional, rigid HOG distance on American Sign Language video gestured by expert signers. The proposed match score function is computationally less expensive (for training and testing), has fewer parameters and is less sensitive to parameter settings than VGPMK. The proposed detector works well on test sequences from an inexpert signer in a non-studio setting with cluttered background.

Reliable Cellular Automata with Self-Organization

In a probabilistic cellular automaton in which all local transitions have positive probability, the problem of keeping a bit of information for more than a constant number of steps is nontrivial, even in an infinite automaton. Still, there is a solution in 2 dimensions, and this solution can be used to construct a simple 3-dimensional discrete-time universal fault-tolerant cellular automaton. This technique does not help much to solve the following problems: remembering a bit of information in 1 dimension; computing in dimensions lower than 3; computing in any dimension with non-synchronized transitions. Our more complex technique organizes the cells in blocks that perform a reliable simulation of a second (generalized) cellular automaton. The cells of the latter automaton are also organized in blocks, simulating even more reliably a third automaton, etc. Since all this (a possibly infinite hierarchy) is organized in "software", it must be under repair all the time from damage caused by errors. A large part of the problem is essentially self-stabilization recovering from a mess of arbitrary-size and content caused by the faults. The present paper constructs an asynchronous one-dimensional fault-tolerant cellular automaton, with the further feature of "self-organization". The latter means that unless a large amount of input information must be given, the initial configuration can be chosen to be periodical with a small period.

Online and Offline Character Recognition Using Alignment to Prototypes

Nearest neighbor classifiers are simple to implement, yet they can model complex non-parametric distributions, and provide state-of-the-art recognition accuracy in OCR databases. At the same time, they may be too slow for practical character recognition, especially when they rely on similarity measures that require computationally expensive pairwise alignments between characters. This paper proposes an efficient method for computing an approximate similarity score between two characters based on their exact alignment to a small number of prototypes. The proposed method is applied to both online and offline character recognition, where similarity is based on widely used and computationally expensive alignment methods, i.e., Dynamic Time Warping and the Hungarian method respectively. In both cases significant recognition speedup is obtained at the expense of only a minor increase in recognition error.

Cellular and in-vitro models to assess antioxidant activities of seaweed extracts and the potential use of the extracts as ingredients

Seaweeds contain a range of antioxidant compounds such as polyphenols, carotenoids, sulphated polysaccharides and vitamins and have the potential to be used as ingredients in neutraceuticals. The antioxidant activity of crude 60% methanol extracts prepared from five Irish seaweeds, Ascophyllum nodosum, Laminaria hyperborea, Pelvetia canaliculata, Fucus vesiculosus and Fucus serratus were examined using in-vitro assays and a cell model system to determine the antioxidant activity of the extracts and their ability to protect against H2O2 and tert-BOOH-induced DNA damage and alterations in cellular antioxidant status in the human adenocarcinoma, Caco-2 cell line. To optimise the extraction of antioxidant compounds from seaweeds, an accelerated solvent extraction (ASE®) was used in combination with food grade solvents. The antioxidant activity of these extracts against H2O2 and tert-BOOH-induced DNA damage and alterations in cellular antioxidant status was also assessed. Extracts that exhibited the highest antioxidant activity, A. nodosum (100% water and 80% ethanol extracts) and F. vesiculosus (60% ethanol extract) were selected as ingredients for incorporation into fluid milk and yogurt at concentrations of 0.25% and 0.5%. The addition of the seaweed extracts to milk and yogurt did not affect the pH or shelf-life properties of the products. Seaweed addition did however significantly influence the colour properties of the milk and yogurt. Yellowness values were significantly higher in yogurts containing F. vesiculosus at both concentrations and A. nodosum (80% ethanol) at the 0.5% concentration. In milk, the F. vesiculosus (60% ethanol) and A. nodosum (80% ethanol) at both the 0.25% and the 0.5% concentrations had higher greenness and yellowness values than the milk containing A. nodosum (100% water). Sensory analysis revealed that appearance and flavour governed the overall acceptability of yogurts with the control yogurt, and yogurts containing A. nodosum (100% water) were the most preferred samples by panellists. However, in the milk trial the perception of a fishy taste was the determining factor in the negative perception of milk. The unsupplemented control and the milk containing A. nodosum (100% water) at a concentration of 0.5% were the most overall accepted milk samples by the sensory panellists. The antioxidant activity of the extracts in milk and yogurt remained stable during storage as determined by the in-vitro assays. Seaweed supplemented milk and yogurt were also subjected to an in-vitro digestion procedure which mimics the human digestive system. The milk and yogurt samples and their digestates were added to Caco-2 cells to investigate their antioxidant potential however neither the undigested or digested samples protected against H2O2-induced DNA damage in Caco-2 cells.

Hybrid integration and packaging of grating-coupled silicon photonics

This thesis covers both the packaging of silicon photonic devices with fiber inputs and outputs as well as the integration of laser light sources with these same devices. The principal challenge in both of these pursuits is coupling light into the submicrometer waveguides that are the hallmark of silicon-on-insulator (SOI) systems. Previous work on grating couplers is leveraged to design new approaches to bridge the gap between the highly-integrated domain of silicon, the Interconnected world of fiber and the active region of III-V materials. First, a novel process for the planar packaging of grating couplers with fibers is explored in detail. This technology allows the creation of easy-to-use test platforms for laser integration and also stands on its own merits as an enabling technology for next-generation silicon photonics systems. The alignment tolerances of this process are shown to be well-suited to a passive alignment process and for wafer-scale assembly. Furthermore, this technology has already been used to package demonstrators for research partners and is included in the offerings of the ePIXfab silicon photonics foundry and as a design kit for PhoeniX Software’s MaskEngineer product. After this, a process for hybridly integrating a discrete edge-emitting laser with a silicon photonic circuit using near-vertical coupling is developed and characterized. The details of the various steps of the design process are given, including mechanical, thermal, optical and electrical steps. The interrelation of these design domains is also discussed. The construction process for a demonstrator is outlined, and measurements are presented of a series of single-wavelength Fabry-Pérot lasers along with a two-section laser tunable in the telecommunications C-band. The suitability and potential of this technology for mass manufacture is demonstrated, with further opportunities for improvement detailed and discussed in the conclusion.