Raika Karimi, L. Rosero, Mahsa Mirgholami, A. Asif, Arash Mohammadi
{"title":"Study on Novel Designs with Reduced Fatigue for Steady State Motion Visual Evoked Potentials","authors":"Raika Karimi, L. Rosero, Mahsa Mirgholami, A. Asif, Arash Mohammadi","doi":"10.1109/GlobalSIP45357.2019.8969186","DOIUrl":"https://doi.org/10.1109/GlobalSIP45357.2019.8969186","url":null,"abstract":"The paper focuses on incorporation of Brain Computer Interfacing (BCI) within an Augmented Reality (AR) platform to provide means for individuals with communication disabilities to interact with the outer world. Recently, there has been a recent surge of interest on Steady-State Visual Evoked Potentials (SSVEP). In a typical SSVEP-based BCI system, the virtual object within the AR environment flickers with a specific frequency while the signal processing module extracts the effects of the flickering frequency on the Electrophysiological (EEG) signals. Despite the popularity of SSVEPs, their utilization for practical application especially for assistive technologies is complicated and challenging due to eye fatigue and risk of induced epileptic seizure. In this regard, the key issue being targeted in this paper is addressing fatigue of flicker (or brightness modulation) by development of flicker-free steady-state motion visual evoked potential (SSMVEP). Two novel SSMVEP paradigms, i.e., Square-based and Circle-based paradigms, with low luminance contrast and oscillating expansion and contraction motions are designed, and integrated within a BCI system. Through experimental evaluations, high detection accuracy of 95.31% is achieved for the square-based SSMVEP.","PeriodicalId":221378,"journal":{"name":"2019 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124324958","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":"Graph Filtering with Quantization over Random Time-varying Graphs","authors":"Leila Ben Saad, E. Isufi, B. Beferull-Lozano","doi":"10.1109/GlobalSIP45357.2019.8969270","DOIUrl":"https://doi.org/10.1109/GlobalSIP45357.2019.8969270","url":null,"abstract":"Distributed graph filters can be implemented over wireless sensor networks by means of cooperation and exchanges among nodes. However, in practice, the performance of such graph filters is deeply affected by the quantization errors that are accumulated when the messages are transmitted. The latter is paramount to overcome the limitations in terms of bandwidth and computation capabilities in sensor nodes. In addition to quantization errors, distributed graph filters are also affected by random packet losses due to interferences and background noise, leading to the degradation of the performance in terms of the filtering accuracy. In this work, we consider the problem of designing graph filters that are robust to quantized data and time-varying topologies. We propose an optimized method that minimizes the quantization error, while ensuring an accurate filtering over time-varying graph topologies. The efficiency of the proposed theoretical findings is validated by numerical results in random wireless sensor networks.","PeriodicalId":221378,"journal":{"name":"2019 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124639508","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":"Dynamic Power Network State Estimation with Asynchronous Measurements","authors":"G. Cavraro, E. Dall’Anese, A. Bernstein","doi":"10.1109/GlobalSIP45357.2019.8969267","DOIUrl":"https://doi.org/10.1109/GlobalSIP45357.2019.8969267","url":null,"abstract":"The operation of distribution networks is becoming increasingly volatile, due to fast variations of renewables and, hence, net-loading conditions. To perform a reliable state estimation under these conditions, this paper considers the case where measurements from meters, phasor measurement units, and distributed energy resources are collected and processed in real time to produce estimates of the state at a fast time scale. Streams of measurements collected in real time and at heterogenous rates render the underlying processing asynchronous, and poses severe strains on workhorse state estimation algorithms. In this work, a real-time state estimation algorithm is proposed, where data are processed on the fly. Starting from a regularized least-squares model, and leveraging appropriate linear models, the proposed scheme boils down to a linear dynamical system where the state is updated based on the previous estimate and on the measurement gathered from a few available sensors. The estimation error is shown to be always bounded under mild condition. Numerical simulations are provided to corroborate the analytical findings.","PeriodicalId":221378,"journal":{"name":"2019 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124706961","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":"Identifying High-resolution Spatiotemporal Components Contributing to the Fast Spiking Response Dynamics of Visual Neurons","authors":"Yasin Zamani, Neda Nategh","doi":"10.1109/GlobalSIP45357.2019.8969435","DOIUrl":"https://doi.org/10.1109/GlobalSIP45357.2019.8969435","url":null,"abstract":"In many brain areas, responses to sensory stimuli vary due to other cognitive, motor, or task factors. In the visual system the integration of these modulatory factors and visual stimuli can change the spatiotemporal characteristics of visual neurons at various spatial and temporal scales. High resolution changes in the neurons’ spatiotemporal sensitivity happening on fast timescales, however, can challenge computational models that aim to capture the neural computations underlying these fast dynamics. The time-varying visual sensitivity around the time of eye movements is an exemplar of such fast, dynamic modulatory computations. This study develops a statistical framework for identifying the high-resolution spatiotemporal components of visual neurons in the middle temporal area of macaque monkeys during a rapid eye movement task. The identified components can be used in building dynamic encoding models capable of characterizing the time-varying stimulus-response relationships with high resolutions and at the level of single-trial spiking activity. Such dynamic models with high temporal precision can be used to provide higher accuracy in the decoding of time-varying visual information from neuronal responses, which can in turn advance visual brain-machine interface systems to be able to operate robustly and with high accuracy in dynamic scenes.","PeriodicalId":221378,"journal":{"name":"2019 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124762496","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":"Exploration of tensor decomposition applied to commercial building baseline estimation","authors":"David Hong, Shunbo Lei, J. Mathieu, L. Balzano","doi":"10.1109/GlobalSIP45357.2019.8969417","DOIUrl":"https://doi.org/10.1109/GlobalSIP45357.2019.8969417","url":null,"abstract":"Baseline estimation is a critical task for commercial buildings that participate in demand response programs and need to assess the impact of their strategies. The problem is to predict what the power profile would have been had the demand response event not taken place. This paper explores the use of tensor decomposition in baseline estimation. We apply the method to submetered fan power data from demand response experiments that were run to assess a fast demand response strategy expected to primarily impact the fans. Baselining this fan power data is critical for evaluating the results, but doing so presents new challenges not readily addressed by existing techniques designed primarily for baselining whole building electric loads. We find that tensor decomposition of the fan power data identifies components that capture both dominant daily patterns and demand response events, and that are generally more interpretable than those found by principal component analysis. We conclude by discussing how these components and related techniques can aid in developing new baseline models.","PeriodicalId":221378,"journal":{"name":"2019 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128490294","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}
Corey D. C. Heath, Hemanth Venkateswara, T. McDaniel, S. Panchanathan
{"title":"Using Multimodal Data for Automated Fidelity Evaluation in Pivotal Response Treatment Videos","authors":"Corey D. C. Heath, Hemanth Venkateswara, T. McDaniel, S. Panchanathan","doi":"10.1109/GlobalSIP45357.2019.8969089","DOIUrl":"https://doi.org/10.1109/GlobalSIP45357.2019.8969089","url":null,"abstract":"Research has shown that caregivers implementing pivotal response treatment (PRT) with their child with autism spectrum disorder (ASD) helps the child develop social and communication skills. Evaluation of caregiver fidelity to PRT in training programs and research studies relies on the evaluation of video probes depicting the caregiver interacting with his or her child. These video probes are reviewed by behavior analysts and are dependent on manual processing to extract data metrics. Using multimodal data processing techniques and machine learning could alleviate the human cost of evaluating the video probes by automating data analysis tasks.Creating an ’Opportunity to Respond’ is one of the categories used to evaluate caregiver fidelity to PRT implementation. A caregiver is determined to have successfully demonstrated cre-ating an opportunity to respond when they have delivered an appropriate instruction while she or he has the child’s attention. Automatically determining when the caregiver has correctly provided an opportunity to respond requires classifying the audio and video data from the probes. Combining the modalities into a single classification task can be undertaken using feature fusion or decision fusion methods. Two decision fusion configurations, and a feature fusion model were evaluated. The decision fusion models achieved higher accuracy, however the feature fusion model had a higher average F1 score, indicating more reliable prediction capability.","PeriodicalId":221378,"journal":{"name":"2019 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"62 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129620910","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":"Providing navigation assistance through ForceHand: a wearable force-feedback glove","authors":"Swagata Das, Y. Kurita","doi":"10.1109/GlobalSIP45357.2019.8969472","DOIUrl":"https://doi.org/10.1109/GlobalSIP45357.2019.8969472","url":null,"abstract":"Conveying information through force-feedback has multiple advantages as compared to auditory or visual information transfer. Kinesthetic senses, in general, have shown enormous importance in human communication and to the very experience of being human. Kinesthetic learners tend to learn complex tasks through force-feedback and tactile sensations, in much lesser time as compared to auditory and visual learners. Navigation cues provided through force-feedback could eliminate the need for intensively engaging oneself to mobile devices. This type of feedback cue could also eliminate the need for auditory and visual engagement of the user, which can help sustained awareness of the proximity. This paper attempts the realization of a navigation assistant using a force-feedback glove enabled with low-pressure pneumatic artificial muscles (PAMs). This glove enables the user to receive navigation cues through force-feedback on the forearm. We used a gaming environment to evaluate the feasibility of using the glove as a navigation assistant. The gaming experiment also provided vast subjective feedback. 89.5% of the participants chose force-feedback as their most preferred type of cue. In addition, an experiment was carried out to identify the optimum resolution of input air pressure that could be successfully differentiated by the users. The average % accuracy in identifying the correct larger force from pairs of forces was found to be 97.6%, 89.2%, 80.8%, and 75.6%, respectively, for resolutions of 20, 15, 10, and 5kPa.","PeriodicalId":221378,"journal":{"name":"2019 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132306246","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}
Dimitris G. Chachlakis, Yorgos Tsitsikas, E. Papalexakis, Panos P. Markopoulos
{"title":"Robust Multi-Relational Learning With Absolute Projection Rescal","authors":"Dimitris G. Chachlakis, Yorgos Tsitsikas, E. Papalexakis, Panos P. Markopoulos","doi":"10.1109/GlobalSIP45357.2019.8969097","DOIUrl":"https://doi.org/10.1109/GlobalSIP45357.2019.8969097","url":null,"abstract":"RESCAL is a popular approach for multi-relational learning based on tensor decomposition. At the same time, RESCAL follows a L2-norm formulation that can be very sensitive against outlying data corruptions. In this work, we propose A-RESCAL: a corruption-resistant reformulation of RESCAL based on absolute projections. Specifically, we (i) show that rank-1 A-RESCAL can be cast as a combinatorial problem over antipodal binary variables and solve it exactly by exhaustive search; (ii) develop an efficient iterative algorithm for approximating the solution to rank-1 A-RESCAL; and (iii) extend our solver for general rank by means of subspace deflation. Our experimental studies on multiple benchmark datasets show that A-RESCAL performs quite similarly to standard RESCAL when the processed data are nominal, while it is significantly more robust in the case of data corruption.","PeriodicalId":221378,"journal":{"name":"2019 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127836550","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}
Trevor C. Vannoy, Jacob J. Senecal, Veronika Strnadová-Neeley
{"title":"Improved Subspace K-Means Performance via a Randomized Matrix Decomposition","authors":"Trevor C. Vannoy, Jacob J. Senecal, Veronika Strnadová-Neeley","doi":"10.1109/GlobalSIP45357.2019.8969298","DOIUrl":"https://doi.org/10.1109/GlobalSIP45357.2019.8969298","url":null,"abstract":"Subspace clustering algorithms provide the capability to project a dataset onto bases that facilitate clustering. Proposed in 2017, the subspace k-means algorithm simultaneously performs clustering and dimensionality reduction with the goal of finding the optimal subspace for the cluster structure; this is accomplished by incorporating a trade-off between cluster and noise subspaces in the objective function. In this study, we improve subspace k-means by estimating a critical transformation matrix via a randomized eigenvalue decomposition. Our modification results in an order of magnitude runtime improvement on high dimensional data, while retaining the simplicity, interpretable subspace projections, and convergence guarantees of the original algorithm.","PeriodicalId":221378,"journal":{"name":"2019 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127876529","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}
Poul Hoang, Z. Tan, Jan Mark de Haan, T. Lunner, J. Jensen
{"title":"Robust Bayesian and Maximum a Posteriori Beamforming for Hearing Assistive Devices","authors":"Poul Hoang, Z. Tan, Jan Mark de Haan, T. Lunner, J. Jensen","doi":"10.1109/GlobalSIP45357.2019.8969234","DOIUrl":"https://doi.org/10.1109/GlobalSIP45357.2019.8969234","url":null,"abstract":"Multi-microphone speech enhancement systems often apply beamforming to enhance one or multiple desired signals in a noisy environment. Common for many beamforming methods, is that they require the direction-of-arrival (DOA) of the target sound source to be known in order to achieve optimal noise reduction performance. To improve robustness against DOA uncertainty, we propose maximum a posteriori (MAP) and Bayesian beamformers that are able to take advantage of prior information on the target direction. We compare the proposed MAP and Bayesian beamformers to state-of-the-art beamforming methods for noise reduction in hearing assistive devices. We evaluate the proposed beamformers in isotropic babble noise in terms of segmental SNR (SSNR) and extended short-time objective intelligibility (ESTOI). Results show that the proposed methods outperform current state-of-the-art beamformers used for noise reduction in hearing aids in most scenarios.","PeriodicalId":221378,"journal":{"name":"2019 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127980094","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}