Pub Date : 2012-12-31DOI: 10.1109/ICCICT.2012.6398194
S. Gupta, A. Dwivedi, R. Issac, S. K. Agrawal
Nowadays, crucial task in data mining field in large multidimensional data has always been the similarity search problems. Similarity search involves both subsequences matching and whole sequence matching. In this paper, we present an approach which consider on how many dimensions the data point is similiar to the query point, the average distance of these dimensions of data point to the query point as well as efficiency with respect to time and space required with the dramatic increment of data size. The proposed approach involves dynamic selection of input parameters, covering both subsequences matching and whole sequence matching, suppressing the impact of high dissimilarities in few dimensions. Thus our proposed approach can help improving performance of existing data analysis technologies, such as financial market analysis, medical diagnosis and scientific and engineering database analysis as tremendous amount of data is generated in these disciplines.
{"title":"EKSS: An efficient approach for similarity search","authors":"S. Gupta, A. Dwivedi, R. Issac, S. K. Agrawal","doi":"10.1109/ICCICT.2012.6398194","DOIUrl":"https://doi.org/10.1109/ICCICT.2012.6398194","url":null,"abstract":"Nowadays, crucial task in data mining field in large multidimensional data has always been the similarity search problems. Similarity search involves both subsequences matching and whole sequence matching. In this paper, we present an approach which consider on how many dimensions the data point is similiar to the query point, the average distance of these dimensions of data point to the query point as well as efficiency with respect to time and space required with the dramatic increment of data size. The proposed approach involves dynamic selection of input parameters, covering both subsequences matching and whole sequence matching, suppressing the impact of high dissimilarities in few dimensions. Thus our proposed approach can help improving performance of existing data analysis technologies, such as financial market analysis, medical diagnosis and scientific and engineering database analysis as tremendous amount of data is generated in these disciplines.","PeriodicalId":319467,"journal":{"name":"2012 International Conference on Communication, Information & Computing Technology (ICCICT)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114239650","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}
Pub Date : 2012-12-31DOI: 10.1109/ICCICT.2012.6398136
T. Ghorpade, L. Ragha
The internet revolution has brought about a new way of expressing an individual's opinion. It has become a medium through which people openly express their views on various subjects. These opinions contain useful information which can be utilized in many sectors which require constant customer feedback. Analysis of the opinion and it's classification into different sentiment classes is gradually emerging as a key factor in decision making. There has been extensive research on automatic text analysis for sentiments such as sentiment classifiers, affect analysis, automatic survey analysis, opinion extraction, or recommender systems. These methods typically try to extract the overall sentiment revealed in a sentence or document, either positive or negative, or somewhere in between. However, a drawback of these methods is that the information can be degraded, especially in texts where a loss of information can also occur. The proposed method attempts to overcome the problem of the loss of text information by using well trained training sets. Also, recommendation of a product or request for a product as per the user's requirements have achieved with the proposed method.
{"title":"Featured based sentiment classification for hotel reviews using NLP and Bayesian classification","authors":"T. Ghorpade, L. Ragha","doi":"10.1109/ICCICT.2012.6398136","DOIUrl":"https://doi.org/10.1109/ICCICT.2012.6398136","url":null,"abstract":"The internet revolution has brought about a new way of expressing an individual's opinion. It has become a medium through which people openly express their views on various subjects. These opinions contain useful information which can be utilized in many sectors which require constant customer feedback. Analysis of the opinion and it's classification into different sentiment classes is gradually emerging as a key factor in decision making. There has been extensive research on automatic text analysis for sentiments such as sentiment classifiers, affect analysis, automatic survey analysis, opinion extraction, or recommender systems. These methods typically try to extract the overall sentiment revealed in a sentence or document, either positive or negative, or somewhere in between. However, a drawback of these methods is that the information can be degraded, especially in texts where a loss of information can also occur. The proposed method attempts to overcome the problem of the loss of text information by using well trained training sets. Also, recommendation of a product or request for a product as per the user's requirements have achieved with the proposed method.","PeriodicalId":319467,"journal":{"name":"2012 International Conference on Communication, Information & Computing Technology (ICCICT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129426925","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}
Pub Date : 2012-12-31DOI: 10.1109/ICCICT.2012.6398143
M. Samadder, S. Chatterjee, J. K. Bag
In wireless & mobile communication the mobility management technique is an important issue of research. To fulfill the criteria of the all time connectivity, the mobile station (MS) should be connected with a base station (BS) during its operating mode, irrespective of its mobility. When a MS travels within the cell, no special technique is required to maintain its connectivity. But when a MS travels out of the coverage area of its current BS and tries to associate with another BS, a delay occurs during the handover of connection which leads to a failure of connection. Throughout the last few years plenty of researches had been done to reduce this handover delay by reducing the scanning delay as the scanning process causes ninety percent of the total handover delay. In this paper, we propose a new scanning technique where the hexagonal cell is divided in three angular segments and for each segment two neighbour BSs are reserved for handover. MS will measure its distance from the reserved BSs at fixed time intervals and the handover of connection will be performed to the nearest BS when the handover will be required. Our simulation results show the effectiveness of our proposed scheme in practical field.
{"title":"A fast scanning technique for mobility management by optimized angular segmentation method","authors":"M. Samadder, S. Chatterjee, J. K. Bag","doi":"10.1109/ICCICT.2012.6398143","DOIUrl":"https://doi.org/10.1109/ICCICT.2012.6398143","url":null,"abstract":"In wireless & mobile communication the mobility management technique is an important issue of research. To fulfill the criteria of the all time connectivity, the mobile station (MS) should be connected with a base station (BS) during its operating mode, irrespective of its mobility. When a MS travels within the cell, no special technique is required to maintain its connectivity. But when a MS travels out of the coverage area of its current BS and tries to associate with another BS, a delay occurs during the handover of connection which leads to a failure of connection. Throughout the last few years plenty of researches had been done to reduce this handover delay by reducing the scanning delay as the scanning process causes ninety percent of the total handover delay. In this paper, we propose a new scanning technique where the hexagonal cell is divided in three angular segments and for each segment two neighbour BSs are reserved for handover. MS will measure its distance from the reserved BSs at fixed time intervals and the handover of connection will be performed to the nearest BS when the handover will be required. Our simulation results show the effectiveness of our proposed scheme in practical field.","PeriodicalId":319467,"journal":{"name":"2012 International Conference on Communication, Information & Computing Technology (ICCICT)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130460519","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}
Pub Date : 2012-12-31DOI: 10.1109/ICCICT.2012.6398190
D. Rathod, R. Awale
Low-density Parity check codes (LDPC) are gaining interest for high data rate application in both terrestrial and spatial communications which requires low bit error rate. This paper proposes an algorithm through which the best parity check matrix is obtained for irregular low density parity check codes, which reduces the Bit Error Rate ,Frame Error Rate and computational complexity. Tanner graph also called a bipartite graph format in an Low Density Parity Check (LDPC) code design contains many short cycles; it will produce a computational complexity in a code design process and it degrades the code performance. To overcome this effect, we proposed an new algorithm which obtains a best final parity check matrix. Throughout the paper we will give the detailed description of an efficient algorithm proposed. The complexity is studied graphically and analytically. Using proposed algorithm, cycles of length four observed in corresponding matrix are removed. Each matrix is evaluated over a noisy Additive White Gaussian Noise (AWGN) channel. Bit Error rate and Frame error rate is calculated. The results are compared with randomly generated best parity check matrix. Simulation results shows that proposed method successfully overcomes the computational complexity and meets the near Shannon limit.
{"title":"An efficient algorithm for irregular Low density Parity Check code with reduced computational complexity and error floor","authors":"D. Rathod, R. Awale","doi":"10.1109/ICCICT.2012.6398190","DOIUrl":"https://doi.org/10.1109/ICCICT.2012.6398190","url":null,"abstract":"Low-density Parity check codes (LDPC) are gaining interest for high data rate application in both terrestrial and spatial communications which requires low bit error rate. This paper proposes an algorithm through which the best parity check matrix is obtained for irregular low density parity check codes, which reduces the Bit Error Rate ,Frame Error Rate and computational complexity. Tanner graph also called a bipartite graph format in an Low Density Parity Check (LDPC) code design contains many short cycles; it will produce a computational complexity in a code design process and it degrades the code performance. To overcome this effect, we proposed an new algorithm which obtains a best final parity check matrix. Throughout the paper we will give the detailed description of an efficient algorithm proposed. The complexity is studied graphically and analytically. Using proposed algorithm, cycles of length four observed in corresponding matrix are removed. Each matrix is evaluated over a noisy Additive White Gaussian Noise (AWGN) channel. Bit Error rate and Frame error rate is calculated. The results are compared with randomly generated best parity check matrix. Simulation results shows that proposed method successfully overcomes the computational complexity and meets the near Shannon limit.","PeriodicalId":319467,"journal":{"name":"2012 International Conference on Communication, Information & Computing Technology (ICCICT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130305616","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}
Pub Date : 2012-12-31DOI: 10.1109/ICCICT.2012.6398125
A. Deshpande, S. Patnaik
Restoration of a single degraded image from uniform velocity motion blurring is recently being studied in number of machine vision based applications including astronomy, medical imaging, consumer level photography, microscopy etc. Identification of motion blur parameters from single blurred image is truly an ill-posed problem, as there results multiple solutions in terms of estimated blur kernel and blurred image combinations, amongst which actual combination is hardly any, that will result into a faithful quality of restored image. The quality of restoration is also highly dependent on the accuracy of point spread function (PSF) kernel estimation. In this paper, we present a Radon transform based motion blur parameter estimation method under both spatial-invariant and variant blur consideration. The experiments performed on simulated motion blurred images show that taking Radon transform of the spectral gradients of blurred images improve estimation accuracy even in presence of noise. Compared with already existing Radon transform based PSF estimation schemes, our method successfully performs PSF estimation even for typical non-uniform motion blurred imagery.
{"title":"Radon transform based uniform and non-uniform motion blur parameter estimation","authors":"A. Deshpande, S. Patnaik","doi":"10.1109/ICCICT.2012.6398125","DOIUrl":"https://doi.org/10.1109/ICCICT.2012.6398125","url":null,"abstract":"Restoration of a single degraded image from uniform velocity motion blurring is recently being studied in number of machine vision based applications including astronomy, medical imaging, consumer level photography, microscopy etc. Identification of motion blur parameters from single blurred image is truly an ill-posed problem, as there results multiple solutions in terms of estimated blur kernel and blurred image combinations, amongst which actual combination is hardly any, that will result into a faithful quality of restored image. The quality of restoration is also highly dependent on the accuracy of point spread function (PSF) kernel estimation. In this paper, we present a Radon transform based motion blur parameter estimation method under both spatial-invariant and variant blur consideration. The experiments performed on simulated motion blurred images show that taking Radon transform of the spectral gradients of blurred images improve estimation accuracy even in presence of noise. Compared with already existing Radon transform based PSF estimation schemes, our method successfully performs PSF estimation even for typical non-uniform motion blurred imagery.","PeriodicalId":319467,"journal":{"name":"2012 International Conference on Communication, Information & Computing Technology (ICCICT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130864047","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}
Pub Date : 2012-12-31DOI: 10.1109/ICCICT.2012.6398122
Vinny Gala, H. Nishar, H. Dave, Y. S. Rao
Adaptation is a primary issue for achieving efficient bandwidth utilization in wireless communication systems because of dynamic fluctuations in channel conditions. This paper details the implementation of an adaptive channel coding and modulation system using Reed Solomon (RS) codes. RS codes are non-binary error correcting codes that are capable of correcting burst and random errors. This paper investigates the effects of an Additive White Gaussian Noise (AWGN) channel on the performance of RS coding methods for different errors correction capability. Relation among BER for different code rates and the performance of RS codes for various modulation schemes is analysed. Based on the obtained analytical results, an adaptive channel coding scheme is designed. Simulation and analysis of the proposed system is done on MATLAB with real time implementation on TMS320C6713 digital signal processing (DSP) Kit.
{"title":"Real-time implementation of an adaptive channel coding system using Reed-Solomon codes","authors":"Vinny Gala, H. Nishar, H. Dave, Y. S. Rao","doi":"10.1109/ICCICT.2012.6398122","DOIUrl":"https://doi.org/10.1109/ICCICT.2012.6398122","url":null,"abstract":"Adaptation is a primary issue for achieving efficient bandwidth utilization in wireless communication systems because of dynamic fluctuations in channel conditions. This paper details the implementation of an adaptive channel coding and modulation system using Reed Solomon (RS) codes. RS codes are non-binary error correcting codes that are capable of correcting burst and random errors. This paper investigates the effects of an Additive White Gaussian Noise (AWGN) channel on the performance of RS coding methods for different errors correction capability. Relation among BER for different code rates and the performance of RS codes for various modulation schemes is analysed. Based on the obtained analytical results, an adaptive channel coding scheme is designed. Simulation and analysis of the proposed system is done on MATLAB with real time implementation on TMS320C6713 digital signal processing (DSP) Kit.","PeriodicalId":319467,"journal":{"name":"2012 International Conference on Communication, Information & Computing Technology (ICCICT)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121991555","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}
Pub Date : 2012-12-31DOI: 10.1109/ICCICT.2012.6398103
B. Kamdar, D. Shah, S. Sorathia, Y. S. Rao
This paper describes a design and implementation of a baseband Orthogonal Frequency Division Multiplexing (OFDM) transceiver utilizing Multiple Input Multiple Output (MIMO) signal processing for increased data rate. MIMO OFDM has many promising features which allow wireless devices to communicate at a higher data rate with reduced errors and hardware complexity. The system is composed of a 2×2 MIMO utilizing Vertical-Bell Laboratories Layered Space-Time (V-BLAST) detection algorithm. Alternate designs for modulator-demodulator, convolutional encoder - decoder and sync circuit are considered to get optimum resource utilization and low complexity. The design is implemented on a Spartan 6 FPGA and resource utilization with various combinations is compared to get an optimum design in terms of hardware footprint.
{"title":"Design and hardware implementation of a low complexity MIMO OFDM system","authors":"B. Kamdar, D. Shah, S. Sorathia, Y. S. Rao","doi":"10.1109/ICCICT.2012.6398103","DOIUrl":"https://doi.org/10.1109/ICCICT.2012.6398103","url":null,"abstract":"This paper describes a design and implementation of a baseband Orthogonal Frequency Division Multiplexing (OFDM) transceiver utilizing Multiple Input Multiple Output (MIMO) signal processing for increased data rate. MIMO OFDM has many promising features which allow wireless devices to communicate at a higher data rate with reduced errors and hardware complexity. The system is composed of a 2×2 MIMO utilizing Vertical-Bell Laboratories Layered Space-Time (V-BLAST) detection algorithm. Alternate designs for modulator-demodulator, convolutional encoder - decoder and sync circuit are considered to get optimum resource utilization and low complexity. The design is implemented on a Spartan 6 FPGA and resource utilization with various combinations is compared to get an optimum design in terms of hardware footprint.","PeriodicalId":319467,"journal":{"name":"2012 International Conference on Communication, Information & Computing Technology (ICCICT)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127737095","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}
Pub Date : 2012-12-31DOI: 10.1109/ICCICT.2012.6398123
T. Dhope, D. Simunic
Bandwidth efficiency is very important parameter, because it relates to frequency spectrum, which is naturally, limited resource. The cognitive radio has been proposed as the future technology to meet the ever increasing demand of the radio spectrum by allocating the spectrum dynamically to allow unlicensed access on non-interfering basis. Conventional sensing methods usually relate to sensing the spectrum in three dimensions viz. frequency, time and space. However, there are other dimensions `Angle' and `Code' that need to be explored further for spectrum opportunity. This paper investigates the performance of Angle of Arrival (AoA) estimation algorithms like Bartlett's, Capon, MUSIC, Root-MUSIC and ESPRIT in cognitive radio networks. The results show that the performance of the algorithms improves with increasing number of array elements, increasing number of snapshots and increasing signal-to-noise ratio. This new approach of AoA estimation of licensed user, improves frequency reuse capability and increases channel capacity by multiplexing multiple users (licensed and unlicensed) into the same channel at the same time in the same geographical area by forming the beam of unlicensed user in the direction other than the licensed users' AoA direction.
{"title":"On the performance of AoA estimation algorithms in cognitive radio networks","authors":"T. Dhope, D. Simunic","doi":"10.1109/ICCICT.2012.6398123","DOIUrl":"https://doi.org/10.1109/ICCICT.2012.6398123","url":null,"abstract":"Bandwidth efficiency is very important parameter, because it relates to frequency spectrum, which is naturally, limited resource. The cognitive radio has been proposed as the future technology to meet the ever increasing demand of the radio spectrum by allocating the spectrum dynamically to allow unlicensed access on non-interfering basis. Conventional sensing methods usually relate to sensing the spectrum in three dimensions viz. frequency, time and space. However, there are other dimensions `Angle' and `Code' that need to be explored further for spectrum opportunity. This paper investigates the performance of Angle of Arrival (AoA) estimation algorithms like Bartlett's, Capon, MUSIC, Root-MUSIC and ESPRIT in cognitive radio networks. The results show that the performance of the algorithms improves with increasing number of array elements, increasing number of snapshots and increasing signal-to-noise ratio. This new approach of AoA estimation of licensed user, improves frequency reuse capability and increases channel capacity by multiplexing multiple users (licensed and unlicensed) into the same channel at the same time in the same geographical area by forming the beam of unlicensed user in the direction other than the licensed users' AoA direction.","PeriodicalId":319467,"journal":{"name":"2012 International Conference on Communication, Information & Computing Technology (ICCICT)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127984181","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}
Pub Date : 2012-12-31DOI: 10.1109/ICCICT.2012.6398113
P. Choudhari
Wireless sensor network is an emerging technology that enables remote monitoring of objects and environment. Wireless sensor networks can assist user to detect target as well as acquire the movement information of the target such as a vehicle. Vehicle tracking finds its prime application in intrusion avoidance, surveillance etc. For surveillance applications, it is preferable to keep the intruder unaware of being tracked. This paper presents a tracking algorithm based on Kalman filter and the hardware implementation of a test bed along with the set/reset calibration circuit for improving the sensitivity of the magnetic sensor. The proposed method has been evaluated on real data.
{"title":"Development of vehicle tracking system using passive sensors","authors":"P. Choudhari","doi":"10.1109/ICCICT.2012.6398113","DOIUrl":"https://doi.org/10.1109/ICCICT.2012.6398113","url":null,"abstract":"Wireless sensor network is an emerging technology that enables remote monitoring of objects and environment. Wireless sensor networks can assist user to detect target as well as acquire the movement information of the target such as a vehicle. Vehicle tracking finds its prime application in intrusion avoidance, surveillance etc. For surveillance applications, it is preferable to keep the intruder unaware of being tracked. This paper presents a tracking algorithm based on Kalman filter and the hardware implementation of a test bed along with the set/reset calibration circuit for improving the sensitivity of the magnetic sensor. The proposed method has been evaluated on real data.","PeriodicalId":319467,"journal":{"name":"2012 International Conference on Communication, Information & Computing Technology (ICCICT)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125813182","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}
Pub Date : 2012-12-31DOI: 10.1109/ICCICT.2012.6398230
Pankaj K. Gakare, Abhilasha M. Patel, Jignesh R. Vaghela, R. Awale
Ambulatory cardiac monitoring has become an important scenario nowadays as a standard preventive cardiological procedure for detection of cardiac abnormalities. In the proposed system it is achieved with the Android smart phone. Heart rate variability (HRV) analysis is well known to give information about the autonomic heart rate modulation mechanism. In order to avoid erroneous conclusions, it is of utmost importance that only sinus rhythms are present in the cardiogram. Therefore, preprocessing of the RR interval time series is necessary. This paper presents an advanced automated algorithm to preprocess RR intervals obtained from a normal ECG. Validation of this algorithm was performed on recorded ECG signals by holter recorder and MIT-BIH database. The proposed algorithm therefore restricts the manual data check to the absolute minimum and allows a reliable HRV analysis.
{"title":"Real time feature extraction of ECG signal on android platform","authors":"Pankaj K. Gakare, Abhilasha M. Patel, Jignesh R. Vaghela, R. Awale","doi":"10.1109/ICCICT.2012.6398230","DOIUrl":"https://doi.org/10.1109/ICCICT.2012.6398230","url":null,"abstract":"Ambulatory cardiac monitoring has become an important scenario nowadays as a standard preventive cardiological procedure for detection of cardiac abnormalities. In the proposed system it is achieved with the Android smart phone. Heart rate variability (HRV) analysis is well known to give information about the autonomic heart rate modulation mechanism. In order to avoid erroneous conclusions, it is of utmost importance that only sinus rhythms are present in the cardiogram. Therefore, preprocessing of the RR interval time series is necessary. This paper presents an advanced automated algorithm to preprocess RR intervals obtained from a normal ECG. Validation of this algorithm was performed on recorded ECG signals by holter recorder and MIT-BIH database. The proposed algorithm therefore restricts the manual data check to the absolute minimum and allows a reliable HRV analysis.","PeriodicalId":319467,"journal":{"name":"2012 International Conference on Communication, Information & Computing Technology (ICCICT)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115252555","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：