Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 11 of 11 for “"sensor array processing"”.

  1. Sensor Array Processing with Manifold Uncertainty

    … realizable source locations for a given array configuration is referred to as the array manifold. In this thesis, array manifold ambiguities for linear arrays of omni-directional sensors in non-dispersive fields are considered. </p><p>First, the problem of underwater a hydrophone array …

    duke Repository record for Sensor Array Processing with Manifold Uncertainty (opens in a new tab)

  2. Blind adaptive sensor-array processing techniques for extracting highly corrupted radio communication signals.

    … radio communication signals with the use of sensor arrays. Initially, existing work is reviewed. The blind signal extraction techniques reviewed do not require known a priori training signals, signals direction of arrival, sensor array geometry or calibration. However they are found generally …

    ottawa-retro Repository record for Blind adaptive sensor-array processing techniques for extracting highly corrupted radio communication signals. (opens in a new tab)

  3. Efficient Robust Adaptive Beamforming Algorithms for Sensor Arrays

    Sensor array processing techniques have been an important research area in recent years. By using a sensor array of a certain configuration, we can improve the parameter estimation accuracy from the observation data in the presence of interference and noise. In this thesis, we focus on sensor array …

    whiterose Download PDF for Efficient Robust Adaptive Beamforming Algorithms for Sensor Arrays (opens in a new tab)

  4. Eigenvector-based multidimensional frequency estimation : identifiability, performance, and applications.

    … frequency estimation is a classic signal processing problem that has versatile applications in sensor array processing and wireless communications. Eigenvalue-based two-dimensional (2-D) and N -dimensional ( N -D) frequency estimation algorithms have been well documented, however, these …

    louisville Repository record for Eigenvector-based multidimensional frequency estimation : identifiability, performance, and applications. (opens in a new tab)

  5. Adaptive sensing for target tracking applications

    … of target signal or its parameters is done by processing data from informative measurements. The estimation performance can be enhanced if we choose the measurements based on some criteria that help to direct our sensing resources such that the measurements are more informative about the …

    mtu Repository record for Adaptive sensing for target tracking applications (opens in a new tab)

  6. Signal processing for arbitrary sensor array configurations : theory and algorithms

    Sensor array systems are employed in many application areas such as multi-antenna wireless communications, radar and biomedicine. Among the research areas of sensor array signal processing, the problem of finding the direction-of-arrival (DoA) at which a propagating wavefield impinges on a sensor …

    aalto Repository record for Signal processing for arbitrary sensor array configurations : theory and algorithms (opens in a new tab)

  7. A unified framework for identifiability analysis in bilinear inverse problems

    … lighting), blind phase and gain calibration in sensor array processing, and multichannel blind deconvolution (MBD). Applying our unified framework to BGPC, we derive sufficient conditions for unique recovery under several scenarios, including subspace, joint sparsity, and sparsity models. For …

    uiuc Repository record for A unified framework for identifiability analysis in bilinear inverse problems (opens in a new tab)

  8. Efficient and guaranteed algorithms for sparse inverse problems

    … the direction of arrival estimation problem in sensor array processing and later proposed and analyzed for joint sparse recovery by Feng and Bresler, provides a guarantee with the minimum number of measurements. We focus instead on the unfavorable but practically significant case of rank defect …

    uiuc Repository record for Efficient and guaranteed algorithms for sparse inverse problems (opens in a new tab)

  9. Highly Robust and Efficient Estimators of Multivariate Location and Covariance with Applications to Array Processing and Financial Portfolio Optimization

    Throughout stochastic data processing fields, mean and covariance matrices are commonly employed for purposes such as standardizing multivariate data through decorrelation. For practical applications, these matrices are usually estimated, and often, the data used for these estimates are …

    vt Repository record for Highly Robust and Efficient Estimators of Multivariate Location and Covariance with Applications to Array Processing and Financial Portfolio Optimization (opens in a new tab)

  10. Bilinear inverse problems with sparsity: Optimal identifiability conditions and efficient recovery

    Bilinear inverse problems (BIPs), the resolution of two vectors given their image under a bilinear mapping, arise in many applications. Without further constraints, BIPs are usually ill-posed. In practice, parsimonious structures of natural signals (e.g., subspace or sparsity) are exploited. …

    uiuc Repository record for Bilinear inverse problems with sparsity: Optimal identifiability conditions and efficient recovery (opens in a new tab)

  11. Audio computing in the wild: frameworks for big data and small computers

    … in a small device that has to process various sensor signals in real time; a lightweight custom chipset for speech enhancement on hand-held devices; instant music analysis engine running on smartphone apps. In all those applications, efficient machine learning algorithms are supposed to achieve …

    uiuc Repository record for Audio computing in the wild: frameworks for big data and small computers (opens in a new tab)