Pub Date : 2011-12-01DOI: 10.1109/ISCIT.2011.6089948
Yanyan Shen, G. Feng, Bo Yang, X. Guan
This paper focuses on the problem of fair resource allocation in wireless multi-user multi-relay networks where both constant-rate users and variable-rate users exist. The problem is formulated as an optimization problem targeting at finding the Nash bargaining solution for the variable-rate users subject to a set of users' rate constraints and a set of relay power constraints. The formulated problem is proven to be a concave maximization problem, and the dual decomposition method is employed to find the optimal solution. Based on this method, a distributed algorithm is then proposed and its convergence is proved as well. Finally, simulations validate the convergence and fairness of the proposed algorithm.
{"title":"Distributed fair resource allocation in wireless multi-user multi-relay networks with heterogeneous rate constraints","authors":"Yanyan Shen, G. Feng, Bo Yang, X. Guan","doi":"10.1109/ISCIT.2011.6089948","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6089948","url":null,"abstract":"This paper focuses on the problem of fair resource allocation in wireless multi-user multi-relay networks where both constant-rate users and variable-rate users exist. The problem is formulated as an optimization problem targeting at finding the Nash bargaining solution for the variable-rate users subject to a set of users' rate constraints and a set of relay power constraints. The formulated problem is proven to be a concave maximization problem, and the dual decomposition method is employed to find the optimal solution. Based on this method, a distributed algorithm is then proposed and its convergence is proved as well. Finally, simulations validate the convergence and fairness of the proposed algorithm.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126282594","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 : 2011-12-01DOI: 10.1109/ISCIT.2011.6092167
Toru Kuboshiki, Hidekazu Suzuki, A. Watanabe
With a possible exhaustion of global IPv4 addresses, shifting to IPv6 is thought to be inevitable. However, when the shifting to IPv6 actually occurs, network topology could be inferred from addresses in the organization. Thus, as a means to conceal network topology, various methods, including the use of Mobile IPv6 and the setting-up of routers for host routes, are being proposed. However, redundant routings become a problem in the case of Mobile IPv6, and increases in the routing tables become a problem in the case of host routing. In this paper, we define new addresses to conceal network topology and propose a communication method using these addresses. We also describe our idea of implementing our method.
{"title":"Proposal on the concealment of the network topology in IPv6","authors":"Toru Kuboshiki, Hidekazu Suzuki, A. Watanabe","doi":"10.1109/ISCIT.2011.6092167","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6092167","url":null,"abstract":"With a possible exhaustion of global IPv4 addresses, shifting to IPv6 is thought to be inevitable. However, when the shifting to IPv6 actually occurs, network topology could be inferred from addresses in the organization. Thus, as a means to conceal network topology, various methods, including the use of Mobile IPv6 and the setting-up of routers for host routes, are being proposed. However, redundant routings become a problem in the case of Mobile IPv6, and increases in the routing tables become a problem in the case of host routing. In this paper, we define new addresses to conceal network topology and propose a communication method using these addresses. We also describe our idea of implementing our method.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":"134 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134106377","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 : 2011-12-01DOI: 10.1109/ISCIT.2011.6089960
Dongho Lee, Kwangsung Ju, K. Chung
Multihop tactical network applications require that mission-critical data should be guaranteed to be delivered to their corresponding targets in time. However, end-to-end QoS (Quality of Service) assurance in multihop networks is a very challenging topic. Several schemes have been proposed to provide end-to-end delay assurance for multihop wireless network environment. However, these schemes do not consider the situation that the network is overloaded and burst collision is occurred. In this paper, we propose the dynamic traffic prioritization scheme for multihop tactical networks. The proposed scheme dynamically assigns priorities to traffic according to network status and the newly defined traffic categories in order to achieve guaranteed end-to-end QoS in multihop tactical networks. In addition, when the burst collision is occurred, the proposed scheme satisfies the requirement of mission-critical data by sacrificing the QoS requirement of non-mission-critical data.
{"title":"Dynamic traffic prioritization scheme for multihop tactical networks","authors":"Dongho Lee, Kwangsung Ju, K. Chung","doi":"10.1109/ISCIT.2011.6089960","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6089960","url":null,"abstract":"Multihop tactical network applications require that mission-critical data should be guaranteed to be delivered to their corresponding targets in time. However, end-to-end QoS (Quality of Service) assurance in multihop networks is a very challenging topic. Several schemes have been proposed to provide end-to-end delay assurance for multihop wireless network environment. However, these schemes do not consider the situation that the network is overloaded and burst collision is occurred. In this paper, we propose the dynamic traffic prioritization scheme for multihop tactical networks. The proposed scheme dynamically assigns priorities to traffic according to network status and the newly defined traffic categories in order to achieve guaranteed end-to-end QoS in multihop tactical networks. In addition, when the burst collision is occurred, the proposed scheme satisfies the requirement of mission-critical data by sacrificing the QoS requirement of non-mission-critical data.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132746133","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 : 2011-12-01DOI: 10.1109/ISCIT.2011.6092166
Xin Song, Jinkuan Wang, Qiuming Li, Jingguo Ren, Han Wang
A novel robust least squares constant modulus algorithm (LSCMA) is proposed for blind adaptive beamforming, which is based on explicit modeling of uncertainty in the desired signal array. To improve robustness, the weight vector is optimized to involve minimization of cost function, while imposing the oblique projection constraint on the weight vector and maintaining a distortionless response for the worst-case signal steering vector. The proposed algorithm appears to be an appealing technique for blind adaptive beamforming that combines excellent robustness with low computational complexity. The numerical experiments have been carried out to demonstrate the superiority of the proposed algorithm on beampattern control and output SINR enhancement.
{"title":"Robust blind beamforming algorithm via the oblique projection method","authors":"Xin Song, Jinkuan Wang, Qiuming Li, Jingguo Ren, Han Wang","doi":"10.1109/ISCIT.2011.6092166","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6092166","url":null,"abstract":"A novel robust least squares constant modulus algorithm (LSCMA) is proposed for blind adaptive beamforming, which is based on explicit modeling of uncertainty in the desired signal array. To improve robustness, the weight vector is optimized to involve minimization of cost function, while imposing the oblique projection constraint on the weight vector and maintaining a distortionless response for the worst-case signal steering vector. The proposed algorithm appears to be an appealing technique for blind adaptive beamforming that combines excellent robustness with low computational complexity. The numerical experiments have been carried out to demonstrate the superiority of the proposed algorithm on beampattern control and output SINR enhancement.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128035496","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 : 2011-12-01DOI: 10.1109/ISCIT.2011.6089730
Peng Shao, A. Matsumoto, S. Aust, Tetsuya Ito, P. Davis
Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) access control protocol is used in the wireless LAN (WLAN) to suppress interferences. According to the CSMA/CA, if the transmitter does not receive an acknowledgment (ACK) control frame from the receiver after transmission, it will assume the previous transmission has failed and repeat the transmission. In order to evaluate the transmission channel and optimize the transmission parameters for improving the efficiency of data transmission it is necessary to distinguish the reason for transmission failure — collisions or attenuation in the transmission channel. Some enhanced collision detection methods for IEEE 802.11 WLAN have been proposed. In these schemes, the exchange of detection information is necessary, which could lead to additional collisions. So the detection information itself might not be received correctly due to collisions. In this paper, we propose a novel collision detection method, based on signal power sensing and time-domain signal processing, for transmitting stations in WLAN, which does not require the feedback of information from the receiver. With the calculation of collision frequency, the transmission parameters can be adjusted to improve the efficiency of data transmission. The effectiveness of the proposed collision detection method is verified in an experiment.
CSMA/CA (Carrier Sense Multiple Access with Collision Avoidance)访问控制协议用于无线局域网(WLAN)中抑制干扰。根据CSMA/CA，如果发送方在发送后没有收到接收方的确认(ACK)控制帧，它将假定之前的传输失败并重复传输。为了对传输信道进行评价和优化传输参数以提高数据传输效率，必须区分传输失败的原因——传输信道中的碰撞或衰减。针对IEEE 802.11无线局域网提出了一些增强的碰撞检测方法。在这些方案中，检测信息的交换是必要的，这可能导致额外的碰撞。因此，由于碰撞，检测信息本身可能无法正确接收。本文提出了一种基于信号功率感知和时域信号处理的无线局域网发射站碰撞检测方法，该方法不需要接收端反馈信息。通过对碰撞频率的计算，可以调整传输参数，提高数据传输效率。实验验证了所提出的碰撞检测方法的有效性。
{"title":"A collision detection method based on power sensing and time-domain signal processing for wireless LAN","authors":"Peng Shao, A. Matsumoto, S. Aust, Tetsuya Ito, P. Davis","doi":"10.1109/ISCIT.2011.6089730","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6089730","url":null,"abstract":"Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) access control protocol is used in the wireless LAN (WLAN) to suppress interferences. According to the CSMA/CA, if the transmitter does not receive an acknowledgment (ACK) control frame from the receiver after transmission, it will assume the previous transmission has failed and repeat the transmission. In order to evaluate the transmission channel and optimize the transmission parameters for improving the efficiency of data transmission it is necessary to distinguish the reason for transmission failure — collisions or attenuation in the transmission channel. Some enhanced collision detection methods for IEEE 802.11 WLAN have been proposed. In these schemes, the exchange of detection information is necessary, which could lead to additional collisions. So the detection information itself might not be received correctly due to collisions. In this paper, we propose a novel collision detection method, based on signal power sensing and time-domain signal processing, for transmitting stations in WLAN, which does not require the feedback of information from the receiver. With the calculation of collision frequency, the transmission parameters can be adjusted to improve the efficiency of data transmission. The effectiveness of the proposed collision detection method is verified in an experiment.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116439105","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 : 2011-12-01DOI: 10.1109/ISCIT.2011.6089724
Chan Zheng, Yiqing Zhang, Ling Yin
Connected dominated subsets (CDS) of nodes in wireless sensor network are always selected to form a virtual backbone. Construction of r-hop connected k-dominating sets ((k, r)-CDS) can reduce the size of CDS and the total amount of information to be transmitted. Their multiple dominating properties can provide higher fault tolerance and robustness as well. In this paper a (k, r)-CDS construction approximation algorithm for wireless sensor and ad-hoc networks is presented. The main strategy is partition to clusters, from which the r-hop k-dominating set nodes ((k, r)-DS) are selected separately. Then (k, r)-DS are connected together to form (k, r)-CDS. Extensive simulations according to the algorithm steps have been conducted. Performance with detailed analysis has been shown at last.
{"title":"Constructing (k, r)-connected dominating sets for robust backbone in wireless sensor networks","authors":"Chan Zheng, Yiqing Zhang, Ling Yin","doi":"10.1109/ISCIT.2011.6089724","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6089724","url":null,"abstract":"Connected dominated subsets (CDS) of nodes in wireless sensor network are always selected to form a virtual backbone. Construction of r-hop connected k-dominating sets ((k, r)-CDS) can reduce the size of CDS and the total amount of information to be transmitted. Their multiple dominating properties can provide higher fault tolerance and robustness as well. In this paper a (k, r)-CDS construction approximation algorithm for wireless sensor and ad-hoc networks is presented. The main strategy is partition to clusters, from which the r-hop k-dominating set nodes ((k, r)-DS) are selected separately. Then (k, r)-DS are connected together to form (k, r)-CDS. Extensive simulations according to the algorithm steps have been conducted. Performance with detailed analysis has been shown at last.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":"303 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114523936","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 : 2011-12-01DOI: 10.1109/ISCIT.2011.6092185
Yan Li, J. Ge, Cheng Shen, Jing Li, Wang Miao
Coordinated Multi-Point transmission (CoMP) has been recognized as one of the most promising technologies in the 4th generation (4G) cellular systems. It can significantly increase the spectral efficiency by combining the data from different eNBs. However, the benefits come at the cost of the increased feedback overhead. In the downlink frequency division duplex (FDD) systems, UEs need to feedback their channel state information (CSI) to the eNBs. As the feedback channel is limited, the quantization of the channel coefficients is necessary. In the conventional noncooperative networks, the feedback overhead can be reduced by allowing UEs with good channel qualities to feedback their CSIs, which is known as the selective feedback. In this paper, we extend this scheme to CoMP systems by the introduction of concatenated codebook. Since the quantization of the channel will result in quantization error, we define a new method to calculate the received SNRs from a specific channel taking quantization error into account. Based on this new method, UEs with weak link would not feedback the CSIs to the cooperative eNBs, which reduces the feedback overhead. We also derive the closed-form expression for the feedback overhead in terms of the SNR threshold. Finally, numerical simulations are provided to prove the effectiveness of our new method.
{"title":"Coordinated multi-point transmission with limited feedback for LTE-advanced","authors":"Yan Li, J. Ge, Cheng Shen, Jing Li, Wang Miao","doi":"10.1109/ISCIT.2011.6092185","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6092185","url":null,"abstract":"Coordinated Multi-Point transmission (CoMP) has been recognized as one of the most promising technologies in the 4th generation (4G) cellular systems. It can significantly increase the spectral efficiency by combining the data from different eNBs. However, the benefits come at the cost of the increased feedback overhead. In the downlink frequency division duplex (FDD) systems, UEs need to feedback their channel state information (CSI) to the eNBs. As the feedback channel is limited, the quantization of the channel coefficients is necessary. In the conventional noncooperative networks, the feedback overhead can be reduced by allowing UEs with good channel qualities to feedback their CSIs, which is known as the selective feedback. In this paper, we extend this scheme to CoMP systems by the introduction of concatenated codebook. Since the quantization of the channel will result in quantization error, we define a new method to calculate the received SNRs from a specific channel taking quantization error into account. Based on this new method, UEs with weak link would not feedback the CSIs to the cooperative eNBs, which reduces the feedback overhead. We also derive the closed-form expression for the feedback overhead in terms of the SNR threshold. Finally, numerical simulations are provided to prove the effectiveness of our new method.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125380542","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 : 2011-12-01DOI: 10.1109/ISCIT.2011.6089721
Yi Fang, Shaohua Hong, L. Wang
In this paper, we propose a novel multi-access multiple-input multiple-output (MIMO) relay frequency-modulated differential chaos shift keying (FM-DCSK) ultra-wideband (UWB) system with decode-and-forward (DF) relaying protocol, where the relay intelligently employs multiple antennas to greatly strengthen the robustness against signal fading in wireless networks. Simulation results show that the bit error rate (BER) performance of the proposed system is remarkably better than the conventional multi-access FM-DCSK UWB systems under indoor residential environments of the IEEE 802.15.4a standard by means of obtaining the spatial diversity gain. Furthermore, the influence of antenna number of relay to the proposed system is also investigated to provide a good compromise between the system performance and implementation complexity. For these advantages above, the proposed system can be seen as a viable alternative to other FM-DCSK UWB schemes for the low-rate and low-power applications in wireless personal area networks (WPAN).
{"title":"A novel MIMO relay FM-DCSK UWB system for low-rate and low-power WPAN applications","authors":"Yi Fang, Shaohua Hong, L. Wang","doi":"10.1109/ISCIT.2011.6089721","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6089721","url":null,"abstract":"In this paper, we propose a novel multi-access multiple-input multiple-output (MIMO) relay frequency-modulated differential chaos shift keying (FM-DCSK) ultra-wideband (UWB) system with decode-and-forward (DF) relaying protocol, where the relay intelligently employs multiple antennas to greatly strengthen the robustness against signal fading in wireless networks. Simulation results show that the bit error rate (BER) performance of the proposed system is remarkably better than the conventional multi-access FM-DCSK UWB systems under indoor residential environments of the IEEE 802.15.4a standard by means of obtaining the spatial diversity gain. Furthermore, the influence of antenna number of relay to the proposed system is also investigated to provide a good compromise between the system performance and implementation complexity. For these advantages above, the proposed system can be seen as a viable alternative to other FM-DCSK UWB schemes for the low-rate and low-power applications in wireless personal area networks (WPAN).","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121165585","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 : 2011-12-01DOI: 10.1109/ISCIT.2011.6089719
M. A. Ameen, N. Ullah, K. Kwak
Wireless sensor networks are widely used for healthcare applications. A new field known as wireless body area networks (WBAN) has emerged to support this area. An energy efficient medium access control (MAC) protocol can increase the performance of such a network. The major requirements for a WBAN MAC protocol are energy efficiency and low delay. In this paper, we propose a MAC protocol for WBAN using wakeup radio mechanism. We present a detailed analytical model for both energy consumption and delay. We have simulated the proposed MAC and compared the results. It is found that the proposed MAC has improved the performance in terms of energy consumption and delay.
{"title":"Design and analysis of a MAC protocol for wireless body area network using wakeup radio","authors":"M. A. Ameen, N. Ullah, K. Kwak","doi":"10.1109/ISCIT.2011.6089719","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6089719","url":null,"abstract":"Wireless sensor networks are widely used for healthcare applications. A new field known as wireless body area networks (WBAN) has emerged to support this area. An energy efficient medium access control (MAC) protocol can increase the performance of such a network. The major requirements for a WBAN MAC protocol are energy efficiency and low delay. In this paper, we propose a MAC protocol for WBAN using wakeup radio mechanism. We present a detailed analytical model for both energy consumption and delay. We have simulated the proposed MAC and compared the results. It is found that the proposed MAC has improved the performance in terms of energy consumption and delay.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115061374","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 : 2011-12-01DOI: 10.1109/ISCIT.2011.6089701
Kanokphan Lertniphonphan, S. Aramvith, T. Chalidabhongse
Recognizing human actions is a challenging research area due to the complexity and variation of human's appearances and postures, the variation of camera settings, and angles. In this paper, we introduce a motion descriptor based on direction of optical flow for human action recognition. The directional value of a silhouette is divided into small regions. In each region, the normalized direction histogram of optical flow is computed. The motion vector is the values of a histogram in every region respective concatenation. The vectors are smoothed in time domain by moving average to reduce the motion variation and noise. For the training process, the motion vectors of the training set are clustered by K-mean to represent action. The clustered data group the similar posture together and is represented by the cluster centers. The centers are used to compare input frames by computing distance and using K-nearest neighbor to classify action. The experimental results show that K-mean clustering can group the similar pose together. The motion feature can be used to classify action in a low resolution image with a small number of reference vectors.
{"title":"Human action recognition using direction histograms of optical flow","authors":"Kanokphan Lertniphonphan, S. Aramvith, T. Chalidabhongse","doi":"10.1109/ISCIT.2011.6089701","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6089701","url":null,"abstract":"Recognizing human actions is a challenging research area due to the complexity and variation of human's appearances and postures, the variation of camera settings, and angles. In this paper, we introduce a motion descriptor based on direction of optical flow for human action recognition. The directional value of a silhouette is divided into small regions. In each region, the normalized direction histogram of optical flow is computed. The motion vector is the values of a histogram in every region respective concatenation. The vectors are smoothed in time domain by moving average to reduce the motion variation and noise. For the training process, the motion vectors of the training set are clustered by K-mean to represent action. The clustered data group the similar posture together and is represented by the cluster centers. The centers are used to compare input frames by computing distance and using K-nearest neighbor to classify action. The experimental results show that K-mean clustering can group the similar pose together. The motion feature can be used to classify action in a low resolution image with a small number of reference vectors.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114691732","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
扫码关注我们
求助内容：
应助结果提醒方式：