• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • Tagged with
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Determining the Distributed Karhunen-Loève Transform via Convex Semidefinite Relaxation

Zhao, Xiaoyu January 2018 (has links)
The Karhunen–Loève Transform (KLT) is prevalent nowadays in communication and signal processing. This thesis aims at attaining the KLT in the encoders and achieving the minimum sum rate in the case of Gaussian multiterminal source coding. In the general multiterminal source coding case, the data collected at the terminals will be compressed in a distributed manner, then communicated the fusion center for reconstruction. The data source is assumed to be a Gaussian random vector in this thesis. We introduce the rate-distortion function to formulate the optimization problem. The rate-distortion function focuses on achieving the minimum encoding sum rate, subject to a given distortion. The main purpose in the thesis is to propose a distributed KLT for encoders to deal with the sampled data and produce the minimum sum rate. To determine the distributed Karhunen–Loève transform, we propose three kinds of algorithms. The rst iterative algorithm is derived directly from the saddle point analysis of the optimization problem. Then we come up with another algorithm by combining the original rate-distortion function with Wyner's common information, and this algorithm still has to be solved in an iterative way. Moreover, we also propose algorithms without iterations. This kind of algorithms will generate the unknown variables from the existing variables and calculate the result directly.All those algorithms can make the lower-bound and upper-bound of the minimum sum rate converge, for the gap can be reduced to a relatively small range comparing to the value of the upper-bound and lower-bound. / Thesis / Master of Applied Science (MASc)
2

Optimal Basis For Ultrasound Rf Apertures: Applications to Real-Time Compression and Beamforming

Kibria, Sharmin 01 January 2014 (has links) (PDF)
Modern medical ultrasound machines produce enormous amounts of data, as much as several gigabytes/sec in some systems. The challenges of generating, storing, processing and reproducing such voluminous data has motivated researchers to search for a feasible compression scheme for the received ultrasound radio frequency (RF) signals. Most of this work has concentrated on the digitized data available after sampling and A/D conversion. We are interested in the possibility of compression implemented directly on the received analog RF signals; hence, we focus on compression of the set of signals in a single receive aperture. We first investigate the model-free approaches to compression that have been proposed by previous researchers that involve applications of some of the well-known signal processing tools like Principal Component Analysis (PCA), wavelets, Fourier Transform, etc. We also consider Bandpass Prolate Spheroidal Functions (BPSFs) in this study. Then we consider the derivation of the optimal basis for the RF signals assuming a white noise model for spatial inhomogeneity field in tissue. We first derive an expression for the (time and space) autocorrelation function of the set of signals received in a linear aperture. This is then used to find the autocorrelation's eigenfunctions, which form an optimal basis for minimum mean-square error compression of the aperture signal set. We show that computation of the coefficients of the signal set with respect to the basis is approximated by calculation of real and imaginary part of the Fourier Series coefficients for the received signal at each aperture element, with frequencies slightly scaled by aperture position, followed by linear combinations of corresponding frequency components across the aperture. The combination weights at each frequency are determined by the eigenvectors of a matrix whose entries are averaged cross-spectral coefficients of the received signal set at that frequency. The principal eigenvector generates a combination that corresponds to a variation on the standard delay-and-sum beamformed aperture center line, while the combinations from other eigenvectors represent aperture information that is not contained in the beamformed line. We then consider how to use the autocorrelation's eigenfunctions and eigenvalues to generate a linear minimum mean-square error beamformer for the center line of each aperture. Finally, we compare the performances of the optimal compression basis and to that of the 2D Fourier Transform.

Page generated in 0.0858 seconds