发布求助
文献互助 智能选刊 最新文献

2015 7th Conference on Information and Knowledge Technology (IKT)最新文献

筛选
英文 中文
Mixture of ICAs model for natural images solved by manifold optimization method 用流形优化方法求解自然图像混合ICAs模型
2015 7th Conference on Information and Knowledge Technology (IKT) Pub Date : 2015-05-26 DOI: 10.1109/IKT.2015.7288745
Arash Mehrjou, Reshad Hosseini, Babak Nadjar Araabi
{"title":"Mixture of ICAs model for natural images solved by manifold optimization method","authors":"Arash Mehrjou, Reshad Hosseini, Babak Nadjar Araabi","doi":"10.1109/IKT.2015.7288745","DOIUrl":"https://doi.org/10.1109/IKT.2015.7288745","url":null,"abstract":"A finite mixture model composed of several components that are each described by a linear mixture of independent sources is proposed in this paper. Randomly selected patches from a dataset of natural images constitute our main dataset. Independent sources and mixing matrix for each mixture component are estimated that help us derive a qualitative inspection about the performance of the algorithm where no ground truth data is available. This method extends the mixture of Gaussians model in a way that components are not restricted to be Gaussian anymore. Each source signal is represented as a mixture of Gaussians which increases its flexibility to model both super- and sub-Gaussian sources. The proposed mixture model is formulated as a manifold optimization problem that gives a desirable convergence behavior. We believe that the non-Gaussian character of informative natural signals, makes them suitable to be modeled by this method. Finally, The learned features in each mixture component can provide us with useful insights into how early sensory pathways process information in an efficient way.","PeriodicalId":338953,"journal":{"name":"2015 7th Conference on Information and Knowledge Technology (IKT)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128433661","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
Evaluating the effect of topic consideration in identifying communities of rating-based social networks 评估主题考虑在识别基于评级的社交网络社区中的作用
2015 7th Conference on Information and Knowledge Technology (IKT) Pub Date : 2015-05-26 DOI: 10.1109/IKT.2015.7288793
A. Reihanian, B. Minaei-Bidgoli, Muhammad Yousefnezhad
{"title":"Evaluating the effect of topic consideration in identifying communities of rating-based social networks","authors":"A. Reihanian, B. Minaei-Bidgoli, Muhammad Yousefnezhad","doi":"10.1109/IKT.2015.7288793","DOIUrl":"https://doi.org/10.1109/IKT.2015.7288793","url":null,"abstract":"Finding meaningful communities in social network has attracted the attentions of many researchers. The community structure of complex networks reveals both their organization and hidden relations among their constituents. Most of the researches in the field of community detection mainly focus on the topological structure of the network without performing any content analysis. Nowadays, real world social networks are containing a vast range of information including shared objects, comments, following information, etc. In recent years, a number of researches have proposed approaches which consider both the contents that are interchanged in the networks and the topological structures of the networks in order to find more meaningful communities. In this research, the effect of topic analysis in finding more meaningful communities in social networking sites in which the users express their feelings toward different objects (like movies) by the means of rating is demonstrated by performing extensive experiments.","PeriodicalId":338953,"journal":{"name":"2015 7th Conference on Information and Knowledge Technology (IKT)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114288648","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
Common feature extraction in multi-source domains for transfer learning 用于迁移学习的多源域公共特征提取
2015 7th Conference on Information and Knowledge Technology (IKT) Pub Date : 2015-05-26 DOI: 10.1109/IKT.2015.7288795
J. Tahmoresnezhad, S. Hashemi
{"title":"Common feature extraction in multi-source domains for transfer learning","authors":"J. Tahmoresnezhad, S. Hashemi","doi":"10.1109/IKT.2015.7288795","DOIUrl":"https://doi.org/10.1109/IKT.2015.7288795","url":null,"abstract":"In transfer learning scenarios, finding a common feature representation is crucial to tackle the problem of domain shift where the training (source domain) and test (target domain) sets have difference in their distribution. However, classical dimensionality reduction approaches such as Fisher Discriminant Analysis (FDA), are not in good yields whenever dealing with shift problem. In this paper we introduce CoMuT, a Common feature extraction in Multi-source domains for Transfer learning, that finds a common feature representation between different source and target domains. CoMuT projects the data into a latent space to reduce the drift in distributions across domains and concurrently preserves the separability between classes. CoMuT constructs the latent space in semi-supervised manner to bridge across domains and relate the different domains to each other. The projected domains have distribution similarity and classical machine learning methods can be applied on them to classify target data. Empirical results indicate that CoMuT outperforms other dimensionality reduction methods on different artificial and real datasets.","PeriodicalId":338953,"journal":{"name":"2015 7th Conference on Information and Knowledge Technology (IKT)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128105961","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
Provide a hybrid method to improve the performance of multilevel thresholding for image segmentation using GA and SA algorithms 提出了一种混合方法，以提高遗传算法和SA算法在图像分割中的多水平阈值分割的性能
2015 7th Conference on Information and Knowledge Technology (IKT) Pub Date : 2015-05-26 DOI: 10.1109/IKT.2015.7288751
Afsaneh Alsadat Hosseinzadeh Salavati, S. Mozafari
{"title":"Provide a hybrid method to improve the performance of multilevel thresholding for image segmentation using GA and SA algorithms","authors":"Afsaneh Alsadat Hosseinzadeh Salavati, S. Mozafari","doi":"10.1109/IKT.2015.7288751","DOIUrl":"https://doi.org/10.1109/IKT.2015.7288751","url":null,"abstract":"Multilevel thresholding methods are efficient for image segmentation. In order to determine the thresholds, most methods use histogram of the image. In this paper, a combinational approach based on genetic algorithm (GA) and simulated annealing (SA) is presented which used multilevel thresholding for histogram-based image segmentation. The optimal threshold values are obtained by maximizing Kapur's and Otsu's objective functions. The proposed method combines local search capability of SA with global search process of GA. The proposed technique has been tested on four standard benchmarks. Experimental results showed that the proposed method outperforms other methods in evaluation measures. Also the Kapur based optimization method gives lower standard deviation as compared with Otsu's method.","PeriodicalId":338953,"journal":{"name":"2015 7th Conference on Information and Knowledge Technology (IKT)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125117476","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
WANI: Wormhole avoidance using neighbor information 使用邻居信息避免虫洞
2015 7th Conference on Information and Knowledge Technology (IKT) Pub Date : 2015-05-26 DOI: 10.1109/IKT.2015.7288750
Sepide Eidie, B. Akbari, Pedram Poshtiban
{"title":"WANI: Wormhole avoidance using neighbor information","authors":"Sepide Eidie, B. Akbari, Pedram Poshtiban","doi":"10.1109/IKT.2015.7288750","DOIUrl":"https://doi.org/10.1109/IKT.2015.7288750","url":null,"abstract":"Ad-hoc Networks due to their non-infrastructure nature exposure to several attacks. One of the most important attacks is Wormhole which is the subset of Dos. In Wormhole two or more attacker nodes cooperate with each other to make a misunderstanding topology for other nodes and appeal most of packets. Then the attackers can control all packets that have passed through them and compromise the security of packets by changing or dropping them. This attack can be more dangerous in networks which use on demand protocols such as DSR or AODV. In this paper, we introduce a new and efficient method to detect malicious nodes and prevent this type of attacks in ad-hoc networks which uses AODV. We use neighbors' information to detect malicious nodes and prevent them. Almost all previous methods need extra hardware or moving vital information which can be more dangerous. Also most of them can only detect In-band attacks and don't have any solution for Out-band attacks. Our method without any change to algorithms and any need to any hardware, can detect both In-band and Out-band attacks. Also it is very easy to implement. The simulation results show our method can achieve both high detection rate and accuracy.","PeriodicalId":338953,"journal":{"name":"2015 7th Conference on Information and Knowledge Technology (IKT)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122277593","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
High secure digital image steganography based on 3D chaotic map 基于三维混沌映射的高安全数字图像隐写
2015 7th Conference on Information and Knowledge Technology (IKT) Pub Date : 2015-05-26 DOI: 10.1109/IKT.2015.7288810
Milad Yousefi Valandar, P. Ayubi, M. Barani
{"title":"High secure digital image steganography based on 3D chaotic map","authors":"Milad Yousefi Valandar, P. Ayubi, M. Barani","doi":"10.1109/IKT.2015.7288810","DOIUrl":"https://doi.org/10.1109/IKT.2015.7288810","url":null,"abstract":"Information security has become an important issue in digital media. Many solutions have been proposed for enhance the digital media security that some of them are based on chaotic maps. The present paper proposes a new spatial domain steganography method based on the chaotic map for digital media, especially digital images. This method uses three variables (x,y,z) for determine pixel position and RGB channel in color images and these variables are generated by proposed chaotic map. The proposed map is very sensitive to initial condition and any changes. Proposed steganography algorithm resists against many existing steganalytic attacks that showed in the experimental results section. In comparison with existing spatial domain steganography based on chaotic maps, proposed algorithm has some advantages, including high resistance against some knowing attacks and larger key space.","PeriodicalId":338953,"journal":{"name":"2015 7th Conference on Information and Knowledge Technology (IKT)","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131015459","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 improved Artificial Bee Colony algorithm with incorporating information of qualified solutions 引入合格解信息的改进人工蜂群算法
2015 7th Conference on Information and Knowledge Technology (IKT) Pub Date : 2015-05-26 DOI: 10.1109/IKT.2015.7288805
Donya Yazdani, M. Meybodi
{"title":"An improved Artificial Bee Colony algorithm with incorporating information of qualified solutions","authors":"Donya Yazdani, M. Meybodi","doi":"10.1109/IKT.2015.7288805","DOIUrl":"https://doi.org/10.1109/IKT.2015.7288805","url":null,"abstract":"Artificial Bee Colony (ABC) is a metaheuristic algorithm with proper ability in solving optimization problems. However, its performance can be improved by setting a better balance between exploitation and exploration. In this study, by changing the search pattern of neighborhood and incorporating the information of a set of qualified solutions into the creating process of candidate solutions, the balance between exploitation and exploration would improve. This change is in a way that in addition to improvement of exploration, the capability of employed and onlooker bees to search around proper solutions is utilized properly. Experiments are conducted on 22 different benchmark functions including standard, shifted, rotated, and shifted-rotated multimodal and unimodal problems. The results confirm superiority of the proposed algorithm compared to standard ABC and some new versions of it.","PeriodicalId":338953,"journal":{"name":"2015 7th Conference on Information and Knowledge Technology (IKT)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131810146","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 image sharing scheme based on compressed sensing 一种新的基于压缩感知的可扩展图像共享方案
2015 7th Conference on Information and Knowledge Technology (IKT) Pub Date : 2015-05-26 DOI: 10.1109/IKT.2015.7288741
Mehdi Safarpour, M. Charmi, S. Toofan, Hamed Nourbakhsh
{"title":"A new scalable image sharing scheme based on compressed sensing","authors":"Mehdi Safarpour, M. Charmi, S. Toofan, Hamed Nourbakhsh","doi":"10.1109/IKT.2015.7288741","DOIUrl":"https://doi.org/10.1109/IKT.2015.7288741","url":null,"abstract":"This paper presents a novel image sharing method. The proposed method is based on emerging theory of compressed sensing. We have exploited intrinsic features of compressed sensing theory to come up with a new image sharing scheme which provides scalable recovery and generates smaller shadow images (share images).The other potential application of our method is in distributed data storage systems, where instead of security, robust data recovery is needed. Our method does not follow the common practice of secret sharing schemes and is merely based on recovery procedure of compressed sensing theory but it produces comparable results in terms of scalability, shadow sizes and quality. Experimental results show applicability of our method through comparison with similar works and demonstrate this method has smaller shadow sizes without compromising much on the quality of recovered image.","PeriodicalId":338953,"journal":{"name":"2015 7th Conference on Information and Knowledge Technology (IKT)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121840326","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
Automatic license plate detection system based on the point weighting and template matching 基于点加权和模板匹配的车牌自动检测系统
2015 7th Conference on Information and Knowledge Technology (IKT) Pub Date : 2015-05-26 DOI: 10.1109/IKT.2015.7288783
Hossein Vahid Dastjerdi, Vahid Rostami, Farid Kheiri
{"title":"Automatic license plate detection system based on the point weighting and template matching","authors":"Hossein Vahid Dastjerdi, Vahid Rostami, Farid Kheiri","doi":"10.1109/IKT.2015.7288783","DOIUrl":"https://doi.org/10.1109/IKT.2015.7288783","url":null,"abstract":"License plate recognition is one of the important security measurements, reinforcing the transportation laws and car-tracing. An effective license plate recognition must deal with problems such as environmental noise, damages to the license plate, light changes, weather conditions and car movements. In this paper, some attributes of the license plates have been extracted, in different conditions in which they are more stable. We proposed an accurate and flexible license plate recognition; applying morphological methods, and a novel method for weighting points. In this process, we face two stages: 1) locating the license plate, 2) reading its characters. We used novel pattern recognition techniques and methods in both sections. The results show that the proposed model is capable of faster recognizing the license plate in the fixed distance range in comparison with other techniques being used currently in the industry. Beside the 93% accuracy rate of this method, it has the ability to work in environments with strong noise. The license plate reader algorithm can also extract, process, and identify the characters from the image of the license plate when we cannot locate the exact location of the license plate through the image segmentation method.to evaluate our algorithm, we applied it to a database comprised of 120 vehicle images with different backgrounds, brightness, distances and viewing angles.","PeriodicalId":338953,"journal":{"name":"2015 7th Conference on Information and Knowledge Technology (IKT)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123934837","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
Facebook user's like behavior can reveal personality Facebook 用户的 "喜欢 "行为可揭示个性
2015 7th Conference on Information and Knowledge Technology (IKT) Pub Date : 2015-05-26 DOI: 10.1109/IKT.2015.7288797
S. Ghavami, M. Asadpour, J. Hatami, Mohammad Mahdavi
{"title":"Facebook user's like behavior can reveal personality","authors":"S. Ghavami, M. Asadpour, J. Hatami, Mohammad Mahdavi","doi":"10.1109/IKT.2015.7288797","DOIUrl":"https://doi.org/10.1109/IKT.2015.7288797","url":null,"abstract":"Personality is an important factor that affects human's behavior. In recent years attraction towards online social networks has increased tremendously.Due to its unique features social networks are very suitable platforms for psychological analysis. By investigating 65 facebook users which participated in this research, correlation between personality traits and user liking behavior was observed. Classification algorithms were applied to classify personality traits based on user liking activity. Among classifiers, the SVM classifier outperforms other classifiers in most traits.","PeriodicalId":338953,"journal":{"name":"2015 7th Conference on Information and Knowledge Technology (IKT)","volume":"202 1-4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120928548","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学术文献互助群
群 号：604180095
Book学术官方微信