6,805 research outputs found

    Sparse Sensing with Semi-Coprime Arrays

    Full text link
    A semi-coprime array (SCA) interleaves two undersampled uniform linear arrays (ULAs) and a QQ element standard ULA. The undersampling factors of the first two arrays are QMQM and QNQN respectively where MM and NN are coprime. The resulting non-uniform linear array is highly sparse. Taking the minimum of the absolute values of the conventional beampatterns of the three arrays results in a beampattern free of grating lobes. The SCA offers more savings in the number of sensors than other popular sparse arrays like coprime arrays, nested arrays, and minimum redundant arrays. Also, the SCA exhibits better side lobe patterns than other sparse arrays. An example of direction of arrival estimation with the SCA illustrates SCA's promising potential in reducing number of sensors, decreasing system cost and complexity in various signal sensing and processing applications

    Quantifying galaxy shapes: Sersiclets and beyond

    Full text link
    Parametrising galaxy morphologies is a challenging task, e.g., in shear measurements of weak lensing or investigations of galaxy evolution. The huge variety of morphologies requires an approach that is highly flexible, e.g., accounting for azimuthal structure. We revisit the method of sersiclets, where galaxy morphologies are decomposed into basis functions based on the Sersic profile. This approach is justified by the fact that the Sersic profile is the first-order Taylor expansion of any real light profile. We show that sersiclets overcome the modelling failures of shapelets. However, sersiclets implicate an unphysical relation between the steepness of the light profile and the spatial scale of azimuthal structures, which is not obeyed by real galaxy morphologies and can therefore give rise to modelling failures. Moreover, we demonstrate that sersiclets are prone to undersampling, which restricts sersiclet modelling to highly resolved galaxy images. Analysing data from the Great08 challenge, we demonstrate that sersiclets should not be used in weak-lensing studies. We conclude that although the sersiclet approach appears very promising at first glance, it suffers from conceptual and practical problems that severly limit its usefulness. The Sersic profile can be enhanced by higher-order terms in the Taylor expansion, which can drastically improve model reconstructions of galaxy images. If orthonormalised, these higher-order profiles can overcome the problems of sersiclets while preserving their mathematical justification.Comment: 14 pages, 12 figures, 2 tables; accepted by MNRA

    Predictive Modeling of ICU Healthcare-Associated Infections from Imbalanced Data. Using Ensembles and a Clustering-Based Undersampling Approach

    Full text link
    Early detection of patients vulnerable to infections acquired in the hospital environment is a challenge in current health systems given the impact that such infections have on patient mortality and healthcare costs. This work is focused on both the identification of risk factors and the prediction of healthcare-associated infections in intensive-care units by means of machine-learning methods. The aim is to support decision making addressed at reducing the incidence rate of infections. In this field, it is necessary to deal with the problem of building reliable classifiers from imbalanced datasets. We propose a clustering-based undersampling strategy to be used in combination with ensemble classifiers. A comparative study with data from 4616 patients was conducted in order to validate our proposal. We applied several single and ensemble classifiers both to the original dataset and to data preprocessed by means of different resampling methods. The results were analyzed by means of classic and recent metrics specifically designed for imbalanced data classification. They revealed that the proposal is more efficient in comparison with other approaches

    On sparsity averaging

    Get PDF
    Recent developments in Carrillo et al. (2012) and Carrillo et al. (2013) introduced a novel regularization method for compressive imaging in the context of compressed sensing with coherent redundant dictionaries. The approach relies on the observation that natural images exhibit strong average sparsity over multiple coherent frames. The associated reconstruction algorithm, based on an analysis prior and a reweighted 1\ell_1 scheme, is dubbed Sparsity Averaging Reweighted Analysis (SARA). We review these advances and extend associated simulations establishing the superiority of SARA to regularization methods based on sparsity in a single frame, for a generic spread spectrum acquisition and for a Fourier acquisition of particular interest in radio astronomy.Comment: 4 pages, 3 figures, Proceedings of 10th International Conference on Sampling Theory and Applications (SampTA), Code available at https://github.com/basp-group/sopt, Full journal letter available at http://arxiv.org/abs/arXiv:1208.233

    Hadamard single-pixel imaging versus Fourier single-pixel imaging

    Full text link
    Single-pixel imaging is an innovative imaging scheme and has received increasing attentions in recent years. It is applicable to imaging at non-visible wavelengths and imaging under low light conditions. However, single-pixel imaging has once encountered problems of low reconstruction quality and long data-acquisition time. This situation has been changed thanks to the developments of Hadamard single-pixel imaging (HSI) and Fourier single-pixel imaging (FSI). Both techniques are able to achieve high-quality and efficient imaging, remarkably improving the applicability of single-pixel imaging scheme. In this paper, we compare the performances of HSI and FSI with theoretical analysis and experiments. The results show that FSI is more efficient than HSI while HSI is more noise-robust than FSI. Our work may provide a guideline for researchers to choose suitable single-pixel imaging technique for their applications

    Properties of spatial coupling in compressed sensing

    Full text link
    In this paper we address a series of open questions about the construction of spatially coupled measurement matrices in compressed sensing. For hardware implementations one is forced to depart from the limiting regime of parameters in which the proofs of the so-called threshold saturation work. We investigate quantitatively the behavior under finite coupling range, the dependence on the shape of the coupling interaction, and optimization of the so-called seed to minimize distance from optimality. Our analysis explains some of the properties observed empirically in previous works and provides new insight on spatially coupled compressed sensing.Comment: 5 pages, 6 figure
    corecore