Search results for " image processing"
showing 10 items of 2323 documents
Salient Spin Images: A Descriptor for 3D Object Recognition
2018
In the last decades a wide range of algorithms have been devoted to recognize 3D free-from objects under real conditions such as occlusions, clutters, rotation, scale and translation. Spin image is one of these algorithms known to be robust to rotation, translation, occlusions up to 70% and clutters up to 60%, but still suffer from scaling, resolution changes and it is time consuming. In this paper we present a novel approach based on spin images, called salient spin images (SSI). This method enhances spin images algorithm based on its limits. Particularly, it decreases significantly the complexity of the algorithm using DoG detector, it shows a higher performance due to the relevant locali…
Transitivity in coherence-based probability logic
2016
We study probabilistically informative (weak) versions of transitivity by using suitable definitions of defaults and negated defaults in the setting of coherence and imprecise probabilities. We represent p-consistent sequences of defaults and/or negated defaults by g-coherent imprecise probability assessments on the respective sequences of conditional events. Moreover, we prove the coherent probability propagation rules for Weak Transitivity and the validity of selected inference patterns by proving p-entailment of the associated knowledge bases. Finally, we apply our results to study selected probabilistic versions of classical categorical syllogisms and construct a new version of the squa…
Square of Opposition Under Coherence
2016
Various semantics for studying the square of opposition have been proposed recently. So far, only (Gilio et al., 2016) studied a probabilistic version of the square where the sentences were interpreted by (negated) defaults. We extend this work by interpreting sentences by imprecise (set-valued) probability assessments on a sequence of conditional events. We introduce the acceptability of a sentence within coherence-based probability theory. We analyze the relations of the square in terms of acceptability and show how to construct probabilistic versions of the square of opposition by forming suitable tripartitions. Finally, as an application, we present a new square involving generalized qu…
Distance-based functions for image comparison
1999
The interest in digital image comparison is steadily growing in the computer vision community. The definition of a suitable comparison measure for non-binary images is relevant in many image processing applications. Visual tasks like segmentation and classification require the evaluation of equivalence classes. Measures of similarity are also used to evaluate lossy compression algorithms and to define pictorial indices in image content based retrieval methods. In this paper we develop a distance-based approach to image similarity evaluation and we present several image distances which are based on low level features. The sensitivity and eAectiveness are tested on real data. ” 1999 Published…
Incompleteness in Conceptual Data Modelling
2013
Although conceptual data modelers can ”get creative” when designing entities and relationships to meet business requirements, they are highly constrained by the business rules which determine the details of how the entities and relationships combine. Typically, there is a delay in realising which business rules might be relevant and a further delay in obtaining an authoritative statement of these rules. We identify circumstances under which viable database designs can be constructed from conceptual data models which are incomplete in the sense that they lack this “infrastructural” detail normally obtained from the business rules. As such detail becomes available, our approach allows the con…
Calibrating a microscopic traffic simulation model for roundabouts using genetic algorithms
2018
The paper introduces a methodological approach based on genetic algorithms to calibrate microscopic traffic simulation models. The specific objective is to test an automated procedure utilizing genetic algorithms for assigning the most appropriate values to driver and vehicle parameters in AIMSUN. The genetic algorithm tool in MATLAB® and AIMSUN micro-simulation software were used. A subroutine in Python implemented the automatic interaction of AIMSUN with MATLAB®. Focus was made on two roundabouts selected as case studies. Empirical capacity functions based on summary random-effects estimates of critical headway and follow up headway derived from meta-analysis were used as reference for ca…
Consensus among preference rankings: a new weighted correlation coefficient for linear and weak orderings
2021
AbstractPreference data are a particular type of ranking data where some subjects (voters, judges,...) express their preferences over a set of alternatives (items). In most real life cases, some items receive the same preference by a judge, thus giving rise to a ranking with ties. An important issue involving rankings concerns the aggregation of the preferences into a “consensus”. The purpose of this paper is to investigate the consensus between rankings with ties, taking into account the importance of swapping elements belonging to the top (or to the bottom) of the ordering (position weights). By combining the structure of $$\tau _x$$ τ x proposed by Emond and Mason (J Multi-Criteria Decis…
A fast and recursive algorithm for clustering large datasets with k-medians
2012
Clustering with fast algorithms large samples of high dimensional data is an important challenge in computational statistics. Borrowing ideas from MacQueen (1967) who introduced a sequential version of the $k$-means algorithm, a new class of recursive stochastic gradient algorithms designed for the $k$-medians loss criterion is proposed. By their recursive nature, these algorithms are very fast and are well adapted to deal with large samples of data that are allowed to arrive sequentially. It is proved that the stochastic gradient algorithm converges almost surely to the set of stationary points of the underlying loss criterion. A particular attention is paid to the averaged versions, which…
Online Principal Component Analysis in High Dimension: Which Algorithm to Choose?
2017
Summary Principal component analysis (PCA) is a method of choice for dimension reduction. In the current context of data explosion, online techniques that do not require storing all data in memory are indispensable to perform the PCA of streaming data and/or massive data. Despite the wide availability of recursive algorithms that can efficiently update the PCA when new data are observed, the literature offers little guidance on how to select a suitable algorithm for a given application. This paper reviews the main approaches to online PCA, namely, perturbation techniques, incremental methods and stochastic optimisation, and compares the most widely employed techniques in terms statistical a…
Anthropometry: An R Package for Analysis of Anthropometric Data
2017
The development of powerful new 3D scanning techniques has enabled the generation of large up-to-date anthropometric databases which provide highly valued data to improve the ergonomic design of products adapted to the user population. As a consequence, Ergonomics and Anthropometry are two increasingly quantitative fields, so advanced statistical methodologies and modern software tools are required to get the maximum benefit from anthropometric data. This paper presents a new R package, called Anthropometry, which is available on the Comprehensive R Archive Network. It brings together some statistical methodologies concerning clustering, statistical shape analysis, statistical archetypal an…