2016 IEEE 37th Sarnoff Symposium最新文献_第3页

A novel video steganography algorithm in DCT domain based on hamming and BCH codes 一种基于hamming码和BCH码的DCT域视频隐写算法

2016 IEEE 37th Sarnoff Symposium Pub Date : 2016-09-01 DOI: 10.1109/SARNOF.2016.7846757

Ramadhan J. Mstafa, K. Elleithy

{"title":"A novel video steganography algorithm in DCT domain based on hamming and BCH codes","authors":"Ramadhan J. Mstafa, K. Elleithy","doi":"10.1109/SARNOF.2016.7846757","DOIUrl":"https://doi.org/10.1109/SARNOF.2016.7846757","url":null,"abstract":"In the past decade, the science of information hiding has gained tremendous significance due to advances in information and communication technology. The performance of any steganographic algorithm relies on the embedding efficiency, embedding payload, and robustness against attackers. Low hidden ratio, less security, and low quality of stego videos are the major issues of many existing steganographic methods. In this paper, we propose a novel video steganography method in DCT domain based on Hamming and BCH codes. To improve the security of the proposed algorithm, a secret message is first encrypted and encoded by using BCH codes. Then, it is embedded into the discrete cosine transform (DCT) coefficients of video frames. The hidden message is embedded into DCT coefficients of each Y, U, and V planes excluding DC coefficients. The proposed algorithm is tested under two types of videos that contain slow and fast moving objects. The experiential results of the proposed algorithm are compared with three existing methods. The comparison results show that our proposed algorithm outperformed other algorithms. The hidden ratio of the proposed algorithm is approximately 27.53%, which is considered as a high hiding capacity with a minimal tradeoff of the visual quality. The robustness of the proposed algorithm was tested under different attacks.","PeriodicalId":137948,"journal":{"name":"2016 IEEE 37th Sarnoff Symposium","volume":"195 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":"124359373","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}

引用次数: 28

A greedy algorithm for decentralized Bayesian detection with feedback 带反馈的分散贝叶斯检测贪心算法

2016 IEEE 37th Sarnoff Symposium Pub Date : 2016-09-01 DOI: 10.1109/SARNOF.2016.7846756

Weiqiang Dong, Moshe Kam

{"title":"A greedy algorithm for decentralized Bayesian detection with feedback","authors":"Weiqiang Dong, Moshe Kam","doi":"10.1109/SARNOF.2016.7846756","DOIUrl":"https://doi.org/10.1109/SARNOF.2016.7846756","url":null,"abstract":"We consider a decentralized binary detection architecture comprised of n local detectors (LDs) communicating their decisions to a Data Fusion Center (DFC). Each local detector (LD) declares preference for one of two hypotheses (H<inf>0</inf> or H<inf>1</inf>) and transmits it to the DFC. The decision of the kth LD at time step t is ut<inf>k</inf>. The DFC develops a global preference ut<inf>0</inf> for one of hypotheses based on the vector of local decisions Ut while minimizing a Bayesian cost. The input to the kth LD at time step t is the observation yt<inf>k</inf> collected from the surveyed environment, and the previous global decision ut−1<inf>0</inf>. Alhakeem and Varshney developed a person-by-person optimal (PBPO) solution to this problem, namely a PBPO procedure to calculate the global fusion rule and the local decision rules. However, their solution requires that at each time step 2n fusion rule equations and 2n local threshold equations be solved simultaneously. In this paper we suggest a suboptimal solution to the problem, based on independent local minimizations of similar Bayesian cost by each LD and by the DFC. To assess the cost of decentralization, the performance of this solution is compared to that of an architecture that processes all observations in one central location.","PeriodicalId":137948,"journal":{"name":"2016 IEEE 37th Sarnoff Symposium","volume":"83 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":"126395473","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}

引用次数: 1

Smart connected canines: IoT design considerations for the lab, home, and mission-critical environments 智能连接犬:实验室，家庭和关键任务环境的物联网设计考虑因素

2016 IEEE 37th Sarnoff Symposium Pub Date : 2016-09-01 DOI: 10.1109/SARNOF.2016.7846739

J. Majikes, Sean P. Mealin, R. Brugarolas, Katherine Walker, S. Yuschak, B. Sherman, A. Bozkurt, D. Roberts

{"title":"Smart connected canines: IoT design considerations for the lab, home, and mission-critical environments","authors":"J. Majikes, Sean P. Mealin, R. Brugarolas, Katherine Walker, S. Yuschak, B. Sherman, A. Bozkurt, D. Roberts","doi":"10.1109/SARNOF.2016.7846739","DOIUrl":"https://doi.org/10.1109/SARNOF.2016.7846739","url":null,"abstract":"The canine-human relationship continues to grow as dogs become an increasingly critical part of our society. As reliance on dogs has increased from simple companionship, to service dogs, urban security, and national defense, the opportunities for enhanced communications between the working canine and their handler increase. Wireless sensor networks and the Internet of Things (IoT) can extend traditional canine-human communication to integrate canines into the cyber-enabled world. This is what we call the Smart Connected Canine (SCC). Canine-computer interaction is sufficiently different from human-computer interaction so as to present some challenging research and design problems. There are physical and performance limits to what a dog will naturally tolerate. There are communications requirements for monitoring dogs, monitoring the environment, and for canine-human communications. Depending on the working environment there are different performance, security, and ergonomic considerations. This paper summarizes three example canine-human systems we presented earlier along with their Ion data characteristics and design criteria in order to explore how smart connected canines can improve our lives, the future of smart connected canines, and the requirements on IoT technologies to facilitate this future.","PeriodicalId":137948,"journal":{"name":"2016 IEEE 37th Sarnoff Symposium","volume":"20 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":"126495100","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}

引用次数: 7

On the continuous coverage problem for a swarm of UAVs 无人机群的连续覆盖问题

2016 IEEE 37th Sarnoff Symposium Pub Date : 2016-09-01 DOI: 10.1109/SARNOF.2016.7846742

Hazim Shakhatreh, Abdallah Khreishah, Jacob Chakareski, H. Salameh, Issa M. Khalil

{"title":"On the continuous coverage problem for a swarm of UAVs","authors":"Hazim Shakhatreh, Abdallah Khreishah, Jacob Chakareski, H. Salameh, Issa M. Khalil","doi":"10.1109/SARNOF.2016.7846742","DOIUrl":"https://doi.org/10.1109/SARNOF.2016.7846742","url":null,"abstract":"Unmanned aerial vehicles (UAVs) can be used to provide wireless network and remote surveillance coverage for disaster-affected areas. During such a situation, the UAVs need to return periodically to a charging station for recharging, due to their limited battery capacity. We study the problem of minimizing the number of UAVs required for a continuous coverage of a given area, given the recharging requirement. We prove that this problem is NP-complete. Due to its intractability, we study partitioning the coverage graph into cycles that start at the charging station. We first characterize the minimum number of UAVs to cover such a cycle based on the charging time, the traveling time, and the number of subareas to be covered by the cycle. Based on this analysis, we then develop an efficient algorithm, the cycles with limited energy algorithm. The straightforward method to continuously cover a given area is to split it into N subareas and cover it by N cycles using N additional UAVs. Our simulation results examine the importance of critical system parameters: the energy capacity of the UAVs, the number of subareas in the covered area, and the UAV charging and traveling times. We demonstrate that the cycles with limited energy algorithm requires 69%–94% fewer additional UAVs relative to the straightforward method, as the energy capacity of the UAVs is increased, and 67%–71% fewer additional UAVs, as the number of subareas is increased.","PeriodicalId":137948,"journal":{"name":"2016 IEEE 37th Sarnoff Symposium","volume":"28 12","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114021485","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}

引用次数: 64

Optimization of LTE radio resource block allocation for maritime channels 海上信道LTE无线电资源块分配优化

2016 IEEE 37th Sarnoff Symposium Pub Date : 2016-09-01 DOI: 10.1109/SARNOF.2016.7846771

Amit Kachroo, M. K. Özdemir, Hatice Tekiner-Mogulkoc

{"title":"Optimization of LTE radio resource block allocation for maritime channels","authors":"Amit Kachroo, M. K. Özdemir, Hatice Tekiner-Mogulkoc","doi":"10.1109/SARNOF.2016.7846771","DOIUrl":"https://doi.org/10.1109/SARNOF.2016.7846771","url":null,"abstract":"In this study, we describe the behavior of LTE over the sea and investigate the problem of radio resource block allocation in such SINR limited maritime channels. For simulations of such sea environment, we considered a network scenario of Bosphorus Strait in Istanbul, Turkey with different number of ships ferrying between two ports at a given time. After exploiting the network characteristics, we formulated and solved the radio resource allocation problem by max-min integer linear programming method. The radio resource allocation fairness in terms of Jain's fairness index was computed and it was compared with round robin and opportunistic methods. Results show that the max-min optimization method performs better than the opportunistic and round robin methods. This result in turn reflects that the max-min optimization method gives us the high minimum best throughput as compared to other two methods considering different ship density scenarios in the sea. Also, it was observed that as the number of ships begin to increase in the sea, the max-min method performs significantly better with good fairness as compared to the other two methods.","PeriodicalId":137948,"journal":{"name":"2016 IEEE 37th Sarnoff Symposium","volume":"95 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":"122098385","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}

引用次数: 4

Edge caching and nearest replica routing in information-centric networking 信息中心网络中的边缘缓存和最近副本路由

2016 IEEE 37th Sarnoff Symposium Pub Date : 2016-09-01 DOI: 10.1109/SARNOF.2016.7846751

Feixiong Zhang, Yanyong Zhang, D. Raychaudhuri

引用次数: 12

QoSApp: Dynamic bandwith management for QoS applications using OpenFlow QoSApp:使用OpenFlow的QoS应用程序的动态带宽管理

2016 IEEE 37th Sarnoff Symposium Pub Date : 2016-09-01 DOI: 10.1109/SARNOF.2016.7846733

Daniel Lartiga, Nicolas Boettcher, Yasmany Prieto, J. Pezoa

引用次数: 1

User density and spatial cloaking algorithm selection: Improving privacy protection of mobile users 用户密度与空间隐身算法选择:提高移动用户隐私保护

2016 IEEE 37th Sarnoff Symposium Pub Date : 2016-09-01 DOI: 10.1109/SARNOF.2016.7846722

Matthew Chan, Hassan Elsherbini, Xiaowen Zhang

引用次数: 3

Data management of sensor signals for high bandwidth data streaming to the cloud 数据管理对传感器信号进行高带宽数据流到云端

2016 IEEE 37th Sarnoff Symposium Pub Date : 2016-09-01 DOI: 10.1109/SARNOF.2016.7846764

Theodoros Soultanopoulos, Stelios Sotiriadis, E. Petrakis, C. Amza

引用次数: 11

One-to-all regularized logistic regression-based classification for WiFi indoor localization 基于一对全正则化逻辑回归的WiFi室内定位分类

2016 IEEE 37th Sarnoff Symposium Pub Date : 2016-09-01 DOI: 10.1109/SARNOF.2016.7846746

Zifan Peng, Yuchen Xie, Donglin Wang, Z. Dong

引用次数: 7