2014 4th International Conference on Computer and Knowledge Engineering (ICCKE)最新文献

筛选
英文 中文
Regularization convex optimization method with l-curve estimation in image restoration 基于l曲线估计的正则化凸优化图像恢复方法
2014 4th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2014-12-22 DOI: 10.1109/ICCKE.2014.6993358
A. Rashno, F. Tabataba, S. Sadri
{"title":"Regularization convex optimization method with l-curve estimation in image restoration","authors":"A. Rashno, F. Tabataba, S. Sadri","doi":"10.1109/ICCKE.2014.6993358","DOIUrl":"https://doi.org/10.1109/ICCKE.2014.6993358","url":null,"abstract":"As a solution of avoiding ill-posed problem stem from sparse and large scale blurring matrix which has many singular values of different orders of magnitude close to the origin, in image restoration, Tikhonov regularization with l-curve parameter estimation as convex optimization problem has been proposed in this paper. Also, since the restored image is so sensitive to initial guess (start point) of optimization algorithm, a new schema for feasible set and feasible start point has been proposed. Some numerical results show the efficiency of proposed algorithm in comparison with older ones such as reduced newton method.","PeriodicalId":152540,"journal":{"name":"2014 4th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122832470","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
Hyperspectral image classification via within class similarity for limited training samples problem 基于类内相似度的有限训练样本高光谱图像分类问题
2014 4th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2014-12-22 DOI: 10.1109/ICCKE.2014.6993375
Reza Seifi Majdar, H. Ghassemian
{"title":"Hyperspectral image classification via within class similarity for limited training samples problem","authors":"Reza Seifi Majdar, H. Ghassemian","doi":"10.1109/ICCKE.2014.6993375","DOIUrl":"https://doi.org/10.1109/ICCKE.2014.6993375","url":null,"abstract":"In hyperspectral image classification, finding the best criterion for separating classes and assign a accurate label to pixels is a major challenge. In traditional classification methods, as SVM, SAM, KNN the uniform criterion is considered for separating the classes as margin, angle, distance, etc. In classification process the distance between unlabeled pixel and a class is calculated. The minimum distance between unlabeled pixel and each class is the main criterion for labeling the pixel. In this paper a simple method based on the within class similarity is proposed for hyperspectral images classification that is proper for limited training samples problem. At first, the best specification of a class is explored based on the training samples, although this specification for each class can be different. Later, unlabeled pixel is added to the training samples of either class for recalculation of each one. Now this specification is compared with the former specification. The unlabeled pixel belongs to the class with minimum difference between former and later specification. Experimental results outcomes, based on the hyperspectral images, represent the effectiveness of this method.","PeriodicalId":152540,"journal":{"name":"2014 4th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127772210","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
Network security risk mitigation using Bayesian decision networks 基于贝叶斯决策网络的网络安全风险缓解
2014 4th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2014-12-22 DOI: 10.1109/ICCKE.2014.6993444
Masoud Khosravi-Farmad, Razieh Rezaee, A. Harati, A. G. Bafghi
{"title":"Network security risk mitigation using Bayesian decision networks","authors":"Masoud Khosravi-Farmad, Razieh Rezaee, A. Harati, A. G. Bafghi","doi":"10.1109/ICCKE.2014.6993444","DOIUrl":"https://doi.org/10.1109/ICCKE.2014.6993444","url":null,"abstract":"Network security risk assessment and mitigation are two processes in the risk management framework which need to be done accurately to improve the overall security level of a network. In this paper, in order to increase the accuracy of vulnerability exploitation probability estimation in the risk assessment phase, in addition to inherent characteristics of vulnerabilities, their temporal characteristics are also considered. In the risk mitigation phase, Bayesian decision networks are used to model interconnections between vulnerabilities that enable the attacker to achieve a particular goal, the security countermeasures covering these vulnerabilities, their cost of implementation and resulted outcome. Using Bayesian decision networks, our approach yields scalability and integration of risk assessment and mitigation processes. A cost-benefit analysis is done to identify the minimum-cost hardening security measures in situations where the allocated budget for network security hardening is limited. The experimental results show that the proposed method effectively improves the security level of a test network in terms of determining the optimal security risk mitigation plans.","PeriodicalId":152540,"journal":{"name":"2014 4th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133859327","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 14
A new complete heuristic approach for ant rendezvous problem 蚁群集合问题的一种新的完全启发式方法
2014 4th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2014-12-22 DOI: 10.1109/ICCKE.2014.6993470
M. Famouri, A. Hamzeh
{"title":"A new complete heuristic approach for ant rendezvous problem","authors":"M. Famouri, A. Hamzeh","doi":"10.1109/ICCKE.2014.6993470","DOIUrl":"https://doi.org/10.1109/ICCKE.2014.6993470","url":null,"abstract":"Ant meeting problem is a distributed problem that its purpose is to find an efficient path for ants to meet each other. Actually, ant robots suffer from the low memory and their restricted computational power. They communicate with their environment by leaving some symptoms like pheromones in their surroundings. In the problem of ants meeting, the ants should reach together in order to cooperate in an intelligent algorithm. In the common type of this problem, they start to search the environment without any knowledge about their locations, directions, obstacles and any other information. They can just leave some signs on the environment which shows their tracks. These marks are the only way of communication between ants. Also, these marks show the information about the ant which has passed the track, and every ant knows whose mark is that. In this paper, a new heuristic approach is proposed for the distributed ants meeting problem based on A* algorithm which guaranties the ants meeting in a finite time. Experimental results show that the presented algorithm is more efficient than previous ones.","PeriodicalId":152540,"journal":{"name":"2014 4th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128832892","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
A low power VLSI compatible approach for retina tree biometric matching 视网膜树生物特征匹配的低功耗VLSI兼容方法
2014 4th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2014-12-22 DOI: 10.1109/ICCKE.2014.6993423
F. Amini, M. Habibi, P. Moallem
{"title":"A low power VLSI compatible approach for retina tree biometric matching","authors":"F. Amini, M. Habibi, P. Moallem","doi":"10.1109/ICCKE.2014.6993423","DOIUrl":"https://doi.org/10.1109/ICCKE.2014.6993423","url":null,"abstract":"Retinal image is one of the robust and accurate biometrics which can be used to authenticate an individual. Feature matching is a key step for any biometric system and its implementation on hardware structures is often challenging due to the required object based processing. This paper presents an approach for retina tree biometric matching which has the capability to be implemented on a low power and high speed VLSI hardware. The key idea behind the presented method is to extract the Gaussian profile of the retinal feature dataset. The proposed technique is evaluated on the public VARIA retina image database.","PeriodicalId":152540,"journal":{"name":"2014 4th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"os-16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127765318","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
Human articulated body parts bending motion classification based on Dictionary-Learning Sparse Representation 基于字典学习稀疏表示的人体关节部位弯曲运动分类
2014 4th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2014-12-22 DOI: 10.1109/ICCKE.2014.6993438
Lida Asgharian, Hoseein Ebrahimnezhad
{"title":"Human articulated body parts bending motion classification based on Dictionary-Learning Sparse Representation","authors":"Lida Asgharian, Hoseein Ebrahimnezhad","doi":"10.1109/ICCKE.2014.6993438","DOIUrl":"https://doi.org/10.1109/ICCKE.2014.6993438","url":null,"abstract":"In this paper a method is developed to estimate human articulated body parts bending motion based on Dictionary-Learning Sparse Representation (DLSR). The extracted features for training the dictionary are achieved by deformation gradient of proposed part, which is the non-translation portion of an affine transformation that determines the change between original shape and deformed shape. In order to train the dictionary for motion classification, we minimize the reconstruction error of the target shape. Then, all trained dictionaries from motion classes are combined to construct an over-complete dictionary for sparse representation and classification. We evaluate our approach to different topological structure of human arm and leg shape. The experimental results show the effectiveness of our approach for treating the bending motion classification in different images.","PeriodicalId":152540,"journal":{"name":"2014 4th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127493055","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 new scalable parallel spatial filter implementation based on data flow graph 一种新的基于数据流图的可扩展并行空间滤波器实现
2014 4th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2014-12-22 DOI: 10.1109/ICCKE.2014.6993355
Mostafa Koraei, A. Teymouri, S. M. Fakhraie
{"title":"A new scalable parallel spatial filter implementation based on data flow graph","authors":"Mostafa Koraei, A. Teymouri, S. M. Fakhraie","doi":"10.1109/ICCKE.2014.6993355","DOIUrl":"https://doi.org/10.1109/ICCKE.2014.6993355","url":null,"abstract":"Spatial image filters are one of the primary operators in digital image processing and edge detection is one of their most well-known operations. Because of growing demand in applications such as real time video processing and stream image processing, accelerating this family of algorithms based on FPGA platforms has received increased attention. This paper introduces a new implementation of this type of filter. We have used data flow computing concept to invent a novel area and bandwidth efficient edge detector hardware. As theory calculations we expect that this method increases area efficiency up to 30 % related to traditional pixel parallel methods.","PeriodicalId":152540,"journal":{"name":"2014 4th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130457075","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
Reversed-Mel cepstrum based audio steganalysis 基于倒频谱的音频隐写分析
2014 4th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2014-12-22 DOI: 10.1109/ICCKE.2014.6993347
Hamzeh Ghasemzadeh, M. Arjmandi
{"title":"Reversed-Mel cepstrum based audio steganalysis","authors":"Hamzeh Ghasemzadeh, M. Arjmandi","doi":"10.1109/ICCKE.2014.6993347","DOIUrl":"https://doi.org/10.1109/ICCKE.2014.6993347","url":null,"abstract":"Some of the previous audio steganalysis systems have suggested features based on human auditory system models. In contrast, this paper exploits the idea of maximum deviation from human auditory system to suggest an efficient audio steganalysis scheme. Based on this idea, an artificial ear is considered that has high resolution in high frequency region and low resolution where the frequency is low. Simulation results show that this artificial ear can virtually hear effect of steganography and distinguish between stego and clean audio signals. Proposed method achieves accuracy of 93% (StegHide@1.563% BPB) and 97% (Hide4Pgp@6.25% BPB) which are 16% and 12% higher than previous MFCC based methods.","PeriodicalId":152540,"journal":{"name":"2014 4th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117022796","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
An effective hybrid model based on PSO-SVM algorithm with a new local search for feature selection 基于PSO-SVM算法的有效混合模型和一种新的局部搜索特征选择方法
2014 4th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2014-12-22 DOI: 10.1109/ICCKE.2014.6993448
E. Eslami, M. Eftekhari
{"title":"An effective hybrid model based on PSO-SVM algorithm with a new local search for feature selection","authors":"E. Eslami, M. Eftekhari","doi":"10.1109/ICCKE.2014.6993448","DOIUrl":"https://doi.org/10.1109/ICCKE.2014.6993448","url":null,"abstract":"Todays, feature selection is an active research in machine learning. The main idea of feature selection is to select a subset of available features, by eliminating features with little or no predictive information. This paper presents a hybrid model with a new local search technique based on reinforcement learning for feature selection. We combined the particle swarm optimization (PSO) with support vector machine (SVM) for improving classification accuracy and selecting a subset of salient feature. This optimization mechanism with combination of discrete PSO and continuous PSO simultaneously selects a subset of salient feature and tunes support vector machine parameters. In this algorithm, a new local search based on reinforcement learning is utilized for obtaining optimal feature subset. The numerical results and statistical analysis show that the proposed method performs significantly better than the other methods in terms of prediction accuracy with smaller subset of features on low and high dimensional datasets.","PeriodicalId":152540,"journal":{"name":"2014 4th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"2016 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134402681","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
Multiple human tracking using PHD filter in distributed camera network 分布式摄像机网络中基于PHD滤波的多人跟踪
2014 4th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2014-12-22 DOI: 10.1109/ICCKE.2014.6993415
Mohammad Khazaei, M. Jamzad
{"title":"Multiple human tracking using PHD filter in distributed camera network","authors":"Mohammad Khazaei, M. Jamzad","doi":"10.1109/ICCKE.2014.6993415","DOIUrl":"https://doi.org/10.1109/ICCKE.2014.6993415","url":null,"abstract":"The Gaussian mixture probability hypothesis density (GM-PHD) filter is a closed form approximation of the multi-target Bayes filter which can overcome most multitarget tracking problems. Limited field of view, decreasing cost of cameras, and advances of using multi-camera induce us to use large-scale camera networks. In this paper, a multihuman tracking framework using the PHD filter in a distributed camera network is proposed. Each camera tracks objects locally with PHD filter and a track-after-detect scheme and its estimates of targets are sent to neighboring nodes. Then each camera fuses its local estimates with it's neighbors. The proposed method is evaluated on the public PETS2009 dataset. The results measured in Correct Tracking Percentage (CTP) showed a better performance compared to one of the most recent related works on the evaluated dataset.","PeriodicalId":152540,"journal":{"name":"2014 4th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134599020","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
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学术官方微信