首页 > 最新文献

2014 IEEE International Conference on Computational Intelligence and Computing Research最新文献

英文 中文
Optical persona realization of tantrum text sensing, excavation and recognition 光学人物角色实现发脾气文本感知、挖掘和识别
K. Pradeepa, M. Sivitha
Text spotting in tantrum personas is an consequential obligatory for galore content-based persona psychoanalysis chores. In this nominate arrangement an surgical and husky technique for sleuthing textual matter in tantrum personas. A libertine and efficacious lopping algorithm is premeditated to educe poly-headed text from an persona. Opposed to some extra feelers which simulate that text is horizontally-oriented to handgrip text of impulsive predilection. The stimulation persona is first percolated with machine-accessible ingredient feeler. Connected component clumping is then used to discover prospect text realms based on the supreme deviation. The skeleton of apiece connected component avails to assort the divergent text strings from apiece other. Then anneal prospect parole realms and influence whether apiece realm moderates text or not. The exfoliation, skewed, and semblance of apiece prospect can be reckoned from CCs, to germinate a text/non text classifier for annealed personas. In this proficiencies not entirely reveal text, it also educes from the persona and recognizes the text in conditions of storing the recognized paroles into a disunite file cabinet by integrating galore key betterments over tralatitious surviving proficiencies to nominate a novel CC clumping based tantrum text sleuthing technique, which finally extends to substantial performance betterment over the other emulous proficiencies.
在发脾气的人物角色中发现文本是大量基于内容的人物角色精神分析工作的必要条件。在这个提名安排外科和哈士奇技术侦查文本问题在发脾气的人物角色。提出了一种灵活有效的裁剪算法,用于从人物角色中提取多头文本。相反,一些额外的触角,模拟文本是水平方向的,以手握文本的冲动偏好。首先用机器可触及的成分检测器渗透刺激角色。然后利用连通分量聚类方法根据最大偏差发现潜在文本域。每个连接组件的骨架用于将不同的文本字符串彼此进行排序。然后退火前景假释领域和影响是否每个领域缓和文本。每个前景的剥离、倾斜和外表可以从cc中计算出来,从而为退火的人物角色萌发文本/非文本分类器。在这种不完全显示文本的熟练度中,它也从人物角色中导出并识别文本,并将识别的文本存储到一个不统一的文件柜中,通过整合大量的关键改进,提出了一种新的基于CC聚块的发脾气文本探测技术,该技术最终扩展到比其他熟练度有实质性的性能改进。
{"title":"Optical persona realization of tantrum text sensing, excavation and recognition","authors":"K. Pradeepa, M. Sivitha","doi":"10.1109/ICCIC.2014.7238303","DOIUrl":"https://doi.org/10.1109/ICCIC.2014.7238303","url":null,"abstract":"Text spotting in tantrum personas is an consequential obligatory for galore content-based persona psychoanalysis chores. In this nominate arrangement an surgical and husky technique for sleuthing textual matter in tantrum personas. A libertine and efficacious lopping algorithm is premeditated to educe poly-headed text from an persona. Opposed to some extra feelers which simulate that text is horizontally-oriented to handgrip text of impulsive predilection. The stimulation persona is first percolated with machine-accessible ingredient feeler. Connected component clumping is then used to discover prospect text realms based on the supreme deviation. The skeleton of apiece connected component avails to assort the divergent text strings from apiece other. Then anneal prospect parole realms and influence whether apiece realm moderates text or not. The exfoliation, skewed, and semblance of apiece prospect can be reckoned from CCs, to germinate a text/non text classifier for annealed personas. In this proficiencies not entirely reveal text, it also educes from the persona and recognizes the text in conditions of storing the recognized paroles into a disunite file cabinet by integrating galore key betterments over tralatitious surviving proficiencies to nominate a novel CC clumping based tantrum text sleuthing technique, which finally extends to substantial performance betterment over the other emulous proficiencies.","PeriodicalId":187874,"journal":{"name":"2014 IEEE International Conference on Computational Intelligence and Computing Research","volume":"14 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128825358","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
CMDSSI: A decision support system for cloud migration for SMEs in India CMDSSI:印度中小企业云迁移的决策支持系统
B. Wilson, Babak Khazaei, Laurence Hirsch, S. Kannan
Cloud computing is currently the hot topic in Information Technology (IT) as it offers a nontraditional model for managing and implementing IT in enterprises. Due to its benefits such as low investment for hardware and dynamic scaling, migrating data and application to cloud environment is gaining popularity in recent years in India. The main aim of this paper is to investigate the aspects of cloud migration with particular importance to SMEs in India and present a literature review of the existing frameworks and models available for cloud adoption. We have identified a number of issues that SMEs in India face while migrating to a cloud infrastructure and have presented our findings as an initial step towards a Decision Support System for cloud migration in India, referred to as Cloud Migration Decision Support System for India (CMDSSI).
云计算为企业管理和实现IT提供了一种非传统的模型,是当前信息技术(IT)领域的热门话题。由于其硬件投资低和动态扩展等优点,近年来将数据和应用程序迁移到云环境在印度越来越受欢迎。本文的主要目的是调查云迁移对印度中小企业特别重要的方面,并对现有的云采用框架和模型进行文献综述。我们已经确定了印度中小企业在迁移到云基础设施时面临的一些问题,并将我们的研究结果作为印度云迁移决策支持系统的第一步,称为印度云迁移决策支持系统(CMDSSI)。
{"title":"CMDSSI: A decision support system for cloud migration for SMEs in India","authors":"B. Wilson, Babak Khazaei, Laurence Hirsch, S. Kannan","doi":"10.1109/ICCIC.2014.7238490","DOIUrl":"https://doi.org/10.1109/ICCIC.2014.7238490","url":null,"abstract":"Cloud computing is currently the hot topic in Information Technology (IT) as it offers a nontraditional model for managing and implementing IT in enterprises. Due to its benefits such as low investment for hardware and dynamic scaling, migrating data and application to cloud environment is gaining popularity in recent years in India. The main aim of this paper is to investigate the aspects of cloud migration with particular importance to SMEs in India and present a literature review of the existing frameworks and models available for cloud adoption. We have identified a number of issues that SMEs in India face while migrating to a cloud infrastructure and have presented our findings as an initial step towards a Decision Support System for cloud migration in India, referred to as Cloud Migration Decision Support System for India (CMDSSI).","PeriodicalId":187874,"journal":{"name":"2014 IEEE International Conference on Computational Intelligence and Computing Research","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128408969","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
CIEVS: A cloud-based framework to modernize the Indian election voting system CIEVS:印度选举投票系统现代化的云端框架
G. Matharu, Anju Mishra, Pallavi Chhikara
In India, Information and Communication technologies (ICT) are being increasingly deployed in almost each sector of economy including media, health, agriculture, transportation, and education. Upon an analysis of the existing Indian Election Voting System, it is felt that the ICT remains to be exploited to its fullest potential. Although, the Election Commission of India (ECI) has recently taken up several ICT-enabled initiatives, but the application of advanced ICTs still needs to be promoted in Indian Election Voting System. In this paper, we propose an I-Voting System to provide for an additional channel of voting to the Indian electorate. This paper evaluates the utility of cloud computing technology in I-Voting and specifies ancillary benefits arising out of its deployment in I-Voting. Further, this paper proposes a cloud deployment model “Cloud-based Integrated Election Voting System (CIEVS)” that leverages advanced Information and Communication technologies including cloud computing, web services and mobile phone services to integrate the existing Electronic Voting Machine (EVM) System with the I-Voting System to provide a solution to the problem of prevailing low voting percentages in the Indian elections. Additionally, the paper elaborates on the components of the proposed model besides discussing the advantages offered by the proposed model.
在印度,信息和通信技术越来越多地应用于几乎每个经济部门,包括媒体、卫生、农业、交通和教育。在对印度现有选举投票制度进行分析后,认为信通技术仍有待充分发挥其潜力。虽然印度选举委员会(ECI)最近已采取数项资讯及通讯科技倡议,但印度选举投票系统仍需推动先进资讯及通讯科技的应用。在本文中,我们提出了一个I-Voting System,为印度选民提供了一个额外的投票渠道。本文评估了云计算技术在I-Voting中的效用,并详细说明了在I-Voting中部署云计算技术所带来的附带效益。此外,本文提出了一种云部署模型“基于云的综合选举投票系统(CIEVS)”,该模型利用先进的信息和通信技术,包括云计算、网络服务和移动电话服务,将现有的电子投票机(EVM)系统与I-Voting System集成,以解决印度选举中普遍存在的低投票率问题。此外,本文还详细阐述了所提出模型的组成部分,并讨论了所提出模型的优点。
{"title":"CIEVS: A cloud-based framework to modernize the Indian election voting system","authors":"G. Matharu, Anju Mishra, Pallavi Chhikara","doi":"10.1109/ICCIC.2014.7238454","DOIUrl":"https://doi.org/10.1109/ICCIC.2014.7238454","url":null,"abstract":"In India, Information and Communication technologies (ICT) are being increasingly deployed in almost each sector of economy including media, health, agriculture, transportation, and education. Upon an analysis of the existing Indian Election Voting System, it is felt that the ICT remains to be exploited to its fullest potential. Although, the Election Commission of India (ECI) has recently taken up several ICT-enabled initiatives, but the application of advanced ICTs still needs to be promoted in Indian Election Voting System. In this paper, we propose an I-Voting System to provide for an additional channel of voting to the Indian electorate. This paper evaluates the utility of cloud computing technology in I-Voting and specifies ancillary benefits arising out of its deployment in I-Voting. Further, this paper proposes a cloud deployment model “Cloud-based Integrated Election Voting System (CIEVS)” that leverages advanced Information and Communication technologies including cloud computing, web services and mobile phone services to integrate the existing Electronic Voting Machine (EVM) System with the I-Voting System to provide a solution to the problem of prevailing low voting percentages in the Indian elections. Additionally, the paper elaborates on the components of the proposed model besides discussing the advantages offered by the proposed model.","PeriodicalId":187874,"journal":{"name":"2014 IEEE International Conference on Computational Intelligence and Computing Research","volume":"160 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117346620","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
Effect of normalization techniques in VIKOR method for network selection in heterogeneous networks VIKOR方法中归一化技术对异构网络中网络选择的影响
Silki Baghla, S. Bansal
Beyond 3G or 4G or Fourth generation wireless networks is an era of heterogeneous networks where a large number of wireless networks having different quality of service and features are present simultaneously. To provide ubiquitous access to end users in such environment, vertical handoff mechanism is deployed where an active call or session is transferred from one access point to another depending on the services required by the end user. This optimal network selection among large number of networks available requires consideration of multiple criteria like cost, delay, jitter, available bandwidth etc. To incorporate maximum number of quality of service (Qos) parameters MADM methods provide a promising solution. But MADM methods suffer from two major problems; number of handovers and ranking abnormality. In this paper VIKOR MADM method has been analyzed with various normalization techniques to mitigate the effect of large number of handovers and ranking abnormality.
超越3G或4G或第四代无线网络是一个异构网络时代,大量具有不同服务质量和特性的无线网络同时存在。为了向这种环境中的最终用户提供无处不在的访问,部署了垂直切换机制,其中根据最终用户所需的服务将活动呼叫或会话从一个接入点转移到另一个接入点。在大量可用网络中进行最优网络选择需要考虑成本、延迟、抖动、可用带宽等多个标准。为了结合最大数量的服务质量(Qos)参数,MADM方法提供了一个有前途的解决方案。但是MADM方法有两个主要问题;移交次数和排序异常。本文分析了VIKOR MADM方法与各种归一化技术,以减轻大量切换和排序异常的影响。
{"title":"Effect of normalization techniques in VIKOR method for network selection in heterogeneous networks","authors":"Silki Baghla, S. Bansal","doi":"10.1109/ICCIC.2014.7238357","DOIUrl":"https://doi.org/10.1109/ICCIC.2014.7238357","url":null,"abstract":"Beyond 3G or 4G or Fourth generation wireless networks is an era of heterogeneous networks where a large number of wireless networks having different quality of service and features are present simultaneously. To provide ubiquitous access to end users in such environment, vertical handoff mechanism is deployed where an active call or session is transferred from one access point to another depending on the services required by the end user. This optimal network selection among large number of networks available requires consideration of multiple criteria like cost, delay, jitter, available bandwidth etc. To incorporate maximum number of quality of service (Qos) parameters MADM methods provide a promising solution. But MADM methods suffer from two major problems; number of handovers and ranking abnormality. In this paper VIKOR MADM method has been analyzed with various normalization techniques to mitigate the effect of large number of handovers and ranking abnormality.","PeriodicalId":187874,"journal":{"name":"2014 IEEE International Conference on Computational Intelligence and Computing Research","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116081771","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}
引用次数: 21
Dynamic group key authentication mechanism for data sharing in network 网络中数据共享的动态组密钥认证机制
P. Suganya, M. Sivitha
In the network data sharing is an important functionality. In many organizations data owners store their data into the storage server which can certainly share data with other followers (users). Earlier approaches either unreasonably expose the uniqueness of a data owner to the untrusted server or any unexclusive vouchers, or innovate substantial expenses on confirmation metadata to preserve concealment. In the proposed system, group manager is introduced and takes charge of user registration, and enlightening the real uniqueness of a dispute data proprietor. Group manager will generate a key and provide to the user, who want to access the data from the storage server. Consequently proposed method reduces the computation overhead and provides high performance due to revoke verification procedure.
在网络中,数据共享是一项重要的功能。在许多组织中,数据所有者将其数据存储到存储服务器中,该服务器当然可以与其他追随者(用户)共享数据。早期的方法要么不合理地将数据所有者的唯一性暴露给不受信任的服务器或任何非排他性凭证,要么在确认元数据上增加大量费用以保持隐蔽性。在该系统中,引入了组管理员,负责用户注册,并启发争议数据所有者的真正唯一性。组管理器将生成一个密钥并提供给希望从存储服务器访问数据的用户。因此,该方法减少了计算量,并且由于引入了撤销验证过程而具有较高的性能。
{"title":"Dynamic group key authentication mechanism for data sharing in network","authors":"P. Suganya, M. Sivitha","doi":"10.1109/ICCIC.2014.7238325","DOIUrl":"https://doi.org/10.1109/ICCIC.2014.7238325","url":null,"abstract":"In the network data sharing is an important functionality. In many organizations data owners store their data into the storage server which can certainly share data with other followers (users). Earlier approaches either unreasonably expose the uniqueness of a data owner to the untrusted server or any unexclusive vouchers, or innovate substantial expenses on confirmation metadata to preserve concealment. In the proposed system, group manager is introduced and takes charge of user registration, and enlightening the real uniqueness of a dispute data proprietor. Group manager will generate a key and provide to the user, who want to access the data from the storage server. Consequently proposed method reduces the computation overhead and provides high performance due to revoke verification procedure.","PeriodicalId":187874,"journal":{"name":"2014 IEEE International Conference on Computational Intelligence and Computing Research","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127172627","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
Energy efficient multihop selection with PEGASIS routing protocol for wireless sensor networks 节能多跳选择与PEGASIS路由协议的无线传感器网络
A. Karthikeyan, V. Jagadeep, A. Rakesh
Recent achievements in wireless sensor networks have enabled the use of tiny and inexpensive sensors with the ability of sensing large information and propagating over large distances. But the most important concern with wireless sensor network is, the node sensing range is very small, Low storage and limited energy resources. So to overcome this type of problem efficient energy planning should be made. Clustering is one of the technologies that can utilize the node energy effectively. So that the network life time can be extended. The proposed method which uses the advantage of SNR for multi hopping and power efficient gathering in sensor information systems (PEGASIS) routing protocol in order to increase the life time of the network. The analysis shows that the proposed method has extended the network life time and were compared with the previously introduced methods based on different parameters.
最近在无线传感器网络方面取得的成就使使用微小和廉价的传感器能够感知大量信息并在远距离上传播。但无线传感器网络最主要的问题是节点感知范围小,存储空间低,能源有限。因此,为了克服这类问题,必须制定有效的能源规划。聚类是一种有效利用节点能量的技术。从而延长网络的使用寿命。该方法利用传感器信息系统(PEGASIS)路由协议中信噪比的优势进行多跳和功率高效采集,以延长网络的生存时间。分析表明,该方法延长了网络的使用寿命,并与已有的基于不同参数的方法进行了比较。
{"title":"Energy efficient multihop selection with PEGASIS routing protocol for wireless sensor networks","authors":"A. Karthikeyan, V. Jagadeep, A. Rakesh","doi":"10.1109/ICCIC.2014.7238360","DOIUrl":"https://doi.org/10.1109/ICCIC.2014.7238360","url":null,"abstract":"Recent achievements in wireless sensor networks have enabled the use of tiny and inexpensive sensors with the ability of sensing large information and propagating over large distances. But the most important concern with wireless sensor network is, the node sensing range is very small, Low storage and limited energy resources. So to overcome this type of problem efficient energy planning should be made. Clustering is one of the technologies that can utilize the node energy effectively. So that the network life time can be extended. The proposed method which uses the advantage of SNR for multi hopping and power efficient gathering in sensor information systems (PEGASIS) routing protocol in order to increase the life time of the network. The analysis shows that the proposed method has extended the network life time and were compared with the previously introduced methods based on different parameters.","PeriodicalId":187874,"journal":{"name":"2014 IEEE International Conference on Computational Intelligence and Computing Research","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126802506","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
Lattice based secure data transmission in MANETs 基于点阵的manet安全数据传输
Fernaz Jasdanwala, N. Dutta, D. K. Bhattacharyya
Wireless communication adapters in mobile nodes form an ad hoc network without the need for any fundamental network infrastructure. Nodes in MANETs use radio signals with a finite range to communicate making it possible for any intermediate node to intercept the communication. Also the frequently changing topology, with high susceptibility to physical compromise along with the node's limitations in terms of energy resource, storage device and CPU form a tremendous challenge in providing security to MANETs. Unlike wired networks, there is no central infrastructure, which paves way for new challenges as services provided by central entities is now to be ensured by the mobile nodes in the network itself. As a result, there is no definitive form of defense and a comprehensive security solution should encompass avoidance, detection and reaction along with sought-after network performances. This paper focuses on the prevention/proactive approach of securing MANETs using NTRU (Nth degree truncated polynomial ring), to secure end-to-end communication through data encryption during data transmission. NTRU is Lattice-based cryptography, which is known to be resistant to quantum attacks. We assume a clustered MANET environment i.e. the mobile nodes have an efficient cluster-based routing algorithm deployed which gives us the list of clusters available in the environment along with its cluster heads and competent routing between them. The proposed technique provides data encryption using NTRU between cluster heads.
移动节点中的无线通信适配器无需任何基础网络基础设施即可形成自组织网络。manet中的节点使用有限范围的无线电信号进行通信,使得任何中间节点都可以拦截通信。此外,频繁变化的拓扑结构易受物理危害,加上节点在能源、存储设备和CPU方面的限制,为manet的安全提供了巨大的挑战。与有线网络不同,没有中央基础设施,这为新的挑战铺平了道路,因为中央实体提供的服务现在由网络中的移动节点本身来保证。因此,没有确定的防御形式,一个全面的安全解决方案应该包括避免、检测和反应,以及受欢迎的网络性能。本文重点研究了利用NTRU (n度截断多项式环)保护manet的预防/主动方法,在数据传输过程中通过数据加密来保护端到端通信。NTRU是一种基于格子的加密技术,它可以抵抗量子攻击。我们假设一个集群的MANET环境,即移动节点部署了一个高效的基于集群的路由算法,该算法为我们提供了环境中可用的集群列表,以及集群头和它们之间的有效路由。该技术利用簇头之间的NTRU提供数据加密。
{"title":"Lattice based secure data transmission in MANETs","authors":"Fernaz Jasdanwala, N. Dutta, D. K. Bhattacharyya","doi":"10.1109/ICCIC.2014.7238393","DOIUrl":"https://doi.org/10.1109/ICCIC.2014.7238393","url":null,"abstract":"Wireless communication adapters in mobile nodes form an ad hoc network without the need for any fundamental network infrastructure. Nodes in MANETs use radio signals with a finite range to communicate making it possible for any intermediate node to intercept the communication. Also the frequently changing topology, with high susceptibility to physical compromise along with the node's limitations in terms of energy resource, storage device and CPU form a tremendous challenge in providing security to MANETs. Unlike wired networks, there is no central infrastructure, which paves way for new challenges as services provided by central entities is now to be ensured by the mobile nodes in the network itself. As a result, there is no definitive form of defense and a comprehensive security solution should encompass avoidance, detection and reaction along with sought-after network performances. This paper focuses on the prevention/proactive approach of securing MANETs using NTRU (Nth degree truncated polynomial ring), to secure end-to-end communication through data encryption during data transmission. NTRU is Lattice-based cryptography, which is known to be resistant to quantum attacks. We assume a clustered MANET environment i.e. the mobile nodes have an efficient cluster-based routing algorithm deployed which gives us the list of clusters available in the environment along with its cluster heads and competent routing between them. The proposed technique provides data encryption using NTRU between cluster heads.","PeriodicalId":187874,"journal":{"name":"2014 IEEE International Conference on Computational Intelligence and Computing Research","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125825739","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
Isolating critical data points from boundary region with feature selection 利用特征选择从边界区域分离关键数据点
A. Anitha, E. Kannan
Immense databases may contain critical instances or chunks-a small heap of records or instances which has domain specific information. These chunks of information are useful in future decision making for improving classification accuracy for labeling of critical, unlabeled instances by reducing false positives and false negatives. Classification process may be assessed based on efficiency and effectiveness. Efficiency is concerned with the time to process the records by reducing attributes in the data set and effectiveness is the improvement in classification accuracy using crucial information. This work focuses on reducing the attributes in the large databases, put forwards an innovative procedure for computing criticality which isolates critical instances from the boundary region and are validated using real-world data set. This work also uses different attribute reduction technique used for fetching the critical instances to reduce the computational time. Results of the experiments show that only subsets of instances are isolated as critical nuggets. It is found that use of attribute reduction technique decreases the computational time. The data set with reduced attributes does not affect the classification accuracy and produces the same result as with the original data set. It also reveals that these critical records helps in improving classification accuracy substantially along with reduced computational time and are validated using real-life data sets.
巨大的数据库可能包含关键实例或块——具有特定领域信息的一小堆记录或实例。这些信息块在未来的决策制定中非常有用,可以通过减少误报和误报来提高标记关键、未标记实例的分类准确性。分类过程可根据效率和效果进行评估。效率是指通过减少数据集中的属性来处理记录的时间,而有效性是指使用关键信息来提高分类精度。本文着重于减少大型数据库中的属性,提出了一种创新的临界性计算方法,该方法将临界实例从边界区域中分离出来,并使用实际数据集进行验证。这项工作还使用了不同的属性约简技术来获取关键实例,以减少计算时间。实验结果表明,只有实例子集被隔离为临界块。结果表明,使用属性约简技术可以减少计算时间。属性约简后的数据集不影响分类精度,并产生与原始数据集相同的结果。它还表明,这些关键记录有助于大大提高分类准确性,同时减少计算时间,并使用实际数据集进行验证。
{"title":"Isolating critical data points from boundary region with feature selection","authors":"A. Anitha, E. Kannan","doi":"10.1109/ICCIC.2014.7238403","DOIUrl":"https://doi.org/10.1109/ICCIC.2014.7238403","url":null,"abstract":"Immense databases may contain critical instances or chunks-a small heap of records or instances which has domain specific information. These chunks of information are useful in future decision making for improving classification accuracy for labeling of critical, unlabeled instances by reducing false positives and false negatives. Classification process may be assessed based on efficiency and effectiveness. Efficiency is concerned with the time to process the records by reducing attributes in the data set and effectiveness is the improvement in classification accuracy using crucial information. This work focuses on reducing the attributes in the large databases, put forwards an innovative procedure for computing criticality which isolates critical instances from the boundary region and are validated using real-world data set. This work also uses different attribute reduction technique used for fetching the critical instances to reduce the computational time. Results of the experiments show that only subsets of instances are isolated as critical nuggets. It is found that use of attribute reduction technique decreases the computational time. The data set with reduced attributes does not affect the classification accuracy and produces the same result as with the original data set. It also reveals that these critical records helps in improving classification accuracy substantially along with reduced computational time and are validated using real-life data sets.","PeriodicalId":187874,"journal":{"name":"2014 IEEE International Conference on Computational Intelligence and Computing Research","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125825781","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 impulse noise removal by modified alpha trimmed median mean filter for FVIN 基于改进alpha裁剪中值均值滤波器的FVIN彩色脉冲噪声去除
Pranay Yadav, Parool Singh
In this reserch article presents a novel method for the enhancement of color images, when images are corrupted by color impulse noise. According to planned algorithm the color noisy pixels are substituted by novel trimmed mean median value color images. Firstly, the color image (RGB) is sub-split up into three sections, i.e. Red (R), Green (G) and Blue (B) color pixel matrices, then all three matrices are checked for noisy pixels. In our proposed work divided in two parts. In first part is detection of noisy pixels and the second part is removal of noisy with details preservation like edges. When pixels values, are present in between 0's and 255's, it implies that they pixel are noise free pixels. Apply this scenario in whole color image pixels for the detection of color impulse noise. Second stage is the removal of noise. In this stage whole image is divided into a small 3×3 particular window and apply Unsymmetric condition in a small 3×3 window with the combination of mean median filter. Different color images are tested via proposed method. The experimental result shows better Peak Signal to Noise Ratio (PSNR) value, Mean Square Error (MSE), Root Mean Square Error (RMSE) and with better visual and human sensing. This method yields a better output for color impulse noise as compare to the other filters.
本文提出了一种新的彩色图像增强方法,用于图像被彩色脉冲噪声破坏时的增强。根据规划的算法,将彩色噪声像素替换为新的裁剪过的平均中值彩色图像。首先,将彩色图像(RGB)细分为三个部分,即红色(R),绿色(G)和蓝色(B)颜色像素矩阵,然后检查所有三个矩阵中的噪声像素。在我们的建议工作分为两个部分。第一部分是噪声像素的检测,第二部分是在保留边缘等细节的情况下去除噪声。当像素值出现在0和255之间时,这意味着它们是无噪声像素。将此场景应用于全彩色图像像素,用于检测彩色脉冲噪声。第二阶段是去除噪声。该阶段将整幅图像分割成一个小的3×3特定窗口,结合均值中值滤波在小的3×3窗口中应用不对称条件。采用该方法对不同颜色图像进行了测试。实验结果表明,该方法具有较好的峰值信噪比(PSNR)值、均方误差(MSE)和均方根误差(RMSE),具有较好的视觉和人体感知效果。与其他滤波器相比,这种方法对颜色脉冲噪声产生更好的输出。
{"title":"Color impulse noise removal by modified alpha trimmed median mean filter for FVIN","authors":"Pranay Yadav, Parool Singh","doi":"10.1109/ICCIC.2014.7238369","DOIUrl":"https://doi.org/10.1109/ICCIC.2014.7238369","url":null,"abstract":"In this reserch article presents a novel method for the enhancement of color images, when images are corrupted by color impulse noise. According to planned algorithm the color noisy pixels are substituted by novel trimmed mean median value color images. Firstly, the color image (RGB) is sub-split up into three sections, i.e. Red (R), Green (G) and Blue (B) color pixel matrices, then all three matrices are checked for noisy pixels. In our proposed work divided in two parts. In first part is detection of noisy pixels and the second part is removal of noisy with details preservation like edges. When pixels values, are present in between 0's and 255's, it implies that they pixel are noise free pixels. Apply this scenario in whole color image pixels for the detection of color impulse noise. Second stage is the removal of noise. In this stage whole image is divided into a small 3×3 particular window and apply Unsymmetric condition in a small 3×3 window with the combination of mean median filter. Different color images are tested via proposed method. The experimental result shows better Peak Signal to Noise Ratio (PSNR) value, Mean Square Error (MSE), Root Mean Square Error (RMSE) and with better visual and human sensing. This method yields a better output for color impulse noise as compare to the other filters.","PeriodicalId":187874,"journal":{"name":"2014 IEEE International Conference on Computational Intelligence and Computing Research","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126684854","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
Eye controlled electric wheelchair 眼控电动轮椅
B. Thakur, Kushagra Kulshrestha
An assistive mechanism for implementing comfortable wheelchair locomotion for severely disabled people is presented. The main feature of the prototype is that the estimation of the direction of movement is decided solely by the patient without stressing him physically. This is successfully achieved by investigating the user's natural gaze behavior using eyeball tracking in NI LabView. The prototype consists of a camera, image processing software and a motor controller to drive the wheelchair. Besides being a reliable, convenient and extremely useful, this prototype promises a cheap solution to the latest technology access. Tracking algorithm utilized is shape adapted mean shift algorithm in NI Vision assistant. The eyeball tracking outcomes are then used to produce suitable wheelchair motion taking the user to the intended location. The prototype encompasses a critical blend of knowledge and skills and should find high acceptance within the target group of severely disabled, especially whose communications are limited only to eye movements.
提出了一种用于实现重度残疾人轮椅舒适运动的辅助机构。该原型的主要特点是,对运动方向的估计完全由患者决定,而不会对他的身体造成压力。这是通过在NI LabView中使用眼球跟踪来调查用户的自然凝视行为成功实现的。原型由摄像头、图像处理软件和驱动轮椅的电机控制器组成。除了可靠、方便和非常有用之外,这个原型还承诺为最新技术提供廉价的解决方案。NI Vision助手采用的跟踪算法是形状自适应均值移位算法。眼球追踪结果随后被用于产生合适的轮椅运动,将用户带到预定位置。该原型包含了知识和技能的重要融合,应该会在严重残疾的目标群体中得到高度认可,特别是那些交流仅限于眼球运动的人。
{"title":"Eye controlled electric wheelchair","authors":"B. Thakur, Kushagra Kulshrestha","doi":"10.1109/ICCIC.2014.7238451","DOIUrl":"https://doi.org/10.1109/ICCIC.2014.7238451","url":null,"abstract":"An assistive mechanism for implementing comfortable wheelchair locomotion for severely disabled people is presented. The main feature of the prototype is that the estimation of the direction of movement is decided solely by the patient without stressing him physically. This is successfully achieved by investigating the user's natural gaze behavior using eyeball tracking in NI LabView. The prototype consists of a camera, image processing software and a motor controller to drive the wheelchair. Besides being a reliable, convenient and extremely useful, this prototype promises a cheap solution to the latest technology access. Tracking algorithm utilized is shape adapted mean shift algorithm in NI Vision assistant. The eyeball tracking outcomes are then used to produce suitable wheelchair motion taking the user to the intended location. The prototype encompasses a critical blend of knowledge and skills and should find high acceptance within the target group of severely disabled, especially whose communications are limited only to eye movements.","PeriodicalId":187874,"journal":{"name":"2014 IEEE International Conference on Computational Intelligence and Computing Research","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121646267","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
期刊
2014 IEEE International Conference on Computational Intelligence and Computing Research
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1