{"title":"Adapting RGB Pose Estimation to New Domains","authors":"Gururaj Mulay, B. Draper, J. Beveridge","doi":"10.1109/CCWC.2019.8666594","DOIUrl":"https://doi.org/10.1109/CCWC.2019.8666594","url":null,"abstract":"Many multi-modal human computer interaction (HCI) systems interact with users in real-time by estimating the user’s pose. Generally, they estimate human poses using depth sensors such as the Microsoft Kinect. For multi-modal HCI interfaces to gain traction in the real world, however, it would be better for pose estimation to be based on data from RGB cameras, which are more common and less expensive than depth sensors. This has motivated research into pose estimation from RGB images. Convolutional Neural Networks (CNNs) represent the state-of-the-art in this literature, for example [1], [2], [9], [13], [14], and [15]. These systems estimate 2D human poses from RGB images. A problem with current CNN-based pose estimators is that they require large amounts of labeled data for training. If the goal is to train an RGB pose estimator for a new domain, the cost of collecting and more importantly labeling data can be prohibitive. A common solution is to train on publicly available pose data sets, but then the trained system is not tailored to the domain. We propose using RGB+D sensors to collect domain-specific data in the lab, and then training the RGB pose estimator using skeletons automatically extracted from the RGB+D data. This paper presents a case study of adapting the RMPE pose estimation network [2] to the domain of the DARPA Communicating with Computers (CWC) program [3], as represented by the EGGNOG data set [8]. We chose RMPE because it predicts both joint locations and Part Affinity Fields (PAFs) in real-time. Our adaptation of RMPE trained on automatically-labeled data outperforms the original RMPE on the EGGNOG data set.","PeriodicalId":132812,"journal":{"name":"2019 IEEE 9th Annual Computing and Communication Workshop and Conference (CCWC)","volume":"426 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132062238","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}
{"title":"Introducing Edge Controlling to Software Defined Networking to Reduce Processing Time","authors":"A. Almohaimeed, A. Asaduzzaman","doi":"10.1109/CCWC.2019.8666504","DOIUrl":"https://doi.org/10.1109/CCWC.2019.8666504","url":null,"abstract":"Edge computing enables computational services to be performed at the edge of a network on behalf of the main cloud services. The rationale of edge computing is applicable to any centralized system where the service should be provided at the proximity of the end-systems. Software-Defined Networking (SDN) is an evolving network model that runs a single-centralized controller to handle all network functions which may lead to limited performance capabilities with the recent growth of data communication. In this paper, we introduce a novel SDN Edge Controlling model that overcomes the performance-limitations by leveraging edge computing capabilities. It aims to bring the computing and storage resources close to network devices so that the load on the main SDN controller can be eased, and the delay between the forward plane and the control plane is minimized. We develop a simulation program to assess the effectiveness of our model. Experimental results show that the bandwidth usage is reduced by about 45% and the total processing time of the main controller is reduced by almost 62% for 10,000 requests. Therefore, the proposed model handles a higher network load and maintains lower latency when compared with a traditional SDN.","PeriodicalId":132812,"journal":{"name":"2019 IEEE 9th Annual Computing and Communication Workshop and Conference (CCWC)","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116149926","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}
{"title":"Shared Entry Logger to Eliminate Duplicate Requests to SDN Controller","authors":"A. Asaduzzaman, A. Almohaimeed, K. K. Chidella","doi":"10.1109/CCWC.2019.8666595","DOIUrl":"https://doi.org/10.1109/CCWC.2019.8666595","url":null,"abstract":"In network architecture domain, software-defined networking (SDN) provides programmable network infrastructure and improves management at the controlling layer level. However, SDN structure is centralized and hence introduces new challenges related to performance and security that require new adaptations. An important problem is that some incoming packets are similar to old packets that have already been processed by the SDN controller. This paper proposes a new model for entry logging with an aim to minimize the number of requests the SDN controller processes. This is achieved by the provision of a logging technique for management of OpenFlow communications. A shared memory is introduced to store recently processed entries to save time and effort for future lookups. The proposed SDN architecture adapts the memory to ensure the controller avoids sending duplicate entries and facilitates switches to obtain an external backup storage. Experimental results show an approximate 30% decrease in the communication load on the controller while maintaining lower latency in the total processing time.","PeriodicalId":132812,"journal":{"name":"2019 IEEE 9th Annual Computing and Communication Workshop and Conference (CCWC)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129420848","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}
{"title":"A Study on Flat and Hierarchical System Deployment for Edge Computing","authors":"Dawei Li, Boxiang Dong, E. Wang, Michelle Zhu","doi":"10.1109/CCWC.2019.8666572","DOIUrl":"https://doi.org/10.1109/CCWC.2019.8666572","url":null,"abstract":"In this paper, we consider the server allocation problem for edge computing system deployment where each edge cloud is modeled as an M/M/c queue. Our goal is to minimize the overall average system response time of application requests generated by all mobile devices/users. We consider two approaches for edge cloud deployment: the flat deployment, where all edge clouds are co-located with the base stations, and the hierarchical deployment, where edge clouds can be co-located with other system components besides the base stations. In flat deployment, we demonstrate that the allocation of edge cloud servers should be balanced across all the base stations, if the application request arrival rates at the base stations are equal to each other; if the application request arrival rates are not the same, we propose a Largest Weighted Reduction Time First (LWRTF) algorithm to assign servers to edge clouds. Numerical comparisons of the proposed algorithm against several other reasonably designed heuristics verify that algorithm LWRTF has very good performances in terms of minimizing the average system response time. We also conduct preliminary study on hierarchical deployment for edge computing and show that the hierarchical deployment approach has great potentials in minimizing the overall average system response time.","PeriodicalId":132812,"journal":{"name":"2019 IEEE 9th Annual Computing and Communication Workshop and Conference (CCWC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133131778","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}
{"title":"Self Error Detection and Correction for Noisy Labels Based on Error Correcting Output Code in Convolutional Neural Networks","authors":"Yang Jiao, S. Latifi, Mei Yang","doi":"10.1109/CCWC.2019.8666460","DOIUrl":"https://doi.org/10.1109/CCWC.2019.8666460","url":null,"abstract":"When using convolutional neural networks in different applications, human errors may occur in labeling the data samples. To solve this problem, a self error detection and correction based on Error Correcting Output Code (SEDC-ECOC) method is proposed in this paper. The SEDC-ECOC method works in two stages. In the first stage, the distance between each sample and each class is measured using ECOC, which provides the base of error detection and correction. In the second stage, SVM ECOC conducts further correction as well as plays the role of classification layer in deep networks. Having the advantages of simple construction and independence from deep networks, the SEDC-ECOC method can be applied with different convolutional neural networks. The experimental results show that the proposed method achieves high correction performance for MNIST and CIFAR-10 datasets. Up to 56.09% and 92.11% erroneous sample labels are corrected by applying the proposed method once and twice respectively to noisy labels.","PeriodicalId":132812,"journal":{"name":"2019 IEEE 9th Annual Computing and Communication Workshop and Conference (CCWC)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127221879","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}
{"title":"Parallel Multi-View Graph Matrix Completion for Large Input Matrix","authors":"A. Koohi, H. Homayoun","doi":"10.1109/CCWC.2019.8666532","DOIUrl":"https://doi.org/10.1109/CCWC.2019.8666532","url":null,"abstract":"We propose a method for parallel multi-view graph matrix completion for the prediction of ratings in recommender systems. The missing ratings are computed based on both the similarity matrix in addition to a rating matrix. The rating matrix is sparse and some items might not have any rating information available. The similarity matrix can be calculated from different item attributes available from ecommerce websites. As the input matrix becomes large, the need for more computationally efficient matrix completion increases. The main contribution of this paper is to show speed-up in calculating the missing ratings by using multi-threaded programming. Simulation results are based on the large input matrix and show reduction in RMSE for the case of cold start prediction.","PeriodicalId":132812,"journal":{"name":"2019 IEEE 9th Annual Computing and Communication Workshop and Conference (CCWC)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123603807","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}
{"title":"On the Uniqueness of Stationary Solutions of an Asynchronous Parallel and Distributed Algorithm for Diffusion Equations","authors":"Kooktae Lee, R. Bhattacharya","doi":"10.1109/CCWC.2019.8666522","DOIUrl":"https://doi.org/10.1109/CCWC.2019.8666522","url":null,"abstract":"In this paper, we study the uniqueness of stationary solutions of an asynchronous parallel and distributed algorithm for diffusion equations. In the literature, it has been reported that asynchronous stationary solutions can be affected by randomness of asynchrony, leading to variations in solutions. The uniqueness in this context implies that the stationary solutions obtained by asynchronous communications between parallel and distributed computing devices are the same as the synchronous one, regardless of asynchrony. In some applications, inexact stationary solutions as an outcome of asynchrony may result in serious consequences. Therefore, it is critical to guarantee the existence of the unique stationary solution for a given problem. As a case study, we analyze the uniqueness of stationary solutions for diffusion equations with a fixed boundary condition, by employing the dynamical system framework and nonnegative matrix theory. The numerical results are presented to validate the proposed method with performance analysis of the asynchronous parallel and distributed algorithm.","PeriodicalId":132812,"journal":{"name":"2019 IEEE 9th Annual Computing and Communication Workshop and Conference (CCWC)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129532743","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}
{"title":"Dedicated Backup Units to Alleviate Overload on SDN Controllers","authors":"A. Almohaimeed, A. Asaduzzaman","doi":"10.1109/CCWC.2019.8666452","DOIUrl":"https://doi.org/10.1109/CCWC.2019.8666452","url":null,"abstract":"Software-Defined Networking (SDN) is a rapidly evolving architecture for computer networking that transforms computer networks into software-driven organizations. The traditional SDN architecture relies on a centralized single controller to manage the entire network operations, which may lead to insufficient capacity to carry a substantial amount of information and processing on various time scales. In this paper, we propose a new approach, called a Dedicated Backup Unit (DBU), for improving the processing capabilities of SDNs. DBUs impact the controller by separating the load of intensive operations into different dedicated units to reduce the processing overload from the SDN controller. In order to evaluate the performance of the proposed model, we implement a simulation model to demonstrate the feasibility of the DBUs, and the results confirm that the enhancement of the DBUs shows a 30% decrease in the overall controller load.","PeriodicalId":132812,"journal":{"name":"2019 IEEE 9th Annual Computing and Communication Workshop and Conference (CCWC)","volume":"163 13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126697771","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}
{"title":"Gender Classification Using Machine Learning with Multi-Feature Method","authors":"Sandeep Kumar, Sukhwinder Singh, J. Kumar","doi":"10.1109/CCWC.2019.8666601","DOIUrl":"https://doi.org/10.1109/CCWC.2019.8666601","url":null,"abstract":"Nowadays gender classification is a very challenging task in a real-time application based on face recognition. The demand for real-time application based on gender classification will increase in the future. Bag of Words (Bow), Scale Invariant Fourier Transform (SIFT) and K-means clustering are used for feature extractors and classification. This state of art methodology gives more efficient result on different standard datasets. This research proposed a new algorithm for automatic live Gender Recognition (GR) using Support Vector Machine (SVM) is used for classification. The implementation of result work tested on FEI, Live Images and SCIEN database for GR. The detection rate has reached up to 98% in FEI dataset, 94% in Live/Own dataset and 91% SCIEN dataset respectively. This proposed state of art methodology is compared with the previous techniques and achieved better results which will help in the development of real-time identification systems.","PeriodicalId":132812,"journal":{"name":"2019 IEEE 9th Annual Computing and Communication Workshop and Conference (CCWC)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123633541","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}
{"title":"Noise Performance of Orthogonal RF Beamforming for THz Radio Communications","authors":"K. K. Tiwari, E. Grass, R. Kraemer","doi":"10.1109/CCWC.2019.8666546","DOIUrl":"https://doi.org/10.1109/CCWC.2019.8666546","url":null,"abstract":"Abstract—Ultra wide-band terahertz (THz) radio links are envisaged for high-throughput and low-latency radio communication from server to virtual reality (VR) head-mounted display (HMD). Orthogonal radio frequency (RF) beamforming is suitable for such extremely high-frequency radio links owing to the propagation characteristics. For RF beam training, the transmit-receive (Tx-Rx) beam combination yielding maximum received signal strength indication (RSSI) is selected. For complex signals employed in typical I/Q architecture communication systems, especially for THz frequencies, RSSI is Rayleigh-distributed. Receiver noise can cause false beam selections manifesting in communication rate loss. In this paper, analytically derived closed-form expressions and lower array dimension Monte Carlo (MC) simulation results for such noise performance evaluation have been presented.","PeriodicalId":132812,"journal":{"name":"2019 IEEE 9th Annual Computing and Communication Workshop and Conference (CCWC)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114719962","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}