2016 Ninth International Conference on Contemporary Computing (IC3)最新文献

筛选
英文 中文
An efficient automated method for exudates segmentation using image normalization and histogram analysis 一种利用图像归一化和直方图分析的高效自动化渗出物分割方法
2016 Ninth International Conference on Contemporary Computing (IC3) Pub Date : 2016-08-01 DOI: 10.1109/IC3.2016.7880256
Ashmita Gupta, Ashish Issac, Namita Sengar, M. Dutta
{"title":"An efficient automated method for exudates segmentation using image normalization and histogram analysis","authors":"Ashmita Gupta, Ashish Issac, Namita Sengar, M. Dutta","doi":"10.1109/IC3.2016.7880256","DOIUrl":"https://doi.org/10.1109/IC3.2016.7880256","url":null,"abstract":"Exudates are one of the abnormalities present on the retina which are used for identification of diseases like Diabetic Retinopathy and Macular Edema. There arises a need for automated and correct segmentation of exudates from digital fundus images. This paper proposes an automated computer vision technique for efficient exudates segmentation from fundus images. The proposed method segments the exudates using an adaptive intensity based threshold which is selected by strategically combining first order statistical parameters and local thresholding based method. The proposed technique correctly detects exudates from the fundus images with an average computation time of 9 seconds. The proposed method is computationally fast and can be used in image processing based applications for diagnosis of ocular diseases.","PeriodicalId":294210,"journal":{"name":"2016 Ninth International Conference on Contemporary Computing (IC3)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123572377","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}
引用次数: 8
Comparative analysis of ELM and No-Prop algorithms ELM算法与No-Prop算法的比较分析
2016 Ninth International Conference on Contemporary Computing (IC3) Pub Date : 2016-08-01 DOI: 10.1109/IC3.2016.7880217
Abobakr Khalil Alshamiri, Alok Singh, R. Bapi
{"title":"Comparative analysis of ELM and No-Prop algorithms","authors":"Abobakr Khalil Alshamiri, Alok Singh, R. Bapi","doi":"10.1109/IC3.2016.7880217","DOIUrl":"https://doi.org/10.1109/IC3.2016.7880217","url":null,"abstract":"Extreme learning machine (ELM) is a learning method for training feedforward neural networks with random­ized hidden layer(s). It initializes the weights of hidden neurons in a random manner and determines the output weights in an analytic manner by making use of Moore-Penrose (MP) generalized inverse. No-Prop algorithm is recently proposed training algorithm for feedforward neural networks in which the weights of the hidden neurons are randomly assigned and fixed, and the output weights are trained using least mean square error (LMS) algorithm. The difference between ELM and No-Prop lies in the way the output weights are trained. While ELM optimizes the output weights in batch mode using MP generalized inverse, No-Prop uses LMS gradient algorithm to train the output weights iteratively. In this paper, a comparative analysis based on empirical studies regarding the stability and convergence performance of ELM and No-Prop algorithms for data classification is provided.","PeriodicalId":294210,"journal":{"name":"2016 Ninth International Conference on Contemporary Computing (IC3)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125006891","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
Multiscale image fusion for pansharpening of multispectral images using saliency detection 基于显著性检测的多光谱图像泛锐化多尺度融合
2016 Ninth International Conference on Contemporary Computing (IC3) Pub Date : 2016-08-01 DOI: 10.1109/IC3.2016.7880253
Shruti, S. Budhiraja
{"title":"Multiscale image fusion for pansharpening of multispectral images using saliency detection","authors":"Shruti, S. Budhiraja","doi":"10.1109/IC3.2016.7880253","DOIUrl":"https://doi.org/10.1109/IC3.2016.7880253","url":null,"abstract":"Pansharpening is a technique used for fusion of low spatial resolution multispectral images with high spatial resolution panchromatic image. The objective of pansharpening is to enhance the spatial resolution of multispectral image while preserving its spectral information. The commonly used pansharpening methods like IHS, PCA, Gram Schmidt and Wavelet based method compromise either on spatial or spectral resolution. This paper presents a modified multiresolution analysis based pansharpening technique that is based on saliency detection of an image. This method fuses the spatial and spectral information of the images independently; therefore the fused image is obtained with high spatial as well as spectral information. The technique has been implemented on different datasets of multispectral and panchromatic images using different sets of fusion rules. The results reveal that the modified saliency detection based pansharpening technique performs better than the existing pansharpening technique and other commonly used pansharpening techniques.","PeriodicalId":294210,"journal":{"name":"2016 Ninth International Conference on Contemporary Computing (IC3)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115500307","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
Face recognition using Symlet, PCA and cosine angle distance measure 人脸识别使用Symlet, PCA和余弦角距离测量
2016 Ninth International Conference on Contemporary Computing (IC3) Pub Date : 2016-08-01 DOI: 10.1109/IC3.2016.7880231
Jyotsna, N. Rajpal, V. P. Vishwakarma
{"title":"Face recognition using Symlet, PCA and cosine angle distance measure","authors":"Jyotsna, N. Rajpal, V. P. Vishwakarma","doi":"10.1109/IC3.2016.7880231","DOIUrl":"https://doi.org/10.1109/IC3.2016.7880231","url":null,"abstract":"In this paper an approach for face recognition is proposed using Symlet, PCA and Cosine angle distance measure. The recognition rate and computational cost of proposed approach is examined against different wavelet families and Euclidean distance measure. Feature extraction is performed using Discrete wavelet transform and Principal component analysis (DWT-PCA). In order to explore best features, experiments are carried out for DWT subband selection and for DWT wavelet selection on Symlet family and on four other different wavelet families (Daubechies, Coiflets, Discrete Meyer and Biorthogonal wavelet family). This also includes their members that vary in terms of orthogonality, symmetry, support size, vanishing moments and filter order. After generating feature vectors, classification is done by Cosine angle distance measure based nearest neighbor classifier (NNC) and its results are compared with Euclidean distance measure. As test dataset, AT&T database of 400 images of 40 people is used to establish the performance by proposed approach. Experimental results on Symlet-6 with Cosine angle distance measure based nearest neighbor classifier shows highest percentage recognition rate of 98.33 for randomly generated 120 image training set.","PeriodicalId":294210,"journal":{"name":"2016 Ninth International Conference on Contemporary Computing (IC3)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129320014","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
Automatic imaging method for optic disc segmentation using morphological techniques and active contour fitting 基于形态学和主动轮廓拟合的视盘分割自动成像方法
2016 Ninth International Conference on Contemporary Computing (IC3) Pub Date : 2016-08-01 DOI: 10.1109/IC3.2016.7880227
Ashi Agarwal, Ashish Issac, Anushikha Singh, M. Dutta
{"title":"Automatic imaging method for optic disc segmentation using morphological techniques and active contour fitting","authors":"Ashi Agarwal, Ashish Issac, Anushikha Singh, M. Dutta","doi":"10.1109/IC3.2016.7880227","DOIUrl":"https://doi.org/10.1109/IC3.2016.7880227","url":null,"abstract":"Optic disc segmentation is a crucial step in diagnosis of various ocular diseases like Glaucoma and Diabetic Retinopathy. This work proposes a technique for automatic detection of optic disc from the fundus images using edge based and active contour fitting method. The proposed work has used image processing techniques such as smoothing filters for removal of blood vessels, morphological operations to correctly segment the optic disc and reject the false positives, active contour snake based model for smoothing of optic disc boundary. The results of optic disc segmentation obtained from the proposed work are compared with the ground truth marked by the ophthalmologists. The results are convincing and segmentation results show that the method has good accuracy. An average overlapping score of more than 90% is obtained for the fundus images under test.","PeriodicalId":294210,"journal":{"name":"2016 Ninth International Conference on Contemporary Computing (IC3)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126126192","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}
引用次数: 11
Range clustering: An algorithm for empirical evaluation of classical clustering algorithms 范围聚类:一种对经典聚类算法进行经验评价的算法
2016 Ninth International Conference on Contemporary Computing (IC3) Pub Date : 2016-08-01 DOI: 10.1109/IC3.2016.7880242
N. Arora, Sandeep Jain, S. Verma
{"title":"Range clustering: An algorithm for empirical evaluation of classical clustering algorithms","authors":"N. Arora, Sandeep Jain, S. Verma","doi":"10.1109/IC3.2016.7880242","DOIUrl":"https://doi.org/10.1109/IC3.2016.7880242","url":null,"abstract":"Cluster analysis is a principal method in analytics domain of data mining. The algorithm used for clustering directly influences the results obtained from applying the clustering algorithm (clusters). Data clustering is done in order to identify the patterns and trends not identifiable from just looking at the data. Clustering may be supervised (if the machine training data set is available) or unsupervised (if the machine training data set is not available). Unsupervised clustering is usually done using k-Means Algorithm (using any distance, the most common being Euclidean and Manhattan Distance). The drawback of k-means algorithm for a large set are the rigorous calculations that need to be done to cluster a data set into multiple data subsets for every single iteration, thereby limiting its efficiency and use for large data sets. We propose a range based single pass clustering algorithm that clusters data on the basis of the range which it falls in, where the ranges are calculated using simple arithmetic mean between two values. The proposed algorithm is compared against the standard k-means algorithm (using Euclidean Distance and Manhattan Distance).","PeriodicalId":294210,"journal":{"name":"2016 Ninth International Conference on Contemporary Computing (IC3)","volume":"136 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122278825","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
Sentiment mining: An approach for Bengali and Tamil tweets 情感挖掘:孟加拉语和泰米尔语推文的一种方法
2016 Ninth International Conference on Contemporary Computing (IC3) Pub Date : 2016-08-01 DOI: 10.1109/IC3.2016.7880246
SudhaShanker Prasad, J. Kumar, D. Prabhakar, S. Tripathi
{"title":"Sentiment mining: An approach for Bengali and Tamil tweets","authors":"SudhaShanker Prasad, J. Kumar, D. Prabhakar, S. Tripathi","doi":"10.1109/IC3.2016.7880246","DOIUrl":"https://doi.org/10.1109/IC3.2016.7880246","url":null,"abstract":"This paper presents a proposed work for extracting the sentiments from tweets in Indian Language. We proposed a system that deal with the goal to extract the sentiments from Bengali & Tamil tweets. Our aim is to classify a given Bengali or Tamil tweets into three sentiment classes namely positive, negative or neutral. In recent time, Twitter gain much attention to NLP researchers as it is most widely used platform that allows the user to share there opinion in form of tweets. The proposed methodology used unigram and bi-gram models along with different supervised machine learning techniques. We also consider the use of features generated from lexical resources such as Wordnets and Emoticons Tagger.","PeriodicalId":294210,"journal":{"name":"2016 Ninth International Conference on Contemporary Computing (IC3)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130286028","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
Hybridization of gravitational search algorithm and biogeography based optimization and its application on grid scheduling problem 重力搜索算法与生物地理优化的融合及其在电网调度问题中的应用
2016 Ninth International Conference on Contemporary Computing (IC3) Pub Date : 2016-08-01 DOI: 10.1109/IC3.2016.7880211
Lavika Goel, Sunita Singhal, S. Mishra, Satyajit Mohanty
{"title":"Hybridization of gravitational search algorithm and biogeography based optimization and its application on grid scheduling problem","authors":"Lavika Goel, Sunita Singhal, S. Mishra, Satyajit Mohanty","doi":"10.1109/IC3.2016.7880211","DOIUrl":"https://doi.org/10.1109/IC3.2016.7880211","url":null,"abstract":"The Gravitational Search Algorithm (GSA) is a nature inspired optimization algorithm which is based on Newton's law of gravity and law of motion. Biogeography Based Optimization (BBO) is also another nature inspired optimization algorithm based on the concept of biogeography (migration and mutation among population). Both of these optimization technique are population based and individually have been applied to a large number of areas. In this paper, we are providing a hybrid GSABBO algorithm that will use the best properties of both the algorithm to enhance the exploration and exploitation properties and reach at the global optimal solution. Grid Computing refers to the sharing of resources across multiple domains to achieve a common goal. Sharing of the resources within an organization helps to enhance its overall performance computationally and economically. The advantages derived from Grid Computing are largely dependent on the scheduling algorithm we use to schedule various jobs across various resources available. This paper introduces a new approach based on the hybridization of BBO and GSA to generate optimal schedules to complete all the given tasks with minimum make span period.","PeriodicalId":294210,"journal":{"name":"2016 Ninth International Conference on Contemporary Computing (IC3)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130124138","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
An automated imaging algorithm for macula detection in fundus images 眼底图像中黄斑检测的自动成像算法
2016 Ninth International Conference on Contemporary Computing (IC3) Pub Date : 2016-08-01 DOI: 10.1109/IC3.2016.7880226
Anushikha Singh, Namita Sengar, Ashish Issac, M. Dutta
{"title":"An automated imaging algorithm for macula detection in fundus images","authors":"Anushikha Singh, Namita Sengar, Ashish Issac, M. Dutta","doi":"10.1109/IC3.2016.7880226","DOIUrl":"https://doi.org/10.1109/IC3.2016.7880226","url":null,"abstract":"The Macula is an important part of the retina of human eye which is responsible for sharp central vision. Accurate and automatic detection of macula from fundus images is an essential step to develop automated screening tool for ocular pathologies. The proposed work presents an imaging method for detection of macula in fundus images automatically. The proposed method includes a strategic windowing based approach for accurate detection of macula. Instead of searching macula from whole fundus image, a search region is considered with the help of optic disc and then macula is detected from that search region using double windowing based method. Normal and affected fundus images from a local eye hospital were used to test the performance of proposed method and achieved encouraging results. The proposed method of macula detection is accurate, computationally cheap and hence can be helpful in real time automated screening of various eye diseases.","PeriodicalId":294210,"journal":{"name":"2016 Ninth International Conference on Contemporary Computing (IC3)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128337163","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
Frame structures for hybrid spectrum accessing strategy in cognitive radio communication system 认知无线电通信系统中混合频谱接入策略的框架结构
2016 Ninth International Conference on Contemporary Computing (IC3) Pub Date : 2016-08-01 DOI: 10.1109/IC3.2016.7880206
P. Thakur, Alok Kumar, S. Pandit, G. Singh, S. N. Satashia
{"title":"Frame structures for hybrid spectrum accessing strategy in cognitive radio communication system","authors":"P. Thakur, Alok Kumar, S. Pandit, G. Singh, S. N. Satashia","doi":"10.1109/IC3.2016.7880206","DOIUrl":"https://doi.org/10.1109/IC3.2016.7880206","url":null,"abstract":"In this paper, we have exploited the novel hybrid-cum-improved spectrum access strategy to significant improvement in the throughput and data-loss rate. This proposed strategy is comprise of hybrid spectrum access and improved frame structure strategies for the cognitive radio communication system. In addition to this, the mathematical expressions of throughput for these approaches are also presented. Moreover, the proposed approaches are validated numerically as well as with reported literature.","PeriodicalId":294210,"journal":{"name":"2016 Ninth International Conference on Contemporary Computing (IC3)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122030151","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
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学术官方微信