2015 IEEE 2nd International Conference on Recent Trends in Information Systems (ReTIS)最新文献

筛选
英文 中文
An optimal clustering for fuzzy categorization of cursive handwritten text with weight learning in textual attributes 基于文本属性权重学习的手写体文本模糊分类优化聚类
G. Sarker, Silpi Dhua, Monica Besra
{"title":"An optimal clustering for fuzzy categorization of cursive handwritten text with weight learning in textual attributes","authors":"G. Sarker, Silpi Dhua, Monica Besra","doi":"10.1109/ReTIS.2015.7232843","DOIUrl":"https://doi.org/10.1109/ReTIS.2015.7232843","url":null,"abstract":"A new method for fuzzy categorization of cursive handwritten text has been addressed in the present work. This is based on input text clustering and subsequent learning of weighted attributes in each subject cluster. The system first employs a new algorithm to detect the letter boundary in each cursive word in the textual sentences. A Modified Optimal Clustering Algorithm (MOCA) and Back Propagation (BP) Network combination converts the handwritten texts into printed ones. Subject wise grouping of printed texts are then made with Optimal Clustering Algorithm (OCA). The weighted attributes of each subject is thereafter learned to finally find out the fuzzy categorization of each input text. Different performance metrics of the system is computed with a newly introduced concept of Fuzzy Confusion Matrix. The performance evaluation of the fuzzy categorization of text with Holdout Method in terms of accuracy, precision, recall and f-score is appreciably high. Also, the learning and categorization time is quiet affordable.","PeriodicalId":161306,"journal":{"name":"2015 IEEE 2nd International Conference on Recent Trends in Information Systems (ReTIS)","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124652570","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}
引用次数: 9
Design & study of a low power high speed full adder using GDI multiplexer 基于GDI多路复用器的低功耗高速全加法器设计与研究
Biswarup Mukherjee, A. Ghosal
{"title":"Design & study of a low power high speed full adder using GDI multiplexer","authors":"Biswarup Mukherjee, A. Ghosal","doi":"10.1109/ReTIS.2015.7232924","DOIUrl":"https://doi.org/10.1109/ReTIS.2015.7232924","url":null,"abstract":"This paper proposes a new method for implementing a low power full adder by means of a set of Gate Diffusion Input (GDI) cell based multiplexers. Full adder is a very common example of combinational circuits and is used widely in Application Specific Integrated Circuits (ASICs). It is always advantageous to have low power action for the sub components used in VLSI chips. The explored technique of realization achieves a low power high speed design for a widely used subcomponent-full adder. Simulated outcome using state-of-art simulation tool shows finer behavioral performance of the projected method over general CMOS based full adder. Power, speed and area comparison between conventional and proposed full adder is also presented.","PeriodicalId":161306,"journal":{"name":"2015 IEEE 2nd International Conference on Recent Trends in Information Systems (ReTIS)","volume":"167 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129367465","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}
引用次数: 18
A lapped transform domain enhanced lee filter with edge detection for speckle noise reduction in SAR images 基于边缘检测的叠加变换域增强lee滤波器用于SAR图像的散斑噪声抑制
D. Hazarika, V. K. Nath, M. Bhuyan
{"title":"A lapped transform domain enhanced lee filter with edge detection for speckle noise reduction in SAR images","authors":"D. Hazarika, V. K. Nath, M. Bhuyan","doi":"10.1109/ReTIS.2015.7232885","DOIUrl":"https://doi.org/10.1109/ReTIS.2015.7232885","url":null,"abstract":"This paper describes a method which uses Lapped orthogonal transform (LOT) domain adaptive enhanced Lee filter for despeckling SAR images. Since LOT is block transform, the transform coefficients are first remapped into octave type form and then the enhanced Lee filtering is applied to subband LOT coefficients. The motivation of using Lapped transform lies in its ability to preserve oscillatory type of features present in the images like textures. For more edge preservation during despeckling process, the modified ratio of averages (MROA) edge detector is applied to the approximation subband to obtain edge information which is then employed in the proposed framework to obtain edge information in other subbands. Based on this edge information we classify the edge and non edge coefficients in all oriented subbands at various decomposition levels. Experiments using true SAR images show that the LOT domain enhanced Lee filter in proposed edge preserving framework smoothes the speckle very well in homogeneous regions while preserving more edges and texture information. The proposed despeckling filter shows significant improvement over enhanced Lee filtering in spatial and wavelet domain and also outperforms one recent undecimated wavelet domain method.","PeriodicalId":161306,"journal":{"name":"2015 IEEE 2nd International Conference on Recent Trends in Information Systems (ReTIS)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130418797","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}
引用次数: 16
Synthesis of flat-top power pattern in time-modulated unequally spaced linear arrays using DE 用DE法合成时调制非等间距线性阵列平顶功率图
S. Patra, S. K. Mandal, G. K. Mahanti, N. Pathak
{"title":"Synthesis of flat-top power pattern in time-modulated unequally spaced linear arrays using DE","authors":"S. Patra, S. K. Mandal, G. K. Mahanti, N. Pathak","doi":"10.1109/ReTIS.2015.7232861","DOIUrl":"https://doi.org/10.1109/ReTIS.2015.7232861","url":null,"abstract":"In several applications such as wireless communication, radar; shaped beam patterns are used to radiate power in a desired sector of region while suppressing the power towards the other direction to avoid interferences. This paper introduces a new technique to synthesizing flat-top shaped power pattern in time-modulated unequally spaced linear arrays (TMUSAs). Since, TMUSA synthesis problems are multimodal, nonlinear type problems which cannot be solved using analytical techniques. Therefore, a stochastically based searching and optimization technique using differential evolution (DE) algorithm is applied to optimize the static excitation with low dynamic range ratio (DRR), element spacings and on-time sequence simultaneously, in order to synthesize a low sidelobe flat-top power patterns with suppressed sideband radiation satisfying the beam requirements. The numerical result of a 30 element TMUSLA shows the superiority of the proposed technique with respect to the conventional unequally spaced linear arrays (CUSLA) used previously to synthesize such patterns.","PeriodicalId":161306,"journal":{"name":"2015 IEEE 2nd International Conference on Recent Trends in Information Systems (ReTIS)","volume":"6 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113937721","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
An adaptive feedback based reversible watermarking algorithm using difference expansion 基于差分展开的自适应反馈可逆水印算法
Sudip Ghosh, N. Das, Subhajit Das, S. Maity, H. Rahaman
{"title":"An adaptive feedback based reversible watermarking algorithm using difference expansion","authors":"Sudip Ghosh, N. Das, Subhajit Das, S. Maity, H. Rahaman","doi":"10.1109/ReTIS.2015.7232879","DOIUrl":"https://doi.org/10.1109/ReTIS.2015.7232879","url":null,"abstract":"In this paper an adaptive feedback based Reversible Watermarking (RW) algorithm using Difference Expansion (DE) is designed for gray-scale still pictures. The algorithm obtains automatically the highest payload size and the corresponding embedding threshold and also determines the best watermarked picture for an input cover picture with respect to the quality metric Peak-Signal-to-Noise Ratio (PSNR). These automatically obtained parameters are non-user-defined like other non-feedback based RW algorithms. The payload that can be embedded into a cover image is discussed, and a feedback mechanism to control this size is designed. Software implementation results using MATLAB 2013b for ten tested images are presented and compared with each other based on their quality metrics. The proposed algorithm is then compared with existing non-feedback based RW algorithms. These results indicate that the proposed algorithm has low timing complexity over other existing non-feedback based RW algorithms which in turn provide higher speed.","PeriodicalId":161306,"journal":{"name":"2015 IEEE 2nd International Conference on Recent Trends in Information Systems (ReTIS)","volume":"228 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123766549","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
A modified algorithm for DNA motif finding and ranking considering variable length motif and mutation 一种考虑变长基序和突变的DNA基序查找和排序改进算法
Adnan Ferdous Ashrafi, A. Newaz, Rasif Ajwad, M. Tanvee, Md. A. Mottalib
{"title":"A modified algorithm for DNA motif finding and ranking considering variable length motif and mutation","authors":"Adnan Ferdous Ashrafi, A. Newaz, Rasif Ajwad, M. Tanvee, Md. A. Mottalib","doi":"10.1109/RETIS.2015.7232844","DOIUrl":"https://doi.org/10.1109/RETIS.2015.7232844","url":null,"abstract":"With the evolution of time the gene composition of species have changed a lot. Consequently it has mutated to generate new diseases and traits. In order to identify genes or coding sections of a DNA sequence it is imperative to find out the promoter regions or the conserved regions of the DNA code first. But the main problem stands that the databases for these information are quite messy and needs to be researched. The main problems in finding motifs in a DNA sequence are finding a good and fast algorithm, considering mutations in those motifs, representing variable length motifs and being species generic. In this paper we tried to formulate a new algorithm which is fast, accurate and effective. Instead of general string matching of DNA sequences we have done integer mapping and matching which are comparatively fast and accurate. Besides in order to formulate a complete DNA motif finding algorithm we also need a generalized and rational fitness function for evaluating the potential motifs. Thus we have formulated a desirable fitness function that enables us to compare the relativity among potential motifs and finally to predict a certain motif for the input DNA sequences.","PeriodicalId":161306,"journal":{"name":"2015 IEEE 2nd International Conference on Recent Trends in Information Systems (ReTIS)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125310137","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
Efficient VLSI routing optimization employing discrete differential evolution technique 采用离散差分进化技术的高效VLSI路由优化
Suvrajit Manna, Tyajodeep Chakrabarti, Udit Sharma, S. Sarkar
{"title":"Efficient VLSI routing optimization employing discrete differential evolution technique","authors":"Suvrajit Manna, Tyajodeep Chakrabarti, Udit Sharma, S. Sarkar","doi":"10.1109/ReTIS.2015.7232923","DOIUrl":"https://doi.org/10.1109/ReTIS.2015.7232923","url":null,"abstract":"Global routing in VLSI design is a difficult discrete optimization problem. This paper describes the global VLSI routing using Differential Evolution based optimization technique to find out the minimum routing wire length. The routing process determines the precise paths to interconnect the chip components. The geometrical layout of the path connected in the chip must be satisfied its design requirements. This paper proposes a novel approach to apply of Differential Evolution algorithm for solving the optimization problems in discrete spaces. Performance of this approach in VLSI routing is effective and it can be efficiently used in other discrete optimization problems. The results obtained in this work are compared with other evolutionary computing techniques like Particle Swarm Optimization (PSO), Artificial Bee Colony (ABC) and FLUTE algorithm which are frequently used in routing problems.","PeriodicalId":161306,"journal":{"name":"2015 IEEE 2nd International Conference on Recent Trends in Information Systems (ReTIS)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132946952","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
A method of learning based boosting in multiple classifier for color facial expression identification 一种基于学习的多分类器面部颜色表情识别方法
Dhananjoy Bhakta, G. Sarker
{"title":"A method of learning based boosting in multiple classifier for color facial expression identification","authors":"Dhananjoy Bhakta, G. Sarker","doi":"10.1109/ReTIS.2015.7232898","DOIUrl":"https://doi.org/10.1109/ReTIS.2015.7232898","url":null,"abstract":"An automatic color facial expression recognition system has been designed and developed using multiple classifier classifications. This facial expression recognition system involves extracting the most communicative facial parts such as forehead, eyes with eyebrows, nose and mouth. Then these extracted features are trained individually using different classification system. Finally, a super classifier fuses the conclusions drawn by individual classifier which results in a final decision. This improves the overall system performance significantly in terms of accuracy, precision, recall and F-score with holdout method. Experimental result shows about 98.75% accuracy. The learning as well as performance evaluation time of the system is affordable.","PeriodicalId":161306,"journal":{"name":"2015 IEEE 2nd International Conference on Recent Trends in Information Systems (ReTIS)","volume":"7 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132193017","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
A novel parallel memory design using 2 Dot 1 electron QCA 基于2点1电子QCA的新型并行存储器设计
Mili Ghosh, Debarka Mukhopadhyay, P. Dutta
{"title":"A novel parallel memory design using 2 Dot 1 electron QCA","authors":"Mili Ghosh, Debarka Mukhopadhyay, P. Dutta","doi":"10.1109/ReTIS.2015.7232928","DOIUrl":"https://doi.org/10.1109/ReTIS.2015.7232928","url":null,"abstract":"In view of the technical limitations of CMOS technology, a serious research initiative is evident towards nanotechnology, as a substitution of the existing technology. Quantum-Dot Cellular Automata constitutes a major field of research in the nanotechnology domain. In this article we are dealing with 2 Dot 1 Electron QCA. This paper proposes a novel parallel memory design both single bit and multi-bit using 2 Dot 1 Electron QCA. The proposed design is going to preserve the stability measure and expected to be optimal.","PeriodicalId":161306,"journal":{"name":"2015 IEEE 2nd International Conference on Recent Trends in Information Systems (ReTIS)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134200698","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}
引用次数: 12
An enhanced harmony search method for Bangla handwritten character recognition using region sampling 一种基于区域采样的孟加拉语手写体字符识别的增强和谐搜索方法
Ritesh Sarkhel, Amit K. Saha, N. Das
{"title":"An enhanced harmony search method for Bangla handwritten character recognition using region sampling","authors":"Ritesh Sarkhel, Amit K. Saha, N. Das","doi":"10.1109/ReTIS.2015.7232899","DOIUrl":"https://doi.org/10.1109/ReTIS.2015.7232899","url":null,"abstract":"Identification of minimum number of local regions of a handwritten character image, containing well-defined discriminating features which are sufficient for a minimal but complete description of the character is a challenging task. A new region selection technique based on the idea of an enhanced Harmony Search methodology has been proposed here. The powerful framework of Harmony Search has been utilized to search the region space and detect only the most informative regions for correctly recognizing the handwritten character. The proposed method has been tested on handwritten samples of Bangla Basic, Compound and mixed (Basic and Compound characters)characters separately with SVM based classifier using a longest run based feature-set obtained from the image sub-regions formed by a CG based quad-tree partitioning approach. Applying this methodology on the above mentioned three types of datasets, respectively 43.75%, 12.5% and 37.5% gains have been achieved in terms of region reduction and 2.3%, 0.6% and 1.2% gains have been achieved in terms of recognition accuracy. The results show a sizeable reduction in the minimal number of descriptive regions as well a significant increase in recognition accuracy for all the datasets using the proposed technique. Thus the time and cost related to feature extraction is decreased without dampening the corresponding recognition accuracy.","PeriodicalId":161306,"journal":{"name":"2015 IEEE 2nd International Conference on Recent Trends in Information Systems (ReTIS)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134120154","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}
引用次数: 23
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学术官方微信
小红书