Pub Date : 2011-03-21DOI: 10.1109/PERCOMW.2011.5766962
M. Kadiyala, Dipti Shikha, R. Pendse, Neeraj Jaggi
In this paper, we propose a new semi-Markov process based model to compute the network parameters such as saturation throughput, for the IEEE 802.11 Distributed Coordination Function (DCF) employing the Binary Exponential Backoff (BEB). The backoff stages of BEB and their backoff intervals are modeled as the states of semi-Markov process and their state holding-times, respectively. The proposed model is simpler than Bianchi's two-dimensional Markov chain based model, with the number of states in the proposed model being of the order O(m), where m is the number of backoff stages in the BEB, compared with the Bianchi's model where number of states is of the order O(2m). Using the proposed semi-Markov process model, we compute the parameters of interest in wireless LANs, such as conditional collision probability, packet transmission probability, and saturation throughput. We show that the proposed model is quite accurate in computing these parameters of interest. Moreover, we show that the computation time with the proposed model is approximately one-tenth of that with Bianchi's model, using Matlab simulations. Thus, the proposed model achieves accurate results with less complexity and computation time, and is suitable to be used for performance evaluation of complex protocols such as IEEE 802.11e.
{"title":"Semi-Markov process based model for performance analysis of wireless LANs","authors":"M. Kadiyala, Dipti Shikha, R. Pendse, Neeraj Jaggi","doi":"10.1109/PERCOMW.2011.5766962","DOIUrl":"https://doi.org/10.1109/PERCOMW.2011.5766962","url":null,"abstract":"In this paper, we propose a new semi-Markov process based model to compute the network parameters such as saturation throughput, for the IEEE 802.11 Distributed Coordination Function (DCF) employing the Binary Exponential Backoff (BEB). The backoff stages of BEB and their backoff intervals are modeled as the states of semi-Markov process and their state holding-times, respectively. The proposed model is simpler than Bianchi's two-dimensional Markov chain based model, with the number of states in the proposed model being of the order O(m), where m is the number of backoff stages in the BEB, compared with the Bianchi's model where number of states is of the order O(2m). Using the proposed semi-Markov process model, we compute the parameters of interest in wireless LANs, such as conditional collision probability, packet transmission probability, and saturation throughput. We show that the proposed model is quite accurate in computing these parameters of interest. Moreover, we show that the computation time with the proposed model is approximately one-tenth of that with Bianchi's model, using Matlab simulations. Thus, the proposed model achieves accurate results with less complexity and computation time, and is suitable to be used for performance evaluation of complex protocols such as IEEE 802.11e.","PeriodicalId":369430,"journal":{"name":"2011 IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops)","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117180593","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-03-21DOI: 10.1109/PERCOMW.2011.5766954
K. Frank, Matthias Röckl, T. Pfeifer
Today's mobile computing environments aggregate many entities, all of them with a number of internal sensors, processing applications and other, user given information that can be shared with others over the available networks. Tomorrow's ubiquitous computing environments, where the number of sensors is assumed to be even significantly higher, face the challenge that information exchange between entities has to be controlled, not only to protect privacy and to unburden the wireless networks - but also to reduce load on the receiving entities that have to process all incoming information. The approach we propose in this work measures the importance of some information and the interest of the receiver in it, before it is transferred. We apply it in two scenarios with limited resources. In vehicle-to-vehicle communications the transmission time while cars meet and bandwidth availability of the wireless channel is the critical resource, forcing to reduce information exchange. In context inference on mobile devices processing power and battery life are limited and responsiveness to user actions is most important. Hence only the most important information should be processed.
{"title":"Intelligent information dissemination in collaborative, context-aware environments","authors":"K. Frank, Matthias Röckl, T. Pfeifer","doi":"10.1109/PERCOMW.2011.5766954","DOIUrl":"https://doi.org/10.1109/PERCOMW.2011.5766954","url":null,"abstract":"Today's mobile computing environments aggregate many entities, all of them with a number of internal sensors, processing applications and other, user given information that can be shared with others over the available networks. Tomorrow's ubiquitous computing environments, where the number of sensors is assumed to be even significantly higher, face the challenge that information exchange between entities has to be controlled, not only to protect privacy and to unburden the wireless networks - but also to reduce load on the receiving entities that have to process all incoming information. The approach we propose in this work measures the importance of some information and the interest of the receiver in it, before it is transferred. We apply it in two scenarios with limited resources. In vehicle-to-vehicle communications the transmission time while cars meet and bandwidth availability of the wireless channel is the critical resource, forcing to reduce information exchange. In context inference on mobile devices processing power and battery life are limited and responsiveness to user actions is most important. Hence only the most important information should be processed.","PeriodicalId":369430,"journal":{"name":"2011 IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124702682","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-03-21DOI: 10.1109/PERCOMW.2011.5766891
Aditi Gupta, Markus Miettinen, N. Asokan
In this paper, we demonstrate the use of context-profiling for making access control decisions in mobile devices. In particular, we discuss the device locking use case, where the device locking timeout and unlocking method are dynamically decided based on the perceived safety of current context.
{"title":"Using context-profiling to aid access control decisions in mobile devices","authors":"Aditi Gupta, Markus Miettinen, N. Asokan","doi":"10.1109/PERCOMW.2011.5766891","DOIUrl":"https://doi.org/10.1109/PERCOMW.2011.5766891","url":null,"abstract":"In this paper, we demonstrate the use of context-profiling for making access control decisions in mobile devices. In particular, we discuss the device locking use case, where the device locking timeout and unlocking method are dynamically decided based on the perceived safety of current context.","PeriodicalId":369430,"journal":{"name":"2011 IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129625472","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-03-21DOI: 10.1109/PERCOMW.2011.5766867
D. Puccinelli, Anna Förster, A. Puiatti, S. Giordano
Outdoor automated people counting is essential to the proper management of recreational and protected areas. We present a solution for radio-based people counting that employs low-end motes to detect the signature of shadowing events left by humans on the RF signal as they interrupt the line-of-sight path between a radio transmitter and a receiver. Our solution can be implemented with devices with a reduced form factor, requires little computing power, and provides a satisfactory performance at a low energy cost. We illustrate our implementation on TelosB nodes and present an extensive set of results from a real-world deployment.
{"title":"Radio-based trail usage monitoring with low-end motes","authors":"D. Puccinelli, Anna Förster, A. Puiatti, S. Giordano","doi":"10.1109/PERCOMW.2011.5766867","DOIUrl":"https://doi.org/10.1109/PERCOMW.2011.5766867","url":null,"abstract":"Outdoor automated people counting is essential to the proper management of recreational and protected areas. We present a solution for radio-based people counting that employs low-end motes to detect the signature of shadowing events left by humans on the RF signal as they interrupt the line-of-sight path between a radio transmitter and a receiver. Our solution can be implemented with devices with a reduced form factor, requires little computing power, and provides a satisfactory performance at a low energy cost. We illustrate our implementation on TelosB nodes and present an extensive set of results from a real-world deployment.","PeriodicalId":369430,"journal":{"name":"2011 IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops)","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129342450","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-03-21DOI: 10.1109/PERCOMW.2011.5766945
M. Endler, Alexandre Skyrme, Daniel Schuster, T. Springer
There is a multitude of systems in the area of mobile and pervasive social computing providing and using social context for pervasive interaction between persons. Currently, it is hard to distinguish the different approaches as there is no appropriate taxonomy available yet. In this paper we introduce the STIP taxonomy to define social context in the area of social computing and further propose to use the term Situated Social Context for a more focused subset of social context for pervasive social computing. We elaborate the taxonomy with a small survey of mobile social networking systems and discuss future research challenges.
{"title":"Defining Situated Social Context for pervasive social computing","authors":"M. Endler, Alexandre Skyrme, Daniel Schuster, T. Springer","doi":"10.1109/PERCOMW.2011.5766945","DOIUrl":"https://doi.org/10.1109/PERCOMW.2011.5766945","url":null,"abstract":"There is a multitude of systems in the area of mobile and pervasive social computing providing and using social context for pervasive interaction between persons. Currently, it is hard to distinguish the different approaches as there is no appropriate taxonomy available yet. In this paper we introduce the STIP taxonomy to define social context in the area of social computing and further propose to use the term Situated Social Context for a more focused subset of social context for pervasive social computing. We elaborate the taxonomy with a small survey of mobile social networking systems and discuss future research challenges.","PeriodicalId":369430,"journal":{"name":"2011 IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126986325","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-03-21DOI: 10.1109/PERCOMW.2011.5766882
Pern Hui Chia
Apart from mechanisms to make crowd-sourcing secure, the reliability of a collaborative system is dependent on the economic incentives of its potential contributors. We study several factors related to the incentives in a community-based security system, including the expectation on the social influence and the contagion effect of generosity. We also investigate the effects of organizing community members differently in a complete, random and scale-free structure. Our simulation results show that, without considering any specific incentive schemes, it is not easy to encourage user contribution in a complete-graph community structure (global systems). On the other hand, a moderate level of cooperative behavior can be cultivated when the community members are organized in the random or scale-free structure (social networks).
{"title":"Analyzing the incentives in Community-based Security Systems","authors":"Pern Hui Chia","doi":"10.1109/PERCOMW.2011.5766882","DOIUrl":"https://doi.org/10.1109/PERCOMW.2011.5766882","url":null,"abstract":"Apart from mechanisms to make crowd-sourcing secure, the reliability of a collaborative system is dependent on the economic incentives of its potential contributors. We study several factors related to the incentives in a community-based security system, including the expectation on the social influence and the contagion effect of generosity. We also investigate the effects of organizing community members differently in a complete, random and scale-free structure. Our simulation results show that, without considering any specific incentive schemes, it is not easy to encourage user contribution in a complete-graph community structure (global systems). On the other hand, a moderate level of cooperative behavior can be cultivated when the community members are organized in the random or scale-free structure (social networks).","PeriodicalId":369430,"journal":{"name":"2011 IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126314635","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-03-21DOI: 10.1109/PERCOMW.2011.5766921
Fawaz S. Bokhari
We present our initial work on the design and implementation of an efficient channel assignment and routing architecture for multi-radio and multichannel wireless mesh networks (WMNs). Our proposed scheme is derived from the principle of Ant Colony Optimization (ACO) in which smart ants (agents) perform the routing and channel assignment to stochastically solve a dynamic network optimization problem. We extend the ACO framework by implementing two modules namely a channel assignment module and a routing module with the objective of minimizing the overall network inference in multi-radio mesh networks. The main focus in our work is to take advantage of the particular characteristics of ACO framework and exploit them in designing a joint channel assignment and routing scheme for WMNs keeping in view the unique characteristics and requirements of these networks.
{"title":"Channel assignment and routing in multiradio wireless mesh networks using smart ants","authors":"Fawaz S. Bokhari","doi":"10.1109/PERCOMW.2011.5766921","DOIUrl":"https://doi.org/10.1109/PERCOMW.2011.5766921","url":null,"abstract":"We present our initial work on the design and implementation of an efficient channel assignment and routing architecture for multi-radio and multichannel wireless mesh networks (WMNs). Our proposed scheme is derived from the principle of Ant Colony Optimization (ACO) in which smart ants (agents) perform the routing and channel assignment to stochastically solve a dynamic network optimization problem. We extend the ACO framework by implementing two modules namely a channel assignment module and a routing module with the objective of minimizing the overall network inference in multi-radio mesh networks. The main focus in our work is to take advantage of the particular characteristics of ACO framework and exploit them in designing a joint channel assignment and routing scheme for WMNs keeping in view the unique characteristics and requirements of these networks.","PeriodicalId":369430,"journal":{"name":"2011 IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121592596","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-03-21DOI: 10.1109/PERCOMW.2011.5766861
P. Ghosh, Michael L. Mayo, Vijender Chaitankar, T. Habib, E. Perkins, Sajal K. Das
Wireless sensor networks (WSNs) are frameworks for modern pervasive computing infrastructures, and are often subject to operational difficulties, such as the inability to effectively mitigate signal noise or sensor failure. Natural systems, such as gene regulatory networks (GRNs), participate in similar information transport and are often subject to similar operational disruptions (noise, damage, etc.). Moreover, they self-adapt to maintain system function under adverse conditions. Using a PBN-type model valid in the operational and functional overlap between GRNs and WSNs, we study how attractors in the GRN-the target state of an evolving network-behave under selective gene or sensor failure. For “larger” networks, attractors are “robust”, in the sense that gene failures (or selective sensor failures in the WSN) conditionally increase their total number; the “distance” between initial states and their attractors (interpreted as the end-to-end packet delay) simultaneously decreases. Moreover, the number of attractors is conserved if the receiving sensor returns packets to the transmitting node; however, the distance to the attractors increases under similar conditions and sensor failures. Interpreting network state-transitions as packet transmission scenarios may allow for trade-offs between network topology and attractor robustness to be exploited to design novel fault-tolerant routing protocols, or other damage-mitigation strategies.
{"title":"Principles of genomic robustness inspire fault-tolerant WSN topologies: A network science based case study","authors":"P. Ghosh, Michael L. Mayo, Vijender Chaitankar, T. Habib, E. Perkins, Sajal K. Das","doi":"10.1109/PERCOMW.2011.5766861","DOIUrl":"https://doi.org/10.1109/PERCOMW.2011.5766861","url":null,"abstract":"Wireless sensor networks (WSNs) are frameworks for modern pervasive computing infrastructures, and are often subject to operational difficulties, such as the inability to effectively mitigate signal noise or sensor failure. Natural systems, such as gene regulatory networks (GRNs), participate in similar information transport and are often subject to similar operational disruptions (noise, damage, etc.). Moreover, they self-adapt to maintain system function under adverse conditions. Using a PBN-type model valid in the operational and functional overlap between GRNs and WSNs, we study how attractors in the GRN-the target state of an evolving network-behave under selective gene or sensor failure. For “larger” networks, attractors are “robust”, in the sense that gene failures (or selective sensor failures in the WSN) conditionally increase their total number; the “distance” between initial states and their attractors (interpreted as the end-to-end packet delay) simultaneously decreases. Moreover, the number of attractors is conserved if the receiving sensor returns packets to the transmitting node; however, the distance to the attractors increases under similar conditions and sensor failures. Interpreting network state-transitions as packet transmission scenarios may allow for trade-offs between network topology and attractor robustness to be exploited to design novel fault-tolerant routing protocols, or other damage-mitigation strategies.","PeriodicalId":369430,"journal":{"name":"2011 IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops)","volume":"187 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132042681","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-03-21DOI: 10.1109/PERCOMW.2011.5766865
Liang Hong, McKenzie McNeal, Wei Chen
Emerging cooperative MIMO communication is a promising technology in improving communication quality for wireless sensor networks. However, the security problems inherent to cooperative communications also arise. In this paper we investigate the situation where some of the cooperative nodes are compromised and try to corrupt the communications by sending garbled signals. To combat the compromised nodes, we extended our previous work and proposed compromised nodes detection algorithms for three more general scenarios. These scenarios include having different numbers of nodes in the transmitting and receiving clusters, having multiple compromised nodes in the transmitting cluster, and having multiple compromised nodes in both the transmitting and receiving clusters. These algorithms are then integrated into a cross-layer security scheme for secure cooperative MIMO network. This scheme combines cryptographic technique implemented in higher layers with proposed data assurance analysis at the physical layer to provide better security. Simulations show that the proposed algorithms for compromised nodes detection are effective and efficient. Simulations also show that the accuracy of received information is significantly improved.
{"title":"Secure cooperative MIMO communications under active compromised nodes","authors":"Liang Hong, McKenzie McNeal, Wei Chen","doi":"10.1109/PERCOMW.2011.5766865","DOIUrl":"https://doi.org/10.1109/PERCOMW.2011.5766865","url":null,"abstract":"Emerging cooperative MIMO communication is a promising technology in improving communication quality for wireless sensor networks. However, the security problems inherent to cooperative communications also arise. In this paper we investigate the situation where some of the cooperative nodes are compromised and try to corrupt the communications by sending garbled signals. To combat the compromised nodes, we extended our previous work and proposed compromised nodes detection algorithms for three more general scenarios. These scenarios include having different numbers of nodes in the transmitting and receiving clusters, having multiple compromised nodes in the transmitting cluster, and having multiple compromised nodes in both the transmitting and receiving clusters. These algorithms are then integrated into a cross-layer security scheme for secure cooperative MIMO network. This scheme combines cryptographic technique implemented in higher layers with proposed data assurance analysis at the physical layer to provide better security. Simulations show that the proposed algorithms for compromised nodes detection are effective and efficient. Simulations also show that the accuracy of received information is significantly improved.","PeriodicalId":369430,"journal":{"name":"2011 IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132058392","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-03-21DOI: 10.1109/PERCOMW.2011.5766970
Erik E. Stone, M. Skubic
We present a method for improving human segmentation results in calibrated, multi-view environments using features derived from both pixel (image) and voxel (volume) space. The main focus of this work is to develop a low-cost, vision-based system for passive activity monitoring of older adults in the home, to capture early signs of illness and functional decline and allow seniors to live independently. Silhouettes are extracted to address privacy concerns. Specific embedded assessment goals include daily gait, fall risk, and overall activity, as well as fall detection. To achieve these goals, accurate, robust segmentation of human subjects (silhouette extraction) from captured video data is required. We present a simple technique that makes use of features acquired from background subtraction results (silhouettes) of multiple calibrated cameras, along with the 3D voxel object formed from the intersection of those multiple silhouettes in a volume space to improve human segmentation results in dynamic environments; moving objects, non-human objects, and lighting changes often complicate this task. The technique is qualitatively evaluated on three data sequences, two of which were captured in an independent living facility for older adults.
{"title":"Silhouette classification using pixel and voxel features for improved elder monitoring in dynamic environments","authors":"Erik E. Stone, M. Skubic","doi":"10.1109/PERCOMW.2011.5766970","DOIUrl":"https://doi.org/10.1109/PERCOMW.2011.5766970","url":null,"abstract":"We present a method for improving human segmentation results in calibrated, multi-view environments using features derived from both pixel (image) and voxel (volume) space. The main focus of this work is to develop a low-cost, vision-based system for passive activity monitoring of older adults in the home, to capture early signs of illness and functional decline and allow seniors to live independently. Silhouettes are extracted to address privacy concerns. Specific embedded assessment goals include daily gait, fall risk, and overall activity, as well as fall detection. To achieve these goals, accurate, robust segmentation of human subjects (silhouette extraction) from captured video data is required. We present a simple technique that makes use of features acquired from background subtraction results (silhouettes) of multiple calibrated cameras, along with the 3D voxel object formed from the intersection of those multiple silhouettes in a volume space to improve human segmentation results in dynamic environments; moving objects, non-human objects, and lighting changes often complicate this task. The technique is qualitatively evaluated on three data sequences, two of which were captured in an independent living facility for older adults.","PeriodicalId":369430,"journal":{"name":"2011 IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132314810","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
扫码关注我们
求助内容：
应助结果提醒方式：