16th Int'l Conf. Computer and Information Technology最新文献

筛选
英文 中文
Breast cancer classification from ultrasonic images based on sparse representation by exploiting redundancy 基于冗余稀疏表示的超声图像乳腺癌分类
16th Int'l Conf. Computer and Information Technology Pub Date : 2014-12-29 DOI: 10.1109/ICCITECHN.2014.6997360
Abdullah Al Helal, K. Ahmed, Md. Saifur Rahman, S. Alam
{"title":"Breast cancer classification from ultrasonic images based on sparse representation by exploiting redundancy","authors":"Abdullah Al Helal, K. Ahmed, Md. Saifur Rahman, S. Alam","doi":"10.1109/ICCITECHN.2014.6997360","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2014.6997360","url":null,"abstract":"We present a Sparse Representation-based Classifier (SRC) that provides superior performance in terms of high Area Under the Receiver Operating Characteristic (ROC) Curve (AUC) in classifying benign and malignant breast lesions captured in ultrasound images. Although such a classifier was proposed for face recognition, it has been proposed in medical diagnosis from ultrasonic images in this work for the first time. The classifier is based on ℓ1-norm based sparse representation of a patient's test data in terms of linear combination of the features of the benign and malignant test lesions available in the training set. The proposed classifier introduces an index called Sparsity Rank (SR) for the classification obtained from the normalized energy of the weights as a linear combination of the global sparse representation of the ultrasound images of the training set. The performance of the classifier is further enhanced to a great extent by two ways: first, by intelligently combining the features extracted from the multiple ultrasound scan of the same mass, and the second, by using the optimal feature set obtained by a suboptimal strategy that avoids the time exhaustive brute force approach that has a combinatorial search space. With all the enhancements an AUC of 0.9802 has been achieved, when training and testing sets are chosen by leave-one-out approach from the data set.","PeriodicalId":113626,"journal":{"name":"16th Int'l Conf. Computer and Information Technology","volume":"152 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124615913","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
Face recognition using eyes, nostrils and mouth features 利用眼睛、鼻孔和嘴巴特征进行人脸识别
16th Int'l Conf. Computer and Information Technology Pub Date : 2014-03-08 DOI: 10.1109/ICCITECHN.2014.6997378
S. Paul, Mohammad Shorif Uddin, S. Bouakaz
{"title":"Face recognition using eyes, nostrils and mouth features","authors":"S. Paul, Mohammad Shorif Uddin, S. Bouakaz","doi":"10.1109/ICCITECHN.2014.6997378","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2014.6997378","url":null,"abstract":"This paper describes a face recognition algorithm that extracts the eyes, nostrils and mouth features from cumulative distribution function (CDF) by applying Otsu thresholding. The algorithm, which is inspired by the probability of white pixels of binary facial image, has been tested using the BioID frontal face large database in different illuminations, expressions and lighting conditions. Illumination and lighting variations are addressed using a selective equalization technique. The experimental results have confirmed an average recognition rate of 93.55%.","PeriodicalId":113626,"journal":{"name":"16th Int'l Conf. Computer and Information Technology","volume":"43 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121235310","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}
引用次数: 5
Optimizing software design migration from structured programming to object oriented paradigm 优化从结构化编程到面向对象范式的软件设计迁移
16th Int'l Conf. Computer and Information Technology Pub Date : 2014-03-08 DOI: 10.1109/ICCITECHN.2014.6997320
Saeed Siddik, Alim Ul Gias, S. Khaled
{"title":"Optimizing software design migration from structured programming to object oriented paradigm","authors":"Saeed Siddik, Alim Ul Gias, S. Khaled","doi":"10.1109/ICCITECHN.2014.6997320","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2014.6997320","url":null,"abstract":"Several industries are using legacy softwares, developed with Structured Programming (SP) approach, that should be migrated to Object Oriented Paradigm (OOP) for ensuring better software quality parameters like modularity, manageability and extendability. Automating SP to OOP migration is pivotal as it could reduce time that take in the manual process. Given this potential benefit, the issue is yet to be addressed by researchers. This paper addresses the scenario by modeling this problem as a graph clustering problem where SP functions and function calls are vertices and edges respectively. The challenge evolving the problem is to find optimized clusters from graphs. To aid this problem, certain heuristic algorithms based on Monte Carlo and Greedy approaches are being developed. The proposed algorithms have been tested against a collection of real and synthetic data. The numerical results show that greedy algorithms are faster and produced better results than the average performance of Monte Carlo based approaches.","PeriodicalId":113626,"journal":{"name":"16th Int'l Conf. Computer and Information Technology","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116247658","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
A new effective part selection approach for part-based gait recognition 基于部位的步态识别中一种新的有效部位选择方法
16th Int'l Conf. Computer and Information Technology Pub Date : 2014-03-08 DOI: 10.1109/ICCITECHN.2014.6997349
M. Shariful Islam, Abdul Matin, J. Paul, M. Rokanujjaman, M. Altab Hossain
{"title":"A new effective part selection approach for part-based gait recognition","authors":"M. Shariful Islam, Abdul Matin, J. Paul, M. Rokanujjaman, M. Altab Hossain","doi":"10.1109/ICCITECHN.2014.6997349","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2014.6997349","url":null,"abstract":"In part-based human gait recognition, choosing the appropriate body parts is the most challenging problem. The various cofactors such as carrying conditions (backpack or side bag or hand bag), cloths (long coat or jacket or gown) affect various body parts. Here, we proposed a method for detecting the various cofactors in early stage. We have taken some pixel points which are marked as a boundary for each cofactor. The weight of these points is calculated and used to detect the particular cofactors in early stage. We divide the human body into seven body parts based on anatomical studies of gait. Discarding the body parts where the cofactor is present, the remaining parts are used in classification. We have achieved better result compared with other classical methods.","PeriodicalId":113626,"journal":{"name":"16th Int'l Conf. Computer and Information Technology","volume":"168 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128630080","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
Bangla phonetic feature table construction for automatic speech recognition 用于自动语音识别的孟加拉语语音特征表构建
16th Int'l Conf. Computer and Information Technology Pub Date : 2014-03-08 DOI: 10.1109/ICCITECHN.2014.6997376
Foyzul Hassan, Mohammed Rokibul Alam Kotwal, M. N. Huda
{"title":"Bangla phonetic feature table construction for automatic speech recognition","authors":"Foyzul Hassan, Mohammed Rokibul Alam Kotwal, M. N. Huda","doi":"10.1109/ICCITECHN.2014.6997376","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2014.6997376","url":null,"abstract":"This This research constructs a phonetic feature (PF) table for all the phonemes pronounced in Bangla (widely known as Bengali) language where the whole study is divided into two parts. In the first part, a PF table is constructed, while the second part deals with Bangla automatic speech recognition (ASR) using PFs. For Bangla language, fifty three phonemes including both vowels and consonants are considered in which the phones, k (/s/) and m (/s/), and, Y (/n/) and b (/n/) contain approximately same spectrum and hence, they share same PFs. In the PF table, twenty two PFs (Silence, Short Silence, Stop, ...) are required for representing all the Bangla phonemes. On the other hand, the second part comprised of three stages: i) first stage deals with acoustic features, mel frequency cepstral coefficients (MFCCs) extraction, ii) second stage embeds PFs extraction procedure using a multilayer neural network (MLN) and iii) the final stage integrates a triphone-based hidden Markov model (HMM) for generating the output text strings by inputting log values of twenty two dimensional PFs. In the experiments on Bangla Newspaper Article Sentences, it is observed that the PF-based ASR system provides higher word correct rate, word accuracy and sentence correct rate in comparison with the standard MFCC-based method.","PeriodicalId":113626,"journal":{"name":"16th Int'l Conf. Computer and Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129432955","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}
引用次数: 4
Two stage fuzzy logic based clustering approach wireless sensor network LEACH protocol 基于两阶段模糊逻辑聚类的无线传感器网络LEACH协议
16th Int'l Conf. Computer and Information Technology Pub Date : 2014-03-08 DOI: 10.1109/ICCITECHN.2014.6997325
M. Kamal, Shamim Ara Shawkat, M. S. Alam
{"title":"Two stage fuzzy logic based clustering approach wireless sensor network LEACH protocol","authors":"M. Kamal, Shamim Ara Shawkat, M. S. Alam","doi":"10.1109/ICCITECHN.2014.6997325","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2014.6997325","url":null,"abstract":"Energy proficiency is an essential feature to intend an extensive existence wireless sensor network. More than a few methods have been proposed to boost the battery lifetime of sensor nodes. One of the methods is clustering approach which consists of two ways: selecting cluster heads with more residual energy and rotating cluster heads periodically from cluster to cluster thus extends the network lifetime. In this paper we present the wireless sensor networks by means of TSFL-LEACH (Two Stage Fuzzy Logic based Low Energy Adaptive Clustering Hierarchy) where completely two separate cluster levels are defined depending on the distance from the cluster heads and the cluster nodes. We also applied fuzzy asymmetrical clustering mechanism to prolong the lifetime of WSNs. We compare our algorithm with some popular algorithms namely LEACH, LEACH-C and EEUC. The simulation result shows that our bespoken edition improves the energy efficiency and enhances the life length of a wireless sensor network (WSN).","PeriodicalId":113626,"journal":{"name":"16th Int'l Conf. Computer and Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129455572","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}
引用次数: 4
Unfairness problem in WLANs due to asymmetric co-channel interference and its mitigation 无线局域网中由非对称同信道干扰引起的不公平性问题及其缓解
16th Int'l Conf. Computer and Information Technology Pub Date : 2014-03-08 DOI: 10.1109/ICCITECHN.2014.6997322
M. Mahmud, M. Uddin
{"title":"Unfairness problem in WLANs due to asymmetric co-channel interference and its mitigation","authors":"M. Mahmud, M. Uddin","doi":"10.1109/ICCITECHN.2014.6997322","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2014.6997322","url":null,"abstract":"Co-channel interference exists in IEEE 802.11 based wireless local area networks (WLANs) due to the limited number of non-overlapping channels in the current standards. In this paper, we investigate the impact of co-channel interference in carrier sense multiple access with collision avoidance (CSMA/CA) based WLANs via simulation. We find that the throughput unfairness among the users is severe in WLANs due to asymmetric co-channel interference among the users. We propose a centralized algorithm based on analytical analysis to configure the minimum contention window of the nodes to mitigate the throughput unfairness problem in WLANs. The performance of the proposed algorithm is evaluated by simulation and found to be very effective.","PeriodicalId":113626,"journal":{"name":"16th Int'l Conf. Computer and Information Technology","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121417179","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
Color feature based video content extraction and its application for poster generation with relevance feedback 基于颜色特征的视频内容提取及其在关联反馈海报生成中的应用
16th Int'l Conf. Computer and Information Technology Pub Date : 2014-03-08 DOI: 10.1109/ICCITECHN.2014.6997343
S. M. Mohidul Islam, Taznin Jahan, Banalata Das
{"title":"Color feature based video content extraction and its application for poster generation with relevance feedback","authors":"S. M. Mohidul Islam, Taznin Jahan, Banalata Das","doi":"10.1109/ICCITECHN.2014.6997343","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2014.6997343","url":null,"abstract":"Poster that represents a video has many applications in internet and media world. In this paper, a method is proposed to generate poster based on color feature and relevance feedback. Color feature is used because it is more closely to human perception and it is easy to extract, match and also effective for indexing. In our method as color feature of a frame in a video, HSV color space and Color Moment are used. To calculate similar frames i.e. to detect shot, Euclidean distance between the features of frames are compared with a predefined threshold value. One frame is selected from each shot and stored with Temporally Occurrence Value (TOV) of the Frame. As a video can have similar shots in it but in different times, so the similar frames from the similar shots of different times are detected and one frame is selected from them. Then this selected frame is stored with Permanent Occurrence Value (POV) of the Frame by replacing its TOV and discarding others of them from storage. Finally, five frames with maximum POV are selected to generate poster layout and ranked the posters by their relevance feedback. The experiments show the robust result than existing methods.","PeriodicalId":113626,"journal":{"name":"16th Int'l Conf. Computer and Information Technology","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130457098","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
A switching mechanism for grid providers 网格提供者的切换机制
16th Int'l Conf. Computer and Information Technology Pub Date : 2014-03-08 DOI: 10.1109/ICCITECHN.2014.6997350
A. Haque
{"title":"A switching mechanism for grid providers","authors":"A. Haque","doi":"10.1109/ICCITECHN.2014.6997350","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2014.6997350","url":null,"abstract":"Economic-based resource management models are found to be efficient for distributed resource collaboration in the Grid. Due to the wide range of applications and dynamic nature of Grid resources, constant performance by a specific economic model is therefore subjective. This work identifies the potential of different models in different scenarios in the Grid. This identification motivates us to design an optimization framework that couples suitable economic models and is able to switch from one model to another based on the models' domains of strength. The research further describes the roles played by an agent in dynamically deciding which model to be used when and for what purpose. It shows the effectiveness of the switching framework compared to any other individual models in a dynamic computing environment.","PeriodicalId":113626,"journal":{"name":"16th Int'l Conf. Computer and Information Technology","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131222491","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
A faster approach to periodic data flipping of SRAM array for NBTI recovery 一种用于NBTI恢复的SRAM阵列周期性数据翻转的快速方法
16th Int'l Conf. Computer and Information Technology Pub Date : 2014-03-08 DOI: 10.1109/ICCITECHN.2014.6997377
Sani Md Ismail, Ismail Hossain, Md. Shazzad Hossain, Y. Arafat
{"title":"A faster approach to periodic data flipping of SRAM array for NBTI recovery","authors":"Sani Md Ismail, Ismail Hossain, Md. Shazzad Hossain, Y. Arafat","doi":"10.1109/ICCITECHN.2014.6997377","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2014.6997377","url":null,"abstract":"Negative Bias Temperature Instability (NBTI) is a prime reliability issue for micro and nano-scale semi-conductor devices. Due to continuous device scaling, NBTI effect has become more severe than before and affected device life-time. Memory devices like SRAMs are tremendously affected by NBTI as the PMOS transistor gate is connected at `0' logic for a long time. Several device-level and architecture-level solutions have been proposed to improve device life-time by interrupting NBTI degradation. Such an architectural level solution is to flip data in a particular SRAM cell after a certain time, causing periodic stress and relaxation. SRAM data flipping techniques proposed so far are not so time friendly as it is needed to access each memory cell individually and flip the data stored. It makes the process more time consuming and inconvenient for present ultra-fast system with high activity factor. In this paper, we proposed a new 7-T SRAM cell to allow flipping data of more than one memory cells at same clock pulse, hence decreasing the flipping time of entire memory array and concluded that with the new proposed cell and flipping procedure, data flipping of the entire memory array will become much faster which will ensure convenient NBTI recovery.","PeriodicalId":113626,"journal":{"name":"16th Int'l Conf. Computer and Information Technology","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114556551","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
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学术官方微信