No description available.

This thesis addresses the design of multiple description lattice vector quantizer (MDLVQ) with a general number L of descriptions, L >= 3. In the previous work on MDLVQ with L>= 3, once the central and side lattice codebooks are fixed, the decoding quality is determined for all numbers k of received descriptions. Therefore, it is not possible to achieve tradeoffs between the quality of reconstruction for different values of k, 1<= k <= L-1. In order to overcome the above drawback, we propose two flexible MDLVQ schemes for L >= 3. Our first design employs a different reconstruction method than in prior work and a heuristic index assignment algorithm, which uses L-2 parameters to control the distortions for 2 <= k <= L-1. Experimental results for the cases L=3 and L=4 show that significant tradeoffs are achieved by controlling the parameters mentioned above. Our second design is based on a structured index assignment. We start with the case L=3 and then generalize the index assignment to any L >= 3. The structured index assignment is able to control the tradeoff by adjusting the sizes of some L-1 subsets of side lattice points. Another important contribution of the thesis is the derivation of analytical expressions of the distortions for the structured index assignment, under the high resolution assumption. These expressions show that a wide range of distortion values can be achieved. / Thesis / Master of Applied Science (MASc)

Given a reduced cooperad C, we consider the 2-colored operad Cyl(C) which governs diagrams U: V -&gt; W, where V, W are Cobar(C)-algebras, and U is an infinity-morphism. We then investigate the deformation complexes of Cyl(C) and Cobar(C). Our main result is that the restriction maps between between the deformation complexes Der'(Cyl(C)) and Der'(Cobar(C)) are homotopic quasi-isomorphisms of filtered Lie algebras. We show how this result may be applied to modifying diagrams of homotopy algebras by derived automorphism. We then recall that Tamarkin's construction gives us a map from the set of Drinfeld associators to the homotopy classes of Lie infinity quasi-isomorphisms for Hochschild cochains of a polynomial algebra. Due to results of V. Drinfeld and T. Willwacher, both the source and the target of this map are equipped with natural actions of the Grothendieck-Teichmueller group GRT. We use our earlier results to prove that this map from the set of Drinfeld associators to the set of homotopy classes of Lie infinity quasi-isomorphisms for Hochschild cochains is GRT-equivariant. / Mathematics

<p> This thesis studies the multiple description vector quantization with lattice codebooks (MDLVQ).</p> <p> The design of index assignment is crucial to the performance of MDLVQ. However, to our best knowledge, none of previous index assignment algorithms for MDLVQ is optimal. In this thesis, we propose a simple linear-time index assignment algorithm for MDLVQ with any K ≥ 2 balanced descriptions. We prove, under the assumption of high resolution, that the algorithm is optimal for K = 2. The optimality holds for many commonly used good lattices of any dimensions, over the entire range of achievable central distortions given the side entropy rate. The optimality is in terms of minimizing the expected distortion given the side description loss rate and given the side entropy rate. We conjecture it to be optimal for K > 2 in general.</p> <p> We also made progress in the analysis of MDLVQ performance. The first exact closed form expression of the expected distortion was derived for K = 2. For K > 2, we improved the current asymptotic expression of the expected distortion.</p> / Thesis / Master of Applied Science (MASc)

In this thesis we propose two lattice-based robust distributed source coding systems, one for two correlated sources and the other for three correlated sources. We provide a detailed performance analysis under the high resolution assumption. It is shown that, in a certain asymptotic regime, our scheme for two correlated sources achieves the information-theoretic limit of quadratic multiple description coding (MDC) when the lattice dimension goes to infinity, whereas a variant of the random coding scheme by Chen and Berger with Gaussian codes is 0.5 bits away from this limit. Our analysis also shows that, under the same asymptotic regime, when the lattice dimension goes to infinity, the proposed scheme for three correlated sources is very close to the theoretical bound for the symmetric quadratic Gaussian MDC problem with single description and all three descriptions decoders. / Thesis / Doctor of Philosophy (PhD)

This thesis describes an automatic computer vision system for color identification. The system deals with color objects, such as wooden parts, that exhibit large texture variations and subtle color differences. In recent years, color has been used more and more as an important cue for recognizing textured objects. Many proposed methods use color histograms as representations of color images. Most of these methods depend on proper quantization of the color space. In our system, a novel adaptive color space quantization scheme has been employed. The method is class-oriented and is integrated with a supervised training algorithm. From a set of training samples, a partition of the original RGB color space is determined, based on the intersection of meaningful parametric descriptions of the classes. Color histograms are constructed relative to the resulting partition of the color space, and serve as the representations of both the test images and the models in the database. Relative entropy, an information-theoretic similarity measure, has been used to perform the recognition. The system described in this thesis has been extensively tested in the laboratory and has shown a high recognition accuracy. / Master of Science

This thesis presents the fundamental issues of the digital controlled DC/DC converter. A lot of challenges exist when you introduce the digital control technique into the control of the DC/DC converter, especially with regards to the voltage regulator module. One issue is the limit cycle oscillation problem caused by the quantization effect from the ADC and DPWM of the digital control chip. Another issue is the delay problem coming from the sample-hold effect. In this thesis, the modeling, analysis and design methodology for the constant frequency voltage-mode control is reviewed. A DPWM (Digital Pulse Width Modulator) model is verified in simulation, which shows what effects the digital control brings to the conventional Pulse Width Modulator. In CPES, the constant on-time control concept is introduced into the digital control of the voltage regulator module. This provides a high resolution of DPWM and allows the digital constant on-time voltage-mode control architecture to be proposed. To limit the oscillation amplitude in the digital control structure, the digital constant on-time current-mode control w/ external ramp is further proposed in CPES. To analyze this structure, a describing function model is proposed for the digital constant on-time current-mode control, which takes both the sample-hold effect and the quantization effect into consideration. This model clearly shows the stability problem caused by the sample-hold effect in the current loop. Using larger ramp's slope values, this stability issue can be alleviated. Based on this model, a design methodology is introduced. By properly designing the current loop's ADC resolution and the voltage loop's ADC resolution, the limit cycle oscillation in this structure can be minimized: the digital constant on-time current-mode control will only have the oscillation coming from the sample-hold effect in the current loop, which can be greatly reduced by adding the large slope's external ramp to this structure. Simulation verification for this design methodology is provided to prove the concepts. Based on the proposed model, the compensator design is performed. The motivation for the compensator design is to push the bandwidth while satisfying the stability condition and the dynamic no-limit-cycle oscillation condition. When analyzing the case of one sample per switching cycle, there is a certain amount of delay, which compromises the phase characteristics. Our design also requires a large external ramp because it will reduce the oscillation amplitude in our system. From our model, it is quite obvious that the external ramp must have a slope larger than one time that of inductor current down slope. A slope that is too larger will weaker the phase and limit the bandwidth. When using the normal current-mode compensator, like the 1-pole 1-zero compensator, the phase is dropped too much and the bandwidth will be limited too low. If we use a 2-pole 2-zero compensator, the phase can be boosted. However, in this case, the gain margin requirement from the dynamic no-limit-cycle oscillation condition will make the further improvements on bandwidth impossible. In our design, the one sixth of the switching frequency is achieved. / Master of Science

In this thesis we are dealing with basic methods of theoretical physics focusing on quantum theory of gravity, that are: Hamilton-Dirac formalism for singular systems, Dirac`s method of quantizing systems with constraints and its mathematical formulation - refined algebraic quantization, representation of compact groups and representation of Lorentz group. We apply these methods to find eigenstates of Lorentz group and General linear group generators. We construct a physical Hilbert space on temporal part of 3+1 decomposition of Einstein-Cartan theory. Powered by TCPDF (www.tcpdf.org)

Fedosov has described a geometro-algebraic method to construct in a canonical way a deformation of the Poisson algebra associated with a finite-dimensional symplectic manifold (\\\"phase space\\\"). His algorithm gives a non-commutative, but associative, product (a so-called \\\"star-product\\\") between smooth phase space functions parameterized by Planck\\\''s constant ℏ, which is treated as a deformation parameter. In the limit as ℏ goes to zero, the star product commutator goes to ℏ times the Poisson bracket, so in this sense his method provides a quantization of the algebra of classical observables. In this work, we develop a generalization of Fedosov\\\''s method which applies to the infinite-dimensional symplectic \\\"manifolds\\\" that occur in Lagrangian field theories. We show that the procedure remains mathematically well-defined, and we explain the relationship of this method to more standard perturbative quantization schemes in quantum field theory.

Ces travaux ont pour application la détection l'identification des signaux audio et particulièrement les signaux d'alarmes de voitures prioritaires. Dans un premier temps, nous proposons une méthode de détection des signaux d'alarme dans un environnement bruité, fondée sur des techniques d'analyse temps-fréquence des signaux. Cette méthode permet de détecter et d'identifier des signaux d'alarmes noyés dans du bruit, y compris pour des rapports signal à bruit négatifs. Puis nous proposons une quantification des signaux robuste aux bruits de transmission. Il s'agit de remplacer chaque niveau de bit d'un vecteur d'échantillons temporels ou fréquentiels par un mot binaire de même longueur fourni par un codeur correcteur d'erreur. Dans une première approche, chaque niveau de bits est quantifié indépendamment des autres selon le critère de minimisation de la distance de Hamming. Dans une seconde approche, pour réduire l'erreur de quantification à robustesse égale, les différents niveaux de bits sont quantifiés successivement selon un algorithme de type matching pursuit. Cette quantification donne aux signaux une forme spécifique permettant par la suite de les reconnaitre facilement parmi d'autres signaux. Nous proposons donc enfin deux méthodes de détection et d'identification des signaux fondées sur la quantification robuste, opérant dans le domaine temporel ou dans le domaine fréquentiel, par minimisation de la distance entre les signaux reçus restreints à leurs bits de poids fort et les signaux de référence. Ces méthodes permettent de détecter et d'identifier les signaux dans des environnements à rapport signal à bruit très faible et ceci grâce à la quantification. Par ailleurs, la première méthode, fondée sur la signature temps-fréquence, s'avère plus performante avec les signaux quantifiés. / This work targets the detection and identification of audio signals and in particular alarm signals from priority cars. First, we propose a method for detecting alarm signals in a noisy environment, based on time-frequency signal analysis. This method makes it possible to detect and identify alarm signals embedded in noise, even with negative signal-to-noise ratios. Then we propose a signal quantization robust against transmission noise. This involves replacing each bit level of a vector of time or frequency samples with a binary word of the same length provided by an error- correcting encoder. In a first approach, each bit level is quantized independently of the others according to the Hamming distance minimization criterion. In a second approach, to reduce the quantization error at equal robustness, the different bit levels are quantized successively by a matching pursuit algorithm. This quantization gives the signals a specific shape that allows them to be easily recognized among other signals. Finally, we propose two methods for detecting and identifying signals based on robust quantization, operating in the time domain or in the frequency domain, by minimizing the distance between the received signals restricted to their high-weight bits and the reference signals. These methods make it possible to detect and identify signals in environments with very low signal-to-noise ratios, thanks to quantization. In addition, the first method, based on the time-frequency signature, is more efficient with quantized signals.