2010 13th International Conference on Computer and Information Technology (ICCIT)最新文献

筛选
英文 中文
A parametric formulation to Detect Speech Activity of noisy speech using EDON 一种用EDON检测含噪语音活动的参数化方法
2010 13th International Conference on Computer and Information Technology (ICCIT) Pub Date : 2010-12-01 DOI: 10.1109/ICCITECHN.2010.5723864
M. Hasan, Md. Ekramul Hamid
{"title":"A parametric formulation to Detect Speech Activity of noisy speech using EDON","authors":"M. Hasan, Md. Ekramul Hamid","doi":"10.1109/ICCITECHN.2010.5723864","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2010.5723864","url":null,"abstract":"The most critical and difficult problem in speech analysis is reliable discrimination among Silence, Unvoiced and Voiced speech. Several methods have been proposed for making this three levels decision and most of them need Speech Activity Detection (SAD). In this study, we propose the Estimated Degree of Noise (EDON) to adjust the threshold of speech activity. To estimate the degree of noise, a function was previously prepared using the least-squares (LS) method, from the given (true) DON and the estimated parameter of DON. This parameter is obtained from the Auto-Correlation Function (ACF) of the noisy speech on a frame basis. Issues associated with this EDON for SAD approach are discussed, and experiments are done using the TIMIT database. Experimental result shows that using EDON improves the classification performance specially voiced and silent parts and the efficiency is compared with other existing published algorithms.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133658174","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
A novel two-tier multiple sequence alignment algorithm 一种新的双层多序列比对算法
2010 13th International Conference on Computer and Information Technology (ICCIT) Pub Date : 2010-12-01 DOI: 10.1109/ICCITECHN.2010.5723819
Md. Sowgat Ibne Mahmud, Md. Akhter Hosen, Md. Saroer-E-Azam, M. Mottalib, H. A. Al-Mamun
{"title":"A novel two-tier multiple sequence alignment algorithm","authors":"Md. Sowgat Ibne Mahmud, Md. Akhter Hosen, Md. Saroer-E-Azam, M. Mottalib, H. A. Al-Mamun","doi":"10.1109/ICCITECHN.2010.5723819","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2010.5723819","url":null,"abstract":"Multiple sequence alignment is one of the basic research areas in bioinformatics. In most cases while doing multiple sequence alignment, a totally unaligned set of sequences are used as an initial data. In this work, we have used Clustal X 2.0.11 program to process those initial data in some aligned way. Then roulette wheel selection operator is used to select the optimal cut points of sequences. Dynamic programming is used to align the subset sequences. By comparing both these two process we found that the result is gradually improving. Our result has proved that we got higher score. In the paper “Shyi-Ming Chen, Chung-Hui Lin, and Shi-Jay Chen; Multiple DNA Sequence Alignment Based on Genetic Algorithms and Divide-and-Conquer Techniques nternational Journal of Applied Science and Engineering; 2005; 3, 2:89-100” we have observed that for the same sequences final score was 25. But using ourmethod we got the final score 32. Some experimental results has shown using graph in order to test the proposed approached.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":"245 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129630361","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
On the performance of Recurring Multistage Evolutionary Algorithm for continuous function optimization 连续函数优化的循环多阶段进化算法性能研究
2010 13th International Conference on Computer and Information Technology (ICCIT) Pub Date : 2010-12-01 DOI: 10.1109/ICCITECHN.2010.5723830
Mohammad Shafiul Alam, Md Wasi Ul Kabir, M. Islam
{"title":"On the performance of Recurring Multistage Evolutionary Algorithm for continuous function optimization","authors":"Mohammad Shafiul Alam, Md Wasi Ul Kabir, M. Islam","doi":"10.1109/ICCITECHN.2010.5723830","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2010.5723830","url":null,"abstract":"Recurring Multistage Evolutionary Algorithm is a novel evolutionary approach that is based on repeating conventional, explorative and exploitative genetic operations in order to perform better optimization with improved robustness against local optima. This work compares the performance of RMEA with that of classical evolutionary algorithm, differential evolution and particle swarm optimization on a test suite of 50 different benchmark functions. The test functions include unimodal and multimodal, separable and non-separable, regular and irregular, low and high dimensional functions. Very few works have been tested on a similar range of benchmark problems. The experimental results show that the performance of RMEA is comparable to and often better than the other mentioned algorithms.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133631192","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
An approximation algorithm for bounded degree closest phylogenetic 2nd root problem 有界度最接近系统发育二根问题的近似算法
2010 13th International Conference on Computer and Information Technology (ICCIT) Pub Date : 2010-12-01 DOI: 10.1109/ICCITECHN.2010.5723821
Md. Ahsanur Rahman, Md. Rafiqul Islam
{"title":"An approximation algorithm for bounded degree closest phylogenetic 2nd root problem","authors":"Md. Ahsanur Rahman, Md. Rafiqul Islam","doi":"10.1109/ICCITECHN.2010.5723821","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2010.5723821","url":null,"abstract":"The degree Δ-closest phylogenetic 2nd root problem (ΔCPR<inf>2</inf>) is an NP-hard problem concerning phylogenetic tree reconstruction from a graph representing the similarities of the species concerned. Here we present an approximation algorithm for this problem for any fixed Δ > 3. When |V| > 3Δ − 1, our algorithm yields an approximation ratio of max((Δ−2)/α, 2), where α > 1 is a constant whose value depends on the values of |V| and Δ.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":"63 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116818147","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
Performance evaluation of MLPC and MFCC for HMM based noisy speech recognition 基于HMM的MLPC和MFCC噪声语音识别性能评价
2010 13th International Conference on Computer and Information Technology (ICCIT) Pub Date : 2010-12-01 DOI: 10.1109/ICCITECHN.2010.5723868
M. Rahman, M. Islam
{"title":"Performance evaluation of MLPC and MFCC for HMM based noisy speech recognition","authors":"M. Rahman, M. Islam","doi":"10.1109/ICCITECHN.2010.5723868","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2010.5723868","url":null,"abstract":"In this paper auditory like features MLPC and MFCC have been used as front-end and their performance has been evaluated on Aurora-2 database for Hidden Markov Model (HMM) based noisy speech recognition. The clean data set is used for training and test set A is used to examine the performance. It has been found that almost the same recognition performance has been obtained both for MLPC and MFCC and the average word accuracy for MLPC and for MFCC is found to be 59.05% and 59.21%, respectively. It has also been observed that the MLPC is more effective than MFCC for noise type subway and exhibition, on the other hand, MFCC is more superior for babble and car noises.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114645735","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
Curvelet texture based face recognition using Principal Component Analysis 基于主成分分析的曲线纹理人脸识别
2010 13th International Conference on Computer and Information Technology (ICCIT) Pub Date : 2010-12-01 DOI: 10.1109/ICCITECHN.2010.5723827
Shafin Rahman, S. M. Naim, Abdullah Al Farooq, M. Islam
{"title":"Curvelet texture based face recognition using Principal Component Analysis","authors":"Shafin Rahman, S. M. Naim, Abdullah Al Farooq, M. Islam","doi":"10.1109/ICCITECHN.2010.5723827","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2010.5723827","url":null,"abstract":"A vital issue for face recognition is to represent a face image by effective and efficient features. To-date a numerous feature extraction techniques have been proposed in the literature. Among them, content based image retrieval (CBIR) using curvelet transform captures accurate texture features to represent the image. In this paper, we propose a novel face recognition method that uses curvelet texture features for face representation. Features are computed by low order statistics like mean and standard deviation of transformed face images. Since the spectral domain of curvelet has no hole or overlap, there is no loss of frequency information in face images. Moveover, such feature representation has considerably low dimension. Thus, computation within the face-space becomes easier. Furthermore, the dimension of features is independent of face image resolution. As a result, it can support face images of different resolution as input. To build the classifier, we apply PCA on the concatenated feature representation of subdivisions. We test our system with 4 and 5 levels of scales of curvelet transform. We also experiment by dividing the face image into different number of sub-divisions on three standard databases. The experimental results confirm that curvelet texture features achieve satisfactory performance for face recognition.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114682818","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
Self-adaptation of mutation step size in Artificial Bee Colony algorithm for continuous function optimization 连续函数优化人工蜂群算法中突变步长的自适应
2010 13th International Conference on Computer and Information Technology (ICCIT) Pub Date : 2010-12-01 DOI: 10.1109/ICCITECHN.2010.5723831
Mohammad Shafiul Alam, Md Wasi Ul Kabir, M. Islam
{"title":"Self-adaptation of mutation step size in Artificial Bee Colony algorithm for continuous function optimization","authors":"Mohammad Shafiul Alam, Md Wasi Ul Kabir, M. Islam","doi":"10.1109/ICCITECHN.2010.5723831","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2010.5723831","url":null,"abstract":"This paper introduces a novel adaptation scheme of mutation step size for the Artificial Bee Colony algorithm and compares its results with a number of swarm intelligence and population based optimization algorithms on complex multimodal benchmark problems. The Artificial Bee Colony (ABC) is a swarm based optimization algorithm mimicking the intelligent food foraging behavior of honey bees. The proposed scheme dynamically adapts the mutation step size for better exploration and exploitation of the search space. Mutation with large step size is likely to produce large variations which would facilitate better exploration of the undiscovered regions of the search space while small step size usually produces small variations that are better for exploitation of the already found solutions. The appropriateness of small or large steps changes dynamically depending on the current stage and maturity of the ongoing search process as well as the properties of the search space. So, dynamic adaptation of mutation step size is a promising and interesting research direction that has not been explored so far with the ABC algorithm. This paper introduces Artificial Bee Colony with Exponentially Distributed Mutation (ABC-EDM) that incorporates exponential distributions to produce mutation steps with varying lengths and suitably adjusts the current step length. ABC-EDM is compared on a number of benchmark functions with the original ABC algorithm, Genetic Algorithm (GA), Particle Swarm Optimization (PSO) and Particle Swarm Inspired Evolutionary Algorithm (PS-EA). Results demonstrate that ABC-EDM performs better optimization with lower dimensionality, but the improvement fades away with increased number of dimensions.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":"189 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132258051","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}
引用次数: 24
Bangla phoneme recognition for ASR using multilayer neural network 基于多层神经网络的孟加拉语语音识别
2010 13th International Conference on Computer and Information Technology (ICCIT) Pub Date : 2010-12-01 DOI: 10.1109/ICCITECHN.2010.5723837
Mohammed Rokibul Alam Kotwal, Manoj Banik, Qamrun Nahar Eity, M. N. Huda, G. Muhammad, Y. Alotaibi
{"title":"Bangla phoneme recognition for ASR using multilayer neural network","authors":"Mohammed Rokibul Alam Kotwal, Manoj Banik, Qamrun Nahar Eity, M. N. Huda, G. Muhammad, Y. Alotaibi","doi":"10.1109/ICCITECHN.2010.5723837","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2010.5723837","url":null,"abstract":"This paper presents a Bangla phoneme recognition method for Automatic Speech Recognition (ASR). The method consists of two stages: i) a multilayer neural network (MLN), which converts acoustic features, mel frequency cepstral coefficients (MFCCs), into phoneme probabilities and ii) the phoneme probabilities obtained from the first stage and corresponding Δ and ΔΔ parameters calculated by linear regression (LR) are inserted into a hidden Markov model (HMM) based classifier to obtain more accurate phoneme strings. From the experiments on Bangla speech corpus prepared by us, it is observed that the proposed method provides higher phoneme recognition performance than the existing method. Moreover, it requires a fewer mixture components in the HMMs.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121788082","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}
引用次数: 10
Dynamic modeling and fuzzy logic control of a two-link flexible manipulator using genetic optimization techniques 基于遗传优化技术的两连杆柔性机械臂动态建模与模糊逻辑控制
2010 13th International Conference on Computer and Information Technology (ICCIT) Pub Date : 2010-12-01 DOI: 10.1109/ICCITECHN.2010.5723894
Tahmina Zebin, M. Alam
{"title":"Dynamic modeling and fuzzy logic control of a two-link flexible manipulator using genetic optimization techniques","authors":"Tahmina Zebin, M. Alam","doi":"10.1109/ICCITECHN.2010.5723894","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2010.5723894","url":null,"abstract":"Flexible manipulator systems exhibit many advantages over their traditional (rigid) counterparts. However, they have not been favored in production industries due to its obvious disadvantages in controlling the manipulator. This paper presents theoretical investigation into the dynamic modeling and characterization of a constrained two-link flexible manipulator, by using finite element method. The final derived model of the system is simulated to investigate the behavior of the system. A Genetic Algorithm (GA) based hybrid fuzzy logic control strategy is also developed to reduce the end-point vibration of a flexible manipulator without sacrificing its speed of response. An uncoupled fuzzy logic controller approach is employed with individual controllers at the shoulder and the elbow link utilizing hub-angle error and hub-velocity feedback. GA has been used to extract and optimize the rule base of the fuzzy logic controller. The fitness function of GA optimization process is formed by taking weighted sum of multiple objectives to trade off between system overshoot and rise time. Moreover, scaling factors of the fuzzy controller are tuned with GA to improve the performance of the controller. A significant amount of vibration reduction has been achieved with satisfactory level of overshoot, rise time and settling time and steady state error.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130097409","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}
引用次数: 13
Towards a tableau based high performance automated theorem prover 迈向基于表格的高性能自动定理证明器
2010 13th International Conference on Computer and Information Technology (ICCIT) Pub Date : 2010-12-01 DOI: 10.1109/ICCITECHN.2010.5723892
Zahidul Islam, Ahmed Shah Mashiyat, Kashif Nizam Khan, S. M. M. Karim
{"title":"Towards a tableau based high performance automated theorem prover","authors":"Zahidul Islam, Ahmed Shah Mashiyat, Kashif Nizam Khan, S. M. M. Karim","doi":"10.1109/ICCITECHN.2010.5723892","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2010.5723892","url":null,"abstract":"Automated Theorem Proving systems are enormously powerful computer programs capable of solving immensely difficult problems. The extreme capabilities of these systems lie on some well-established proof systems. Semantic tableau is such a proof system used to prove the validity of a formula by contradiction and can produce a counterexample if it fails. It can also be used to prove whether a formula is a logical consequence of a set of formulas. Tableau can be used in propositional logic, predicate logic, modal logic, temporal logic, and in other non-classical logics. In this paper, we describe the implementation of a sequential tableau algorithm for propositional logic using a procedural programming language rather then logic programming language. We also propose a tableau based proof system in a distributed environment using the message passing interface. Successful implementation of the proposed high performance approach will un-wrap an efficient paradigm for automated theorem proving.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115506023","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
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学术文献互助群
群 号:481959085
Book学术官方微信