Search results for "image processing"
showing 10 items of 3285 documents
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…
Design of an image processing integrated circuit for real time edge detection
2003
Presents the design of a real time image processing micro-system to detect defects on manufacturing products. The analysis method is based on an edge detection algorithm (differential operators) to select the information related to the structure of the objects present in the image. The edge calculation function has been integrated in a standard cell circuit using a CMOS 1.5 mu m process. The ASIC has been implemented and tested in an image processing microsystem with a CCD camera. Results show an improvement of performances (speed, noise, size reduction system characterization, etc. . .) in comparison with the first prototypes (software implementation and printed board with standard compone…
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…
Using mathematical morphology for unsupervised classification of functional data
2011
This paper is concerned with the unsupervised classification of functional data by using mathematical morphology. Different morphological operators are used to extract relevant structures of the functions (considered as sets through their subgraph representations). These operators can be considered as preprocessing tools whose outputs are also functional data. We explore some dissimilarity measures and clustering methods for the classification of the transformed data. Our approach is illustrated through a detailed analysis of two data sets. These techniques, which have mainly been used in image processing, provide a flexible and robust toolbox for improving the results in unsupervised funct…
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…