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.

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.

This thesis studies the application of the wavelet filter bank (WFB) in perceptual audio coding by providing brief overviews of perceptual coding, psychoacoustics, wavelet theory, and existing wavelet coding algorithms. Furthermore, it describes the poor frequency localization property of the WFB and explores one filter design method, in particular, for improving channel separation between the wavelet bands. A wavelet audio coder has also been developed by the author to test the new filters. Preliminary tests indicate that the new filters provide some improvement over other wavelet filters when coding audio signals that are stationary-like and contain only a few harmonic components, and similar results for other types of audio signals that contain many spectral and temporal components. It has been found that the WFB provides a flexible decomposition scheme through the choice of the tree structure and basis filter, but at the cost of poor localization properties. This flexibility can be a benefit in the context of audio coding but the poor localization properties represent a drawback. Determining ways to fully utilize this flexibility, while minimizing the effects of poor time-frequency localization, is an area that is still very much open for research.

Echolocation in bats is a subject that has received much attention over the last few decades. Bat echolocation calls have evolved over millions of years and can be regarded as well suited to the task of active target-detection. In analysing the time-frequency structure of bat calls, it is hoped that some insight can be gained into their capabilities and limitations. Most analysis of calls is performed using non-parametric techniques such as the short time Fourier transform. The resulting time-frequency distributions are often ambiguous, leading to further uncertainty in any subsequent analysis which depends on the time-frequency distribution. There is thus a need to develop a method which allows improved time-frequency characterisation of bat echolocation calls. The aim of this work is to develop a parametric approach for signal analysis, specifically taking into account the varied nature of bat echolocation calls in the signal model. A time-varying harmonic signal model with a polynomial chirp basis is used to track the instantaneous frequency components of the signal. The model is placed within a Bayesian context and a particle filter is used to implement the filter. Marginalisation of parameters is considered, leading to the development of a new marginalised particle filter (MPF) which is used to implement the algorithm. Efficient reversible jump moves are formulated for estimation of the unknown (and varying) number of frequency components and higher harmonics. The algorithm is applied to the analysis of synthetic signals and the performance is compared with an existing algorithm in the literature which relies on the Rao-Blackwellised particle filter (RBPF) for online state estimation and a jump Markov system for estimation of the unknown number of harmonic components. A comparison of the relative complexity of the RBPF and the MPF is presented. Additionally, it is shown that the MPF-based algorithm performs no worse than the RBPF, and in some cases, better, for the test signals considered. Comparisons are also presented from various reversible jump sampling schemes for estimation of the time-varying number of tones and harmonics. The algorithm is subsequently applied to the analysis of bat echolocation calls to establish the improvements obtained from the new algorithm. The calls considered are both amplitude and frequency modulated and are of varying durations. The calls are analysed using polynomial basis functions of different orders and the performance of these basis functions is compared. Inharmonicity, which is deviation of overtones away from integer multiples of the fundamental frequency, is examined in echolocation calls from several bat species. The results conclude with an application of the algorithm to the analysis of calls from the feeding buzz, a sequence of extremely short duration calls emitted at high pulse repetition frequency, where it is shown that reasonable time-frequency characterisation can be achieved for these calls.

<p>This dissertation focuses on two vital challenges in relation to whale acoustic signals: detection and classification.</p><p>In detection, we evaluated the influence of the uncertain ocean environment on the spectrogram-based detector, and derived the likelihood ratio of the proposed Short Time Fourier Transform detector. Experimental results showed that the proposed detector outperforms detectors based on the spectrogram. The proposed detector is more sensitive to environmental changes because it includes phase information.</p><p>In classification, our focus is on finding a robust and sparse representation of whale vocalizations. Because whale vocalizations can be modeled as polynomial phase signals, we can represent the whale calls by their polynomial phase coefficients. In this dissertation, we used the Weyl transform to capture chirp rate information, and used a two dimensional feature set to represent whale vocalizations globally. Experimental results showed that our Weyl feature set outperforms chirplet coefficients and MFCC (Mel Frequency Cepstral Coefficients) when applied to our collected data.</p><p>Since whale vocalizations can be represented by polynomial phase coefficients, it is plausible that the signals lie on a manifold parameterized by these coefficients. We also studied the intrinsic structure of high dimensional whale data by exploiting its geometry. Experimental results showed that nonlinear mappings such as Laplacian Eigenmap and ISOMAP outperform linear mappings such as PCA and MDS, suggesting that the whale acoustic data is nonlinear.</p><p>We also explored deep learning algorithms on whale acoustic data. We built each layer as convolutions with either a PCA filter bank (PCANet) or a DCT filter bank (DCTNet). With the DCT filter bank, each layer has different a time-frequency scale representation, and from this, one can extract different physical information. Experimental results showed that our PCANet and DCTNet achieve high classification rate on the whale vocalization data set. The word error rate of the DCTNet feature is similar to the MFSC in speech recognition tasks, suggesting that the convolutional network is able to reveal acoustic content of speech signals.</p> / Dissertation