Pub Date : 2016-09-28DOI: 10.1109/CEEC.2016.7835890
Louis-Pierre Bergé, N. Aouf, Thierry Duval, G. Coppin
In this paper, we present a process to simulate 3D data; as an unmanned combat aerial vehicle (drone) equipped with a Ladar sensor could do. The data obtained are colored 3D point clouds in where potential targets are highlighted. Our objective with these simulated corpus of 3D point cloud data is to explore the usage of Virtual Reality settings to validate the selection of a target. To do that we detail an implementation of a VR headset to visualize our simulated data. We also introduce a metric to estimate the visibility of the target.
{"title":"Generation and VR visualization of 3D point clouds for drone target validation assisted by an operator","authors":"Louis-Pierre Bergé, N. Aouf, Thierry Duval, G. Coppin","doi":"10.1109/CEEC.2016.7835890","DOIUrl":"https://doi.org/10.1109/CEEC.2016.7835890","url":null,"abstract":"In this paper, we present a process to simulate 3D data; as an unmanned combat aerial vehicle (drone) equipped with a Ladar sensor could do. The data obtained are colored 3D point clouds in where potential targets are highlighted. Our objective with these simulated corpus of 3D point cloud data is to explore the usage of Virtual Reality settings to validate the selection of a target. To do that we detail an implementation of a VR headset to visualize our simulated data. We also introduce a metric to estimate the visibility of the target.","PeriodicalId":114518,"journal":{"name":"2016 8th Computer Science and Electronic Engineering (CEEC)","volume":"299 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117053497","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 : 2016-09-01DOI: 10.1109/CEEC.2016.7835885
Maysa I. Abdulhussain, J. Q. Gan
Sparse autoencoder is a commonly used deep learning approach for automatically learning features from unlabelled data (unsupervised feature learning). This paper proposes class-specific (supervised) pre-trained approach based on sparse autoencoder to gain low-dimensional interesting structure of features with high performance in document classification. Experimental results have demonstrated the advantages and usefulness of the proposed method in document classification in high-dimensional feature space, in terms of the limited number of features required to achieve good classification accuracy.
{"title":"Class-specific pre-trained sparse autoencoders for learning effective features for document classification","authors":"Maysa I. Abdulhussain, J. Q. Gan","doi":"10.1109/CEEC.2016.7835885","DOIUrl":"https://doi.org/10.1109/CEEC.2016.7835885","url":null,"abstract":"Sparse autoencoder is a commonly used deep learning approach for automatically learning features from unlabelled data (unsupervised feature learning). This paper proposes class-specific (supervised) pre-trained approach based on sparse autoencoder to gain low-dimensional interesting structure of features with high performance in document classification. Experimental results have demonstrated the advantages and usefulness of the proposed method in document classification in high-dimensional feature space, in terms of the limited number of features required to achieve good classification accuracy.","PeriodicalId":114518,"journal":{"name":"2016 8th Computer Science and Electronic Engineering (CEEC)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132474088","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 : 2016-09-01DOI: 10.1109/CEEC.2016.7835887
Grigorios Kalliatakis, N. Vidakis, G. Triantafyllidis
Despite significant recent advances in the field of head pose estimation and facial expression recognition, raising the cognitive level when analysing human activity presents serious challenges to current concepts. Motivated by the need of generating comprehensible visual representations from different sets of data, we introduce a system capable of monitoring human activity through head pose and facial expression changes, utilising an affordable 3D sensing technology (Microsoft Kinect sensor). An approach build on discriminative random regression forests was selected in order to rapidly and accurately estimate head pose changes in unconstrained environment. In order to complete the secondary process of recognising four universal dominant facial expressions (happiness, anger, sadness and surprise), emotion recognition via facial expressions (ERFE) was adopted. After that, a lightweight data exchange format (JavaScript Object Notation-JSON) is employed, in order to manipulate the data extracted from the two aforementioned settings. Such mechanism can yield a platform for objective and effortless assessment of human activity within the context of serious gaming and human-computer interaction.
{"title":"Web-based visualisation of head pose and facial expressions changes: Monitoring human activity using depth data","authors":"Grigorios Kalliatakis, N. Vidakis, G. Triantafyllidis","doi":"10.1109/CEEC.2016.7835887","DOIUrl":"https://doi.org/10.1109/CEEC.2016.7835887","url":null,"abstract":"Despite significant recent advances in the field of head pose estimation and facial expression recognition, raising the cognitive level when analysing human activity presents serious challenges to current concepts. Motivated by the need of generating comprehensible visual representations from different sets of data, we introduce a system capable of monitoring human activity through head pose and facial expression changes, utilising an affordable 3D sensing technology (Microsoft Kinect sensor). An approach build on discriminative random regression forests was selected in order to rapidly and accurately estimate head pose changes in unconstrained environment. In order to complete the secondary process of recognising four universal dominant facial expressions (happiness, anger, sadness and surprise), emotion recognition via facial expressions (ERFE) was adopted. After that, a lightweight data exchange format (JavaScript Object Notation-JSON) is employed, in order to manipulate the data extracted from the two aforementioned settings. Such mechanism can yield a platform for objective and effortless assessment of human activity within the context of serious gaming and human-computer interaction.","PeriodicalId":114518,"journal":{"name":"2016 8th Computer Science and Electronic Engineering (CEEC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130727031","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 : 2016-09-01DOI: 10.1109/CEEC.2016.7835906
Sayed Qaiser Ali Shah, H. Zafar, Ivan Andonovic, T. Jan
In Vehicular Delay Tolerant Networks (VDTN) connection from source to destination at any required period is not necessarily available. Therefore, the node with the message, save it in its own buffer and carry it until an opportunity comes across for forwarding. Fix nodes enhances the performance of VDTN. It helps in message storage and relaying messages. Due to mobility the bit error rate is high in mobile nodes connection but it is not considered in any of the previous routing schemes for VDTN. The connection between fix nodes will always have low bit error rate as compared to connection involving mobile nodes. All the pervious schemes are one dimensional. Environmental hindrances are not taken under consideration as well. Its effect can be both negative and positive. In this paper, a scheme titled Hybrid routing scheme is suggested to overcome the above stated problems. Features of another vehicular network called Vehicular Ad Hoc Networks (VANETs) are added to Maximum Priority (MaxProp) routing scheme for VDTN. Different propagation models of VANETs are implemented for both with and without mobile node communication for VDTN. The concept of bit error rate is also featured in Hybrid routing scheme. This makes Hybrid routing scheme two dimensional and more intelligent. The implementation and performance assessment of the proposed scheme is evaluated via Opportunistic Network Environment (ONE) Simulator. The Hybrid routing scheme outperform MaxProp in terms of the delivery probability and delivery delay.
{"title":"Hybrid routing scheme for Vehicular Delay Tolerant Networks","authors":"Sayed Qaiser Ali Shah, H. Zafar, Ivan Andonovic, T. Jan","doi":"10.1109/CEEC.2016.7835906","DOIUrl":"https://doi.org/10.1109/CEEC.2016.7835906","url":null,"abstract":"In Vehicular Delay Tolerant Networks (VDTN) connection from source to destination at any required period is not necessarily available. Therefore, the node with the message, save it in its own buffer and carry it until an opportunity comes across for forwarding. Fix nodes enhances the performance of VDTN. It helps in message storage and relaying messages. Due to mobility the bit error rate is high in mobile nodes connection but it is not considered in any of the previous routing schemes for VDTN. The connection between fix nodes will always have low bit error rate as compared to connection involving mobile nodes. All the pervious schemes are one dimensional. Environmental hindrances are not taken under consideration as well. Its effect can be both negative and positive. In this paper, a scheme titled Hybrid routing scheme is suggested to overcome the above stated problems. Features of another vehicular network called Vehicular Ad Hoc Networks (VANETs) are added to Maximum Priority (MaxProp) routing scheme for VDTN. Different propagation models of VANETs are implemented for both with and without mobile node communication for VDTN. The concept of bit error rate is also featured in Hybrid routing scheme. This makes Hybrid routing scheme two dimensional and more intelligent. The implementation and performance assessment of the proposed scheme is evaluated via Opportunistic Network Environment (ONE) Simulator. The Hybrid routing scheme outperform MaxProp in terms of the delivery probability and delivery delay.","PeriodicalId":114518,"journal":{"name":"2016 8th Computer Science and Electronic Engineering (CEEC)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133474742","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 : 2016-09-01DOI: 10.1109/CEEC.2016.7835910
G. Licciardo, Carmine Cappetta, L. D. Benedetto
The Bachet weight decomposition method is used to design a new 2D convolution-based filter, specifically aimed to image processing. The filter substitutes multipliers with simplified floating point adders to emulate standard 32 bit floating point multipliers, by using a set of pre-computed coefficients. A careful organization of the memory, together with the optimized distribution of the related hard macros in the FPGA fabric, allow the elaboration of the data in raster scan order, as those directly provided by an acquisition source, without the need of frame buffers or additional aligning circuitry. The proposed design achieves a state-of-the-art critical path delay of 4.7 ns on a Xilinx Virtex 7 FPGA.
{"title":"FPGA optimization of convolution-based 2D filtering processor for image processing","authors":"G. Licciardo, Carmine Cappetta, L. D. Benedetto","doi":"10.1109/CEEC.2016.7835910","DOIUrl":"https://doi.org/10.1109/CEEC.2016.7835910","url":null,"abstract":"The Bachet weight decomposition method is used to design a new 2D convolution-based filter, specifically aimed to image processing. The filter substitutes multipliers with simplified floating point adders to emulate standard 32 bit floating point multipliers, by using a set of pre-computed coefficients. A careful organization of the memory, together with the optimized distribution of the related hard macros in the FPGA fabric, allow the elaboration of the data in raster scan order, as those directly provided by an acquisition source, without the need of frame buffers or additional aligning circuitry. The proposed design achieves a state-of-the-art critical path delay of 4.7 ns on a Xilinx Virtex 7 FPGA.","PeriodicalId":114518,"journal":{"name":"2016 8th Computer Science and Electronic Engineering (CEEC)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125848251","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 : 2016-09-01DOI: 10.1109/CEEC.2016.7835896
Patrick Veenstra, C. Cooper, S. Phelps
An analysis of the correlation between the returns of different securities is of fundamental importance in many areas of finance, such as portfolio optimisation. The most commonly used measure of correlation is the Pearson correlation coefficient; however, this suffers from several problems when applied to data from the real world. We propose an alternative estimator — the Biweight Mid Correlation (Bicor) — as a more robust measure for capturing the relationship between returns. We systematically evaluate Bicor empirically using data from the FTSE 100 constituents, and show that it is more robust when compared with the Pearson correlation coefficient. Finally, we demonstrate that Bicor can be used to improve a graph-based method of portfolio construction. Specifically, we show that when treating the correlation matrix as an adjacency matrix for a graph and using graph centrality to construct portfolios, the use of Bicor leads to better performing portfolios.
{"title":"The use of Biweight Mid Correlation to improve graph based portfolio construction","authors":"Patrick Veenstra, C. Cooper, S. Phelps","doi":"10.1109/CEEC.2016.7835896","DOIUrl":"https://doi.org/10.1109/CEEC.2016.7835896","url":null,"abstract":"An analysis of the correlation between the returns of different securities is of fundamental importance in many areas of finance, such as portfolio optimisation. The most commonly used measure of correlation is the Pearson correlation coefficient; however, this suffers from several problems when applied to data from the real world. We propose an alternative estimator — the Biweight Mid Correlation (Bicor) — as a more robust measure for capturing the relationship between returns. We systematically evaluate Bicor empirically using data from the FTSE 100 constituents, and show that it is more robust when compared with the Pearson correlation coefficient. Finally, we demonstrate that Bicor can be used to improve a graph-based method of portfolio construction. Specifically, we show that when treating the correlation matrix as an adjacency matrix for a graph and using graph centrality to construct portfolios, the use of Bicor leads to better performing portfolios.","PeriodicalId":114518,"journal":{"name":"2016 8th Computer Science and Electronic Engineering (CEEC)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127152554","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 : 2016-09-01DOI: 10.1109/CEEC.2016.7835911
Raluca D. Gaina, Diego Perez Liebana, S. Lucas
This paper presents a new track of the General Video Game AI competition for generic Artificial Intelligence agents, which features both competitive and cooperative real time stochastic two player games. The aim of the competition is to directly test agents against each other in more complex and dynamic environments, where there is an extra uncertainty in a game, consisting of the behaviour of the other player. The framework, server functionality and general competition setup are analysed and the results of the experiments with several sample controllers are presented. The results indicate that currently Open Loop Monte Carlo Tree Search is the overall leading algorithm on this set of games.
{"title":"General Video Game for 2 players: Framework and competition","authors":"Raluca D. Gaina, Diego Perez Liebana, S. Lucas","doi":"10.1109/CEEC.2016.7835911","DOIUrl":"https://doi.org/10.1109/CEEC.2016.7835911","url":null,"abstract":"This paper presents a new track of the General Video Game AI competition for generic Artificial Intelligence agents, which features both competitive and cooperative real time stochastic two player games. The aim of the competition is to directly test agents against each other in more complex and dynamic environments, where there is an extra uncertainty in a game, consisting of the behaviour of the other player. The framework, server functionality and general competition setup are analysed and the results of the experiments with several sample controllers are presented. The results indicate that currently Open Loop Monte Carlo Tree Search is the overall leading algorithm on this set of games.","PeriodicalId":114518,"journal":{"name":"2016 8th Computer Science and Electronic Engineering (CEEC)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130928511","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 : 2016-09-01DOI: 10.1109/CEEC.2016.7835915
M. Hasan, Kamal Abu-Hassan, Khin T. Lwin, M. A. Hossain
In a multi-criteria system, it is often required to optimize the decision according to the given problem set. In this paper, a reversible decision support system has been utilized in a human-machine system to select the best decision among the selected alternatives. A reversible decision support system is used to interchange the alternatives between inputs and outputs. It also examines the dissonance level while taking decisions and ranked alternatives according to the attributes and sub-attributes of each criterion. These decisions have been classified into two segments such as reversible and irreversible. This paper highlights the reversible aspects of the alternatives and how it can be performed better with minimum dissonance. Fuzzy analytic hierarchy process has been applied especially triangular membership function to evaluate interim judgments. Triangular fuzzy number is implemented to form the perception of alternatives with different weights for each factor and sub-factor. Moreover, this study reveals that cognitive dissonance can be reduced in a reversible environment to resolve multi-constraint. Finally, performance of the proposed reversible decision support system has been analysed through an experiment to demonstrate its merits and capabilities. The result shows that the final decision has less dissonance level and more satisfaction when users get the chance to reverse the decision.
{"title":"Reversible decision support system: Minimising cognitive dissonance in multi-criteria based complex system using fuzzy analytic hierarchy process","authors":"M. Hasan, Kamal Abu-Hassan, Khin T. Lwin, M. A. Hossain","doi":"10.1109/CEEC.2016.7835915","DOIUrl":"https://doi.org/10.1109/CEEC.2016.7835915","url":null,"abstract":"In a multi-criteria system, it is often required to optimize the decision according to the given problem set. In this paper, a reversible decision support system has been utilized in a human-machine system to select the best decision among the selected alternatives. A reversible decision support system is used to interchange the alternatives between inputs and outputs. It also examines the dissonance level while taking decisions and ranked alternatives according to the attributes and sub-attributes of each criterion. These decisions have been classified into two segments such as reversible and irreversible. This paper highlights the reversible aspects of the alternatives and how it can be performed better with minimum dissonance. Fuzzy analytic hierarchy process has been applied especially triangular membership function to evaluate interim judgments. Triangular fuzzy number is implemented to form the perception of alternatives with different weights for each factor and sub-factor. Moreover, this study reveals that cognitive dissonance can be reduced in a reversible environment to resolve multi-constraint. Finally, performance of the proposed reversible decision support system has been analysed through an experiment to demonstrate its merits and capabilities. The result shows that the final decision has less dissonance level and more satisfaction when users get the chance to reverse the decision.","PeriodicalId":114518,"journal":{"name":"2016 8th Computer Science and Electronic Engineering (CEEC)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129228365","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 : 2016-09-01DOI: 10.1109/CEEC.2016.7835912
G. Licciardo, Carmine Cappetta, L. D. Benedetto
In this paper a multiresolution architecture to expand the dynamic range of low dynamic range (LDR) images to 32-bit high dynamic range (HDR) counterpart is presented. The processor is capable to provide on-the-fly calculation of the edge-preserving bilateral filtering and luminance average, to images images up to full-HD images (1920×1080 pixels) using 25×9 filtering and up to 4K UHDTV images (3840×2160 pixels) using 25×5 filtering without frame buffers. To this end, a “hardware friendly” algorithm has been derived from the most effective methods presented in the literature. Additionally, the proposed design is capable of processing the input pixel in streaming order, as they come from input devices by avoiding frame buffers and eliminating external DRAM. The processor complexity can be configured with different area/speed ratios in order to meet the requirements of different FPGA platforms. Implemented on a high-end FPGA the processor achieves state-of-the art performances.
{"title":"Design and FPGA implementation of a real-time processor for the HDR conversion of images and videos","authors":"G. Licciardo, Carmine Cappetta, L. D. Benedetto","doi":"10.1109/CEEC.2016.7835912","DOIUrl":"https://doi.org/10.1109/CEEC.2016.7835912","url":null,"abstract":"In this paper a multiresolution architecture to expand the dynamic range of low dynamic range (LDR) images to 32-bit high dynamic range (HDR) counterpart is presented. The processor is capable to provide on-the-fly calculation of the edge-preserving bilateral filtering and luminance average, to images images up to full-HD images (1920×1080 pixels) using 25×9 filtering and up to 4K UHDTV images (3840×2160 pixels) using 25×5 filtering without frame buffers. To this end, a “hardware friendly” algorithm has been derived from the most effective methods presented in the literature. Additionally, the proposed design is capable of processing the input pixel in streaming order, as they come from input devices by avoiding frame buffers and eliminating external DRAM. The processor complexity can be configured with different area/speed ratios in order to meet the requirements of different FPGA platforms. Implemented on a high-end FPGA the processor achieves state-of-the art performances.","PeriodicalId":114518,"journal":{"name":"2016 8th Computer Science and Electronic Engineering (CEEC)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133732719","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 : 2016-09-01DOI: 10.1109/CEEC.2016.7835888
G. Barresi, J. Tessadori, L. Schiatti, D. Mazzanti, D. Caldwell, L. Mattos
In past decades, eye-tracking (ET) became one of the most widespread communication strategies for people with severe motor impairments (as in locked-in syndromes, LIS). ET cameras enable paralyzed patients to move a cursor across a user interface (UI) by means of their gaze, and to activate a selectable UI object after looking at it for a certain dwell time. This procedure is definitely intuitive and acceptable for many users. Nevertheless, such control function of gaze can become prone to errors if the dwell time duration is too short, not customized for each specific user. Considering such issue and the potential of brain-computer interface (BCI) systems in monitoring user's parameters like attention, it is possible to design hybrid ET-BCI solutions - labeled as EyeBCI in this paper - in order to improve the performance and the usability of ET. In this paper, a novel interaction concept is introduced to adapt the duration of the dwell time to the level of mental focus of the user of EyeBCI when he/she wants to select and activate a UI item: the dwell time shortens according to the raise of the observer's concentration, improving the system precision and responsiveness. In order to evaluate this solution, a pilot study was performed to compare different control conditions in terms of task performance and user experience: 3 ET conditions (different by duration of dwell time) and 2 EyeBCI conditions (BCI-triggered activation of UI items and BCI-modulated dwell time). The results demonstrated promising levels of performance and user experience when using the tested implementation of the novel EyeBCI. In addition, the capability of this new interaction paradigm to be self-adaptable to the user's goals has the potential to greatly enhance the usability of ET solutions for patients with LIS.
{"title":"Focus-sensitive dwell time in EyeBCI: Pilot study","authors":"G. Barresi, J. Tessadori, L. Schiatti, D. Mazzanti, D. Caldwell, L. Mattos","doi":"10.1109/CEEC.2016.7835888","DOIUrl":"https://doi.org/10.1109/CEEC.2016.7835888","url":null,"abstract":"In past decades, eye-tracking (ET) became one of the most widespread communication strategies for people with severe motor impairments (as in locked-in syndromes, LIS). ET cameras enable paralyzed patients to move a cursor across a user interface (UI) by means of their gaze, and to activate a selectable UI object after looking at it for a certain dwell time. This procedure is definitely intuitive and acceptable for many users. Nevertheless, such control function of gaze can become prone to errors if the dwell time duration is too short, not customized for each specific user. Considering such issue and the potential of brain-computer interface (BCI) systems in monitoring user's parameters like attention, it is possible to design hybrid ET-BCI solutions - labeled as EyeBCI in this paper - in order to improve the performance and the usability of ET. In this paper, a novel interaction concept is introduced to adapt the duration of the dwell time to the level of mental focus of the user of EyeBCI when he/she wants to select and activate a UI item: the dwell time shortens according to the raise of the observer's concentration, improving the system precision and responsiveness. In order to evaluate this solution, a pilot study was performed to compare different control conditions in terms of task performance and user experience: 3 ET conditions (different by duration of dwell time) and 2 EyeBCI conditions (BCI-triggered activation of UI items and BCI-modulated dwell time). The results demonstrated promising levels of performance and user experience when using the tested implementation of the novel EyeBCI. In addition, the capability of this new interaction paradigm to be self-adaptable to the user's goals has the potential to greatly enhance the usability of ET solutions for patients with LIS.","PeriodicalId":114518,"journal":{"name":"2016 8th Computer Science and Electronic Engineering (CEEC)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114532680","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
扫码关注我们
求助内容：
应助结果提醒方式：