Robust multiscale stereo matching from fundus images with radiometric differences

A robust multiscale stereo matching algorithm is proposed to find reliable correspondences between low contrast and weakly textured retinal image pairs with radiometric differences. Existing algorithms designed to deal with piecewise planar surfaces with distinct features and Lambertian reflectance do not apply in applications such as 3D reconstruction of medical images including stereo retinal images. In this paper, robust pixel feature vectors are formulated to extract discriminative features in the presence of noise in scale space, through which the response of low-frequency mechanisms alter and interact with the response of high-frequency mechanisms. The deep structures of the scene are represented with the evolution of disparity estimates in scale space, which distributes the matching ambiguity along the scale dimension to obtain globally coherent reconstructions. The performance is verified both qualitatively by face validity and quantitatively on our collection of stereo fundus image sets with ground truth, which have been made publicly available as an extension of standard test images for performance evaluation.     

A characterization of span program size and improved lower bounds for monotone span programs

We give a characterization of span program size by a combinatorial-algebraic measure. The measure we consider is a generalization of a measure on covers which has been used to prove lower bounds on formula size and has also been studied with respect to communication complexity.?In the monotone case our new methods yield lower bounds for the monotone span program complexity of explicit Boolean functions in n variables over arbitrary fields, improving the previous lower bounds on monotone span program size. Our characterization of span program size implies that any matrix with superpolynomial separation between its rank and cover number can be used to obtain superpolynomial lower bounds on monotone span program size. We also identify a property of bipartite graphs that is suficient for constructing Boolean functions with large monotone span program complexity. Received: September 30, 2000.     

Data Refinement of Remote Procedures

Recently the action systems formalism for parallel and distributed systems has been extended with the procedure mechanism. This gives us a very general framework for describing different communication paradigms for action systems, e.g. remote procedure calls. Action systems come with a design methodology based on the refinement calculus. Data refinement is a powerful technique for refining action systems. In this paper we will develop a theory and proof rules for the refinement of action systems that communicate via remote procedures based on the data refinement approach. The proof rules we develop are compositional so that modular refinement of action systems is supported. As an example we will especially study the atomicity refinement of actions. This is an important refinement strategy, as it potentially increases the degree of parallelism in an action system. Received February 1999 / Accepted in revised form July 2000     

Artificial Intelligence and Environmental Decision Support Systems

An effective protection of our environment is largely dependent on the quality of the available information used to make an appropriate decision. Problems arise when the quantities of available information are huge and nonuniform (i.e., coming from many different disciplines or sources) and their quality could not be stated in advance. Another associated issue is the dynamical nature of the problem. Computers are central in contemporary environmental protection in tasks such as monitoring, data analysis, communication, information storage and retrieval, so it has been natural to try to integrate and enhance all these tasks with Artificial Intelligence knowledge-based techniques. This paper presents an overview of the impact of Artificial Intelligence techniques on the definition and development of Environmental Decision Support Systems (EDSS) during the last fifteen years. The review highlights the desirable features that an EDSS must show. The paper concludes with a selection of successful applications to a wide range of environmental problems.     

Ab initio determination of heavy oxide perovskite related structures from precession electron diffraction data

Two complex perovskite-related structures were solved by ab initio from precession electron diffraction intensities. Structure models were firstly derived from HREM images and than have been confirmed independently using two and three-dimensional sets of precession intensities. Patterson techniques prove to be effective for ab initio structure resolution, specially in case of projections with no overlapping atoms. Quality of precession intensity data may be suitable enough to resolve unknown heavy oxide structures.     

SnapPaste: an interactive technique for easy mesh composition

Editing and manipulation of existing 3D geometric objects are a means to extend their repertoire and promote their availability. Traditionally, tools to compose or manipulate objects defined by 3D meshes are in the realm of artists and experts. In this paper, we introduce a simple and effective user interface for easy composition of 3D mesh-parts for non-professionals. Our technique borrows from the cut-and-paste paradigm where a user can cut parts out of existing objects and paste them onto others to create new designs. To assist the user attach objects to each other in a quick and simple manner, many applications in computer graphics support the notion of “snapping”. Similarly, our tool allows the user to loosely drag one mesh part onto another with an overlap, and lets the system snap them together in a graceful manner. Snapping is accomplished using our Soft-ICP algorithm which replaces the global transformation in the ICP algorithm with a set of point-wise locally supported transformations. The technique enhances registration with a set of rigid to elastic transformations that account for simultaneous global positioning and local blending of the objects. For completeness of our framework, we present an additional simple mesh-cutting tool, adapting the graph-cut algorithm to meshes.     

Direct magnetic problem solved by quaternion analog of 3-D Cauchy-Riemann system

Contents By applying the quaternion variant of the Cauchy integral formula the general solution of the direct magnetic problem is derived. The applicability of the method presented here is shown by investigating and calculating the outer field of a analytically magnetized sphere.

---

Die Lösung der direkten Aufgabe der Magnetik mit Hilfe des Quaternionen Analogons des 3-D Cauchy-Riemann Systems

Übersicht Die allgemeine Lösung der direkten Aufgabe der Magnetik wird mit Hilfe der Quaternionenvariante des Cauchy-Integrals abgeleitet. Die Anwendbarkeit der vorgestellten, Methode wird am Beispiel des berechneten äußeren magnetischen Feldes einer analytisch magnetisierten Kugel untersucht.

     

Weaving patterns of lines and line segments in space

Aweaving W is a simple arrangement of lines (or line segments) in the plane together with a binary relation specifying which line is above the other. A system of lines (or line segments) in 3-space is called arealization ofW, if its projection into the plane isW and the above-below relations between the lines respect the specifications. Two weavings are equivalent if the underlying arrangements of lines are combinatorially equivalent and the above-below relations are the same. An equivalence class of weavings is said to be aweaving pattern. A weaving pattern isrealizable if at least one element of the equivalence class has a three-dimensional realization. A weaving (pattern)W is calledperfect if, along each line (line segment) ofW, the lines intersecting it are alternately above and below. We prove that (i) a perfect weaving pattern ofn lines is realizable if and only ifn 3, (ii) a perfect m byn weaving pattern of line segments (in a grid-like fashion) is realizable if and only if min(m, n) 3, (iii) ifn is sufficiently large, then almost all weaving patterns ofn lines are nonrealizable.Jànos Pach has been supported in part by Hungarian NFSR Grant 1812, NSF Grant CCR-8901484, and the Center for Discrete Mathematics and Theoretical Computer Science (DIMACS), a National Science Foundation Science and Technology Center, under NSF Grant STC88-09648. Richard Pollack has been supported in part by NSA Grant MDA904-89-H-2030, NSF Grants DMS-85-01947 and CCR-8901484, and DIMACS. Emo Welzl has been supported in part by the ESPRIT II Basic Research Actions Program of the EC under Contract No. 3075 (project ALCOM) and DIMACS.     

Optimizations of the naïve-Bayes classifier for the prognosis of B-Chronic Lymphocytic Leukemia incorporating flow cytometry data

Prognosis of B-Chronic Lymphocytic Leukemia (B-CLL) remains a challenging problem in medical research and practice. While the parameters obtained by flow cytometry analysis form the basis of the diagnosis of the disease, the question whether these parameters offer additional prognostic information still remains open. In this work, we attempt to provide computer-assisted support to the clinical experts of the field, by deploying a classification system for B-CLL multiparametric prognosis that combines various heterogeneous (clinical, laboratory and flow cytometry) parameters associated with the disease. For this purpose, we employ the na?ve-Bayes classifier and propose an algorithm that improves its performance. The algorithm discretizes the continuous classification attributes (candidate prognostic parameters) and selects the most useful subset of them to optimize the classification accuracy. Thus, in addition to the high classification accuracy achieved, the proposed approach also suggests the most informative parameters for the prognosis. The experimental results demonstrate that the inclusion of flow cytometry parameters in our system improves prognosis.     

Behavioral adaptation of information systems through goal models

Customizing software to perfectly fit individual needs is becoming increasingly important in information systems engineering. Users want to be able to customize software behavior through reference to terms familiar to their diverse needs and experience. We present a requirements-driven approach to behavioral customization of software systems. Goal models are constructed to represent alternative behaviors that users can exhibit to achieve their goals. Customization information is then added to restrict the space of possibilities to those that fit specific users, contexts, or situations. Meanwhile, elements of the goal models are mapped to units of source code. This way, customization preferences posed at the requirements level are directly translated into system customizations. Our approach, which we apply to an on-line shopping cart system and an automated teller machine simulator, does not assume adoption of a particular development methodology, platform, or variability implementation technique and keeps the reasoning computation overhead from interfering with the execution of the configured application.