Pub Date : 2018-11-22DOI: 10.1109/GLOBALSIP.2018.8646403
Ana P. Costa, Jakob S. Møller, H. Iversen, S. Puthusserypady
A 3-class motor imagery (MI) Brain-Computer Interface (BCI) system, that implements subject adaptation with short to non-existing calibration sessions is proposed. The proposed adaptive common spatial patterns (ACSP) algorithm was tested on two datasets (an open source data set (4-class MI), and an in-house data set (3-class MI)). Results show that when long calibration data is available, the ACSP performs only slightly better (4%) than the CSP, but for short calibration sessions, the ACSP significantly improved the performance (up to 4-fold). An investigation into class separability of the in-house data set was performed and was concluded that the "Pinch"movement was more easily discriminated than "Grasp" and "Elbow Flexion". The proposed paradigm proved feasible and provided insights to help choose the motor tasks leading to best results in potential real-life applications. The ACSP enabled a successful semi user independent scenario and showed potential to be a tool towards an improved, personalized stroke rehabilitation protocol.
{"title":"ADAPTIVE CSP FOR USER INDEPENDENCE IN MI-BCI PARADIGM FOR UPPER LIMB STROKE REHABILITATION","authors":"Ana P. Costa, Jakob S. Møller, H. Iversen, S. Puthusserypady","doi":"10.1109/GLOBALSIP.2018.8646403","DOIUrl":"https://doi.org/10.1109/GLOBALSIP.2018.8646403","url":null,"abstract":"A 3-class motor imagery (MI) Brain-Computer Interface (BCI) system, that implements subject adaptation with short to non-existing calibration sessions is proposed. The proposed adaptive common spatial patterns (ACSP) algorithm was tested on two datasets (an open source data set (4-class MI), and an in-house data set (3-class MI)). Results show that when long calibration data is available, the ACSP performs only slightly better (4%) than the CSP, but for short calibration sessions, the ACSP significantly improved the performance (up to 4-fold). An investigation into class separability of the in-house data set was performed and was concluded that the \"Pinch\"movement was more easily discriminated than \"Grasp\" and \"Elbow Flexion\". The proposed paradigm proved feasible and provided insights to help choose the motor tasks leading to best results in potential real-life applications. The ACSP enabled a successful semi user independent scenario and showed potential to be a tool towards an improved, personalized stroke rehabilitation protocol.","PeriodicalId":119131,"journal":{"name":"2018 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126374415","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}
Pub Date : 2018-11-01DOI: 10.1109/GlobalSIP.2018.8646422
P. Vouras, A. Weiss, Maria Becker, B. Jamroz, J. Quimby, Dylan F. Williams, K. Remley
Precise measurement and characterization of millimeter wave channels requires antennas capable of high angular resolution to resolve closely spaced multipath sources. To achieve angular resolution on the order of a few degrees these antennas must be electrically large which is impractical for phased array architectures at millimeter wave frequencies. An alternative approach is to synthesize a virtual aperture in space by using an accurate mechanical positioner to move a receive antenna to points along a sampling grid. An advantage of creating virtual apertures is that the received signal is digitized at every spatial sample position which enables the use of sophisticated angle estimation algorithms such as maximum likelihood (ML) techniques. The main contribution of this paper is a new gradient-based implementation of maximum likelihood angle estimation that was demonstrated on virtual array data collected at 28 GHz using a vector network analyzer (VNA).
{"title":"GRADIENT-BASED SOLUTION OF MAXIMUM LIKELIHOOD ANGLE ESTIMATION FOR VIRTUAL ARRAY MEASUREMENTS","authors":"P. Vouras, A. Weiss, Maria Becker, B. Jamroz, J. Quimby, Dylan F. Williams, K. Remley","doi":"10.1109/GlobalSIP.2018.8646422","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2018.8646422","url":null,"abstract":"Precise measurement and characterization of millimeter wave channels requires antennas capable of high angular resolution to resolve closely spaced multipath sources. To achieve angular resolution on the order of a few degrees these antennas must be electrically large which is impractical for phased array architectures at millimeter wave frequencies. An alternative approach is to synthesize a virtual aperture in space by using an accurate mechanical positioner to move a receive antenna to points along a sampling grid. An advantage of creating virtual apertures is that the received signal is digitized at every spatial sample position which enables the use of sophisticated angle estimation algorithms such as maximum likelihood (ML) techniques. The main contribution of this paper is a new gradient-based implementation of maximum likelihood angle estimation that was demonstrated on virtual array data collected at 28 GHz using a vector network analyzer (VNA).","PeriodicalId":119131,"journal":{"name":"2018 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117206822","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}
Pub Date : 2018-11-01DOI: 10.1109/GlobalSIP.2018.8646411
J. Kulpa, W. Barott
With the growing demand on radio frequency interference mitigation techniques in radio astronomy, better testing tools are required. This paper presents the signal oriented simulator developed at Embry-Riddle Aeronautical University. The modular simulator is capable of simulating ground based, satellite and celestial sources with a variety of transmit IQ signals. The concept, basic modes, and a configuration of the simulator are presented. The simulator is written in class-oriented MATLAB language.
{"title":"SIGNAL SIMULATOR FOR RFI MITIGATION ALGORITHMS TESTING","authors":"J. Kulpa, W. Barott","doi":"10.1109/GlobalSIP.2018.8646411","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2018.8646411","url":null,"abstract":"With the growing demand on radio frequency interference mitigation techniques in radio astronomy, better testing tools are required. This paper presents the signal oriented simulator developed at Embry-Riddle Aeronautical University. The modular simulator is capable of simulating ground based, satellite and celestial sources with a variety of transmit IQ signals. The concept, basic modes, and a configuration of the simulator are presented. The simulator is written in class-oriented MATLAB language.","PeriodicalId":119131,"journal":{"name":"2018 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126767528","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}
Pub Date : 2018-11-01DOI: 10.1109/GlobalSIP.2018.8646440
K. Baker, A. Bernstein
Due to an increase in distributed generation and controllable loads, distribution networks are frequently operating under high levels of uncertainty. Joint chance constraints, which seek to satisfy multiple constraints simultaneously with a prescribed probability, are one way to incorporate uncertainty across sets of constraints for optimization and control of these networks. Due to the complexity of evaluating these constraints directly, sampling approaches or approximations can be used to transform the joint chance constraint into deterministic constraints. However, sampling techniques may be extremely computationally expensive and not suitable for physical networks operating on fast timescales, and conservative approximations may needlessly result in a much higher cost of system operation. The proposed framework aims to provide a scalable, data-driven approach which learns operational trends in a power network, eliminates zero-probability events (e.g., inactive constraints), and uses this additional information to accurately and efficiently approximate the joint chance constraint directly.
{"title":"JOINT CHANCE CONSTRAINTS REDUCTION THROUGH LEARNING IN ACTIVE DISTRIBUTION NETWORKS","authors":"K. Baker, A. Bernstein","doi":"10.1109/GlobalSIP.2018.8646440","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2018.8646440","url":null,"abstract":"Due to an increase in distributed generation and controllable loads, distribution networks are frequently operating under high levels of uncertainty. Joint chance constraints, which seek to satisfy multiple constraints simultaneously with a prescribed probability, are one way to incorporate uncertainty across sets of constraints for optimization and control of these networks. Due to the complexity of evaluating these constraints directly, sampling approaches or approximations can be used to transform the joint chance constraint into deterministic constraints. However, sampling techniques may be extremely computationally expensive and not suitable for physical networks operating on fast timescales, and conservative approximations may needlessly result in a much higher cost of system operation. The proposed framework aims to provide a scalable, data-driven approach which learns operational trends in a power network, eliminates zero-probability events (e.g., inactive constraints), and uses this additional information to accurately and efficiently approximate the joint chance constraint directly.","PeriodicalId":119131,"journal":{"name":"2018 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115194845","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}
Pub Date : 2018-11-01DOI: 10.1109/GlobalSIP.2018.8646391
Sara Fridovich-Keil, P. Ramadge
We consider the problem of smartphone video-based heart rate estimation, which typically relies on measuring the green color intensity of the user’s skin. We describe a novel signal in fingertip videos used for smartphone-based heart rate estimation: fingertip contact surface area. We propose a model relating contact surface area to pressure, and validate it on a dataset of 786 videos from 62 participants by demonstrating a statistical correlation between contact surface area and green color intensity. We estimate heart rate on our dataset with two algorithms, a baseline using the green signal only and a novel algorithm based on both color and area. We demonstrate lower rates of substantial errors (> 10 beats per minute) using the novel algorithm (4.1%), compared both to the baseline algorithm (6.4%) and to published results using commercial color-based applications (≥ 6%).
{"title":"CONTACT SURFACE AREA: A NOVEL SIGNAL FOR HEART RATE ESTIMATION IN SMARTPHONE VIDEOS","authors":"Sara Fridovich-Keil, P. Ramadge","doi":"10.1109/GlobalSIP.2018.8646391","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2018.8646391","url":null,"abstract":"We consider the problem of smartphone video-based heart rate estimation, which typically relies on measuring the green color intensity of the user’s skin. We describe a novel signal in fingertip videos used for smartphone-based heart rate estimation: fingertip contact surface area. We propose a model relating contact surface area to pressure, and validate it on a dataset of 786 videos from 62 participants by demonstrating a statistical correlation between contact surface area and green color intensity. We estimate heart rate on our dataset with two algorithms, a baseline using the green signal only and a novel algorithm based on both color and area. We demonstrate lower rates of substantial errors (> 10 beats per minute) using the novel algorithm (4.1%), compared both to the baseline algorithm (6.4%) and to published results using commercial color-based applications (≥ 6%).","PeriodicalId":119131,"journal":{"name":"2018 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115590935","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}
Pub Date : 2018-11-01DOI: 10.1109/GlobalSIP.2018.8646328
T. Getu, W. Ajib, R. Landry
Continuous wave (CW) radio frequency interference (RFI) can happen in various radio frequency (RF) operating systems such as satellite and terrestrial communication systems. The efficient excision of such an RFI requires a proper detector. Accordingly, this paper investigates a computationally simple modified power detector (PD) for the detection of a CW RFI. Exact closed-form expressions are derived for the exhibited probabilities of RFI detection and of false alarm. Simulations validate the derived closed-form expressions and corroborate that the investigated modified PD performs as good as a kurtosis detector for medium to large average interference-to-noise ratio regimes though KD is more computationally complex.
{"title":"Power-Based Continuous Wave RFI Detector for RF Operating Systems","authors":"T. Getu, W. Ajib, R. Landry","doi":"10.1109/GlobalSIP.2018.8646328","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2018.8646328","url":null,"abstract":"Continuous wave (CW) radio frequency interference (RFI) can happen in various radio frequency (RF) operating systems such as satellite and terrestrial communication systems. The efficient excision of such an RFI requires a proper detector. Accordingly, this paper investigates a computationally simple modified power detector (PD) for the detection of a CW RFI. Exact closed-form expressions are derived for the exhibited probabilities of RFI detection and of false alarm. Simulations validate the derived closed-form expressions and corroborate that the investigated modified PD performs as good as a kurtosis detector for medium to large average interference-to-noise ratio regimes though KD is more computationally complex.","PeriodicalId":119131,"journal":{"name":"2018 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"459 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116232347","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}
Pub Date : 2018-11-01DOI: 10.1109/GlobalSIP.2018.8646657
Ping Xu, Z. Tian, Yue Wang
Distributed average consensus finds extensive applications in multi-agent systems where a group of agents are required to agree upon a common value. Motivated by the need to conserve energy for large-scale multi-agent systems, we propose an infrequent communication scheme that allows the system to reach average consensus at low energy consumption. The proposed scheme divides the original large network into two smaller sub-networks with some overlapping nodes. Agents in the two sub-networks take turns to broadcast and update their local estimates, until reaching consensus. We prove that the proposed scheme guarantees asymptotic convergence when both subnetworks are connected and have overlapping nodes. Simulations corroborate the energy saving capability of the proposed scheme.
{"title":"AN ENERGY-EFFICIENT DISTRIBUTED AVERAGE CONSENSUS SCHEME VIA INFREQUENT COMMUNICATION","authors":"Ping Xu, Z. Tian, Yue Wang","doi":"10.1109/GlobalSIP.2018.8646657","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2018.8646657","url":null,"abstract":"Distributed average consensus finds extensive applications in multi-agent systems where a group of agents are required to agree upon a common value. Motivated by the need to conserve energy for large-scale multi-agent systems, we propose an infrequent communication scheme that allows the system to reach average consensus at low energy consumption. The proposed scheme divides the original large network into two smaller sub-networks with some overlapping nodes. Agents in the two sub-networks take turns to broadcast and update their local estimates, until reaching consensus. We prove that the proposed scheme guarantees asymptotic convergence when both subnetworks are connected and have overlapping nodes. Simulations corroborate the energy saving capability of the proposed scheme.","PeriodicalId":119131,"journal":{"name":"2018 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129254123","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}
Pub Date : 2018-11-01DOI: 10.1109/GlobalSIP.2018.8646618
Sijia Liu, Xingguo Li, Pin-Yu Chen, J. Haupt, Lisa Amini
In this paper, we analyze the convergence of the zeroth-order stochastic projected gradient descent (ZO-SPGD) method for constrained convex and nonconvex optimization scenarios where only objective function values (not gradients) are directly available. We show statistical properties of a new random gradient estimator, constructed through random direction samples drawn from a bounded uniform distribution. We prove that ZO-SPGD yields a $Oleft( {frac{d}{{bqsqrt T }} + frac{1}{{sqrt T }}} right)$ convergence rate for convex but non-smooth optimization, where d is the number of optimization variables, b is the minibatch size, q is the number of random direction samples for gradient estimation, and T is the number of iterations. For nonconvex optimization, we show that ZO-SPGD achieves $Oleft( {frac{1}{{sqrt T }}} right)$ convergence rate but suffers an additional $Oleft( {frac{{d + q}}{{bq}}} right)$ error. Our the oretical investigation on ZO-SPGD provides a general framework to study the convergence rate of zeroth-order algorithms.
本文分析了零阶随机投影梯度下降(ZO-SPGD)方法在只有目标函数值(非梯度)直接可用的约束凸和非凸优化场景下的收敛性。我们展示了一种新的随机梯度估计量的统计性质，它是通过从有界均匀分布中抽取的随机方向样本构造的。我们证明了ZO-SPGD对于凸但非光滑优化的收敛速度为$Oleft( {frac{d}{{bqsqrt T }} + frac{1}{{sqrt T }}} right)$，其中d为优化变量的数量，b为小批量大小，q为梯度估计的随机方向样本的数量，T为迭代次数。对于非凸优化，我们表明ZO-SPGD达到$Oleft( {frac{1}{{sqrt T }}} right)$收敛速度，但遭受额外的$Oleft( {frac{{d + q}}{{bq}}} right)$误差。我们对ZO-SPGD的理论研究为研究零阶算法的收敛速度提供了一个一般框架。
{"title":"ZEROTH-ORDER STOCHASTIC PROJECTED GRADIENT DESCENT FOR NONCONVEX OPTIMIZATION","authors":"Sijia Liu, Xingguo Li, Pin-Yu Chen, J. Haupt, Lisa Amini","doi":"10.1109/GlobalSIP.2018.8646618","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2018.8646618","url":null,"abstract":"In this paper, we analyze the convergence of the zeroth-order stochastic projected gradient descent (ZO-SPGD) method for constrained convex and nonconvex optimization scenarios where only objective function values (not gradients) are directly available. We show statistical properties of a new random gradient estimator, constructed through random direction samples drawn from a bounded uniform distribution. We prove that ZO-SPGD yields a $Oleft( {frac{d}{{bqsqrt T }} + frac{1}{{sqrt T }}} right)$ convergence rate for convex but non-smooth optimization, where d is the number of optimization variables, b is the minibatch size, q is the number of random direction samples for gradient estimation, and T is the number of iterations. For nonconvex optimization, we show that ZO-SPGD achieves $Oleft( {frac{1}{{sqrt T }}} right)$ convergence rate but suffers an additional $Oleft( {frac{{d + q}}{{bq}}} right)$ error. Our the oretical investigation on ZO-SPGD provides a general framework to study the convergence rate of zeroth-order algorithms.","PeriodicalId":119131,"journal":{"name":"2018 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129319301","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}
Pub Date : 2018-11-01DOI: 10.1109/GlobalSIP.2018.8646583
Himanshu Pandotra, R. Velmurugan, Karthik S. Gurumoorthy, Ajit V. Rajwade
Traditionally, direction of arrival (DOA) estimation techniques have been based on spectral estimation methods utilizing signal and noise subspaces [1]. Such techniques perform well when sensor measurements are available at multiple snapshots. Recently, compressed sensing (CS) based DOA estimation techniques have been introduced, which improve source localization in the single snapshot case by modeling the angle search as a sparse recovery problem. In this domain, various on-grid and off-grid methods have been proposed in the existing literature [2] [3] [4]. The on-grid methods rely on a fixed basis and solve traditional CS based sparse recovery problems while the latter has modifications based on first-order Taylor approximation of the array manifold matrix. In this paper, we present an off-grid CS based formulation, where we employ an alternating minimization strategy for fine-grid search of source directions based on coordinate descent. We show that our technique outperforms the first-order approximation techniques whose performance is limited by the signal-norm dependent Taylor error.
{"title":"PERTURBED COMPRESSED SENSING BASED SINGLE SNAPSHOT DOA ESTIMATION","authors":"Himanshu Pandotra, R. Velmurugan, Karthik S. Gurumoorthy, Ajit V. Rajwade","doi":"10.1109/GlobalSIP.2018.8646583","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2018.8646583","url":null,"abstract":"Traditionally, direction of arrival (DOA) estimation techniques have been based on spectral estimation methods utilizing signal and noise subspaces [1]. Such techniques perform well when sensor measurements are available at multiple snapshots. Recently, compressed sensing (CS) based DOA estimation techniques have been introduced, which improve source localization in the single snapshot case by modeling the angle search as a sparse recovery problem. In this domain, various on-grid and off-grid methods have been proposed in the existing literature [2] [3] [4]. The on-grid methods rely on a fixed basis and solve traditional CS based sparse recovery problems while the latter has modifications based on first-order Taylor approximation of the array manifold matrix. In this paper, we present an off-grid CS based formulation, where we employ an alternating minimization strategy for fine-grid search of source directions based on coordinate descent. We show that our technique outperforms the first-order approximation techniques whose performance is limited by the signal-norm dependent Taylor error.","PeriodicalId":119131,"journal":{"name":"2018 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123990560","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}
Pub Date : 2018-11-01DOI: 10.1109/GLOBALSIP.2018.8645973
Shashini De Silva, Travis Hagan, Jinsub Kim, E. C. Sanchez
Time-synchronized phasor measurements from phasor measurement units (PMUs) are valuable for real time monitoring and control. However, their reliance on civilian GPS signals makes them vulnerable to GPS signal spoofing attacks which can be launched by an adversary to falsify PMU data entries. In this paper, we consider the problem of correcting PMU data to mitigate the impact of GPS spoofing attacks. We exploit the unique structure of how GPS spoofing attacks affect PMU data as well as the sparse nature of attacked PMUs. We formulate PMU data correction as a sparse optimization problem that incorporates the unique structure of GPS spoofing attacks. We develop an iterative greedy algorithm to recover tampered PMU measurements and demonstrate its efficacy using simulations with the IEEE RTS-96 test case under both observable and unobservable power network settings.
{"title":"SPARSE ERROR CORRECTION FOR PMU DATA UNDER GPS SPOOFING ATTACKS","authors":"Shashini De Silva, Travis Hagan, Jinsub Kim, E. C. Sanchez","doi":"10.1109/GLOBALSIP.2018.8645973","DOIUrl":"https://doi.org/10.1109/GLOBALSIP.2018.8645973","url":null,"abstract":"Time-synchronized phasor measurements from phasor measurement units (PMUs) are valuable for real time monitoring and control. However, their reliance on civilian GPS signals makes them vulnerable to GPS signal spoofing attacks which can be launched by an adversary to falsify PMU data entries. In this paper, we consider the problem of correcting PMU data to mitigate the impact of GPS spoofing attacks. We exploit the unique structure of how GPS spoofing attacks affect PMU data as well as the sparse nature of attacked PMUs. We formulate PMU data correction as a sparse optimization problem that incorporates the unique structure of GPS spoofing attacks. We develop an iterative greedy algorithm to recover tampered PMU measurements and demonstrate its efficacy using simulations with the IEEE RTS-96 test case under both observable and unobservable power network settings.","PeriodicalId":119131,"journal":{"name":"2018 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123231218","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：