Most signal processing methods were developed for continuous signals. Digital devices, such as the computer, process only discrete signals. This dissertation proposes new techniques to accurately define and efficiently implement an important signal processing method---the time--frequency distribution (TFD)---using discrete signals. The TFD represents a signal in the joint time--frequency domain. Because these distributions are a function of both time and frequency they, unlike traditional signal processing methods, can display frequency content that changes over time. TFDs have been used successfully in many signal processing applications as almost all real-world signals have time-varying frequency content. Although TFDs are well defined for continuous signals, defining and computing a TFD for discrete signals is problematic. This work overcomes these problems by making contributions to the definition, computation, and application of discrete TFDs. The first contribution is a new discrete definition of TFDs. A discrete TFD (DTFD) should be free from the sampling-related distortion known as aliasing and satisfy all the important mathematical properties that the continuous TFD satisfies. Many different DTFD definitions exist but none come close to attaining this ideal. I propose three new components which make up the DTFD: 1) a new discrete Wigner--Ville distribution (DWVD) definition which satisfies all properties, 2) a new discrete analytic signal which minimises aliasing in the DWVD, and 3) a new method to define and convolve the discrete kernel with the DWVD to produce the DTFD. The result: a DTFD definition that, relative to the existing definitions, better approximates the ideal DTFD. The second contribution is two sets of computationally efficient algorithms to compute the proposed DTFD. The first set of algorithms computes the DTFD exactly; the second set requires less memory than the first set by computing time- and, or frequency-decimated versions of the DTFD. Both sets of algorithms reduce the computational load by exploiting symmetries in the DTFD and by constructing kernel-specific algorithms for four different kernel types. The third, and final, contribution is a biomedical application for the proposed DTFD and algorithms. This application is to accurately detect seizure events in newborn electroencephalogram (EEG) signals. Existing detection methods do not perform well enough for use in a clinical setting. I propose a new method which is more robust than existing methods and show how using the proposed DTFD, comparative to an existing DTFD, improves detection performance for this method. In summary, this dissertation makes practical contributions to the area of time--frequency signal processing by proposing an improved DTFD definition, efficient DTFD algorithms, and an improved newborn EEG seizure detection method using DTFDs.

L'analyse de la structure et du mouvement permet d'estimer la forme d'objets 3D et la position de la caméra à partir de photos ou de vidéos. Le plus souvent, elle est réalisée au moyen des étapes suivantes : 1) L'extraction de points d'intérêt, 2) La mise en correspondance des points d'intérêt entre les images à l'aide de descripteurs photométriques des voisinages de point, 3) Le filtrage des appariements produits à l'étape précédente afin de ne conserver que ceux compatibles avec une contrainte géométrique fixée, dont on peut alors calculer les paramètres. Cependant, la ressemblance photométrique seule utilisée en deuxième étape ne suffit pas quand plusieurs points ont la même apparence. Ensuite, la dernière étape est effectuée par un algorithme de filtrage robuste, Ransac, qui nécessite de fixer des seuils, ce qui se révèle être une opération délicate. Le point de départ de ce travail est l'approche A Contrario Ransac de Moisan et Stival, qui permet de s'abstraire des seuils. Ensuite, notre première contribution a consisté en l'élaboration d'un modèle a contrario qui réalise la mise en correspondance à l'aide de critères photométrique et géométrique, ainsi que le filtrage robuste en une seule étape. Cette méthode permet de mettre en correspondance des scènes contenant des motifs répétés, ce qui n'est pas possible par l'approche habituelle. Notre seconde contribution étend ce résultat aux forts changements de point de vue, en améliorant la méthode ASift de Morel et Yu. Elle permet d'obtenir des correspondances plus nombreuses et plus densément réparties, dans des scènes difficiles contenant des motifs répétés observés sous des angles très différents.

<p>What makes an image photorealistic and how to pinpoint and understand how our mind interprets different elements in an image conditions? It is proposed that the phrase "imperfect makes perfect" is the key for the photorealistic goal in today’s 3D. There is a review of all the elements for the creation of one perfect image, such as Global Illumination, Anti-Aliasing and also a basic review of photography, how a scene is set up, color temperature and the nature of the real light. To put different theories to a test, the common three dimensional software 3D Studio Max was used with the V-Ray renderer. On a field trip to IKEA communications, we were assigned a project of a room scene containing a kitchen, with a finished scene model. A kitchen was created and experimented to reach a result where there is no visible difference between a computer generated image and the photography. Our result was not what we had hoped for due to many problems with our scene. We ourselves see this as a first step toward a scientific explanation to photorealism and what makes something photorealistic.</p>

My thesis deals with register allocation. During this phase, the compiler has to assign variables of the source program, in an arbitrary big number, to actual registers of the processor, in a limited number k. Recent works, for instance the thesis of F. Bouchez and S. Hack, have shown that it is possible to split in two different decoupled step this phase: the spill - store the variables into memory to release registers - followed by the registers assignment. These works demonstrate the feasibility of this decoupling relying on a theoretic framework and some assumptions. In particular, it is sufficient to ensure after the spill step that the number of variables simultaneously live is below k.My thesis follows these works by showing how to apply this kind of approach when real-world constraints come in play: instructions encoding, ABI (application binary interface), register aliasing. Different approaches are proposed. They allow either to ignore these problems or to directly tackle them into the theoretic framework. The hypothesis of the models and the proposed solutions are evaluated and validated using a thorough experimental study with the compiler of STMicroelectronics. Finally, all these works have been done with the constraints of modern compilers in mind, the JIT (just-in-time) compilation, where the compilation time et the memory footprint of the compiler are key factors. We strive to offer solutions that cope with these criteria or improve the result until a given budget is reached. We, in particular, used the SSA (static single assignment) form to define algorithm like tree scan that generalizes linear scan based approaches proposed for JIT compilation.

Most signal processing methods were developed for continuous signals. Digital devices, such as the computer, process only discrete signals. This dissertation proposes new techniques to accurately define and efficiently implement an important signal processing method---the time--frequency distribution (TFD)---using discrete signals. The TFD represents a signal in the joint time--frequency domain. Because these distributions are a function of both time and frequency they, unlike traditional signal processing methods, can display frequency content that changes over time. TFDs have been used successfully in many signal processing applications as almost all real-world signals have time-varying frequency content. Although TFDs are well defined for continuous signals, defining and computing a TFD for discrete signals is problematic. This work overcomes these problems by making contributions to the definition, computation, and application of discrete TFDs. The first contribution is a new discrete definition of TFDs. A discrete TFD (DTFD) should be free from the sampling-related distortion known as aliasing and satisfy all the important mathematical properties that the continuous TFD satisfies. Many different DTFD definitions exist but none come close to attaining this ideal. I propose three new components which make up the DTFD: 1) a new discrete Wigner--Ville distribution (DWVD) definition which satisfies all properties, 2) a new discrete analytic signal which minimises aliasing in the DWVD, and 3) a new method to define and convolve the discrete kernel with the DWVD to produce the DTFD. The result: a DTFD definition that, relative to the existing definitions, better approximates the ideal DTFD. The second contribution is two sets of computationally efficient algorithms to compute the proposed DTFD. The first set of algorithms computes the DTFD exactly; the second set requires less memory than the first set by computing time- and, or frequency-decimated versions of the DTFD. Both sets of algorithms reduce the computational load by exploiting symmetries in the DTFD and by constructing kernel-specific algorithms for four different kernel types. The third, and final, contribution is a biomedical application for the proposed DTFD and algorithms. This application is to accurately detect seizure events in newborn electroencephalogram (EEG) signals. Existing detection methods do not perform well enough for use in a clinical setting. I propose a new method which is more robust than existing methods and show how using the proposed DTFD, comparative to an existing DTFD, improves detection performance for this method. In summary, this dissertation makes practical contributions to the area of time--frequency signal processing by proposing an improved DTFD definition, efficient DTFD algorithms, and an improved newborn EEG seizure detection method using DTFDs.

Most signal processing methods were developed for continuous signals. Digital devices, such as the computer, process only discrete signals. This dissertation proposes new techniques to accurately define and efficiently implement an important signal processing method---the time--frequency distribution (TFD)---using discrete signals. The TFD represents a signal in the joint time--frequency domain. Because these distributions are a function of both time and frequency they, unlike traditional signal processing methods, can display frequency content that changes over time. TFDs have been used successfully in many signal processing applications as almost all real-world signals have time-varying frequency content. Although TFDs are well defined for continuous signals, defining and computing a TFD for discrete signals is problematic. This work overcomes these problems by making contributions to the definition, computation, and application of discrete TFDs. The first contribution is a new discrete definition of TFDs. A discrete TFD (DTFD) should be free from the sampling-related distortion known as aliasing and satisfy all the important mathematical properties that the continuous TFD satisfies. Many different DTFD definitions exist but none come close to attaining this ideal. I propose three new components which make up the DTFD: 1) a new discrete Wigner--Ville distribution (DWVD) definition which satisfies all properties, 2) a new discrete analytic signal which minimises aliasing in the DWVD, and 3) a new method to define and convolve the discrete kernel with the DWVD to produce the DTFD. The result: a DTFD definition that, relative to the existing definitions, better approximates the ideal DTFD. The second contribution is two sets of computationally efficient algorithms to compute the proposed DTFD. The first set of algorithms computes the DTFD exactly; the second set requires less memory than the first set by computing time- and, or frequency-decimated versions of the DTFD. Both sets of algorithms reduce the computational load by exploiting symmetries in the DTFD and by constructing kernel-specific algorithms for four different kernel types. The third, and final, contribution is a biomedical application for the proposed DTFD and algorithms. This application is to accurately detect seizure events in newborn electroencephalogram (EEG) signals. Existing detection methods do not perform well enough for use in a clinical setting. I propose a new method which is more robust than existing methods and show how using the proposed DTFD, comparative to an existing DTFD, improves detection performance for this method. In summary, this dissertation makes practical contributions to the area of time--frequency signal processing by proposing an improved DTFD definition, efficient DTFD algorithms, and an improved newborn EEG seizure detection method using DTFDs.

Most signal processing methods were developed for continuous signals. Digital devices, such as the computer, process only discrete signals. This dissertation proposes new techniques to accurately define and efficiently implement an important signal processing method---the time--frequency distribution (TFD)---using discrete signals. The TFD represents a signal in the joint time--frequency domain. Because these distributions are a function of both time and frequency they, unlike traditional signal processing methods, can display frequency content that changes over time. TFDs have been used successfully in many signal processing applications as almost all real-world signals have time-varying frequency content. Although TFDs are well defined for continuous signals, defining and computing a TFD for discrete signals is problematic. This work overcomes these problems by making contributions to the definition, computation, and application of discrete TFDs. The first contribution is a new discrete definition of TFDs. A discrete TFD (DTFD) should be free from the sampling-related distortion known as aliasing and satisfy all the important mathematical properties that the continuous TFD satisfies. Many different DTFD definitions exist but none come close to attaining this ideal. I propose three new components which make up the DTFD: 1) a new discrete Wigner--Ville distribution (DWVD) definition which satisfies all properties, 2) a new discrete analytic signal which minimises aliasing in the DWVD, and 3) a new method to define and convolve the discrete kernel with the DWVD to produce the DTFD. The result: a DTFD definition that, relative to the existing definitions, better approximates the ideal DTFD. The second contribution is two sets of computationally efficient algorithms to compute the proposed DTFD. The first set of algorithms computes the DTFD exactly; the second set requires less memory than the first set by computing time- and, or frequency-decimated versions of the DTFD. Both sets of algorithms reduce the computational load by exploiting symmetries in the DTFD and by constructing kernel-specific algorithms for four different kernel types. The third, and final, contribution is a biomedical application for the proposed DTFD and algorithms. This application is to accurately detect seizure events in newborn electroencephalogram (EEG) signals. Existing detection methods do not perform well enough for use in a clinical setting. I propose a new method which is more robust than existing methods and show how using the proposed DTFD, comparative to an existing DTFD, improves detection performance for this method. In summary, this dissertation makes practical contributions to the area of time--frequency signal processing by proposing an improved DTFD definition, efficient DTFD algorithms, and an improved newborn EEG seizure detection method using DTFDs.

Most signal processing methods were developed for continuous signals. Digital devices, such as the computer, process only discrete signals. This dissertation proposes new techniques to accurately define and efficiently implement an important signal processing method---the time--frequency distribution (TFD)---using discrete signals. The TFD represents a signal in the joint time--frequency domain. Because these distributions are a function of both time and frequency they, unlike traditional signal processing methods, can display frequency content that changes over time. TFDs have been used successfully in many signal processing applications as almost all real-world signals have time-varying frequency content. Although TFDs are well defined for continuous signals, defining and computing a TFD for discrete signals is problematic. This work overcomes these problems by making contributions to the definition, computation, and application of discrete TFDs. The first contribution is a new discrete definition of TFDs. A discrete TFD (DTFD) should be free from the sampling-related distortion known as aliasing and satisfy all the important mathematical properties that the continuous TFD satisfies. Many different DTFD definitions exist but none come close to attaining this ideal. I propose three new components which make up the DTFD: 1) a new discrete Wigner--Ville distribution (DWVD) definition which satisfies all properties, 2) a new discrete analytic signal which minimises aliasing in the DWVD, and 3) a new method to define and convolve the discrete kernel with the DWVD to produce the DTFD. The result: a DTFD definition that, relative to the existing definitions, better approximates the ideal DTFD. The second contribution is two sets of computationally efficient algorithms to compute the proposed DTFD. The first set of algorithms computes the DTFD exactly; the second set requires less memory than the first set by computing time- and, or frequency-decimated versions of the DTFD. Both sets of algorithms reduce the computational load by exploiting symmetries in the DTFD and by constructing kernel-specific algorithms for four different kernel types. The third, and final, contribution is a biomedical application for the proposed DTFD and algorithms. This application is to accurately detect seizure events in newborn electroencephalogram (EEG) signals. Existing detection methods do not perform well enough for use in a clinical setting. I propose a new method which is more robust than existing methods and show how using the proposed DTFD, comparative to an existing DTFD, improves detection performance for this method. In summary, this dissertation makes practical contributions to the area of time--frequency signal processing by proposing an improved DTFD definition, efficient DTFD algorithms, and an improved newborn EEG seizure detection method using DTFDs.

Most signal processing methods were developed for continuous signals. Digital devices, such as the computer, process only discrete signals. This dissertation proposes new techniques to accurately define and efficiently implement an important signal processing method---the time--frequency distribution (TFD)---using discrete signals. The TFD represents a signal in the joint time--frequency domain. Because these distributions are a function of both time and frequency they, unlike traditional signal processing methods, can display frequency content that changes over time. TFDs have been used successfully in many signal processing applications as almost all real-world signals have time-varying frequency content. Although TFDs are well defined for continuous signals, defining and computing a TFD for discrete signals is problematic. This work overcomes these problems by making contributions to the definition, computation, and application of discrete TFDs. The first contribution is a new discrete definition of TFDs. A discrete TFD (DTFD) should be free from the sampling-related distortion known as aliasing and satisfy all the important mathematical properties that the continuous TFD satisfies. Many different DTFD definitions exist but none come close to attaining this ideal. I propose three new components which make up the DTFD: 1) a new discrete Wigner--Ville distribution (DWVD) definition which satisfies all properties, 2) a new discrete analytic signal which minimises aliasing in the DWVD, and 3) a new method to define and convolve the discrete kernel with the DWVD to produce the DTFD. The result: a DTFD definition that, relative to the existing definitions, better approximates the ideal DTFD. The second contribution is two sets of computationally efficient algorithms to compute the proposed DTFD. The first set of algorithms computes the DTFD exactly; the second set requires less memory than the first set by computing time- and, or frequency-decimated versions of the DTFD. Both sets of algorithms reduce the computational load by exploiting symmetries in the DTFD and by constructing kernel-specific algorithms for four different kernel types. The third, and final, contribution is a biomedical application for the proposed DTFD and algorithms. This application is to accurately detect seizure events in newborn electroencephalogram (EEG) signals. Existing detection methods do not perform well enough for use in a clinical setting. I propose a new method which is more robust than existing methods and show how using the proposed DTFD, comparative to an existing DTFD, improves detection performance for this method. In summary, this dissertation makes practical contributions to the area of time--frequency signal processing by proposing an improved DTFD definition, efficient DTFD algorithms, and an improved newborn EEG seizure detection method using DTFDs.

Most signal processing methods were developed for continuous signals. Digital devices, such as the computer, process only discrete signals. This dissertation proposes new techniques to accurately define and efficiently implement an important signal processing method---the time--frequency distribution (TFD)---using discrete signals. The TFD represents a signal in the joint time--frequency domain. Because these distributions are a function of both time and frequency they, unlike traditional signal processing methods, can display frequency content that changes over time. TFDs have been used successfully in many signal processing applications as almost all real-world signals have time-varying frequency content. Although TFDs are well defined for continuous signals, defining and computing a TFD for discrete signals is problematic. This work overcomes these problems by making contributions to the definition, computation, and application of discrete TFDs. The first contribution is a new discrete definition of TFDs. A discrete TFD (DTFD) should be free from the sampling-related distortion known as aliasing and satisfy all the important mathematical properties that the continuous TFD satisfies. Many different DTFD definitions exist but none come close to attaining this ideal. I propose three new components which make up the DTFD: 1) a new discrete Wigner--Ville distribution (DWVD) definition which satisfies all properties, 2) a new discrete analytic signal which minimises aliasing in the DWVD, and 3) a new method to define and convolve the discrete kernel with the DWVD to produce the DTFD. The result: a DTFD definition that, relative to the existing definitions, better approximates the ideal DTFD. The second contribution is two sets of computationally efficient algorithms to compute the proposed DTFD. The first set of algorithms computes the DTFD exactly; the second set requires less memory than the first set by computing time- and, or frequency-decimated versions of the DTFD. Both sets of algorithms reduce the computational load by exploiting symmetries in the DTFD and by constructing kernel-specific algorithms for four different kernel types. The third, and final, contribution is a biomedical application for the proposed DTFD and algorithms. This application is to accurately detect seizure events in newborn electroencephalogram (EEG) signals. Existing detection methods do not perform well enough for use in a clinical setting. I propose a new method which is more robust than existing methods and show how using the proposed DTFD, comparative to an existing DTFD, improves detection performance for this method. In summary, this dissertation makes practical contributions to the area of time--frequency signal processing by proposing an improved DTFD definition, efficient DTFD algorithms, and an improved newborn EEG seizure detection method using DTFDs.