{"title":"An efficient heuristics to realize near-optimal small-world networks","authors":"Abhishek Chakraborty, B. S. Manoj","doi":"10.1109/NCC.2015.7084862","DOIUrl":"https://doi.org/10.1109/NCC.2015.7084862","url":null,"abstract":"Small-world characteristic brings down average path length of a network by adding a few long-links among network node-pairs. In a real-world deployment scenario, probabilistic long-link addition cannot guarantee optimal value of average path length for a network with limited number of long-links. In this paper, we propose a generalized heuristic, Sequential Deterministic Long-link Addition (SDLA) algorithm to incorporate small-world property for moderate sized string topology networks. Our proposed algorithm has O(k × N) time complexity compared to O(N2(k+2) × log N) for optimal and O(k × N4 × log N) for near-optimal long-link addition strategies for k long links when a string topology network of size N is concerned. Our studies show that SDLA algorithm negligibly deviates in various network properties (e.g., average path length, average clustering coefficient, and graph centralities) from the optimal and near-optimal solutions.","PeriodicalId":302718,"journal":{"name":"2015 Twenty First National Conference on Communications (NCC)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126488092","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 new decimation and interpolation algorithm and an efficient lossless compression technique for images","authors":"P. Prabhakaran, G. PoonachaP.","doi":"10.1109/NCC.2015.7084824","DOIUrl":"https://doi.org/10.1109/NCC.2015.7084824","url":null,"abstract":"Efficient lossless compression using decimation and interpolation algorithms with low complexity and high quality is an important goal for multi-media distribution over the internet. This is because content is consumed at different sizes and over networks with different bandwidths. It is also because informational content, large screen advertisements, professional video and high quality computer animation have different quality requirements. In this paper we propose and study a novel decimation and interpolation scheme. Our method compares well in terms of PSNR with well-known Bi-cubic interpolation as well as other computationally more expensive methods available in the literature. We have compared the efficiency of our method with Bi-cubic in terms of computational complexity. In the second part of the paper we have used our decimation and interpolation scheme for developing a new lossless compression technique for images. This falls broadly under the spatial hierarchy schemes. Literature consists of many attempts to use decimation and interpolation for lossy compression of images. We have compared the efficiency of our method with Bi-cubic interpolation based approach. On an average our method has better compression efficiency than methods like lossless JPEG. Our experimental results show that ZIP, PNG and TIFF are 27%, 57% and 42% poorer in terms of compression efficiency respectively. However, this comes at the cost of increased computational complexity.","PeriodicalId":302718,"journal":{"name":"2015 Twenty First National Conference on Communications (NCC)","volume":"509 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134261358","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}
Mousmita Sarma, Sree Nilendra Gadre, B. Sarma, S. Prasanna
{"title":"Speaker change detection using excitation source and vocal tract system information","authors":"Mousmita Sarma, Sree Nilendra Gadre, B. Sarma, S. Prasanna","doi":"10.1109/NCC.2015.7084869","DOIUrl":"https://doi.org/10.1109/NCC.2015.7084869","url":null,"abstract":"The speaker change information in speech is due to both vocal tract and excitation source information. In this work, the excitation source information is extracted by computing cepstral features from the zero frequency filtered speech (ZFFS) signal. The vocal tract system information is extracted by computing cepstral features from the speech signal. The speaker change evidences obtained from these two feature sets are combined and observed that they contain complementary information for speaker change detection. The popular distance metric based algorithms, Bayesian Information Criteria (BIC) and Kullback Leibler Divergence (KLD) are used to detect the speaker change evidences. The Miss Detection Rate (MDR) of BIC based algorithm using cepstral features obtained from speech is 24.18% and from ZFFS is 25.92%, respectively. When the two sets of evidences are combined, the MDR reduces to 15.89%. Similarly, individual MDR of KLD based algorithm from speech and ZFFS are 32.24% and 45.17%, respectively, where as the combination reduces the MDR to 19.67%. Experiments are also performed with noisy speech signal and similar reduction of MDR is observed. This demonstrates the usefulness of cepstral features from the excitation source signal for reducing MDR.","PeriodicalId":302718,"journal":{"name":"2015 Twenty First National Conference on Communications (NCC)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133626339","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":"Characterizing glottal activity from speech using Empirical Mode Decomposition","authors":"Rajib Sharma, S. Prasanna","doi":"10.1109/NCC.2015.7084821","DOIUrl":"https://doi.org/10.1109/NCC.2015.7084821","url":null,"abstract":"Glottal activity is an important aspect of speech production that results in voiced speech, and localizing such regions for computing various parameters of the excitation source is useful in many speech processing applications. The aim of this paper is to investigate the ability of Empirical Mode Decomposition (EMD) and its noise assisted variants, in characterizing glottal activity from the speech signal. A pair of consecutive Intrinsic Mode Functions (IMFs), obtained from the decomposition is found to reflect the periodic nature of different voiced regions of the speech signal. This IMF pair is utilized to construct a signal, named the Glottal Intrinsic Mode Function (GIMF), which represents most of the voiced speech regions. To measure the capability of the GIMF in representing the glottal activity, it is applied to the tasks of Glottal Activity Detection (GAD), pitch frequency (F0) tracking and detecting pitch markers. The results ascertain the capability of EMD in localizing Glottal activity within a small subset of IMFs, and suggest the possibility of accurately extracting source-information from voiced speech with simple signal processing procedures.","PeriodicalId":302718,"journal":{"name":"2015 Twenty First National Conference on Communications (NCC)","volume":"199 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133068159","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":"Multi-channel vibro-acoustic fault analysis of ball bearing using wavelet based multi-scale principal component analysis","authors":"Satish Mohanty, K. K. Gupta, K. Raju","doi":"10.1109/NCC.2015.7084916","DOIUrl":"https://doi.org/10.1109/NCC.2015.7084916","url":null,"abstract":"Ball bearing fault segmentation at different time steps are important to avert failure. This paper studies the Vibro-acoustic characteristic of the ball bearing using Wavelet Based Multi Scale Principal Component Analysis (WMSPCA) and FFT. Firstly, the characteristic frequencies of the ball bearing for healthy and unhealthy states are verified using an impulse exciter hammer; and the generated frequencies are acquired using a Zigbee wireless accelerometer sensor. Secondly, the acoustic and vibration characteristics are acquired using three channel accelerometer sensor and a array microphone. Lastly, the actual characteristics of the ball bearing are extracted using WMSPCA. The main advantage of WMSPCA lies in the actual feature segmentation from different channels independent relative to the direction of propagation of faults. WMSPCA uses wavelet and PCA to auto-correlate and cross-correlate the signal simultaneously. The algorithm extracts the frequency range of operation of the ball bearing and assists in determining the precise frequency of vibration excluding its perplexed frequency components associated along tangential, axial and radial direction of the ball bearing. The paper also correlates the significance of acoustic-vibration in the fault finding of bearing.","PeriodicalId":302718,"journal":{"name":"2015 Twenty First National Conference on Communications (NCC)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124558160","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}
Jobish John, Vinay S. Palaparthy, S. Sarik, M. Baghini, G. Kasbekar
{"title":"Design and implementation of a soil moisture wireless sensor network","authors":"Jobish John, Vinay S. Palaparthy, S. Sarik, M. Baghini, G. Kasbekar","doi":"10.1109/NCC.2015.7084901","DOIUrl":"https://doi.org/10.1109/NCC.2015.7084901","url":null,"abstract":"This paper presents the design of a shortest path tree based data collection wireless sensor network to sense soil moisture, soil temperature and relative humidity. Each node in the network follows a synchronized, periodic sleep - wake up schedule in order to maximize the lifetime of the network. The paper also demonstrates the implementation of a cluster based sensor network consisting of 10 nodes grouped as 3 clusters which collects and sends sensed data to a base station (here laptop) through a sink node. Data processing and presentation on the laptop is achieved using custom designed graphical user interface (GUI) in MATLAB. Nodes are kept approximately 8m apart covering an area of 400 m2. The implemented sensor network features using in house developed, low cost dual probe heat pulse (DPHP) soil moisture sensor, soil temperature sensor and energy efficient wireless transmission using clustering architecture for agricultural application. Field testing for 20% moisture level is demonstrated while feasibility of measuring the moisture levels from 0% to 40% is established from lab experiments.","PeriodicalId":302718,"journal":{"name":"2015 Twenty First National Conference on Communications (NCC)","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132392792","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":"Designing a passive star optical network for the India-based Neutrino Observatory","authors":"V. Singh, N. Chandrachoodan, Anil Prabhakar","doi":"10.1109/NCC.2015.7084900","DOIUrl":"https://doi.org/10.1109/NCC.2015.7084900","url":null,"abstract":"The India-based Neutrino Observatory (INO) uses an iron calorimeter (ICAL) as the neutrino detector. The ICAL consist of 28, 800 resistive plate chambers (RPCs) that generate event data at ~ 650 kbps, for an aggregate of 18 Gbps at the backend. Implementation of a triggerless detection scheme will increase this by a factor of 20. We describe a passive star optical network (PSON) and provide a data networking scheme for the ICAL. We discuss the need of a custom designed communication protocol (ICAL-PRO) for PSON and present its 4 layer architecture and data flow. We use a microcontroller based embedded model to demonstrate a 1 × 16 PSON and discuss its packet error rate (PER) analysis. We achieve a PER of <; 10-9 at the operational signal to noise ratio (SNR) value. We implement time synchronization in the 1 × 16 PSON and achieve an accuracy between 200 - 300 ns. We substantiate the operational principle of ICAL-PRO by successfully demonstrating a 1 × 16 PSON.","PeriodicalId":302718,"journal":{"name":"2015 Twenty First National Conference on Communications (NCC)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132474204","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 framework of data reduction at multiscale level for eigenspace multichannel ECG signals","authors":"Anurag Singh, Jiss J. Nallikuzhy, S. Dandapat","doi":"10.1109/NCC.2015.7084918","DOIUrl":"https://doi.org/10.1109/NCC.2015.7084918","url":null,"abstract":"Multichannel elctrocardiogram (MECG) signals are correlated both in spatial domain as well as in temporal domain and this correlation becomes even higher at multiscale levels. This work presents a MECG compression method in order to exploit the inherent inter-channel correlation more efficiently, using a multiscale compressive sensing (MSCS) based approach. Principal component analysis (PCA) is used to decorrelate the subband signals from different channels at each wavelet scale and then the significant eigenspace signals from higher frequency subbands are undergone through multiscale compressed sensing (CS). Since CS is well known for its effective representation of high dimensional sparse signals in terms of few random projections, here it confines the noise dominated high frequency clinical information of MECG signals to few compressed measurements which readily reduces the data size at the encoder side. Eigenspace is taken as the sparsifying basis for high frequency subband ECG signals. The proposed encoding strategy is implemented using a uniform scalar quantizer and a entropy encoder. Sparse signal recovery is done using a greedy sparse recovery algorithm called orthogonal matching pursuit (OMP). Performance evaluation of the coder is mainly carried out in terms of compression ratio (CR), root mean square difference (PRD), and wavelet energy based diagnostic distortion (WEDD). Simulation results give the lowest PRD value, 4.72% and WEDD value 3.28% at CR=10.84, for lead aVF for CSE multi-lead measurement library database.","PeriodicalId":302718,"journal":{"name":"2015 Twenty First National Conference on Communications (NCC)","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132003774","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":"Sparseland model for speckle suppression of B-mode ultrasound images","authors":"M. Srinivas, R. Bharath, P. Rajalakshmi, C. Mohan","doi":"10.1109/NCC.2015.7084842","DOIUrl":"https://doi.org/10.1109/NCC.2015.7084842","url":null,"abstract":"Speckle is a multiplicative noise which is inherent in medical ultrasound images. Speckles contributes high variance between neighboring pixels reducing the visual quality of an image. Suppression of speckle noise significantly improves the diagnostic content present in the image. In this paper, we propose how sparseland model can be used for speckle suppression. The performance of the model is evaluated based on variance to mean ratio of a patch in the filtered image. The algorithm is tested on both software generated images and real time ultrasound images. The proposed algorithm has performed similar to past adaptive speckle suppression filters and seems promising in improving diagnostic content.","PeriodicalId":302718,"journal":{"name":"2015 Twenty First National Conference on Communications (NCC)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128424265","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":"Enhanced spectral efficiency for intensity modulated DWDM systems","authors":"Neeraj Sharma, R. Vij, N. Badhan","doi":"10.1109/NCC.2015.7084818","DOIUrl":"https://doi.org/10.1109/NCC.2015.7084818","url":null,"abstract":"The core of the global telecommunication network consists of wavelength division multiplexed (WDM) optical transmission systems. WDM is the technology of choice as it allows for a high spectral efficiency. We propose an effective way to counter the nonlinearities like Four Wave Mixing, Stimulated Raman Scattering, Stimulated Brillouin Scattering, Cross Phase Modulation to achieve high spectral efficiency for different intensity modulated DWDM systems. We propose the concept of non-uniform or unequal channel spacing and non-uniform power assignment between adjacent channels of the DWDM system. The different intensity modulation formats considered in this paper are NRZ, RZ, CSRZ and Duo-binary. A comparison of performance is also presented between these formats.","PeriodicalId":302718,"journal":{"name":"2015 Twenty First National Conference on Communications (NCC)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126684385","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}