Liuping Huang, Qingxiang Wu, Yanfeng Chen, SanLiang Hong, Xi Huang
{"title":"Gesture Recognition Based on Fusion Features from Multiple Spiking Neural Networks","authors":"Liuping Huang, Qingxiang Wu, Yanfeng Chen, SanLiang Hong, Xi Huang","doi":"10.1109/CSNT.2015.214","DOIUrl":"https://doi.org/10.1109/CSNT.2015.214","url":null,"abstract":"Gesture recognition is one of challenging image processing. In this paper, a method of gesture segmentation is proposed, which is based on fusion of multi-information from multiple neural networks inspired by the human visual system. In this method, the gesture region is segmented from the video image sequence, innovatively using integration of the outputs from two kinds of spiking neural networks. The structures and the properties of the two networks are detailed in this paper. Based on the integrated outputs, the features of distance distribution histograms and outline moments are extracted and fused to form the mixed features. Finally, gestures are classified by the multi-class Support Vector Machine. Experimental results show that the proposed algorithm works efficiently and can perform gesture segmentation and gesture recognition with the satisfying accuracy for dynamic visual image sequence under complex background. It is promising to apply this approach to video processing domain and robotic visual systems.","PeriodicalId":334733,"journal":{"name":"2015 Fifth International Conference on Communication Systems and Network Technologies","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125359753","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":"Performance Analysis for Android Runtime Environment","authors":"Radhakishan Yadav, R. S. Bhadoria","doi":"10.1109/CSNT.2015.52","DOIUrl":"https://doi.org/10.1109/CSNT.2015.52","url":null,"abstract":"A new runtime was introduced with Android 4.4 i.e. Kit Kat, which should eventually replace the Dalvik runtime. ART (Android Runtime) and Dalvik as the runtime executes the Dalvik Executable format and Dex byte code specification. In other words, when an app is run on android, it goes through a runtime. Previously, Android's runtime was Dalvik. While it performed well, it was still a bottleneck as it only ran the code at the moment it needed to, with a JIT compiler (Just-in-time). AOT (Ahead-of-time) compilation paradigm is followed by ART to process application instructions before they are even required. In the next section, the background of compilation on various architectures is described. In next section, ART is introduced with its new features. In next section, ART has been tested against traditional Dalvik runtime. Then before the conclusion, ARM big. LITTLE architecture is described with some results.","PeriodicalId":334733,"journal":{"name":"2015 Fifth International Conference on Communication Systems and Network Technologies","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124443083","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 Step toward Speeding Up Cross-Cut Shredded Document Reconstruction","authors":"A. S. Atallah, E. Emary, M. El-Mahallawy","doi":"10.1109/CSNT.2015.69","DOIUrl":"https://doi.org/10.1109/CSNT.2015.69","url":null,"abstract":"Recovery of shredded documents helps in security informatics, forensic and investigation science. Shredded document reconstruction requires much time and human effort. Hence, there is a great need to enhance its performance due to the high growth of critical cases requiring fast shredded document reconstruction. In this paper, we focus particularly on the most influential sub-problem which is enhancing and speeding up the matching process in addition to reducing the search space. Furthermore, fully automated pre-processing, feature extraction and matching are applied in order to minimize the user interaction and reduce the time needed for reconstructing enormous number of shredded documents.","PeriodicalId":334733,"journal":{"name":"2015 Fifth International Conference on Communication Systems and Network Technologies","volume":"11 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127992853","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 Compact Frequency Selective Surface Based Band-Stop Filter for WLAN Applications","authors":"Kiran Aseri, S. Yadav, M. Sharma","doi":"10.1109/CSNT.2015.116","DOIUrl":"https://doi.org/10.1109/CSNT.2015.116","url":null,"abstract":"This paper presents a compact frequency selective surface (FSS) based band-stop spatial filter for WLAN application which can be useful for modern communication system. The proposed structure is designed on PTFE substrate which have exceptional weather and heat resistance with excellent insulator characteristics. It is a single sided metallic square patch FSS which give 10-dB insertion loss bandwidth from 5 to 6 GHZ and resonated at 5.5 GHZ. The unit cell has the aspect dimension of 0.302λ×0.302λ×0.0366λ millimeter cube. The proposed design has been simulated using CST Microwave studio. CST microwave studio is based on finite difference time domain method (FDTD).","PeriodicalId":334733,"journal":{"name":"2015 Fifth International Conference on Communication Systems and Network Technologies","volume":"275 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123426729","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":"Planar Coupled-Fed Monopole Antenna for Nine-Band LTE/WWAN/GPS Mobile Handset Application","authors":"Lindsey Chou, Chia-Hao Ku","doi":"10.1109/CSNT.2015.282","DOIUrl":"https://doi.org/10.1109/CSNT.2015.282","url":null,"abstract":"In this paper, a planar coupled-fed monopole antenna with nine-band LTE/WWAN (LTE700/2300/2500/GSM850/900/1800/1900/UMTS) operation for mobile handset device application is proposed. It simply consists of a offset T-shaped driven strip and a capacitive loaded coupled radiating structure, which occupies a small PCB area of 60(W)x15(L) mm2. This antenna, which is printed on a 0.8 mm thick FR4 substrate and fed by a 50-O coaxial cable, can provide two wide operating bandwidths covering 672-1228 MHz and 1394-2876 MHz for LTE/WWAN communication systems. Also, a SEMCAD software is applied in evaluating SAR values. A prototype of the proposed antenna is fabricated, tested and analyzed. From the measurement results, nearly omnidirectional coverage and stable gain variation across the desired LTE/WWAN bands can be obtained with the antenna.","PeriodicalId":334733,"journal":{"name":"2015 Fifth International Conference on Communication Systems and Network Technologies","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134210386","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":"Performance Analysis of Color Space for Optimum Skin Color Detection","authors":"Amit Kumar, Shivani Malhotra","doi":"10.1109/CSNT.2015.88","DOIUrl":"https://doi.org/10.1109/CSNT.2015.88","url":null,"abstract":"In the development of Human computer interface applications information related to skin color is extensively utilized. Reason being skin is the biggest part of human being. Human skin color shows resemblance with non-skin colored material like wall paint, wood etc. So an efficient human computer interface (HCI) system is required to be designed which can distinguish between them. The default color space obtained from imaging device is RGB and processing with this color space takes more time as comparison to other color spaces, hence color space transformation is required. Thus in this paper system performance is evaluated on the basis of processing time and computational complexity. It is verified that less complex structure of application reduces the processing time too. Using two different color space schemes computational time for processing a fixed number of frames of video signal in a constant environment are evaluated and on the basis of that a better color scheme method is proposed.","PeriodicalId":334733,"journal":{"name":"2015 Fifth International Conference on Communication Systems and Network Technologies","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114341161","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 Quantum Parallel Self Organizing Neural Network (QPSONN) for Pure Color Object Extraction from a Noisy Background","authors":"S. Bhattacharyya, Pankaj Pal, Sandip Bhowmick","doi":"10.1109/CSNT.2015.55","DOIUrl":"https://doi.org/10.1109/CSNT.2015.55","url":null,"abstract":"In this article, a quantum version of the parallel self organizing neural network (QPSONN) architecture for extraction of pure color objects from a noisy perspective is proposed. The QPSONN architecture operates in a phased manner to process input noisy pure color images. After the segregation of the pure color inputs into pure color components in the initial phase, these components are subsequently forwarded for processing to three component quantum multilayer self organizing neural network (QMLSONN) architectures composed of three processing layers viz., input, hidden and output layers characterized by qubits based neurons. The interconnection weights are represented by single qub it rotation gates. Quantum measurements at the component output layers destroy the quantum states of the processed information facilitating adjustment of network interconnection weights by a quantum back propagation algorithm using linear indices of fuzziness. Finally, a fusion of the stable component outputs are brought about in a sink layer to produce extracted outputs. Results of application of the QPSONN are demonstrated on a synthetic and a real life spanner image with various degrees of Gaussian noise. A comparison with the classical PSONN architecture reveals the extraction and time efficiency of the proposed QPSONN architecture.","PeriodicalId":334733,"journal":{"name":"2015 Fifth International Conference on Communication Systems and Network Technologies","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126609354","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":"Implementation of Dynamic Association Rule Mining Using Back Navigation Approach","authors":"S. Huria, Jaiteg Singh","doi":"10.1109/CSNT.2015.272","DOIUrl":"https://doi.org/10.1109/CSNT.2015.272","url":null,"abstract":"ARM (Association Rule Mining), one of the most frequently used technique in the domain of data mining and machine learning. Using association rule mining or rule learning extracts the hidden patterns in terms of the association between entities of the training data set. This technique is applied on number of data sets by different researchers and academicians, still this area is under research as the domain and data sets increase very frequently. Association rule learning is a mainstream and generally inquired about system for finding intriguing relations between variables in expansive databases. It is proposed to distinguish solid rules found in databases utilizing distinctive measures of interestingness. Based on the idea of solid rules, Rakesh Agrawal et al. presented association rules for finding regularities between items in expansive scale exchange information recorded by purpose of-offer (POS) frameworks in markets. The data set can be utilized as the premise for choices about promoting exercises, for example, e.g., limited time estimating or item positions. Notwithstanding the above illustration from business crate investigation association rules are utilized today in numerous application regions including Web utilization mining, interruption recognition, Continuous generation, and bioinformatics. This manuscript highlight and implements a novel approach for association rule mining using back navigation and is implemented on the unique dataset.","PeriodicalId":334733,"journal":{"name":"2015 Fifth International Conference on Communication Systems and Network Technologies","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117199273","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":"Large File Transmission Using Self-Adaptive Data Fragmentation in Opportunistic Networks","authors":"Long Feng, Yong Zhang, Hongjun Li","doi":"10.1109/CSNT.2015.273","DOIUrl":"https://doi.org/10.1109/CSNT.2015.273","url":null,"abstract":"Delivery ratio of large file transmission in opportunistic networks is low for the characteristics of opportunistic networks. In order to improve the ability of transferring large files, a kind of data fragmentation strategy is proposed in this paper: self-adaptive data fragmentation (SADF). The size of data fragment in SADF is based on historical statistic transmission rate and historical statistic connection duration between communicating nodes. The SADF strategy makes full use of current networking connection, minimizing the overhead caused by fragmentation control information. Simulation results show that the proposed fragmentation strategies can improve delivery ratio of large file greatly.","PeriodicalId":334733,"journal":{"name":"2015 Fifth International Conference on Communication Systems and Network Technologies","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127455523","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":"Fingerprint Segmentation Using Scale Vector Algorithm","authors":"Rohan Nimkar, A. Mishra","doi":"10.1109/CSNT.2015.137","DOIUrl":"https://doi.org/10.1109/CSNT.2015.137","url":null,"abstract":"Pre-processing part in fingerprint image recognition system is fingerprint image segmentation. Even after the years of research in the field of image segmentation, it is still a challenging task. An image segmentation algorithm is proposed, named as Adaptive (scale) and Orientation (vector) algorithm, for effective segmentation of fingerprint images. The basic idea of the proposed algorithm is originated from the total variation models, along with two features of fingerprints, namely, scale and vector. It decomposes a fingerprint image into two layers: noisy and texture. Proposed segmentation algorithm is experimented and analyzed for two different fingerprint images. PSNR is the measuring parameter for checking the efficiency of algorithm. This algorithm is compared with adaptive and directional algorithm individually and concludes its better efficiency.","PeriodicalId":334733,"journal":{"name":"2015 Fifth International Conference on Communication Systems and Network Technologies","volume":"172 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117344772","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}