{"title":"Global Optimisation for Time of Arrival-Based Localisation","authors":"Michael Pauley, J. Manton","doi":"10.1109/SSP.2018.8450751","DOIUrl":"https://doi.org/10.1109/SSP.2018.8450751","url":null,"abstract":"Synchronous and asynchronous time of arrival-based localisation problems are considered. The likelihood functions in these problems are non-convex and can have issues of local extrema. Typical approaches therefore approximate maximum likelihood estimation by something easier to compute. We aim for global optimisation with guarantees, which we achieve by partitioning the search space into regions, each containing at most one critical point.","PeriodicalId":330528,"journal":{"name":"2018 IEEE Statistical Signal Processing Workshop (SSP)","volume":"437 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116185587","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Seti Detection Strategies for Single Dish Radio Telescopes","authors":"G. Hellbourg","doi":"10.1109/SSP.2018.8450739","DOIUrl":"https://doi.org/10.1109/SSP.2018.8450739","url":null,"abstract":"Radio Searches for Extra Terrestrial Intelligence aim at detecting artificial transmissions from extra terrestrial communicative civilizations. The lack of prior knowledge concerning these potential transmissions increase the search parameter space. Ground-based single dish radio telescopes offer high sensitivity, but standard data products are limited to power spectral density estimates.To overcome important classical energy detector limitations, two detection strategies based on asynchronous ON and OFF astronomical target observations are proposed. Statistical models are described to enable threshold selection and detection performance assessment.","PeriodicalId":330528,"journal":{"name":"2018 IEEE Statistical Signal Processing Workshop (SSP)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123947688","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Block-Sparse Signal Recovery From Binary Measurements","authors":"Niklas Koep, R. Mathar","doi":"10.1109/SSP.2018.8450728","DOIUrl":"https://doi.org/10.1109/SSP.2018.8450728","url":null,"abstract":"We address the issue of block-sparse signal recovery from binary measurements of random projections. While a variety of recovery algorithms for sparse signals have been proposed in the context of 1-bit compressed sensing, there remains a gap in the recovery of more structured signals. We propose a convex programming approach tailored to the class of block-sparse signals, as well as an iterative method based on the binary iterative hard thresholding algorithm. We motivate the respective recovery schemes, and demonstrate their effectiveness and superior performance to previously established methods in a series of numerical experiments.","PeriodicalId":330528,"journal":{"name":"2018 IEEE Statistical Signal Processing Workshop (SSP)","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125031737","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An Edge Exclusion Test for Complex Gaussian Graphical Model Selection","authors":"Jitendra Tugnait","doi":"10.1109/SSP.2018.8450845","DOIUrl":"https://doi.org/10.1109/SSP.2018.8450845","url":null,"abstract":"We consider the problem of inferring the conditional independence graph (CIG) of complex-valued multivariate Gaussian vectors. A p-variate complex Gaussian graphical model (CGGM) associated with an undirected graph with p vertices is defined as the family of complex Gaussian distributions that obey the conditional independence restrictions implied by the edge set of the graph. For real random vectors, considerable body of work exists where one first tests for exclusion of each edge from the saturated model, and then infers the CIG. Much less attention has been paid to CGGMs. In this paper, we propose and analyze a generalized likelihood ratio test based edge exclusion test statistic for CGGMs. The test statistic is expressed in an alternative form compared to an existing result, where the alternative expression is in a form usually given and exploited for real GGMs. The computational complexity of the proposed statistic is $mathcal {O}(p^{3})$ compared to $mathcal {O}(p^{5})$ for the existing result.","PeriodicalId":330528,"journal":{"name":"2018 IEEE Statistical Signal Processing Workshop (SSP)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131025256","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"On Approximate Nonlinear Gaussian Message Passing on Factor Graphs","authors":"Eike Petersen, C. Hoffmann, P. Rostalski","doi":"10.1109/SSP.2018.8450699","DOIUrl":"https://doi.org/10.1109/SSP.2018.8450699","url":null,"abstract":"Factor graphs have recently gained increasing attention as a unified framework for representing and constructing algorithms for signal processing, estimation, and control. One capability that does not seem to be well explored within the factor graph tool kit is the ability to handle deterministic nonlinear transformations, such as those occuring in nonlinear filtering and smoothing problems, using tabulated message passing rules. In this contribution, we provide general forward (filtering) and backward (smoothing) approximate Gaussian message passing rules for deterministic nonlinear transformation nodes in arbitrary factor graphs fulfilling a Markov property, based on numerical quadrature procedures for the forward pass and a Rauch-Tung-Striebel-type approximation of the backward pass. These message passing rules can be employed for deriving many algorithms for solving nonlinear problems using factor graphs, as is illustrated by the proposition of a nonlinear modified Bryson-Frazier (MBF) smoother based on the presented message passing rules.","PeriodicalId":330528,"journal":{"name":"2018 IEEE Statistical Signal Processing Workshop (SSP)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121314108","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The Performance Of Box-Relaxation Decoding In Massive MIMO With Low-Resolution ADCS","authors":"Christos Thrampoulidis, Weiyu Xu","doi":"10.1109/SSP.2018.8450800","DOIUrl":"https://doi.org/10.1109/SSP.2018.8450800","url":null,"abstract":"We study massive multiple-input-multiple-output (MIMO) uplink systems with low-resolution analog-to-digital converters (ADCs) on each receiver antenna. For the decoding, we propose an efficient convex program, namely the boxrelaxation optimization (BRO), for which we further characterize its asymptotic bit-error rate (BER) under Gaussian channel and noise models. The derived formula is an explicit function of the ratio of receive to transmit antennas, of the SNR, and of the specifics of the quantization scheme. Hence, it can be used for tuning of these parameters such that the desired BER specifications are met. We further show the superiority of the BRO compared to standard linear detectors such as the zero-forcing (ZF) decoder. Numerical simulations corroborate our theoretical results.","PeriodicalId":330528,"journal":{"name":"2018 IEEE Statistical Signal Processing Workshop (SSP)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121622852","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Target Resolution Properties of the Multi-Tone Sinusoidal Frequency Modulatedwaveform","authors":"David A. Hague","doi":"10.1109/SSP.2018.8450793","DOIUrl":"https://doi.org/10.1109/SSP.2018.8450793","url":null,"abstract":"The mainlobe width of a waveform’s Ambiguity Function (AF) determines its ability to resolve multiple closely spaced targets in time-delay (range) and Doppler (range-rate). The contour of the AF’s mainlobe is well approximated by a coupled ellipse known as the Ellipse Of Ambiguity (EOA) whose parameters can be directly calculated in closed form if the waveform’s modulation function is known. The Multi-Tone Sinusoidal Frequency Modulated (MTSFM) waveform possesses a modulation function that is represented using a Fourier series expansion. These Fourier coefficients act as a set of tunable parameters that can be adjusted to synthesize waveforms with desired properties. This paper derives closed form expressions for the EOA parameters of the MTSFM and demonstrates their mainlobe characteristics via simulation.","PeriodicalId":330528,"journal":{"name":"2018 IEEE Statistical Signal Processing Workshop (SSP)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121192074","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
E. Leitinger, Stefan Grebien, Xuhong Li, F. Tufvesson, K. Witrisal
{"title":"On the Use of Mpc Amplitude Information in Radio Signal Based Slam","authors":"E. Leitinger, Stefan Grebien, Xuhong Li, F. Tufvesson, K. Witrisal","doi":"10.1109/SSP.2018.8450734","DOIUrl":"https://doi.org/10.1109/SSP.2018.8450734","url":null,"abstract":"In this paper we present a Bayesian framework for utilizing the amplitude information of multipath components (MPCs) in radio-signal-based simultaneous localization and mapping (SLAM). The developed algorithm exploits the complex amplitudes of MPC parameters that are provided by the radio channel parameter estimator. With this information, the algorithm can adapt the probabilities of detecting features within a radio signal in a time-variant way. The algorithm increases the life-time of used features and it better explores “weak” MPCs, i.e., MPCs with low signal-to-interference-plus-noise-ratios (SINRs) in dense multipath.","PeriodicalId":330528,"journal":{"name":"2018 IEEE Statistical Signal Processing Workshop (SSP)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123872444","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Esraa Al-sharoa, M. Al-khassaweneh, Selin Aviyente
{"title":"Temporal Block Spectral Clustering for Multi-Layer Temporal Functional Connectivity Networks","authors":"Esraa Al-sharoa, M. Al-khassaweneh, Selin Aviyente","doi":"10.1109/SSP.2018.8450744","DOIUrl":"https://doi.org/10.1109/SSP.2018.8450744","url":null,"abstract":"Many real world complex systems can be modeled as networks, i.e. graphs. A key approach to network analysis is community detection. Early work in community detection methods focused on a single network, whereas in most applications networks may be time dependent or may have multiple types of edges relating the nodes. Recently, multi-layer networks that incorporate multiple channels of connectivity have been introduced to represent such complex systems. In this paper, we focus on multi-layer temporal networks. A temporal block spectral clustering approach is proposed to detect and track the community structure across time. In this approach, both the connections between nodes of the network within a time window, i.e. intralayer adjacency, as well as the connections between nodes across different time windows, i.e. inter-layer adjacency are taken into account. The proposed framework is evaluated on both simulated and resting state fMRI data.","PeriodicalId":330528,"journal":{"name":"2018 IEEE Statistical Signal Processing Workshop (SSP)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123858360","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}