Search results for "Computer Vision"
showing 10 items of 2353 documents
Detection of Partial Discharges at Square Shaped Voltages
2018
Due to the wide use of electronic converters and the introduction of new powerful power electronics devices, the input waveforms most often used are becoming much different than the traditional power frequent sinusoidal one. In High Voltage (HV) apparatus particularly, this condition can increase the stress on the insulation systems that may lower the reliability of the whole power grid. This type of input voltage, often showing an increased voltage gradient, causes problems in the Partial Discharge (PD) measurement setup and acquisition systems, also due to the increased harmonic content. In this paper, the main aim is to discuss how to suitably approach the measurement technique of PDs at…
Bayesian estimation of edge orientations in junctions
1999
Abstract Junctions, defined as those points of an image where two or more edges meet, play a significant role in many computer vision applications. Junction detection is a widely treated problem, and some detectors can provide even the directions of the edges that meet in a junction. The main objective of this paper is the precise estimation of such directions. It is supposed that the junction point has been previously found by some detector. Also, it is assumed that samples, possibly noisy, of orientations of the edges found in a circular window surrounding the point are available. A mixture of von Mises distributions is assumed for these data, and then a Bayesian methodology is applied to…
Reliability-based design optimization of trusses under dynamic shakedown constraints
2019
A reliability-based design optimization problem under dynamic shakedown constraints for elastic perfectly plastic truss structures subjected to stochastic wind actions is presented. The simultaneous presence of quasi-static (cyclic) thermal loads is also considered. As usual in the shakedown theory, the quasi-statical loads will be defined as variable within a deterministic domain, while the dynamic problem will be treated considering an extended Ceradini-Gavarini approach. Some sources of uncertainties are introduced in the structural system and in the load definition. The reliability-optimization problem is formulated as the minimization of the volume of the structure subjected to determi…
α-stable distributions for better performance of ACO in detecting damage on not well spaced frequency systems
2014
Abstract In this paper, the Ant Colony Optimization (ACO) algorithm is modified through α -stable Levy variables and applied to the identification of incipient damage in structural components. The main feature of the proposed optimization is an improved ability, which derives from the heavy tails of the stable random variable, to escape from local minima. This aspect is relevant since the objective function used for damage detection may have many local minima which render very challenging the search of the global minimum corresponding to the damage parameter. As the optimization is performed on the structural response and does not require the extraction of modal components, the method is pa…
STUDY OF VOLUME VARIATION OF IMPLICIT OBJECTS
2006
We propose studying the variations of volume of implicit objects during an animation according to several points of view: choice of the function of density, variations of parameters such as the iso-value and the radius of influence for a given function, variations of the parameters inherent in a particular function. Modification of parameters of the function of density must be carried out with care. There are no rules concerning these variations. To avoid the non-monotonous variations, it is necessary to choose a function of density beforehand and study the intervals of variation of its parameters. A new discretization makes it possible to locate these variations for a later use in a proce…
The design of absorbing Bayesian pursuit algorithms and the formal analyses of their ε-optimality
2016
The fundamental phenomenon that has been used to enhance the convergence speed of learning automata (LA) is that of incorporating the running maximum likelihood (ML) estimates of the action reward probabilities into the probability updating rules for selecting the actions. The frontiers of this field have been recently expanded by replacing the ML estimates with their corresponding Bayesian counterparts that incorporate the properties of the conjugate priors. These constitute the Bayesian pursuit algorithm (BPA), and the discretized Bayesian pursuit algorithm. Although these algorithms have been designed and efficiently implemented, and are, arguably, the fastest and most accurate LA report…
model reduction for continuous-time Markovian jump systems with incomplete statistics of mode information
2013
This paper investigates the problem of model reduction for a class of continuous-time Markovian jump linear systems with incomplete statistics of mode information, which simultaneously considers the exactly known, partially unknown and uncertain transition rates. By fully utilising the properties of transition rate matrices, together with the convexification of uncertain domains, a new sufficient condition for performance analysis is first derived, and then two approaches, namely, the convex linearisation approach and the iterative approach, are developed to solve the model reduction problem. It is shown that the desired reduced-order models can be obtained by solving a set of strict linear…
Optimal positioning of irregular shapes in stamping die strip
2010
The nesting of two-dimensional shapes is a common problem, where raw material has to be economically cut. As for the single-pass single-row strip layout, several algorithms, based on established methods, have been proposed. Moreover, it should be noticed that the optimum layout should also consider a few constraints, like grain orientation for subsequent forming operation, correct bridge width, and the commercial roll of metal width in order to make solutions applicable in real industrial environments. Most of the procedures until now shown in literature are quite complex and often ignore these real constraints. They usually make use of sliding techniques and are not able to effectively wor…
A homography formulation to the 3pt plus a common direction relative pose problem
2014
International audience; In this paper we present an alternative formulation for the minimal solution to the 3pt plus a common direction relative pose prob-lem. Instead of the commonly used epipolar constraint we use the homog-raphy constraint to derive a novel formulation for the 3pt problem. This formulation allows the computation of the normal vector of the plane defined by the three input points without any additional computation in addition to the standard motion parameters of the camera. We show the working of the method on synthetic and real data sets and compare it to the standard 3pt method and the 5pt method for relative pose estima-tion. In addition we analyze the degenerate condi…
Efficient Pruning LMI Conditions for Branch-and-Prune Rank and Chirality-Constrained Estimation of the Dual Absolute Quadric
2014
International audience; We present a new globally optimal algorithm for self- calibrating a moving camera with constant parameters. Our method aims at estimating the Dual Absolute Quadric (DAQ) under the rank-3 and, optionally, camera centers chirality constraints. We employ the Branch-and-Prune paradigm and explore the space of only 5 parameters. Pruning in our method relies on solving Linear Matrix Inequality (LMI) feasibility and Generalized Eigenvalue (GEV) problems that solely depend upon the entries of the DAQ. These LMI and GEV problems are used to rule out branches in the search tree in which a quadric not satisfy- ing the rank and chirality conditions on camera centers is guarantee…