Search results for "VISION"
showing 10 items of 5066 documents
Regularization of optical flow with M-band wavelet transform
2003
The optical flow is an important tool for problems arising in the analysis of image sequences. Flow fields generated by various existing solving techniques are often noisy and partially incorrect, especially near occlusions or motion boundaries. Therefore, the additional information on the scene gained from a sequence of images is usually worse. In this paper, discrete wavelet transform has been adopted in order to enhance the reliability of optical flow estimation. A generalization of the well-known dyadic orthonormal wavelets to the case of the dilation scale factor M > 2 with N vanishing moments has been used, and it has proved to be a useful regularizing tool. The advantages in the comp…
Periodic Spline Wavelets and Wavelet Packets
2014
This chapter presents wavelets and wavelet packets in the spaces of periodic splines of arbitrary order, which, in essence, are the multiple generators for these spaces. The SHA technique provides explicit representation of the wavelets and wavelet packets and fast implementation of the transforms in one and several dimensions.
Improved color interpolation using discrete wavelet transform
2005
New approaches to Color Interpolation based on Discrete Wavelet Transform are described. The Bayer data are split into the three colour components; for each component the Wavelet Coefficient Interpolation (WCI) algorithm is applied and results are combined to obtain the final colour interpolated image. A further anti-aliasing algorithm can be applied in order to reduce false colours. A first approach consists of interpolating wavelet coefficients starting from a spatial analysis of the input image. It was considered an interpolation step based on threshold levels associated to the spatial correlation of the input image pixel. A second approach consists of interpolating wavelet coefficients …
A General Frame-by-Frame Wavelet Transform Algorithm for a Three-Dimensional Analysis with Reduced Memory Usage
2007
The 3D-DWT is a mathematical tool of increasing importance. However, the huge memory requirement of the algorithms that compute it is one of the main drawbacks in practical implementations. In this paper, we introduce a frame-by-frame algorithm to calculate the 3D-DWT with low memory usage. This algorithm is general, in the sense that it can be employed with any wavelet transform and, contrary to other proposals, it gets the same results as the regular wavelet transform. In addition, there is no need to divide the input video sequence into group of frames, and it can be applied in a continuous manner, so that coding efficiency is increased and no blocking artifacts appear.
172 REAL TIME EDGES DETECTION USING WAVELET TRANSFORM
2000
One of the way to extract edges uses the fast wavelet transform algorithm. This technique allows the detection of multiscale edges and is used to detect all the details, which are in a picture by modifying the scale. The real time application for edge detection involves the implementation of the algorithm on an integrated circuit like a FPGA and the development of an appropriated board. This article deals about the implementation of a wavelet transform algorithm onto a FPGA and development of an electronic board to detect multiscale edges.
EMG artifacts removal during electrical stimulation, a CWT based technique
2014
International audience; A technique of artifacts removal based on the continuous wavelet transform is presented. It uses common mother wavelets to find the temporal localization of stimulation artifacts on electromyogram (EMG) signal during an electrically evoked contraction of a muscle. This method can be used with standard stimulation pulse waveforms like monophasics or biphasics ones. It uses a histogram representation to find the best threshold to apply on the CWT domain. The algotithm is presented with Haar wavelet and then it is used with common wavelet famillies such as Daubechies or Symlets.
A coupled Finite Volume–Smoothed Particle Hydrodynamics method for incompressible flows
2016
Abstract An hybrid approach is proposed which allows to combine Finite Volume Method (FVM) and Smoothed Particle Hydrodynamics (SPH). The method is based on the partitioning of the computational domain into a portion discretized with a structured grid of hexahedral elements (the FVM-domain ) and a portion filled with Lagrangian particles (the SPH-domain ), separated by an interface made of triangular elements. A smooth transition between the solutions in the FVM and SPH regions is guaranteed by the introduction of a layer of grid cells in the SPH-domain and of a band of virtual particles in the FVM one (both neighboring the interface), on which the hydrodynamic variables are obtained throug…
Proposer des révisions intersessions aux étudiants de 1ère année : quelles relations avec la réussite aux examens ?
2013
This paper assesses a revision programme proposed to unsuccessful students between the two examination sessions within the framework of the "Plan réussite en Licence" in first year at the University of Burgundy, both in terms of student participation and links with achievement. The low participation of students is not associated with particular student profiles. An analysis of the students' future shows that student participation in the revision programme led to a lower drop-out risk during the second examination session and greater success, but only as regards the examinations of the 2nd semester. It should also be noted that student participation also has positive effects in the mid-term …
Distributed Learning Automata-based S-learning scheme for classification
2019
This paper proposes a novel classifier based on the theory of Learning Automata (LA), reckoned to as PolyLA. The essence of our scheme is to search for a separator in the feature space by imposing an LA-based random walk in a grid system. To each node in the grid, we attach an LA whose actions are the choices of the edges forming a separator. The walk is self-enclosing, and a new random walk is started whenever the walker returns to the starting node forming a closed classification path yielding a many-edged polygon. In our approach, the different LA attached to the different nodes search for a polygon that best encircles and separates each class. Based on the obtained polygons, we perform …
Robust stabilisation of 2D state-delayed stochastic systems with randomly occurring uncertainties and nonlinearities
2013
This paper is concerned with the state feedback control problem for a class of two-dimensional (2D) discrete-time stochastic systems with time-delays, randomly occurring uncertainties and nonlinearities. Both the sector-like nonlinearities and the norm-bounded uncertainties enter into the system in random ways, and such randomly occurring uncertainties and nonlinearities obey certain mutually uncorrelated Bernoulli random binary distribution laws. Sufficient computationally tractable linear matrix inequality–based conditions are established for the 2D nonlinear stochastic time-delay systems to be asymptotically stable in the mean-square sense, and then the explicit expression of the desired…