Recursive filtering of images with symmetric extension

Recursive filters are widely used in image analysis due to their efficiency and simple implementation. However these filters have an initialisation problem which either produces unusable results near the image boundaries or requires costly approximate solutions such as extending the boundary manually. In this paper, we describe a method for the recursive filtering of symmetrically extended images for filters with symmetric denominator. We begin with an analysis of symmetric extensions and their effect on non-recursive filtering operators. Based on the non-recursive case, we derive a formulation of recursive filtering on symmetric domains as a linear but spatially varying implicit operator. We then give an efficient method for decomposing and solving the linear implicit system, along with a proof that this decomposition always exists. This decomposition needs to be performed only once for each dimension of the image. This yields a filtering which is both stable and consistent with the ideal infinite extension. The filter is efficient, requiring less computation than the standard recursive filtering. We give experimental evidence to verify these claims. (c) 2005 Elsevier B.V. All rights reserved.

Mixed partitions of sets of triples into small planes

We continue our study of partitions of the set of all ((v)(3)) triples chosen from a v-set into pairwise disjoint planes with three points per line. We develop further necessary conditions for the existence of partitions of such sets into copies of PG(2, 2) and copies of AG(2, 3), and deal with the cases v = 13, 14, 15 and 17. These partitions, together with those already known for v = 12, 16 and 18, then become starters for recursive constructions of further infinite families of partitions. (C) 2004 Elsevier B.V. All rights reserved.

Symmetry contaminations in reactive scattering through long-lived collision complexes

We extend our Lanczos subspace time-independent wave packet method [J. Chem. Phys. 116 (2002) 2354] to investigate the issue of symmetry contaminations for the challenging deep-well H + O-2 reaction. Our central objective is to address the issue of whether significant symmetry contamination can occur if a wavepacket initially possessing the correct O-O exchange symmetry is propagated over tens of thousands of recursive steps using a basis which does not explicitly enforce the correct symmetry, and if so how seriously this affects the results. We find that symmetry contamination does exist where the symmetry constraint is not explicitly enforced in the basis. While it affects individual resonances and the associated peak amplitudes, the overall shape of the more averaged quantities such as total reaction probabilities and vibrational branching ratios are not seriously affected. (C) 2004 Elsevier B.V. All rights reserved.

A work domain analysis framework for modelling intensive care unit patients

Work domain analysis (WDA) has been applied to a range of complex work domains, but few WDAs have been undertaken in medical contexts. One pioneering effort suggested that clinical abstraction is not based on means-ends relations, whereas another effort downplayed the role of bio-regulatory mechanisms. In this paper it is argued that bio-regulatory mechanisms that govern physiological behaviour must be part of WDA models of patients as the systems at the core of intensive care units. Furthermore it is argued that because the inner functioning of patients is not completely known, clinical abstraction is based on hypothetico-deductive abstract reasoning. This paper presents an alternative modelling framework that conforms to the broader aspirations of WDA. A modified version of the viable systems model is used to represent the patient system as a nested dissipative structure while aspects of the recognition primed decision model are used to represent the information resources available to clinicians in ways that support lsquoif...thenrsquo conceptual relations. These two frameworks come together to form the recursive diagnostic framework, which may provide a more appropriate foundation for information display design in the intensive care unit.

Robust stability of sequential multi-input multi-output quantitative feedback theory designs

This paper re-examines the stability of multi-input multi-output (MIMO) control systems designed using sequential MIMO quantitative feedback theory (QFT). In order to establish the results, recursive design equations for the SISO equivalent plants employed in a sequential MIMO QFT design are established. The equations apply to sequential MIMO QFT designs in both the direct plant domain, which employs the elements of plant in the design, and the inverse plant domain, which employs the elements of the plant inverse in the design. Stability theorems that employ necessary and sufficient conditions for robust closed-loop internal stability are developed for sequential MIMO QFT designs in both domains. The theorems and design equations facilitate less conservative designs and improved design transparency.

Hyperspace geography: Visualizing fitness landscapes beyond 4D

Human perception is finely tuned to extract structure about the 4D world of time and space as well as properties such as color and texture. Developing intuitions about spatial structure beyond 4D requires exploiting other perceptual and cognitive abilities. One of the most natural ways to explore complex spaces is for a user to actively navigate through them, using local explorations and global summaries to develop intuitions about structure, and then testing the developing ideas by further exploration. This article provides a brief overview of a technique for visualizing surfaces defined over moderate-dimensional binary spaces, by recursively unfolding them onto a 2D hypergraph. We briefly summarize the uses of a freely available Web-based visualization tool, Hyperspace Graph Paper (HSGP), for exploring fitness landscapes and search algorithms in evolutionary computation. HSGP provides a way for a user to actively explore a landscape, from simple tasks such as mapping the neighborhood structure of different points, to seeing global properties such as the size and distribution of basins of attraction or how different search algorithms interact with landscape structure. It has been most useful for exploring recursive and repetitive landscapes, and its strength is that it allows intuitions to be developed through active navigation by the user, and exploits the visual system's ability to detect pattern and texture. The technique is most effective when applied to continuous functions over Boolean variables using 4 to 16 dimensions.