226 research outputs found
Annular filters for binary images
A binary annular filter removes isolated points in the foreground and the background of an image. Here, the adjective 'isolated' refers to an underlying adjacency relation between pixels, which may be different for foreground and background pixels. In this paper, annular filters are represented in terms of switch pairs. A switch pair consists of two operators which govern the removal of points from foreground and background, respectively. In the case of annular filters, switch pairs are completely determined by foreground and background adjacency. It is shown that a specific triangular condition in terms of both adjacencies is required to establish idempotence of the resulting annular filter
Floral morphology and structure of Emblingia calceoliflora (Emblingiaceae, Brassicales): questions and answers
Climbing: A Unified Approach for Global Constraints on Hierarchical Segmentation
International audienceThe paper deals with global constraints for hierarchical segmentations. The proposed framework associates, with an input image, a hierarchy of segmentations and an energy, and the subsequent optimization problem. It is the first paper that compiles the different global constraints and unifies them as Climbing energies. The transition from global optimization to local optimization is attained by the h-increasingness property, which allows to compare parent and child partition energies in hierarchies. The laws of composition of such energies are established and examples are given over the Berkeley Dataset for colour and texture segmentation
Correspondence between Topological and Discrete Connectivities in Hausdorff Discretization
We consider \emph{Hausdorff discretization} from a metric space to
a discrete subspace , which associates to a closed subset of
any subset of minimizing the Hausdorff distance between
and ; this minimum distance, called the \emph{Hausdorff radius}
of and written , is bounded by the resolution of .
We call a closed set \emph{separated} if it can be partitioned
into two non-empty closed subsets and whose mutual
distances have a strictly positive lower bound. Assuming some minimal
topological properties of and (satisfied in and
), we show that given a non-separated closed subset of ,
for any , every Hausdorff discretization of is connected
for the graph with edges linking pairs of points of at distance at
most . When is connected, this holds for , and its
greatest Hausdorff discretization belongs to the partial connection
generated by the traces on of the balls of radius
. However, when the closed set is separated, the Hausdorff
discretizations are disconnected whenever the resolution of is
small enough.
In the particular case where and with norm-based
distances, we generalize our previous results for . For a norm
invariant under changes of signs of coordinates, the greatest
Hausdorff discretization of a connected closed set is axially
connected. For the so-called \emph{coordinate-homogeneous} norms,
which include the norms, we give an adjacency graph for which
all Hausdorff discretizations of a connected closed set are connected
Shopping centre siting and modal choice in Belgium: a destination based analysis
Although modal split is only one of the elements considered in decision-making on new shopping malls, it remarkably often arises in arguments of both proponents and opponents. Today, this is also the case in the debate on the planned development of three major shopping malls in Belgium. Inspired by such debates, the present study focuses on the impact of the location of shopping centres on the travel mode choice of the customers. Our hypothesis is that destination-based variables such as embeddedness in the urban fabric, accessibility and mall size influence the travel mode choice of the visitors. Based on modal split data and location characteristics of seventeen existing shopping centres in Belgium, we develop a model for a more sustainable siting policy. The results show a major influence of the location of the shopping centre in relation to the urban form, and of the size of the mall. Shopping centres that are part of a dense urban fabric, measured through population density, are less car dependent. Smaller sites will attract more cyclists and pedestrians. Interestingly, our results deviate significantly from the figures that have been put forward in public debates on the shopping mall issue in Belgium
Diagnostic Practices and Treatment for <i>P. vivax</i> in the InterEthnic Therapeutic Encounter of South-Central Vietnam: A Mixed-Methods Study
On the equivalence between hierarchical segmentations and ultrametric watersheds
We study hierarchical segmentation in the framework of edge-weighted graphs.
We define ultrametric watersheds as topological watersheds null on the minima.
We prove that there exists a bijection between the set of ultrametric
watersheds and the set of hierarchical segmentations. We end this paper by
showing how to use the proposed framework in practice in the example of
constrained connectivity; in particular it allows to compute such a hierarchy
following a classical watershed-based morphological scheme, which provides an
efficient algorithm to compute the whole hierarchy.Comment: 19 pages, double-colum
Digitally Continuous Multivalued Functions, Morphological Operations and Thinning Algorithms
In a recent paper (Escribano et al. in Discrete Geometry for Computer Imagery 2008. Lecture Notes in Computer Science, vol. 4992, pp. 81–92, 2008) we have introduced a notion of continuity in digital spaces which extends the usual notion of digital continuity. Our approach, which uses multivalued functions, provides a better framework to define topological notions, like retractions, in a far more realistic way than by using just single-valued digitally continuous functions.
In this work we develop properties of this family of continuous functions, now concentrating on morphological operations and thinning algorithms. We show that our notion of continuity provides a suitable framework for the basic operations in mathematical morphology: erosion, dilation, closing, and opening. On the other hand, concerning thinning algorithms, we give conditions under which the existence of a retraction F:X⟶X∖D guarantees that D is deletable. The converse is not true, in general, although it is in certain particular important cases which are at the basis of many thinning algorithms
- …