1,189 research outputs found
Universality in the merging dynamics of parametric active contours: a study in MRI-based lung segmentation
Measurement of lung ventilation is one of the most reliable techniques of
diagnosing pulmonary diseases. The time consuming and bias prone traditional
methods using hyperpolarized HHe and H magnetic resonance
imageries have recently been improved by an automated technique based on
multiple active contour evolution. Mapping results from an equivalent
thermodynamic model, here we analyse the fundamental dynamics orchestrating the
active contour (AC) method. We show that the numerical method is inherently
connected to the universal scaling behavior of a classical nucleation-like
dynamics. The favorable comparison of the exponent values with the theoretical
model render further credentials to our claim.Comment: 4 pages, 4 figure
An edge-based approach for robust foreground detection
Foreground segmentation is an essential task in many image processing applications and a commonly used approach to obtain foreground objects from the background. Many techniques exist, but due to shadows and changes in illumination the segmentation of foreground objects from the background remains challenging. In this paper, we present a powerful framework for detections of moving objects in real-time video processing applications under various lighting changes. The novel approach is based on a combination of edge detection and recursive smoothing techniques.We use edge dependencies as statistical features of foreground and background regions and define the foreground as regions containing moving edges. The background is described by short- and long-term estimates. Experiments prove the robustness of our method in the presence of lighting changes in sequences compared to other widely used background subtraction techniques
Multi-resolution texture classification based on local image orientation
The aim of this paper is to evaluate quantitatively the discriminative power of the image orientation in the texture classification process. In this regard, we have evaluated the performance of two texture classification schemes where the image orientation is extracted using the partial derivatives of the Gaussian function. Since the texture descriptors are dependent on the observation scale, in this study the main emphasis is placed on the implementation of multi-resolution texture analysis schemes. The experimental results were obtained when the analysed texture descriptors were applied to standard texture databases
On the segmentation and classification of hand radiographs
This research is part of a wider project to build predictive models of bone age using hand radiograph images. We examine ways of finding the outline of a hand from an X-ray as the first stage in segmenting the image into constituent bones. We assess a variety of algorithms including contouring, which has not previously been used in this context. We introduce a novel ensemble algorithm for combining outlines using two voting schemes, a likelihood ratio test and dynamic time warping (DTW). Our goal is to minimize the human intervention required, hence we investigate alternative ways of training a classifier to determine whether an outline is in fact correct or not. We evaluate outlining and classification on a set of 1370 images. We conclude that ensembling with DTW improves performance of all outlining algorithms, that the contouring algorithm used with the DTW ensemble performs the best of those assessed, and that the most effective classifier of hand outlines assessed is a random forest applied to outlines transformed into principal components
Cassini ISS mutual event astrometry of the mid-sized Saturnian satellites 2005-2012
Reproduced with permission from Astronomy & Astrophysics, © ES
The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games
We analyse the computational complexity of finding Nash equilibria in simple
stochastic multiplayer games. We show that restricting the search space to
equilibria whose payoffs fall into a certain interval may lead to
undecidability. In particular, we prove that the following problem is
undecidable: Given a game G, does there exist a pure-strategy Nash equilibrium
of G where player 0 wins with probability 1. Moreover, this problem remains
undecidable if it is restricted to strategies with (unbounded) finite memory.
However, if mixed strategies are allowed, decidability remains an open problem.
One way to obtain a provably decidable variant of the problem is restricting
the strategies to be positional or stationary. For the complexity of these two
problems, we obtain a common lower bound of NP and upper bounds of NP and
PSPACE respectively.Comment: 23 pages; revised versio
Visual 3-D SLAM from UAVs
The aim of the paper is to present, test and discuss the implementation of Visual SLAM techniques to images taken from Unmanned Aerial Vehicles (UAVs) outdoors, in partially structured environments. Every issue of the whole process is discussed in order to obtain more accurate localization and mapping from UAVs flights. Firstly, the issues related to the visual features of objects in the scene, their distance to the UAV, and the related image acquisition system and their calibration are evaluated for improving the whole process. Other important, considered issues are related to the image processing techniques, such as interest point detection, the matching procedure and the scaling factor. The whole system has been tested using the COLIBRI mini UAV in partially structured environments. The results that have been obtained for localization, tested against the GPS information of the flights, show that Visual SLAM delivers reliable localization and mapping that makes it suitable for some outdoors applications when flying UAVs
Decision Problems for Nash Equilibria in Stochastic Games
We analyse the computational complexity of finding Nash equilibria in
stochastic multiplayer games with -regular objectives. While the
existence of an equilibrium whose payoff falls into a certain interval may be
undecidable, we single out several decidable restrictions of the problem.
First, restricting the search space to stationary, or pure stationary,
equilibria results in problems that are typically contained in PSPACE and NP,
respectively. Second, we show that the existence of an equilibrium with a
binary payoff (i.e. an equilibrium where each player either wins or loses with
probability 1) is decidable. We also establish that the existence of a Nash
equilibrium with a certain binary payoff entails the existence of an
equilibrium with the same payoff in pure, finite-state strategies.Comment: 22 pages, revised versio
- …