Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
Volume 8, Issue 1Jan. 1998
Reflects downloads up to 10 Nov 2024Bibliometrics
Skip Table Of Content Section
article
Migration Processes I: The Continuous Case

In this paper the general concept of a migration process (MP) is introduced; it involves iterative displacement of each point in a set as function of a neighborhood of the point, and is applicable to arbitrary sets with arbitrary topologies. After a ...

article
Migration Processes II: The Discrete Case

Following the study of migration processes in the continuous domain in Part I of this paper, we reformulate the concept of migration in the discrete domain (Z ^m ) and define Discrete Migration Processes (DMP). We demonstrate that this model is a ...

article
Set-Theoretical Algebraic Approaches to Connectivityin Continuous or Digital Spaces

Connectivity has been defined in the framework of topological spaces, but also in graphs; the two types of definitions do not always coincide. Serra gave a set of formal axioms for connectivity, which consists in a list of properties of the family of all ...

article
Multiresolution Imaging: An End-to-End Assessment

This paper evaluates the trade-off between data compression and visual quality in the context of the end-to-end continuous-target/discrete-processing/continuous-display multiresolution imaging model. It extends the traditional design and assessment of ...

article
Averaging of Random Sets Based on Their Distance Functions

A new notion of expectation for random sets (or average of binary images) is introduced using the representation of sets by distance functions. The distance function may be the familiar Euclidean distance transform, or some generalisation. The expectation ...

Comments