Search results for "Computer Vision and Pattern Recognition"

showing 10 items of 997 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…

Materials scienceunconventional streRenewable Energy Sustainability and the Environmentbusiness.industrypattern recognitionElectrical engineeringEnergy Engineering and Power TechnologyComputer Science Applications1707 Computer Vision and Pattern RecognitionHigh voltageConvertersIndustrial and Manufacturing EngineeringPower (physics)Computer Networks and CommunicationReliability (semiconductor)Artificial IntelligencePartial dischargePower electronicsPartial dischargeHarmonicPWMbusinessInstrumentationVoltage2018 IEEE 4th International Forum on Research and Technology for Society and Industry (RTSI)
researchProduct

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…

Mathematical optimizationBayes estimatorBayesian probabilityDetectorPosterior probabilityMarkov chain Monte CarloExpected valueReal imagesymbols.namesakeArtificial IntelligenceSignal ProcessingsymbolsPoint (geometry)Computer Vision and Pattern RecognitionAlgorithmSoftwareMathematicsPattern Recognition Letters
researchProduct

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…

Mathematical optimizationControl and OptimizationOptimization problemComputer scienceMonte Carlo methodStructural system0211 other engineering and technologiesTruss02 engineering and technology0203 mechanical engineeringDynamic problemReliability-based designDynamic shakedownReliability (statistics)021106 design practice & managementElastic plastic trusseProbabilistic logicComputer Science Applications1707 Computer Vision and Pattern RecognitionComputer Graphics and Computer-Aided DesignComputer Science ApplicationsShakedown020303 mechanical engineering & transportsControl and Systems EngineeringSettore ICAR/08 - Scienza Delle CostruzioniSoftwareStochastic wind loadStructural and Multidisciplinary Optimization
researchProduct

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…

Mathematical optimizationDiscretizationComputer scienceVolume variationProcess (computing)Volume (computing)Function (mathematics)AnimationVariation (game tree)Computer Graphics and Computer-Aided DesignComputer Science ApplicationsRadius of influenceComputer Vision and Pattern RecognitionAlgorithmInternational Journal of Image and Graphics
researchProduct

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…

Mathematical optimizationLearning automataDiscretizationbusiness.industryBayesian probability02 engineering and technologyMathematical proof01 natural sciencesConjugate priorField (computer science)010104 statistics & probabilityArtificial IntelligenceConvergence (routing)0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingComputer Vision and Pattern RecognitionArtificial intelligence0101 mathematicsbusinessBeta distributionMathematics
researchProduct

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…

Mathematical optimizationModel reductionbusiness.industryMarkovian jump systemsRegular polygonLinear matrix inequalityComputer Science Applications1707 Computer Vision and Pattern RecognitionLinear matrixLinear matrix inequalityTransition rate matrixIncomplete statistics of mode informationComputer Science ApplicationsTheoretical Computer ScienceMarkovian jump linear systemsMarkovian jumpSoftwareControl and Systems EngineeringStatisticsIncomplete statistics of mode information; Linear matrix inequality; Markovian jump systems; Model reduction; Control and Systems Engineering; Theoretical Computer Science; Computer Science Applications1707 Computer Vision and Pattern RecognitionDesign methodsbusinessMathematicsInternational Journal of Systems Science
researchProduct

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…

Mathematical optimizationQuadric[INFO.INFO-CV] Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV]Rank (linear algebra)Linear matrix inequality[INFO.INFO-CV]Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV]Function (mathematics)Pruning (decision trees)[ INFO.INFO-CV ] Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV]Rotation (mathematics)Search treeEigenvalues and eigenvectorsMathematics
researchProduct

Using Fourier local magnitude in adaptive smoothness constraints in motion estimation

2007

Like many problems in image analysis, motion estimation is an ill-posed one, since the available data do not always sufficiently constrain the solution. It is therefore necessary to regularize the solution by imposing a smoothness constraint. One of the main difficulties while estimating motion is to preserve the discontinuities of the motion field. In this paper, we address this problem by integrating the motion magnitude information obtained by the Fourier analysis into the smoothness constraint, resulting in an adaptive smoothness. We describe how to achieve this with two different motion estimation approaches: the Horn and Schunck method and the Markov Random Field (MRF) modeling. The t…

Mathematical optimizationRandom fieldMarkov random fieldSmoothness (probability theory)ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISIONOptical flowConstraint (information theory)symbols.namesakeMotion fieldArtificial IntelligenceFourier analysisMotion estimationSignal ProcessingsymbolsComputer Vision and Pattern RecognitionAlgorithmSoftwareComputingMethodologies_COMPUTERGRAPHICSMathematicsPattern Recognition Letters
researchProduct

The squared symmetric FastICA estimator

2017

In this paper we study the theoretical properties of the deflation-based FastICA method, the original symmetric FastICA method, and a modified symmetric FastICA method, here called the squared symmetric FastICA. This modification is obtained by replacing the absolute values in the FastICA objective function by their squares. In the deflation-based case this replacement has no effect on the estimate since the maximization problem stays the same. However, in the symmetric case we obtain a different estimate which has been mentioned in the literature, but its theoretical properties have not been studied at all. In the paper we review the classic deflation-based and symmetric FastICA approaches…

Mathematical optimizationaffine equivarianceminimum distance indexMathematics - Statistics TheoryIndependent component analysis02 engineering and technologyEstimating equationsStatistics Theory (math.ST)01 natural sciences010104 statistics & probabilityMatrix (mathematics)0202 electrical engineering electronic engineering information engineeringFOS: MathematicsApplied mathematics62H10 62H120101 mathematicsElectrical and Electronic EngineeringMathematicsta113ta112ta111EstimatorContrast (statistics)riippumattomien komponenttien analyysi020206 networking & telecommunicationsMaximizationIndependent component analysisNonlinear systemControl and Systems EngineeringSignal ProcessingFastICAComputer Vision and Pattern Recognitionlimiting normalitySoftware
researchProduct

Patch-Based Image Denoising Model for Mixed Gaussian Impulse Noise Using L1 Norm

2017

Image denoising is the classes of technique used to free the image form the noise. The noise in the image may be added during the observation process due to the improper setting of the camera lance, low-resolution camera, cheap, and low-quality sensors, etc. Noise in the image may also be added during the image restoration, image transmission through the transmission media. To obtain required information from image, image must be noise free, i.e., high-frequency details must be present in the image. There are number of applications where image denoising is needed such as remote location detection, computer vision, computer graphics, video surveillance, etc. In last two decades, numbers of m…

Mathematical optimizationbusiness.industryComputer scienceGaussianComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISIONTransmission mediumImpulse (physics)Non-local meansImpulse noiseComputer graphicssymbols.namesakeGaussian noiseComputer Science::Computer Vision and Pattern RecognitionsymbolsComputer visionArtificial intelligencebusinessImage restoration
researchProduct