2012 Third International Conference on Computer and Communication Technology最新文献

筛选
英文 中文
Automatic Critical Health Care Service System Using Wireless Communication, Positioning and/or RF ID 使用无线通信、定位和/或射频识别的自动关键医疗保健服务系统
2012 Third International Conference on Computer and Communication Technology Pub Date : 2012-11-23 DOI: 10.1109/ICCCT.2012.39
A. Kumar
{"title":"Automatic Critical Health Care Service System Using Wireless Communication, Positioning and/or RF ID","authors":"A. Kumar","doi":"10.1109/ICCCT.2012.39","DOIUrl":"https://doi.org/10.1109/ICCCT.2012.39","url":null,"abstract":"An automatic critical health care service system is proposed here to enable a person who becomes critically ill to request for and receive help with the click of a button on the Mobile Phone. When the patient clicks this button, the following occur simultaneously: the doctor at hospital the patient normally consults (Home Hospital/Doctor) is informed, the hospital nearest to the patient's current location (Nearest Hospital) is informed of his/her location and patient's critical health information is sent to the Nearest Hospital. The Nearest Hospital could dispatch an ambulance with appropriate skills and armed with critical health information of the patient. Three solutions for this automatic critical health care service system are proposed that integrate a combination of Electronic Patient Record technology, Mobile and Satellite technologies, RFID technology, GPS and other location technologies, Geographical Information System technology, and Java SIM Card technology. One of the solutions - with a Service Provider System - has been tested by designing and implementing a prototype system.","PeriodicalId":235770,"journal":{"name":"2012 Third International Conference on Computer and Communication Technology","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123177379","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}
引用次数: 1
An Illumination Invariant Robust and Fast Face Detection, Feature Extraction Based Face Recognition System 基于光照不变鲁棒快速人脸检测、特征提取的人脸识别系统
2012 Third International Conference on Computer and Communication Technology Pub Date : 2012-11-23 DOI: 10.1109/ICCCT.2012.30
Priyanka Goel, S. Agarwal
{"title":"An Illumination Invariant Robust and Fast Face Detection, Feature Extraction Based Face Recognition System","authors":"Priyanka Goel, S. Agarwal","doi":"10.1109/ICCCT.2012.30","DOIUrl":"https://doi.org/10.1109/ICCCT.2012.30","url":null,"abstract":"This paper proposes a fast and efficient approach for face recognition under non uniform illumination variations. Robust Haar classifiers technique is used for face detection from an image. Since illumination variations lie in low frequency DCT coefficients, illumination variations is removed from detected face by rescaling down an appropriate number of low frequency DCT coefficients while still preserving important facial features. Further, since, important facial features are concentrated in small number of DCT coefficients, face feature vector is generated by discarding high frequency coefficients. K-means clustering is employed to reduce search space complexity. Face recognition is performed by comparing feature vector of test image with feature vector of images in the closest matching cluster using Euclidean distance. Experimental results on Yale database, Caltech database, IMM database and Extended Yale face database B show that the proposed approach improves face recognition rate upto 100% along with significantly reduced search space complexity and low computational cost. Equal error rate (EER) is acquired by plotting false acceptance rate (FAR) and false reject rate (FRR) against different threshold values.","PeriodicalId":235770,"journal":{"name":"2012 Third International Conference on Computer and Communication Technology","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125139110","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}
引用次数: 6
Mouse Cursor Control System Based on Facial Electromyogram and Mechanomyogram 基于面肌电图和肌力图的鼠标光标控制系统
2012 Third International Conference on Computer and Communication Technology Pub Date : 2012-11-23 DOI: 10.1109/ICCCT.2012.26
S. Kaushik, N. M. Kakoty
{"title":"Mouse Cursor Control System Based on Facial Electromyogram and Mechanomyogram","authors":"S. Kaushik, N. M. Kakoty","doi":"10.1109/ICCCT.2012.26","DOIUrl":"https://doi.org/10.1109/ICCCT.2012.26","url":null,"abstract":"This paper reports the development of a mouse cursor control system as an assistive technology for upper arm amputees. The control is based on facial electromyogram (fEMG) and mechanomyogram (MMG) signals. The fEMG and MMG signals are collected for six words from eight subjects. A reference signal has been simulated based on the mean values of the signals representing the six words. The Euclidian distance between the Cepstral coefficients of the six words from that of the reference signal comprised the feature vector. Classification is through a probabilistic neural network. Six mouse cursor operations: up, down, left, right, left click and right click are reproduced. We have achieved an average classification rate of 91.5% using fEMG and 89.5% using MMG signal. The classification result is mapped into cursor operations through a switch based linear control.","PeriodicalId":235770,"journal":{"name":"2012 Third International Conference on Computer and Communication Technology","volume":"521 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115352096","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}
引用次数: 0
Forensic Analysis of E-mail Date and Time Spoofing 电子邮件日期和时间欺骗的法医分析
2012 Third International Conference on Computer and Communication Technology Pub Date : 2012-11-23 DOI: 10.1109/ICCCT.2012.69
P. Mishra, E. Pilli, R. Joshi
{"title":"Forensic Analysis of E-mail Date and Time Spoofing","authors":"P. Mishra, E. Pilli, R. Joshi","doi":"10.1109/ICCCT.2012.69","DOIUrl":"https://doi.org/10.1109/ICCCT.2012.69","url":null,"abstract":"There are no adequate and proactive mechanisms for securing E-mail systems. E-mail date and time spoofing is one of the major problems of E-mail security. The effects of E-mail spoofing can be limited by the appropriate configuration of E-mail servers and improved user awareness of the problem. The only real countermeasure is the use of digitally signed messages that allow a recipient to authenticate the identity of the sender. This paper presents E-mail forensics to detect E-mail Date and Time spoofing. We have created data set of spoofed and legitimate E-mails. We propose an algorithm to perform the forensic analysis of E-mail time and date spoofing, by reading the header information and analyzing the fields related to date and time. We have given a policy to check sent-date and received-date fields of every E-mail. If the sent-date and sent-time differs from the received date and received-time by some predefined margin, the E-mail has been spoofed. The algorithm is validated on the data set created in our lab.","PeriodicalId":235770,"journal":{"name":"2012 Third International Conference on Computer and Communication Technology","volume":"436 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122878236","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}
引用次数: 7
Non-uniform Spectrum Sensing Using Computationally Efficient 2-level (FFT-Goertzel) Based Energy Detection 基于计算效率的2级(FFT-Goertzel)能量检测的非均匀频谱传感
2012 Third International Conference on Computer and Communication Technology Pub Date : 2012-11-23 DOI: 10.1109/ICCCT.2012.52
P. V. Bhatt, Vijay Kumar Chakka
{"title":"Non-uniform Spectrum Sensing Using Computationally Efficient 2-level (FFT-Goertzel) Based Energy Detection","authors":"P. V. Bhatt, Vijay Kumar Chakka","doi":"10.1109/ICCCT.2012.52","DOIUrl":"https://doi.org/10.1109/ICCCT.2012.52","url":null,"abstract":"Energy detection in frequency domain is a preferred technique for the spectrum sensing and the accuracy of frequency estimation depends on the DFT size. A new technique for energy detection is proposed here. Instead of computing full length (N-point) DFT of the whole data, this paper proposes a two level (coarse-fine) approach. In the first (coarse) level, time averaging of smaller size (L<;<;N) data blocks of the whole data and its DFT are computed and Neymen Pearson based detection is performed to determine the presence of energy in the subbands. In the second level (fine), Goertzel algorithm is applied to determine the fine estimates in those subbands. Matlab based experiments were performed to verify the proposed method. Simulation result also shows that this method can be applied for non-uniformly occupied spectrum also. The complexity of this approach is evaluated and it is about 51% computationally more efficient at -5 dB signal to noise ratio of received signal.","PeriodicalId":235770,"journal":{"name":"2012 Third International Conference on Computer and Communication Technology","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129054456","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}
引用次数: 2
Image Mining: A New Approach for Data Mining Based on Texture 图像挖掘:一种基于纹理的数据挖掘新方法
2012 Third International Conference on Computer and Communication Technology Pub Date : 2012-11-23 DOI: 10.1109/ICCCT.2012.11
M. Sahu, M. Shrivastava, M. Rizvi
{"title":"Image Mining: A New Approach for Data Mining Based on Texture","authors":"M. Sahu, M. Shrivastava, M. Rizvi","doi":"10.1109/ICCCT.2012.11","DOIUrl":"https://doi.org/10.1109/ICCCT.2012.11","url":null,"abstract":"Image data mining can be done manually by slicing and dicing the data until a pattern becomes obvious. Or, it can be done with programs that analyse the data automatically. Colour, texture and shape of an image have been primitive image descriptors in Content Based Image Retrieval (CBIR) system. Primitive features of an image used to identify and retrieve closely matched images from an image database. It is very difficult to extract images manually from image database because they are very large. This paper presents a novel framework for texture information of an image and achieves higher retrieval efficiency than the shape features of an image. There is a trade-off between accuracy and computational cost. The trade-off decreases as more efficient algorithm is used to solve the problem and increases the computational power and will decreases the cost of the whole system as well.","PeriodicalId":235770,"journal":{"name":"2012 Third International Conference on Computer and Communication Technology","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130518813","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}
引用次数: 21
RBF Neural Network Modeling of Rectangular Microstrip Patch Antenna 矩形微带贴片天线的RBF神经网络建模
2012 Third International Conference on Computer and Communication Technology Pub Date : 2012-11-23 DOI: 10.1109/ICCCT.2012.56
M. Aneesh, J. A. Ansari, A. Singh, K. Kamakshi, S. Verma
{"title":"RBF Neural Network Modeling of Rectangular Microstrip Patch Antenna","authors":"M. Aneesh, J. A. Ansari, A. Singh, K. Kamakshi, S. Verma","doi":"10.1109/ICCCT.2012.56","DOIUrl":"https://doi.org/10.1109/ICCCT.2012.56","url":null,"abstract":"In this paper, a design procedure has been proposed for rectangular micro strip patch antenna using artificial neural network, which has been demonstrated using radial basis function neural network. The Neural model was analyzed for 20 sets of input output parameters. The radial basis function outputs are optimized by variation of spread constant and number of neurons. By applying this model we can reduce output error as well as time delay of system. The testing of output of neural model is found in good agreement with theoretical values.","PeriodicalId":235770,"journal":{"name":"2012 Third International Conference on Computer and Communication Technology","volume":"292 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132382356","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}
引用次数: 14
A Perceptually Motivated Multi-Band Spectral Subtraction Algorithm for Enhancement of Degraded Speech 基于感知动机的多频带频谱减法增强退化语音
2012 Third International Conference on Computer and Communication Technology Pub Date : 2012-11-23 DOI: 10.1109/ICCCT.2012.75
Navneet Upadhyay, A. Karmakar
{"title":"A Perceptually Motivated Multi-Band Spectral Subtraction Algorithm for Enhancement of Degraded Speech","authors":"Navneet Upadhyay, A. Karmakar","doi":"10.1109/ICCCT.2012.75","DOIUrl":"https://doi.org/10.1109/ICCCT.2012.75","url":null,"abstract":"The spectral subtraction method is a classical approach for enhancement of degraded speech. The basic principle of this technique is to estimate the short-time spectral magnitude of speech by subtracting estimated noise from the noisy speech spectrum and to combine it with the phase of the noisy speech. Besides reducing the noise, this method generates an unnatural and unpleasant noise, called remnant noise. The other drawback of this method is that it can work only for white Gaussian noise which has a flat spectrum and is distributed uniformly over the frequency spectrum. But real-world noise is mostly colored and has a non-uniform spectrum. To take care of this kind of noises, spectral subtraction algorithm has been extended to a multi-band case with uniformly spaced frequency bands. In this paper, a perceptually motivated multi-band spectral subtraction algorithm is proposed to enhance the speech signal degraded by colored noise. In the proposed scheme, the whole speech spectrum is divided in different non-uniform bands (N = 6) in accordance to the critical-band rate scale and spectral subtraction is executed independently in each band. The simulation results as well as informal subjective evaluations show that the proposed algorithm reduces remnant noise efficiently and the enhanced speech contains minimal speech distortions with improved signal-to-noise ratio.","PeriodicalId":235770,"journal":{"name":"2012 Third International Conference on Computer and Communication Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130195955","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}
引用次数: 3
Detection and Classification of Apple Fruit Diseases Using Complete Local Binary Patterns 利用完全局部二值模式检测和分类苹果果实病害
2012 Third International Conference on Computer and Communication Technology Pub Date : 2012-11-23 DOI: 10.1109/ICCCT.2012.76
S. Dubey, A. S. Jalal
{"title":"Detection and Classification of Apple Fruit Diseases Using Complete Local Binary Patterns","authors":"S. Dubey, A. S. Jalal","doi":"10.1109/ICCCT.2012.76","DOIUrl":"https://doi.org/10.1109/ICCCT.2012.76","url":null,"abstract":"Diseases in fruit cause devastating problem in economic losses and production in agricultural industry worldwide. In this paper, a solution for the detection and classification of apple fruit diseases is proposed and experimentally validated. The image processing based proposed approach is composed of the following main steps, in the first step K-Means clustering technique is used for the image segmentation, in the second step some state of the art features are extracted from the segmented image, and finally images are classified into one of the classes by using a Multi-class Support Vector Machine. Our experimental results express that the proposed solution can significantly support accurate detection and automatic classification of apple fruit diseases. The classification accuracy for the proposed solution is achieved up to 93%.","PeriodicalId":235770,"journal":{"name":"2012 Third International Conference on Computer and Communication Technology","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131551946","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}
引用次数: 198
A Comparative Study on DFA-Based Pattern Matching for Deep Packet Inspection 基于dfa的深度包检测模式匹配比较研究
2012 Third International Conference on Computer and Communication Technology Pub Date : 2012-11-23 DOI: 10.1109/ICCCT.2012.59
R. Lenka, P. Ranjan
{"title":"A Comparative Study on DFA-Based Pattern Matching for Deep Packet Inspection","authors":"R. Lenka, P. Ranjan","doi":"10.1109/ICCCT.2012.59","DOIUrl":"https://doi.org/10.1109/ICCCT.2012.59","url":null,"abstract":"Most of the network security applications in today's networks are based on Deep Packet Inspection (DPI). It is a form of computer network packet filtering that examines not only the header portion but also the payload part of a packet as it passes through an inspection point, searching for protocol noncompliance, viruses, Spam, intrusions or some predefined criteria to decide if the packet can pass it or it needs to be routed to a different destination. Most of the systems that perform deep packet inspection implement basic string matching algorithms to match packets against large but finite strings. However, there is growing interest in the use of regular expression-based pattern matching, since regular expressions offer superior expressive power. DFA is employed to implement regular expression matching. DFA representations of a regular expression sets in network applications require large amounts of memory, limiting their practical application. This paper presents an analysis of different compact representation of DFA such as D2FA, δFA, δ2FA.","PeriodicalId":235770,"journal":{"name":"2012 Third International Conference on Computer and Communication Technology","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128842881","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}
引用次数: 14
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信