Application of the Extended Distance Transformation in digital image colorization

In this paper we present a novel colorization scheme that takes advantage of the modified morphological distance transform to propagate the color, scribbled by a user on the grayscale image. First, based on the scribbled image, the topological distance values are computed for each image pixel, describing its distance to the inserted color markers. These values are then complemented with the structural information and luminance changes derived from the original grayscale image. The distances are then used along with gradient based features to reproduce original image structures while propagating the new colors obtained during the additive color blending process. Extensive experiments performed on various kinds of natural images demonstrated the effectiveness of the proposed colorization method. They also showed that the main advantage of the presented algorithm is its computational speed and ability to produce visually pleasing colorization results promptly after providing the color information.     

Hierarchically Structured Surfaces Prepared by Phase Separation: Tissue Mimicking Culture Substrate

The pseudo 3D hierarchical structure mimicking in vivo microenvironment was prepared by phase separation on tissue culture plastic. For surface treatment, time-sequenced dosing of the solvent mixture with various concentrations of polymer component was used. The experiments showed that hierarchically structured surfaces with macro, meso and micro pores can be prepared with multi-step phase separation processes. Changes in polystyrene surface topography were characterized by atomic force microscopy, scanning electron microscopy and contact profilometry. The cell proliferation and changes in cell morphology were tested on the prepared structured surfaces. Four types of cell lines were used for the determination of impact of the 3D architecture on the cell behavior, namely the mouse embryonic fibroblast, human lung carcinoma, primary human keratinocyte and mouse embryonic stem cells. The increase of proliferation of embryonic stem cells and mouse fibroblasts was the most remarkable. Moreover, the embryonic stem cells express different morphology when cultured on the structured surface. The acquired findings expand the current state of knowledge in the field of cell behavior on structured surfaces and bring new technological procedures leading to their preparation without the use of problematic temporary templates or additives.     

Open-Source Model Checking

We present GMC², a software model checker for GCC, the open-source compiler from the Free Software Foundation (FSF). GMC², which is part of the GMC static-analysis and model-checking tool suite for GCC under development at SUNY Stony Brook, can be seen as an extension of Monte Carlo model checking to the setting of concurrent, procedural programming languages. Monte Carlo model checking is a newly developed technique that utilizes the theory of geometric random variables, statistical hypothesis testing, and random sampling of lassos in Büchi automata to realize a one- sided error, randomized algorithm for LTL model checking. To handle the function call/return mechanisms inherent in procedural languages such as C/C++, the version of Monte Carlo model checking implemented in GMC² is optimized for pushdown-automaton models. Our experimental results demonstrate that this approach yields an efficient and scalable software model checker for GCC.     

On the analysis of cooperation and antagonism in networks of communicating processes

We propose a new method for the analysis of cooperative and antagonistic properties of communicating finite state processes (FSPs). This algebraic technique is based on a composition operator and on the notion of possibility equivalence among FSPs. We demonstrate its utility by showing that potential blocking, termination, and lockout can be decided in polynomial time for loosely connected networks of tree FSPs. Potential blocking and termination are examples of cooperative properties, while lockout is an antagonistic one. For loosely connected networks of (the more general) acyclic FSPs, the cooperative properties become NP-complete and the antagonistic ones PSPACE-complete. For tightly coupled networks of tree FSPs, we also have NP-completeness for the cooperative properties. For the harder case of FSPs with cycles, we provide a natural extension of the method.     

Adaptive rank weighted switching filter for impulsive noise removal in color images

Journal of Real-Time Image Processing - In this paper, a novel approach to the problem of impulsive noise removal in color digital images is presented. The described switching filter is based on...     

Data flow analysis of distributed communicating processes

Data flow analysis is a technique essential to the compile-time optimization of computer programs, wherein facts relevant to program optimizations are discovered by the global propagation of facts obvious locally. This paper extends several known techniques for data flow analysis of sequential programs to the static analysis of distributed communicating processes. In particular, we present iterative algorithms for detecting unreachable program statements, and for determining the values of program expressions. The latter information can be used to place bounds on the size of variables and messages. Our main innovation is theevent spanning graph, which serves as a heuristic for ordering the nodes through which data flow information is propagated. We consider bothstatic communication, where all channel arguments are constants, and the more difficultdynamic communication, where channel arguments may be variables and channels may be passed as messages.A preliminary version of this paper appeared in the proceedings of the Sixth Annual ACM Symposium on Principles of Programming Languages, pp. 257–268, June 1979.Supported by National Science Foundation Grant NSF MCS82-00269 and the Office of Naval Research Contract N00014-80-C-0647.Supported by National Science Foundation Grants NSF DCR-8505873 and NSF CCR-8704309.     

Preliminary investigation of factors determining self-organised structures preparation in polymer layers

Factors determining creation of self-organized structures, Bénar–Marangoni cells, during the process of solvent evaporation from the polymer solution and formation of polymer film were studied. Examined parameters were temperature, temperature gradient, rate of drying, height of a liquid layer, area for film preparation, viscosity, molecular weight distribution, etc. A special apparatus, micro condensation drying system, was engineered for this study. As a model system, hydroxyethyl cellulose aqueous solution was used for its excellent film-forming ability and the tendency to self-aggregation. Experimental results, presented in a wide spectrum of self-organized patterns, show the complexity of the problem and the crucial role of molecular weight distribution of the polymer in the fixation of organized structures under highly non-equilibrium conditions.     

Integrated environments for formally well-founded design andsimulation of concurrent systems

An ongoing project concerned with the development of environments that support the specification and design of concurrent systems is reported. The project has two key aspects: an existing and working system, Clara, that supports Milner's CCS as a specification and design language; and the development of general techniques for computer-aided generation of Clara-like environments for other concurrent languages. The Clara environment is emphasized. It has two main components: support for the usage of formal techniques in the design process, and a rich and highly interactive simulation facility. A further distinguishing feature is the environment's graphical user interface which is based on a pictorial version of CCS. The semantics of CCS is defined nonprocedurally in two phases: an operational semantics given as a set of inference rules, and an algebraic semantics represented by a set of equational rules     

Local model checking and protocol analysis

This paper describes a local model-checking algorithm for the alternation-free fragment of the modal mu-calculus that has been implemented in the Concurrency Factory and discusses its application to the analysis of a real-time communications protocol. The protocol considered is RETHER, a software-based, real-time Ethernet protocol developed at SUNY at Stony Brook. Its purpose is to provide guaranteed bandwidth and deterministic, periodic network access to multimedia applications over commodity Ethernet hardware. Our model-checking results show that (for a particular network configuration) RETHER makes good on its bandwidth guarantees to real-time nodes without exposing non-real-time nodes to the possibility of starvation. Our data also indicate that, in many cases, the state-exploration overhead of the local model checker is significantly smaller than the total amount that would result from a global analysis of the protocol. In the course of specifying and verifying RETHER, we also identified an alternative design of the protocol that warranted further study due to its potentially smaller run-time overhead in servicing requests for data transmission. Again, using local model checking, we showed that this alternative design also possesses the properties of interest. This observation points out one of the often-overlooked benefits of formal verification: by forcing designers to understand their designs rigorously and abstractly, these techniques often enable the designers to uncover interesting design alternatives.