{"title":"Relative frequency maps for face recognition","authors":"K. Karthik, Harshit Balaraman","doi":"10.1109/NCC.2016.7561079","DOIUrl":"https://doi.org/10.1109/NCC.2016.7561079","url":null,"abstract":"Single face-image comparisons are extremely challenging, particularly in the context of pose, expression variations and scene illumination changes. Most of the existing schemes are sub-space learning based, where dominant eigen-directions are determined from the covariance matrix computed over the entire face space. In this paper we propose a simple hashing method based on the relative magnitudes of selective frequencies obtained from the intensity histogram and use this indicator function as an elastic representation of the face, termed as the Order Preserving Selective Relative frequency map (OPSRFM). Despite being a histogram derivative, the OPSRFM has been found to be robust to contrast stretching operations and pose variations in faces, while remaining discriminative across face classes. Recognition rates obtained for the ORL and YALE databases were 87.63% and 76.36% respectively which are comparable to computationally intensive sub-space learning and hashing methods.","PeriodicalId":279637,"journal":{"name":"2016 Twenty Second National Conference on Communication (NCC)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128527870","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":"Compressed sensing of respiratory signals promoting joint-sparsity","authors":"Ramakanth Reddy, P. R. Muduli, A. Mukherjee","doi":"10.1109/NCC.2016.7561095","DOIUrl":"https://doi.org/10.1109/NCC.2016.7561095","url":null,"abstract":"Telemonitoring is a potential solution for management of patients suffering from chronic respiratory diseases, such as chronic obstructive pulmonary disease (COPD), respiratory failure, and obstructive sleep apnea. However, the compression is a prime concern for designing telemonitoring systems via Wireless Body Area Networks (WBANs). In this regard, Compressed Sensing (CS) is a promising tool of compression. This paper proposes a mixed norm-based CS technique to compress/recover respiratory signals in WBAN systems. To enhance the recovery performance, the overall problem is framed in Multiple Measurement Vector (MMV) model exploiting the joint-sparsity. First, the raw respiratory data is compressed employing a sparse binary sensing matrix with a few nonzero entries at the sensor (transmitter) side. Then at the server (receiver) side, the original signal is recovered using the proposed algorithm. The experimental results using the Physiobank respiratory database shows promising achievement obtained by the proposed method in terms of CPU computation time as well as reconstruction quality.","PeriodicalId":279637,"journal":{"name":"2016 Twenty Second National Conference on Communication (NCC)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128595355","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 smartphone app-based digital hearing aid with sliding-band dynamic range compression","authors":"Nitya Tiwari, P. C. Pandey, Anurag Sharma","doi":"10.1109/NCC.2016.7561146","DOIUrl":"https://doi.org/10.1109/NCC.2016.7561146","url":null,"abstract":"Listeners with sensorineural hearing loss have degraded speech perception due to frequency-dependent elevation of hearing thresholds, reduced dynamic range, and increased temporal and spectral masking. Signal processing in hearing aids for such listeners uses frequency-selective amplification and dynamic range compression for restoring normal loudness of low-level sounds without making the high-level sounds uncomfortably loud. Sliding-band compression has been reported earlier for reducing the temporal and spectral distortions generally associated with currently used single and multiband compression techniques. The paper presents implementation of sliding-band compression as a smartphone app for use as a hearing aid. The processing involves a frequency-dependent gain function calculated on the basis of critical bandwidth based short-time power spectrum and the specified hearing thresholds, compression ratios, and attack and release times. It is realized using FFT-based analysis-synthesis and can be integrated with other such techniques for computational efficiency.","PeriodicalId":279637,"journal":{"name":"2016 Twenty Second National Conference on Communication (NCC)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122273724","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":"Trace based application layer modeling in ns-3","authors":"P. Agrawal, Mythili Vutukuru","doi":"10.1109/NCC.2016.7561126","DOIUrl":"https://doi.org/10.1109/NCC.2016.7561126","url":null,"abstract":"Ns-3 is a widely used as a the network simulator of choice by researchers. It contains many well tested and high quality models of network protocols. However, the application layer models of ns-3 are very simplistic, and do not capture all aspects of real life applications. As a result, there is often a huge gap between the results of real experiments and the corresponding simulations. This problem is particularly exacerbated for wireless simulations, where many networking phenomena like wireless channel contention crucially depend on the application traffic characteristics. One way to bridge the gap between experiments and simulations is to incorporate knowledge from network traces into simulations. To this end, our work builds a trace-based application layer simulator in ns-3. Given a network trace collected from a user, our TraceReplay application layer model automatically generates traffic that is faithful to the real application in the ns-3 simulator. TraceReplay infers and replays only application layer delays like user think times, lets the simulator control the lower layer phenomena. TraceReplay extracts application layer characteristics from a single trace, and replays this information across many users in simulation, by using suitable randomization. Our model is also generic enough to replay any application layer protocol. Validation of our simulation model shows that simulation results obtained using TraceReplay are significantly different from those using other models, and are closer to experimental observations.","PeriodicalId":279637,"journal":{"name":"2016 Twenty Second National Conference on Communication (NCC)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131391218","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":"CCU: Algorithm for Concurrent Consistent Updates for a Software Defined Network","authors":"Radhika Sukapuram, G. Barua","doi":"10.1109/NCC.2016.7561139","DOIUrl":"https://doi.org/10.1109/NCC.2016.7561139","url":null,"abstract":"A Software Defined Network has its control plane separated from its data plane, with the control plane providing abstractions for development of control programs that alter the state of the network by updating the rules installed in switches. Switch updates are central to an SDN and updates must be such that there are no packet drops or loops. An update property which ensures that the traces generated for a packet are either due to the old network configuration or due to the new configuration, but never a combination of both, thus preventing packet drops and loops, is called per-packet consistency. We envisage that large data center networks supporting multiple tenants and network virtualization will need a large number of concurrent updates due to VM creation, VM migration, network management applications etc. There are algorithms in the literature that enable concurrent updates and improve update speed but they are either not general or do not preserve per-packet consistency. This paper proposes an update algorithm, Concurrent Consistent Updates (CCU), that is general, is per-packet consistent and that enables concurrent disjoint updates. Since the size of a TCAM on a switch is small, rule tables implemented in software are used to supplement the TCAM. The algorithm makes use of a Software Rules Table to restrict updates to only the internal switches that genuinely need an update and to reduce update installation time.","PeriodicalId":279637,"journal":{"name":"2016 Twenty Second National Conference on Communication (NCC)","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131639614","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 Taylor series approximation technique for self-interference cancellation in full-duplex radios","authors":"Arjun Nadh, Ankit Sharma, S. Aniruddhan, R. Ganti","doi":"10.1109/NCC.2016.7561156","DOIUrl":"https://doi.org/10.1109/NCC.2016.7561156","url":null,"abstract":"Full-duplex (FD) wireless communication is gaining increasing attention of the wireless industry because of the potential doubling of spectral efficiency. Radio design of an FD transceiver is a key aspect to its realization. The major impediment in realizing an FD radio is the self interference (SI). The received self interference is a filtered version of the transmitted signal, the filter (SI filter) being caused by the multiple transmit paths through the circuit board (or silicon substrate) and the wireless channel. Current techniques for suppressing SI rely on mimicking the SI filter partly in the RF domain (using multiple length RF traces on a PCB) and partly in the digital domain by adaptive techniques. This paper proposes a novel SI cancellation technique, based on Taylor series expansion of the delayed signal, that results in linearizing the delayed self-interference component of the transmitted signal. Linearization not only aids the practicality of analog cancellation by reducing the form factor, but also results in a simple SI filter model in the digital domain. In this paper, in addition to deriving the generic form of the SI filter, we provide experimental evidence for the same.","PeriodicalId":279637,"journal":{"name":"2016 Twenty Second National Conference on Communication (NCC)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133270397","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}
Abhishek Dey, S. Shahnawazuddin, K. Deepak, Siddika Imani, S. Prasanna, R. Sinha
{"title":"Enhancements in Assamese spoken query system: Enabling background noise suppression and flexible queries","authors":"Abhishek Dey, S. Shahnawazuddin, K. Deepak, Siddika Imani, S. Prasanna, R. Sinha","doi":"10.1109/NCC.2016.7561193","DOIUrl":"https://doi.org/10.1109/NCC.2016.7561193","url":null,"abstract":"In the work presented in this paper, the recent improvements incorporated in the earlier developed Assamese spoken query (SQ) system for accessing the price of agricultural commodities are discussed. The developed SQ system consists of interactive voice response (IVR) and automatic speech recognition (ASR) modules. These are developed using open source resources. The speech data used for developing the ASR system was collected in the field conditions, thus contained significantly high level of background noise. On account of the background noise, the recognition performance of earlier version of the SQ system was severely affected. In order to deal with that, a front-end noise suppression module-based on zero frequency filtering has been added in the current version. Furthermore, we have also incorporated the subspace Gaussian mixture (SGMM) and deep neural network (DNN)-based acoustic modeling approaches. These techniques are found to be more effective than the Gaussian mixture model (GMM)-based approach which was employed in the previous version. The combination of noise removal and DNN-based acoustic modeling is found to result in a relative improvement of almost 32% in word error rate in comparison to the earlier reported GMM-HMM-based ASR system. The earlier SQ system was designed expecting the users' queries in form of isolated words only and, therefore, a high degraded recognition performance was noted whenever the queries were in the form of continuous sentences. In order to overcome that, we present a simple technique exploiting the inherent patterns in the user queries. These patterns are then incorporated in the employed language model. The modified language model is observed to result in significant improvements in the recognition performances in case of continuous queries.","PeriodicalId":279637,"journal":{"name":"2016 Twenty Second National Conference on Communication (NCC)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115330399","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":"Effectiveness of polarity detection for improved epoch extraction from speech","authors":"D. Govind, P. Hisham, D. Pravena","doi":"10.1109/NCC.2016.7561089","DOIUrl":"https://doi.org/10.1109/NCC.2016.7561089","url":null,"abstract":"The objective of the present work is to demonstrate the significance of speech polarity detection in improving the accuracy of the estimated epochs in speech. The paper also proposes a method to extract the speech polarity information using the properties of the Hilbert transform. The Hilbert transform of the speech is computed as the imaginary part of the complex analytic signal representation of the original speech. The Hilbert envelope (HE) is then computed as the magnitude of the analytic signal. The average slope of the signal amplitudes of speech and Hilbert transform of speech around the peaks in the HE are observed to be varying in accordance with the polarity of the speech signal. The effectiveness of the proposed approach is confirmed by the performance evaluation over 7 voices of the phonetically balanced CMU-Arctic database and German emotional speech database. The performance of the proposed approach is also observed to be comparable with that of the existing algorithms such as residual skewness based polarity detection and Hilbert phase based speech polarity detection. Finally, a significant improvement in the identification accuracies of the estimated epochs in speech using the popular zero frequency filtering (ZFF) method is demonstrated as an application of the speech polarity detection.","PeriodicalId":279637,"journal":{"name":"2016 Twenty Second National Conference on Communication (NCC)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115855218","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":"Fuzzy logic based cell selection framework for downlink uplink decoupled cellular networks","authors":"S. Kumar, Abhinav Kumar, K. Detroja","doi":"10.1109/NCC.2016.7561137","DOIUrl":"https://doi.org/10.1109/NCC.2016.7561137","url":null,"abstract":"Deployment of small cell base stations (BSs), like pico BSs (PBSs), alongside macro BSs (MBSs) in cellular network leads to increased data rates for the users. However, asymmetric transmission power of BSs and received power based user association (UA) necessitates some form of user offloading between MBSs and PBSs on both the downlink and uplink to maximize system performance. In this work, we formulate optimal downlink and uplink decoupled UA as an optimization problem. We show that this network wide optimization problem is not real time solvable. Hence, we propose a novel fuzzy logic based cell selection framework that can be tuned for system level performance gains. Further, we show that in certain scenarios, careful tuning of fuzzy logic system based UA results in significant increase in system performance compared with existing techniques.","PeriodicalId":279637,"journal":{"name":"2016 Twenty Second National Conference on Communication (NCC)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124523291","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":"Integral Channel Feature based arbitrary object tracking","authors":"M. Parate, S. Sinha, K. Bhurchandi","doi":"10.1109/NCC.2016.7561124","DOIUrl":"https://doi.org/10.1109/NCC.2016.7561124","url":null,"abstract":"Object tracking is a challenging problem in computer vision as many performance affecting factors need to be considered in a robust algorithm. We propose a framework to consolidate Integral Channel Features (ICF) to represent targets' appearance by embedding global and patch based approaches which offer feature strength and accuracy to the target template. The use of ICF expedites the extraction of color and structural features from video frames in a very efficient manner. Application of the patch based approach on global templates with maximum similarity metric enables better object representation. Target's appearance representation is updated using k-means clustering and vector quantization. We use incremental PCA learning for acquiring training samples and presenting fixed size feature codebook vectors. Experiments are conducted to compare performance between the proposed approach and two other state of the art approaches. Results show that the proposed approach outperforms published state of the art methods.","PeriodicalId":279637,"journal":{"name":"2016 Twenty Second National Conference on Communication (NCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130860485","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}