{"title":"A novel approach for multimodal face recognition system based on modular PCA","authors":"S. Parvathy, S. Naveen, R. Moni","doi":"10.1109/COMPSC.2014.7032634","DOIUrl":"https://doi.org/10.1109/COMPSC.2014.7032634","url":null,"abstract":"An efficient face recognition system should recognize faces in different views and poses. The efficiency of a human face recognition system depends on the capability of face recognition in presence of changes in the appearance of face due to expression, pose and illumination. A novel algorithm which utilizes the combination of texture and depth information based on Modular PCA to overcome the problem of pose variation and illumination change for face recognition is proposed. The system has combined 2D and 3D systems in the feature level which presents higher performance in contrast with methods which utilizes either 2D or 3D system separately. A multimodal face recognition based on Modular PCA when compared with conventional PCA algorithm has an improved recognition rate for face images with large variations in illumination and facial expression. The proposed algorithm is tested with FRAV3D database that has faces with pose variation and illumination changes. Recognition rates from experimental results show the superiority of Modular PCA over conventional PCA methods in tackling face images with different pose variations and changes in illuminations. The proposed algorithm shows a recognition rate of 86% that is achieved in fusion experiment.","PeriodicalId":388270,"journal":{"name":"2014 First International Conference on Computational Systems and Communications (ICCSC)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116125784","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}
Neethu Johnson, Kuruvachan K. George, C. S. Kumar, P. Raj
{"title":"Towards improving the performance of speaker recognition systems","authors":"Neethu Johnson, Kuruvachan K. George, C. S. Kumar, P. Raj","doi":"10.1109/COMPSC.2014.7032617","DOIUrl":"https://doi.org/10.1109/COMPSC.2014.7032617","url":null,"abstract":"This paper studies the contribution of different phones in speech data towards improving the performance of text/language independent speaker recognition systems. This work is motivated by the fact that the removal of silence segments from the speech data improves the system performance significantly as it does not contain any speaker-specific information. It is also clear from the literature that not all the phones in the speech data contains equal amount of speaker-specific information in it and the performance of the speaker recognition systems depends on this information. In addition to the silence segments, our work empirically finds 18 other diluent phones that has minimum speaker discrimination capability. We propose to use a preprocessing stage that identifies all non-informative set of phones recursively and removes them along with silence segments. Results show that using phones removed preprocessed data in state-of-the-art i-vector system outperforms the baseline i-vector system. We report absolute improvements of 1%, 1%, 2%, 2% and 1% in EER for test set collected through channels of Digital Voice Recorder, Headset, Mobile Phone 1, Mobile Phone 2 and Tablet PC respectively on IITG-MV database.","PeriodicalId":388270,"journal":{"name":"2014 First International Conference on Computational Systems and Communications (ICCSC)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116824762","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":"An improved dual tree complex wavelet transform based image denoising using GCV thresholding","authors":"A. Varsha, P. Basu","doi":"10.1109/COMPSC.2014.7032635","DOIUrl":"https://doi.org/10.1109/COMPSC.2014.7032635","url":null,"abstract":"Noise suppression is an integral part of any image processing task Noise significantly degrades the image quality and hence makes it difficult for the observer to discriminate fine detail of the images especially in diagnostic examinations. Through decades of research, mass articles on image denoising have been proposed The effect of noise in the images can be reduced by using either spatial filtering or transform domain filtering. In transform domain wavelet method provide better denoising while preserving the details of images like edges. The Discrete Wavelet Transform (DWT) has some disadvantages that undetermined its application in image processing as lack of shift invariance and poor directional selectivity. In order to overcome these disadvantages Dual Tree Complex Wavelet Transform (DT-CWT) is used which provide perfect reconstruction over the traditional wavelet transform It employs 2 real DWTs; the first DWT gives the real part of the transform while second DWT gives the imaginary part. It is nearly shift invariant and directionally selective in two and higher dimensions with limited redundancy. The DTCWT outperforms the DWT for applications like image denoising and enhancement One of the advantages of the DTCWT is that it can be used to implement 2D wavelet transforms that are more selective with respect to orientation than is the 2D DWT. The 2D DTCWT produces twelve sub bands at each scale, each of which are strongly oriented at distinct angles. A Dual Tree Complex Wavelet transform based image denoising is proposed which uses generalized cross validation technique The denoising performance for different images using Discrete Wavelet Transform and Dual Tree Complex wavelet transform with different thresholding need to be evaluated Evaluation is carried out in terms of various parameters such as Peak Signal to Noise Ratio, mean Structural Similarity and Coefficient of Correlation.","PeriodicalId":388270,"journal":{"name":"2014 First International Conference on Computational Systems and Communications (ICCSC)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127171310","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":"Reversible data hiding in selectively encrypted RGB images by reserving room in advance","authors":"K. J. Besteena, P. Joseph","doi":"10.1109/COMPSC.2014.7032681","DOIUrl":"https://doi.org/10.1109/COMPSC.2014.7032681","url":null,"abstract":"Recently, more and more attention is paid to protect sensitive data transmitting across network. Currently, there are methods which use RDH with cover image also as information to transfer. To ensure confidentiality of cover image, it is encrypted and data hiding is done in encrypted image. In real-time scenarios we need to use color images as cover image and large amount of data to hide in image. The standard encryption methods which encrypt every bit of cover image waste large amount of time for encryption and decryption process. Our proposed methods use chaotic encryption to secure cover image which selectively encrypt some of the bits in image using confusion and diffusion methods. Since our method use RDH using reserving room in advance approach original cover can be losslessly recovered after extraction of embedded data. All the existing methods embed data by reversibly vacating room in the encrypted images. But these methods may result in some errors on image restoration and data extraction. In proposed method image recovery and data extraction are free of any error and achieves real reversibility.","PeriodicalId":388270,"journal":{"name":"2014 First International Conference on Computational Systems and Communications (ICCSC)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127567721","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":"WSN technologies for low data rate and power constrained applications","authors":"George Eldho John, Joaquim Ignatious Monteiro","doi":"10.1109/COMPSC.2014.7032632","DOIUrl":"https://doi.org/10.1109/COMPSC.2014.7032632","url":null,"abstract":"This paper discusses the use of Wireless Sensor Networks (WSN) for low data rate and power constrained applications like precision agriculture. Studies of different WSN technologies were conducted and their utility in precision agriculture was evaluated. A ZigBee based sensor node was implemented and field tested. The Sensor Network was also simulated in network simulator (NS2.34) and various network parameters were studied. A novel approach for reducing the cost up to four times as compared with ZigBee based WSN was presented. A comparison of different technologies on the basis of cost is also presented in this paper. Power consumption by sensor nodes is studied and an approach to reduce this energy consumption was proposed. It is expected that this paper will promote the use of WSN in agriculture.","PeriodicalId":388270,"journal":{"name":"2014 First International Conference on Computational Systems and Communications (ICCSC)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133831726","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":"An image authentication technique based on cross chaotic map","authors":"Rija M. Raju, K. Gopakumar","doi":"10.1109/COMPSC.2014.7032647","DOIUrl":"https://doi.org/10.1109/COMPSC.2014.7032647","url":null,"abstract":"Digital data transmitted through the internet can be copied and can be used in malicious ways. This may cause problems referring to the protection of intellectual rights and the integrity of the transmitted information. Watermarking has emerged as a new technology to resolve these problems, providing both copyright claiming mechanisms and integrity verification tools. A novel image authentication technique is proposed in this paper in which both discrete wavelet transform (DWT) and chaotic principle are combined effectively. The watermark is embedded using Haar wavelet transform and the cross chaotic map is generated by combining the non-periodical and non-convergence properties of Henon map and Arnolds Cat map. The map is run for a couple of iterations to generate a chaotic sequence, and the pixels of the watermarked image are encrypted with these sequences. The method proposed is efficient, fast and highly secure that can be used for digital data transmission.","PeriodicalId":388270,"journal":{"name":"2014 First International Conference on Computational Systems and Communications (ICCSC)","volume":"1994 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130979685","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}
Sincy V. Thambi, K. T. Sreekumar, C. S. Kumar, P. Raj
{"title":"Random forest algorithm for improving the performance of speech/non-speech detection","authors":"Sincy V. Thambi, K. T. Sreekumar, C. S. Kumar, P. Raj","doi":"10.1109/COMPSC.2014.7032615","DOIUrl":"https://doi.org/10.1109/COMPSC.2014.7032615","url":null,"abstract":"Speech/non-speech detection (SND) distinguishes between speech and non-speech segments in recorded audio and video documents. SND systems can help reduce the storage space required when only speech segments from the audio documents are required, for example content analysis, spoken language identification, etc. In this work, we experimented with the use of time domain, frequency domain and cepstral domain features for short time frames of 20 ms. size along with their mean and standard deviation for segments of size 200 ms. We then analysed if selecting a subset of the features can help improve the performance of the SND system. Towards this, we experimented with different feature selection algorithms, and observed that correlation based feature selection gave the best results. Further, we experimented with different decision tree classification algorithms, and note that random forest algorithm outperformed other decision tree algorithms. We further improved the SND system performance by smoothing the decisions over 5 segments of 200 ms. each. Our baseline system has 272 features, a classification accuracy of 94.45 % and the final system with 8 features has a classification accuracy of 97.80 %.","PeriodicalId":388270,"journal":{"name":"2014 First International Conference on Computational Systems and Communications (ICCSC)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129533816","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 robust novel method for face recognition from 2D depth images using DWT and DFT score fusion","authors":"N. S, R. Moni","doi":"10.1109/COMPSC.2014.7032610","DOIUrl":"https://doi.org/10.1109/COMPSC.2014.7032610","url":null,"abstract":"Face recognition has been an area of interest among researchers in pattern recognition for the past few decades. Researches in face recognition are basically concentrated on texture based and geometry based features. The main advantage of Face recognition systems utilizing depth information is the availability of geometrical information of the face structure which is more or less unique for a subject. This paper focuses on the problems of person identification using 2D Face Depth data. Most of the face recognition systems are based on reconstruction of 3D shapes from the 2D depth data. But the reconstruction requires much more computation time. Further the use of unregistered 2D Face depth data significantly increases the operational speed of the system with huge database enrollment. In this work, the unregistered. 2D Face Depth data is fed to a classifier in multiple spectral representations. Discrete Wavelet Transform (DWT) and Discrete Fourier Transform (DFT) are used for the spectral representations. The face recognition accuracy obtained when the feature extractors are used individually, is evaluated. Fusion of the matching scores proves that the recognition accuracy can be improved significantly by fusion of scores of multiple representations. Robustness analysis which covers the FAR (False Acceptance Rate) and TRR (True Rejection Rate) is also done. FRAV3D database provided by Face recognition and artificial vision group of Universidad Rey Juan Carlos, Madrid Spain is used for testing the algorithm.","PeriodicalId":388270,"journal":{"name":"2014 First International Conference on Computational Systems and Communications (ICCSC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130736006","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":"Multiuser CDMA systems employing parity bit selected double spreading","authors":"Geethu Shaji, P. Haris","doi":"10.1109/COMPSC.2014.7032616","DOIUrl":"https://doi.org/10.1109/COMPSC.2014.7032616","url":null,"abstract":"A double spreaded CDMA system employing Parity bit selected spreading sequences is proposed in this paper for improving the Bit error rate (BER) performance of Multiuser CDMA systems. In a CDMA system with parity bit selected spreading sequences (CDMA/PB), the transmitted data bits is used to select the spreading code from a set of mutually orthogonal spreading waveforms allocated to each user. After this the spreaded data is again undergone a second spreading using a unique PN sequence. Multiple Access Interference (MAI) caused in Multiuser CDMA/PB systems can be mitigated by this double spreading method. A new detection algorithm is also used at the receiver for the betterment of the BER performance. The complexity of this proposed method is less compared to Parallel Interference Cancellation (PIC) method in Multiuser CDMA systems. Hadamard codes are used for spreading in the proposed system in order to maintain the orthogonality between the spreading codes.","PeriodicalId":388270,"journal":{"name":"2014 First International Conference on Computational Systems and Communications (ICCSC)","volume":"134 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132762091","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 low power CMOS current steering multivibrator VFC with full scale input","authors":"Rooha Razmid Ahammed, Asst. Professor","doi":"10.1109/COMPSC.2014.7032653","DOIUrl":"https://doi.org/10.1109/COMPSC.2014.7032653","url":null,"abstract":"This paper presents a low power CMOS current steering multivibrator based VFC, which can be used for analog front end interfacing of sensors in telemetry applications. The proposed circuit is designed in 180 nm CMOS technology with 1.8V power supply. It operates at full scale input voltage range and the output frequency ranges from 0.38MHz to 4.69MHz. The peak total power consumption observed is 182.5 μW.","PeriodicalId":388270,"journal":{"name":"2014 First International Conference on Computational Systems and Communications (ICCSC)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124031016","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}