Pub Date : 2009-12-01DOI: 10.1109/ICCIT.2009.5407127
H. M. I. Hassan, M. Hasan, Md. Fazle Elahi Khan, M. Shahjahan
Human walks, runs, dances and left behind interesting information on their actions. This paper presents how chaotic dynamics help to interpret and classify human actions. The trajectories of two legs are extracted during a motion such as walk. These trajectories of foot points are collected from an artificial human video arrangement. Each dimension of trajectory represents a time series. The phase space for each time series is reconstructed using appropriate time delay and dimension. The plot exhibited a characteristic trajectory representing the regularity of the time series. Analysis of time series obtained in human with three different motions revealed that the trajectory behaves in such a way that the time series is governed with a deterministic rule. Unique patterns are observed for a particular motion. This can be revealed from the phase space and self organizing map (SOM) network. The motions (walk, run, and jump) can be categorized in terms of different shape of phase space and output of the SOM network. The results are validated with correlation dimension. These representations are very useful in classifying the human motions.
{"title":"Extracting unique patterns from human actions","authors":"H. M. I. Hassan, M. Hasan, Md. Fazle Elahi Khan, M. Shahjahan","doi":"10.1109/ICCIT.2009.5407127","DOIUrl":"https://doi.org/10.1109/ICCIT.2009.5407127","url":null,"abstract":"Human walks, runs, dances and left behind interesting information on their actions. This paper presents how chaotic dynamics help to interpret and classify human actions. The trajectories of two legs are extracted during a motion such as walk. These trajectories of foot points are collected from an artificial human video arrangement. Each dimension of trajectory represents a time series. The phase space for each time series is reconstructed using appropriate time delay and dimension. The plot exhibited a characteristic trajectory representing the regularity of the time series. Analysis of time series obtained in human with three different motions revealed that the trajectory behaves in such a way that the time series is governed with a deterministic rule. Unique patterns are observed for a particular motion. This can be revealed from the phase space and self organizing map (SOM) network. The motions (walk, run, and jump) can be categorized in terms of different shape of phase space and output of the SOM network. The results are validated with correlation dimension. These representations are very useful in classifying the human motions.","PeriodicalId":443258,"journal":{"name":"2009 12th International Conference on Computers and Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129045911","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 : 2009-12-01DOI: 10.1109/ICCIT.2009.5407305
A. Mostayed, M. E. Kabir, S. Z. Khan, Md. Mynuddin Gani Mazumder
Biometric authentication refers to the automatic verification of a person's identity from physiological or behavioral characteristics presented by him or her. In this paper an authentication scheme from hand images is presented. Instead of dealing with hand measurements, typically termed as ‘hand geometry’, this method verifies with entire hand shape. Peg free and position invariant features are calculated using Radon Transform. Low resolution hand images captured by a document scanner are processed to extract feature vectors. The proposed scheme is tested on a data set of 136 images with simple Euclidian norm based match score. The method attained an Equal Error Rate (EER) of 5.1%.
{"title":"Biometric authentication from low resolution hand images using radon transform","authors":"A. Mostayed, M. E. Kabir, S. Z. Khan, Md. Mynuddin Gani Mazumder","doi":"10.1109/ICCIT.2009.5407305","DOIUrl":"https://doi.org/10.1109/ICCIT.2009.5407305","url":null,"abstract":"Biometric authentication refers to the automatic verification of a person's identity from physiological or behavioral characteristics presented by him or her. In this paper an authentication scheme from hand images is presented. Instead of dealing with hand measurements, typically termed as ‘hand geometry’, this method verifies with entire hand shape. Peg free and position invariant features are calculated using Radon Transform. Low resolution hand images captured by a document scanner are processed to extract feature vectors. The proposed scheme is tested on a data set of 136 images with simple Euclidian norm based match score. The method attained an Equal Error Rate (EER) of 5.1%.","PeriodicalId":443258,"journal":{"name":"2009 12th International Conference on Computers and Information Technology","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130896231","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 : 2009-12-01DOI: 10.1109/ICCIT.2009.5407307
M. Mottalib, Md Safiur Rahman Mahdi, A. Haque, S.M. Al Mamun, H. A. A. Mamun
Neural network is one of the successful methods for protein secondary structure prediction. Day to day this technology is modified, improved, even other methods also combined with it to get better result. In this paper we trained feed-forward neural network with trans-membrane protein for helix prediction. Using Java Object Oriented Neural Engine (JOONE) our achieved accuracy is 71%. This paper is expected to benefit researchers in proteomics by presenting a summary of developments of neural network in this area.
{"title":"Transmembrane helix prediction using feed-forward neural network","authors":"M. Mottalib, Md Safiur Rahman Mahdi, A. Haque, S.M. Al Mamun, H. A. A. Mamun","doi":"10.1109/ICCIT.2009.5407307","DOIUrl":"https://doi.org/10.1109/ICCIT.2009.5407307","url":null,"abstract":"Neural network is one of the successful methods for protein secondary structure prediction. Day to day this technology is modified, improved, even other methods also combined with it to get better result. In this paper we trained feed-forward neural network with trans-membrane protein for helix prediction. Using Java Object Oriented Neural Engine (JOONE) our achieved accuracy is 71%. This paper is expected to benefit researchers in proteomics by presenting a summary of developments of neural network in this area.","PeriodicalId":443258,"journal":{"name":"2009 12th International Conference on Computers and Information Technology","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133107363","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 : 2009-12-01DOI: 10.1109/ICCIT.2009.5407130
M. Islam, M. Rahman, Muhammad Abdul Goffar Khan
This paper presents an approach of speech enhancement techniques to improve the performance of the robust speaker identification under noisy environments. Start-end points detection, silence part removal, frame segmentation and windowing technique have been used to pre-process and wiener filter has been used to remove the silence parts from the speech utterances. To extract the features from the speech various speech parameterization techniques that is LPC, LPCC, RCC, MFCC, ΔMFCC and ΔΔMFCC have been simulated. Finally, to measure the performance of the proposed speech enhancement techniques, genetic algorithm has been used as a classifier for the noise robust automated speaker identification system and various experiments have performed on genetic algorithm to select the optimum parameters. According to the NOIZEOUS speech database, the highest identification rate of 70.31 [%] for text-dependent and of 61.26 [%] for text-independent speaker identification system have been achieved.
{"title":"Improvement of speech enhancement techniques for robust speaker identification in noise","authors":"M. Islam, M. Rahman, Muhammad Abdul Goffar Khan","doi":"10.1109/ICCIT.2009.5407130","DOIUrl":"https://doi.org/10.1109/ICCIT.2009.5407130","url":null,"abstract":"This paper presents an approach of speech enhancement techniques to improve the performance of the robust speaker identification under noisy environments. Start-end points detection, silence part removal, frame segmentation and windowing technique have been used to pre-process and wiener filter has been used to remove the silence parts from the speech utterances. To extract the features from the speech various speech parameterization techniques that is LPC, LPCC, RCC, MFCC, ΔMFCC and ΔΔMFCC have been simulated. Finally, to measure the performance of the proposed speech enhancement techniques, genetic algorithm has been used as a classifier for the noise robust automated speaker identification system and various experiments have performed on genetic algorithm to select the optimum parameters. According to the NOIZEOUS speech database, the highest identification rate of 70.31 [%] for text-dependent and of 61.26 [%] for text-independent speaker identification system have been achieved.","PeriodicalId":443258,"journal":{"name":"2009 12th International Conference on Computers and Information Technology","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132787455","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 : 2009-12-01DOI: 10.1109/ICCIT.2009.5407144
F. A. Faisal, M. Rahman
A Symmetric Tori connected Torus Network (STTN) is a 2D-torus network of multiple basic modules, in which the basic modules are 2D-torus networks that are hierarchically interconnected for higher-level networks. In this paper, we present the architecture of the STTN, addressing of node, routing of message, and evaluate the static network performance of STTN, TTN, TESH, mesh, and torus networks. It is shown that the STTN possesses several attractive features, including constant degree, small diameter, low cost, small average distance, moderate bisection width, and high fault tolerant performance than that of other conventional and hierarchical interconnection networks.
{"title":"Symmetric Tori connected Torus Network","authors":"F. A. Faisal, M. Rahman","doi":"10.1109/ICCIT.2009.5407144","DOIUrl":"https://doi.org/10.1109/ICCIT.2009.5407144","url":null,"abstract":"A Symmetric Tori connected Torus Network (STTN) is a 2D-torus network of multiple basic modules, in which the basic modules are 2D-torus networks that are hierarchically interconnected for higher-level networks. In this paper, we present the architecture of the STTN, addressing of node, routing of message, and evaluate the static network performance of STTN, TTN, TESH, mesh, and torus networks. It is shown that the STTN possesses several attractive features, including constant degree, small diameter, low cost, small average distance, moderate bisection width, and high fault tolerant performance than that of other conventional and hierarchical interconnection networks.","PeriodicalId":443258,"journal":{"name":"2009 12th International Conference on Computers and Information Technology","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123916826","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 : 2009-12-01DOI: 10.1109/ICCIT.2009.5407169
Nazia Perwaiz, M. Y. Javed
Energy awareness is an essential design issue in wireless sensor networks (WSN). The routing techniques of WSN are classified into three main categories Data-Centric, hierarchical and location-based. Data-Centric technologies perform in-network aggregation of data to yield energy-efficient dissemination; Sensor Protocols for Information via Negotiation (SPIN) and Directed Diffusion (DD) are basic Data-Centric routing protocols. This paper presents a survey on Data-Centric routing and specifically focuses on the Directed Diffusion and its variants (dissemination and aggregation variants) and the protocols that follow the similar concept like Directed Diffusion.
{"title":"A study on distributed diffusion and its variants","authors":"Nazia Perwaiz, M. Y. Javed","doi":"10.1109/ICCIT.2009.5407169","DOIUrl":"https://doi.org/10.1109/ICCIT.2009.5407169","url":null,"abstract":"Energy awareness is an essential design issue in wireless sensor networks (WSN). The routing techniques of WSN are classified into three main categories Data-Centric, hierarchical and location-based. Data-Centric technologies perform in-network aggregation of data to yield energy-efficient dissemination; Sensor Protocols for Information via Negotiation (SPIN) and Directed Diffusion (DD) are basic Data-Centric routing protocols. This paper presents a survey on Data-Centric routing and specifically focuses on the Directed Diffusion and its variants (dissemination and aggregation variants) and the protocols that follow the similar concept like Directed Diffusion.","PeriodicalId":443258,"journal":{"name":"2009 12th International Conference on Computers and Information Technology","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128902680","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 : 2009-12-01DOI: 10.1109/ICCIT.2009.5407167
M. M. Hossain, M. Awal, D. Roy, Md. Asraful Islam, Md. Anwar Hossain
CDMA refers to multiple access method in which the individual terminals uses spread spectrum techniques and occupy the entire spectrum whenever they transmit. This feature makes CDMA different from FDMA and TDMA. In the wireless communication, the Signal to Interference Ratio (SIR) and Bit Error Rate (BER) are the predominant parameter that characterizes the system performance. This paper presented here Standard Gaussian Approximation (SGA) methods presented in the international literature concerning the computation of the SIR and the BER in DS-CDMA systems under perfect and imperfect power control over fading and non-fading channel. The content and conclusions of this paper have driven to take many important decisions by varying different DS-CDMA communication parameters such as processing gain, number of interfering cells, multipath components etc. using SGA techniques. As SGA is analytically developed and is very computationally efficient solution for the system performance estimate in terms of SIR and BER, it helps us to avoid the tedious and cost-inefficient simulations.
{"title":"Performance analysis of DS-CDMA under perfect and imperfect power control","authors":"M. M. Hossain, M. Awal, D. Roy, Md. Asraful Islam, Md. Anwar Hossain","doi":"10.1109/ICCIT.2009.5407167","DOIUrl":"https://doi.org/10.1109/ICCIT.2009.5407167","url":null,"abstract":"CDMA refers to multiple access method in which the individual terminals uses spread spectrum techniques and occupy the entire spectrum whenever they transmit. This feature makes CDMA different from FDMA and TDMA. In the wireless communication, the Signal to Interference Ratio (SIR) and Bit Error Rate (BER) are the predominant parameter that characterizes the system performance. This paper presented here Standard Gaussian Approximation (SGA) methods presented in the international literature concerning the computation of the SIR and the BER in DS-CDMA systems under perfect and imperfect power control over fading and non-fading channel. The content and conclusions of this paper have driven to take many important decisions by varying different DS-CDMA communication parameters such as processing gain, number of interfering cells, multipath components etc. using SGA techniques. As SGA is analytically developed and is very computationally efficient solution for the system performance estimate in terms of SIR and BER, it helps us to avoid the tedious and cost-inefficient simulations.","PeriodicalId":443258,"journal":{"name":"2009 12th International Conference on Computers and Information Technology","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129436564","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 : 2009-12-01DOI: 10.1109/ICCIT.2009.5407284
Muhammad Mahfuzul Alam, M. Rajib, S. Biswas
Digital Enhanced Cordless Telecommunication (DECT) can be a latent solution for wireless local loop (WLL) based communication system planning. In this paper, the design and simulation of a 8×8 planar microstrip antenna array and signal processing techniques of smart antenna systems for DECT radio base stations are presented. MUltiple SIgnal Classification (MUSIC) and Least Mean Square (LMS) signal processing algorithm techniques are analyzed and simulated for smart antenna system. Simulation results of the radiation characteristics, gain and return loss of the fixed beam planar array antenna have been produced by EM simulation software Zeland IE3D. Signal processing simulations were run in MATLAB. This smart antenna system is designed and simulated for DECT system in 1.88–1.90GHz frequency band.
{"title":"Design and analysis of smart antenna system for DECT radio base station in wireless local loop","authors":"Muhammad Mahfuzul Alam, M. Rajib, S. Biswas","doi":"10.1109/ICCIT.2009.5407284","DOIUrl":"https://doi.org/10.1109/ICCIT.2009.5407284","url":null,"abstract":"Digital Enhanced Cordless Telecommunication (DECT) can be a latent solution for wireless local loop (WLL) based communication system planning. In this paper, the design and simulation of a 8×8 planar microstrip antenna array and signal processing techniques of smart antenna systems for DECT radio base stations are presented. MUltiple SIgnal Classification (MUSIC) and Least Mean Square (LMS) signal processing algorithm techniques are analyzed and simulated for smart antenna system. Simulation results of the radiation characteristics, gain and return loss of the fixed beam planar array antenna have been produced by EM simulation software Zeland IE3D. Signal processing simulations were run in MATLAB. This smart antenna system is designed and simulated for DECT system in 1.88–1.90GHz frequency band.","PeriodicalId":443258,"journal":{"name":"2009 12th International Conference on Computers and Information Technology","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122008995","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 : 2009-12-01DOI: 10.1109/ICCIT.2009.5407319
K. Hasan, K. Islam, Mojahidul Islam, T. Tsuji
Multidimensional array is widely used in large number of scientific research and engineering applications for handling large multidimensional data. There exist many data structures to represent multidimensional data. But most of these data structures are static (such as traditional multidimensional array) and can not handle the dynamic extension or reduction of the array. The Traditional Multidimensional Array (TMA) is efficient in terms of accessing the elements of the array by random computing the addressing function but TMA is not extendible during run time. In this paper we propose a new scheme, Karnaugh Representation of Extendible Array (KEA), to represent the multidimensional data. The main idea of this scheme is to represent n dimensional array by a set of two dimensional extendible arrays. The scheme can be extended in any direction during run time. To evaluate our proposed scheme, we implement and compare with the existing systems for different operations with the Traditional Multidimensional Array (TMA), and Traditional Extendible Array (TEA). Our experimental result shows that the KEA scheme outperforms TMA and TEA.
{"title":"An extendible data structure for handling large multidimensional data sets","authors":"K. Hasan, K. Islam, Mojahidul Islam, T. Tsuji","doi":"10.1109/ICCIT.2009.5407319","DOIUrl":"https://doi.org/10.1109/ICCIT.2009.5407319","url":null,"abstract":"Multidimensional array is widely used in large number of scientific research and engineering applications for handling large multidimensional data. There exist many data structures to represent multidimensional data. But most of these data structures are static (such as traditional multidimensional array) and can not handle the dynamic extension or reduction of the array. The Traditional Multidimensional Array (TMA) is efficient in terms of accessing the elements of the array by random computing the addressing function but TMA is not extendible during run time. In this paper we propose a new scheme, Karnaugh Representation of Extendible Array (KEA), to represent the multidimensional data. The main idea of this scheme is to represent n dimensional array by a set of two dimensional extendible arrays. The scheme can be extended in any direction during run time. To evaluate our proposed scheme, we implement and compare with the existing systems for different operations with the Traditional Multidimensional Array (TMA), and Traditional Extendible Array (TEA). Our experimental result shows that the KEA scheme outperforms TMA and TEA.","PeriodicalId":443258,"journal":{"name":"2009 12th International Conference on Computers and Information Technology","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115691934","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 : 2009-12-01DOI: 10.1109/ICCIT.2009.5407166
Md. Omar Faruq, M. Rahman, M. Islam, M. Amin
In this paper, a simple scheme is presented to improve the performance of mobile cellular networks by using delay of voice end user (DOVE) to the new originating calls over handoff calls in a two-dimensional (2D) traffic model for finite number of users. Expressions for probability of forced termination of handoff calls and the blocking probability of new originating calls have been derived. From this study, it has been found that the probability of forced termination of handoff calls is significantly reduced due to the incorporation of the delay of voice end user compared to the case when no such delay of voice end user is used in the system.
{"title":"Capacity enhancement of limited user traffic of mobile cellular networks using DOVE technique","authors":"Md. Omar Faruq, M. Rahman, M. Islam, M. Amin","doi":"10.1109/ICCIT.2009.5407166","DOIUrl":"https://doi.org/10.1109/ICCIT.2009.5407166","url":null,"abstract":"In this paper, a simple scheme is presented to improve the performance of mobile cellular networks by using delay of voice end user (DOVE) to the new originating calls over handoff calls in a two-dimensional (2D) traffic model for finite number of users. Expressions for probability of forced termination of handoff calls and the blocking probability of new originating calls have been derived. From this study, it has been found that the probability of forced termination of handoff calls is significantly reduced due to the incorporation of the delay of voice end user compared to the case when no such delay of voice end user is used in the system.","PeriodicalId":443258,"journal":{"name":"2009 12th International Conference on Computers and Information Technology","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131199867","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
扫码关注我们
求助内容：
应助结果提醒方式：