Pub Date : 2016-07-06DOI: 10.1109/CITS.2016.7546437
J. Lu, Xiaoming Tao, Linhao Dong, N. Ge
Eye contact is one of critical aspects of video conference. In current video conference systems, an important problem is the shortage of eye contact. This is due to the direction disparity between the normal of focus plane of camera and the interlocutor's gaze. Currently, the state-of-the-method performs well on gaze correction with only single webcam. However, this method that applied to the sequences with face obscured has shown unsatisfying results. In this paper, we propose a novel model-based gaze correction scheme to independently build the eye models, the nose model and the mouth model independently so that the occlusion problem can be solved effectively. To be more specific, by rotating the aforementioned four models at a pre-detected displacement, the degree of gaze correction can be obtained. The facial appearance that is occluded will not be rotated, which will prevent the occluding object from being distorted. Experiment results show that, under different parts of occluding objects, our method can achieve better performance on gaze correction than the current method in terms of perceived quality in two scenes usually appearing in conversational videos.
{"title":"Chunk-wise face model based gaze correction in conversational videos with single camera","authors":"J. Lu, Xiaoming Tao, Linhao Dong, N. Ge","doi":"10.1109/CITS.2016.7546437","DOIUrl":"https://doi.org/10.1109/CITS.2016.7546437","url":null,"abstract":"Eye contact is one of critical aspects of video conference. In current video conference systems, an important problem is the shortage of eye contact. This is due to the direction disparity between the normal of focus plane of camera and the interlocutor's gaze. Currently, the state-of-the-method performs well on gaze correction with only single webcam. However, this method that applied to the sequences with face obscured has shown unsatisfying results. In this paper, we propose a novel model-based gaze correction scheme to independently build the eye models, the nose model and the mouth model independently so that the occlusion problem can be solved effectively. To be more specific, by rotating the aforementioned four models at a pre-detected displacement, the degree of gaze correction can be obtained. The facial appearance that is occluded will not be rotated, which will prevent the occluding object from being distorted. Experiment results show that, under different parts of occluding objects, our method can achieve better performance on gaze correction than the current method in terms of perceived quality in two scenes usually appearing in conversational videos.","PeriodicalId":340958,"journal":{"name":"2016 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132044872","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-07-06DOI: 10.1109/CITS.2016.7546452
Yuxin Li, Yinghui Ye, G. Lu, Cai Xu
In diversity-based multiple antenna cognitive radio system, the performance of the existing cooperative spectrum sensing algorithms based on covariance matrix degrades seriously due to the channel correlation. In this paper, we formulate spectrum sensing as a multinomial distribution test problem, and then apply the Discrete Anderson Darling (DAD) test, one of discrete goodness of fit tests, to examining the above problem. The proposed algorithm dubbed DAD sensing is assessed through Monte Carlo simulations. It is shown that the performance of DAD sensing is robust to the antenna correlation and noise uncertainty.
{"title":"Cooperative spectrum sensing using discrete goodness of fit testing for multi-antenna cognitive radio system","authors":"Yuxin Li, Yinghui Ye, G. Lu, Cai Xu","doi":"10.1109/CITS.2016.7546452","DOIUrl":"https://doi.org/10.1109/CITS.2016.7546452","url":null,"abstract":"In diversity-based multiple antenna cognitive radio system, the performance of the existing cooperative spectrum sensing algorithms based on covariance matrix degrades seriously due to the channel correlation. In this paper, we formulate spectrum sensing as a multinomial distribution test problem, and then apply the Discrete Anderson Darling (DAD) test, one of discrete goodness of fit tests, to examining the above problem. The proposed algorithm dubbed DAD sensing is assessed through Monte Carlo simulations. It is shown that the performance of DAD sensing is robust to the antenna correlation and noise uncertainty.","PeriodicalId":340958,"journal":{"name":"2016 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"305 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132150104","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-07-06DOI: 10.1109/CITS.2016.7546409
Genfa Zhang, Jun Yan, Bingcheng Zhu, Weiping Zhu
In this paper, a relay node placement for free-space optical (FSO) communication system are proposed for different multi-user and communication service requirements. First, the relay problem is formulated as the constraint multi-objective optimization framework. The outage probability function of each user, the obstacle and feasible region are described as the objective function and the constraint function respectively. Then, the multi-objective optimization problem is transformed into a single-objective optimization problem, according to each different communication service requirement. At last, the optimal position of each relay node can be obtained using the linear weight parameter method. The simulation test are carried out under different practical environments.
{"title":"A relay node placement for free space optical communication system under multi-user environments","authors":"Genfa Zhang, Jun Yan, Bingcheng Zhu, Weiping Zhu","doi":"10.1109/CITS.2016.7546409","DOIUrl":"https://doi.org/10.1109/CITS.2016.7546409","url":null,"abstract":"In this paper, a relay node placement for free-space optical (FSO) communication system are proposed for different multi-user and communication service requirements. First, the relay problem is formulated as the constraint multi-objective optimization framework. The outage probability function of each user, the obstacle and feasible region are described as the objective function and the constraint function respectively. Then, the multi-objective optimization problem is transformed into a single-objective optimization problem, according to each different communication service requirement. At last, the optimal position of each relay node can be obtained using the linear weight parameter method. The simulation test are carried out under different practical environments.","PeriodicalId":340958,"journal":{"name":"2016 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114737570","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-07-06DOI: 10.1109/CITS.2016.7546451
P. V. Krishna, S. Misra, D. Nagaraju, V. Saritha, M. Obaidat
In recent years, mobile cloud computing (MCC) is treated as one of the important enablers of Internet of Things. MCC has evolved from a mix of mobile computing and cloud computing. Most of the researcher works on MCC focus on the reduction of cost of applications in mobile devices by leveraging cloud technology. The limitations of mobile environment such as computation capacity, battery power and limited memory lead to the integration of cloud technology. The performance of the mobile environment improves by the implementation of task offloading using cloud technology. In this paper, a model for task offloading using learning automata based decision making algorithm (LADMA) is proposed. The algorithm considers the completion time and energy consumption of the tasks during the allocation of the tasks to the suitable VMs in the cloud. The proposed model is tested on Amazon EC2 and Android X 86 Platforms.
{"title":"Learning automata based decision making algorithm for task offloading in mobile cloud","authors":"P. V. Krishna, S. Misra, D. Nagaraju, V. Saritha, M. Obaidat","doi":"10.1109/CITS.2016.7546451","DOIUrl":"https://doi.org/10.1109/CITS.2016.7546451","url":null,"abstract":"In recent years, mobile cloud computing (MCC) is treated as one of the important enablers of Internet of Things. MCC has evolved from a mix of mobile computing and cloud computing. Most of the researcher works on MCC focus on the reduction of cost of applications in mobile devices by leveraging cloud technology. The limitations of mobile environment such as computation capacity, battery power and limited memory lead to the integration of cloud technology. The performance of the mobile environment improves by the implementation of task offloading using cloud technology. In this paper, a model for task offloading using learning automata based decision making algorithm (LADMA) is proposed. The algorithm considers the completion time and energy consumption of the tasks during the allocation of the tasks to the suitable VMs in the cloud. The proposed model is tested on Amazon EC2 and Android X 86 Platforms.","PeriodicalId":340958,"journal":{"name":"2016 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127546229","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-07-06DOI: 10.1109/CITS.2016.7546457
Z. Fu, B. Luo, Chun Wu, Q. Qin
This paper presents an optimized descriptor method for multispectral images. The method proposed is based on LGHD (Log-Gabor Histogram Descriptor)[1]. Initially, all feature points are detected from Long wave Infrared and Visible spectrum images, and descripted by LGHD, then PCA (Principal Component Analysis) is used to reduce the dimension of the two different descriptors, finally the optimized descriptors are used to match the points. Experimental results show that proposed approach achieves a better matching performance than LGHD.
{"title":"A novel descriptor optimization method for multispectral images","authors":"Z. Fu, B. Luo, Chun Wu, Q. Qin","doi":"10.1109/CITS.2016.7546457","DOIUrl":"https://doi.org/10.1109/CITS.2016.7546457","url":null,"abstract":"This paper presents an optimized descriptor method for multispectral images. The method proposed is based on LGHD (Log-Gabor Histogram Descriptor)[1]. Initially, all feature points are detected from Long wave Infrared and Visible spectrum images, and descripted by LGHD, then PCA (Principal Component Analysis) is used to reduce the dimension of the two different descriptors, finally the optimized descriptors are used to match the points. Experimental results show that proposed approach achieves a better matching performance than LGHD.","PeriodicalId":340958,"journal":{"name":"2016 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132314290","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-07-06DOI: 10.1109/CITS.2016.7546429
Zongmin Cui, Peng Yue, Yao Ji
Enormous applications which are enabled using Vehicular Ad Hoc Networks (VANETs) require a both efficient and reliable data delivery. Visible Light Communication (VLC), which has high transmission rate without using Radio Frequency (RF) spectrum, is regard as a candidate for data transmission in VANETs. Since a VLC system requires a line-of-sight communication, the position and the posture of LEDs and receivers play key roles in VLC. Unfortunately the position and the posture always change with vehicle motion and may make the performance of VLC become severe and even result in the outage of VLC. In this paper, we present an improved Vehicle-to-Vehicle (V2V) model and an improved Vehicle-to-Infrastructure (V2I) model in consideration of the position and the posture. In order to get diversity gains and reduce the VLC interruption caused by vehicle motion, we propose a VLC based cooperative diversity scheme. Finally simulation results show that the cooperative diversity scheme can decrease the Bit-Error-Rate (BER) significantly and reduce the VLC interruption caused by vehicle motion.
{"title":"Study of cooperative diversity scheme based on visible light communication in VANETs","authors":"Zongmin Cui, Peng Yue, Yao Ji","doi":"10.1109/CITS.2016.7546429","DOIUrl":"https://doi.org/10.1109/CITS.2016.7546429","url":null,"abstract":"Enormous applications which are enabled using Vehicular Ad Hoc Networks (VANETs) require a both efficient and reliable data delivery. Visible Light Communication (VLC), which has high transmission rate without using Radio Frequency (RF) spectrum, is regard as a candidate for data transmission in VANETs. Since a VLC system requires a line-of-sight communication, the position and the posture of LEDs and receivers play key roles in VLC. Unfortunately the position and the posture always change with vehicle motion and may make the performance of VLC become severe and even result in the outage of VLC. In this paper, we present an improved Vehicle-to-Vehicle (V2V) model and an improved Vehicle-to-Infrastructure (V2I) model in consideration of the position and the posture. In order to get diversity gains and reduce the VLC interruption caused by vehicle motion, we propose a VLC based cooperative diversity scheme. Finally simulation results show that the cooperative diversity scheme can decrease the Bit-Error-Rate (BER) significantly and reduce the VLC interruption caused by vehicle motion.","PeriodicalId":340958,"journal":{"name":"2016 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132161493","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-07-06DOI: 10.1109/CITS.2016.7546435
Yongquan Cai, Yuchen Jiang
Support Vector Data Description (SVDD) has a limitation for dealing with a large dataset or online learning tasks. This work investigates the practice of credit scoring and proposes a new incremental learning algorithm for SVDD based on Karush-Kuhn-Tucker (KKT) conditions and convex hull. Convex hull and part of newly added samples which violates KKT conditions are treated as new training samples instead of previous support vector and entire new arrived samples. The proposed method can achieve comparable training time with traditional incremental learning algorithm for SVDD while have similar classification accuracy with original SVDD.
{"title":"Credit scoring using incremental learning algorithm for SVDD","authors":"Yongquan Cai, Yuchen Jiang","doi":"10.1109/CITS.2016.7546435","DOIUrl":"https://doi.org/10.1109/CITS.2016.7546435","url":null,"abstract":"Support Vector Data Description (SVDD) has a limitation for dealing with a large dataset or online learning tasks. This work investigates the practice of credit scoring and proposes a new incremental learning algorithm for SVDD based on Karush-Kuhn-Tucker (KKT) conditions and convex hull. Convex hull and part of newly added samples which violates KKT conditions are treated as new training samples instead of previous support vector and entire new arrived samples. The proposed method can achieve comparable training time with traditional incremental learning algorithm for SVDD while have similar classification accuracy with original SVDD.","PeriodicalId":340958,"journal":{"name":"2016 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131933326","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-07-06DOI: 10.1109/CITS.2016.7546453
Xiaochuan Guo, Xinchang Liu, Guiming Chen, Leilei Chang, Xiang Li
This study proposes an optimization method for the missile weapon system-of-systems (MWSoS) based on information entropy. However, there are multiple challenges, such as the diversity of input values and the non uniform measurement standards. Therefore, the information entropy based method is proposed due to its advantages in dealing with these challenges. This method uses the uniform standard to measure the input value of capability indexes, which further proposes an index aggregation evaluation method based on the information entropy. The proposed approach is validated by an illustrated MWSoS optimization example, which shows the practicability and effectiveness of the method. This method can be more efficiently applied for MWSoS optimization, which provides the decision-making basis for missile weapon.
{"title":"Missile weapon system-of-systems optimization method based on information entropy","authors":"Xiaochuan Guo, Xinchang Liu, Guiming Chen, Leilei Chang, Xiang Li","doi":"10.1109/CITS.2016.7546453","DOIUrl":"https://doi.org/10.1109/CITS.2016.7546453","url":null,"abstract":"This study proposes an optimization method for the missile weapon system-of-systems (MWSoS) based on information entropy. However, there are multiple challenges, such as the diversity of input values and the non uniform measurement standards. Therefore, the information entropy based method is proposed due to its advantages in dealing with these challenges. This method uses the uniform standard to measure the input value of capability indexes, which further proposes an index aggregation evaluation method based on the information entropy. The proposed approach is validated by an illustrated MWSoS optimization example, which shows the practicability and effectiveness of the method. This method can be more efficiently applied for MWSoS optimization, which provides the decision-making basis for missile weapon.","PeriodicalId":340958,"journal":{"name":"2016 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115878092","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-07-06DOI: 10.1109/CITS.2016.7546392
Lingsen Zhu, Xiaohui Zhao, Yongjun Xu
Orthogonal frequency division multiplexing (OFD-M)based cognitive radio networks (CRNs) is a promising paradigm to increase spectrum efficiency and achieve flexible resource allocation. However, previous works either lack the consideration of channel uncertainties or ignore the effect of imperfect spectrum sensing. In this paper, we focus on the power control for a downlink OFDM-based CRN with the consideration of both parametric uncertainties and spectrum sensing errors. A robust power control strategy based on the worst case approach to maximize achievable data rate of secondary user is proposed while satisfying the interference constraint and power budget constraint. Simulation results demonstrate that our proposed worst case approach exhibits improved performance since it can obtain a relatively good data rate and provide a better protection for primary user.
{"title":"Robust power control for cognitive radio networks under spectrum sensing errors","authors":"Lingsen Zhu, Xiaohui Zhao, Yongjun Xu","doi":"10.1109/CITS.2016.7546392","DOIUrl":"https://doi.org/10.1109/CITS.2016.7546392","url":null,"abstract":"Orthogonal frequency division multiplexing (OFD-M)based cognitive radio networks (CRNs) is a promising paradigm to increase spectrum efficiency and achieve flexible resource allocation. However, previous works either lack the consideration of channel uncertainties or ignore the effect of imperfect spectrum sensing. In this paper, we focus on the power control for a downlink OFDM-based CRN with the consideration of both parametric uncertainties and spectrum sensing errors. A robust power control strategy based on the worst case approach to maximize achievable data rate of secondary user is proposed while satisfying the interference constraint and power budget constraint. Simulation results demonstrate that our proposed worst case approach exhibits improved performance since it can obtain a relatively good data rate and provide a better protection for primary user.","PeriodicalId":340958,"journal":{"name":"2016 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123700109","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-07-06DOI: 10.1109/CITS.2016.7546386
Yamin Li, Wanming Chu
This paper describes digit-by-digit integer restoring and non-restoring algorithms for computing the cube root of a 33-bit radicand and gives improved methods for the implementations of the algorithms to speed up the computations. The methods include calculating multiplication products in advance with additions and using carry save adders (CSAs) to calculate the partial remainder at each iteration. The cost/performance is evaluated by implementing the algorithms on an FPGA chip. The results show that the CSA methods achieve performance speedups of 199.63% and 177.06%, for restoring and non-restoring cube root algorithms, respectively.
{"title":"On the improved implementations and performance evaluation of digit-by-digit integer restoring and non-restoring cube root algorithms","authors":"Yamin Li, Wanming Chu","doi":"10.1109/CITS.2016.7546386","DOIUrl":"https://doi.org/10.1109/CITS.2016.7546386","url":null,"abstract":"This paper describes digit-by-digit integer restoring and non-restoring algorithms for computing the cube root of a 33-bit radicand and gives improved methods for the implementations of the algorithms to speed up the computations. The methods include calculating multiplication products in advance with additions and using carry save adders (CSAs) to calculate the partial remainder at each iteration. The cost/performance is evaluated by implementing the algorithms on an FPGA chip. The results show that the CSA methods achieve performance speedups of 199.63% and 177.06%, for restoring and non-restoring cube root algorithms, respectively.","PeriodicalId":340958,"journal":{"name":"2016 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"197 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124398160","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
扫码关注我们
求助内容：
应助结果提醒方式：