2012 IEEE 8th International Conference on Intelligent Computer Communication and Processing最新文献

筛选
英文 中文
Kernel Entropy Component Analysis using local mean-based k-nearest centroid neighbour (LMKNCN) as a classifier for face recognition in video surveillance camera systems 基于局部均值的k-最近邻(LMKNCN)分类器的核熵分量分析用于视频监控摄像机系统中的人脸识别
S. Damavandinejadmonfared
{"title":"Kernel Entropy Component Analysis using local mean-based k-nearest centroid neighbour (LMKNCN) as a classifier for face recognition in video surveillance camera systems","authors":"S. Damavandinejadmonfared","doi":"10.1109/ICCP.2012.6356195","DOIUrl":"https://doi.org/10.1109/ICCP.2012.6356195","url":null,"abstract":"In this paper, a new method for face recognition in video surveillance is proposed. Local mean-based k-nearest centroid neighbour (LMKNCN) is a recently proposed method for classifying data which has been proven to be more appropriate than other classifiers such as k-nearest neighbour (KNN), K-Nearest Centroid Neighbour (KNCN), and local mean-based k-nearest neighbour (LMKNN). Kernel Entropy Component Analysis is a new extension of 1-D PCA-based feature extractions methods enhancing the performance of PCA-based methods. In the proposed method in this paper, LMKNCN is used as a classifier in KPCA method. Moreover, the Extensive experiments on surveillance camera faces database (SCfaces) and Head Pose Image database reveal the significance of the proposed method.","PeriodicalId":406461,"journal":{"name":"2012 IEEE 8th International Conference on Intelligent Computer Communication and Processing","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126134640","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
Scheduling Service with SLA assurance for private cloud systems 为私有云系统提供SLA保证的调度服务
Mihaela-Catalina Nita, Florin Pop, V. Cristea
{"title":"Scheduling Service with SLA assurance for private cloud systems","authors":"Mihaela-Catalina Nita, Florin Pop, V. Cristea","doi":"10.1109/ICCP.2012.6356209","DOIUrl":"https://doi.org/10.1109/ICCP.2012.6356209","url":null,"abstract":"The Cloud systems performance consists in its agile response to the user needs and in the Quality of Service provided. In this context, one of the biggest challenges facing cloud computing nowadays is the Service Level Agreement (SLA) assurance, which will increase the user's confidence in the system. We present in this paper a model for a scheduling service not only to respect the Service Level Agreement (SLA) constraints but also to minimize the total cost of resource utilization. Based on this model, we outline a scheduling application architecture for a system that will receive SLAs and will provide the allocation schema for the existing hosts. The application is implemented as an Haizea add-on. Haizea is virtual machine-based lease management system built on the top of OpenNebula environment. We tested and validated the proposed model using the simulator offered by Haizea.","PeriodicalId":406461,"journal":{"name":"2012 IEEE 8th International Conference on Intelligent Computer Communication and Processing","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123201868","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
Particle based modelling and processing of high resolution and large textile surfaces 基于粒子的高分辨率和大型纺织品表面建模和处理
A. Sabou, C. Mocan, D. Gorgan
{"title":"Particle based modelling and processing of high resolution and large textile surfaces","authors":"A. Sabou, C. Mocan, D. Gorgan","doi":"10.1109/ICCP.2012.6356213","DOIUrl":"https://doi.org/10.1109/ICCP.2012.6356213","url":null,"abstract":"High resolution modeling and dynamical simulation of large and flexible 3D surfaces can be achieved by using particle based solutions. Simulating such a model requires a huge number of linked particles that are not supported efficiently by just one graphical processing unit or computational machine. Even if the visualization could be achieved through graphics clusters the simulation is still a difficult case mainly for model distribution and communication among processors. This paper experiments and evaluates the cluster based solution for simulating high resolution and large flexible textile surfaces and highlights the issues of the software technologies.","PeriodicalId":406461,"journal":{"name":"2012 IEEE 8th International Conference on Intelligent Computer Communication and Processing","volume":"163 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122976896","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
PCA type algorithm applied in face recognition PCA型算法在人脸识别中的应用
S. Nedevschi, Ioan Radu Peter, Adina Mandrut
{"title":"PCA type algorithm applied in face recognition","authors":"S. Nedevschi, Ioan Radu Peter, Adina Mandrut","doi":"10.1109/ICCP.2012.6356181","DOIUrl":"https://doi.org/10.1109/ICCP.2012.6356181","url":null,"abstract":"One of the widely used approaches in image recognition is principal component analysis (PCA) because of the good balance between the simplicity and speed of the algorithm and the results obtained by using it. In the last years many variants of PCA were developed: two dimensional PCA, two directional two dimensional PCA, extended two dimensional PCA and extended two dimensional two directional PCA, the last one developed by the first two authors of the present paper. In this paper we go further with this study by considering a mixed approach between E2DPCA and diagonal PCA. The mixed approach not only takes approximately the same amount of time for training and testing as the classical approach, but also gives better recognition accuracy for some of the PCA algorithm variants.","PeriodicalId":406461,"journal":{"name":"2012 IEEE 8th International Conference on Intelligent Computer Communication and Processing","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121444121","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
Designing a travel recommendation system using Case-Based Reasoning and domain ontology 基于案例推理和领域本体的旅游推荐系统设计
C. Lemnaru, M. Dobrin, M. Florea, R. Potolea
{"title":"Designing a travel recommendation system using Case-Based Reasoning and domain ontology","authors":"C. Lemnaru, M. Dobrin, M. Florea, R. Potolea","doi":"10.1109/ICCP.2012.6356156","DOIUrl":"https://doi.org/10.1109/ICCP.2012.6356156","url":null,"abstract":"This paper proposes a new travel recommendation system, which aims to provide a unified solution to user demands. It is a hybrid system that combines Case-Based Reasoning with domain-specific ontology. Queries can be constructed template-based or in natural language and a relaxation query management strategy is developed. The solution space is searched from two perspectives: relevance and diversity. We propose a new similarity function, which measures the distances according to the domain ontology.","PeriodicalId":406461,"journal":{"name":"2012 IEEE 8th International Conference on Intelligent Computer Communication and Processing","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132261537","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
Checking the norms for explanation 检查规范的解释
I. A. Letia, A. Goron
{"title":"Checking the norms for explanation","authors":"I. A. Letia, A. Goron","doi":"10.1109/ICCP.2012.6356153","DOIUrl":"https://doi.org/10.1109/ICCP.2012.6356153","url":null,"abstract":"If the purpose of agent organizations is to create power relationships, not just constraining agents, but to enable them to face the dynamics of the environment, the effect of norms and their interplay is a significant practical aspect. To better understand how agents can face dynamism and improve the overall social gain, we present our current view on the model checking of properties for the behavior of a normative system. We consider goal oriented processes as a flexible description of the environment within which the normative organization has to perform as well as possible. To actively involve the users and domain experts in the modeling of processes, we show the verbalizing step that leads to controlled natural language.","PeriodicalId":406461,"journal":{"name":"2012 IEEE 8th International Conference on Intelligent Computer Communication and Processing","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115666209","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
Catch me if you can: Using self-camouflaging images to strengthen graphical passwords 如果你能抓住我:使用自我伪装图像来加强图形密码
M. Ordean, K. Renaud
{"title":"Catch me if you can: Using self-camouflaging images to strengthen graphical passwords","authors":"M. Ordean, K. Renaud","doi":"10.1109/ICCP.2012.6356205","DOIUrl":"https://doi.org/10.1109/ICCP.2012.6356205","url":null,"abstract":"In the last decade graphical passwords have been proposed as a viable alternative to the problematical password. One of the most popular of these is the recognition-based graphical password, where the user clicks secret images from one or more challenge sets of images, in order to authenticate. While these mechanisms have provable memorability advantages, they are easily as vulnerable to automated sniffing attacks, password-capturing and password computation mechanisms, as are passwords themselves. For example, an attacker can use software to automatically scrape the challenge set images, display these on a duplicate site, and then entice the genuine account owner to reveal the authentication secret. Here we propose a mechanism for addressing this particular weakness of recognition-based graphical passwords. We propose a constantly changing image set, implementing a kind of one-time-password (OTP), which will confound automated attacks by continuously changing the imprint of the secret images. It is vital to ensure that the displayable quality of the images is not compromised so that the genuine user can still authenticate without difficulty. Fortunately usability testing showed that the enhanced security model had no impact on the user authentication process. All the benefits of graphical passwords, such as ease of use and increased memorability, are preserved whilst resisting automated attacks.","PeriodicalId":406461,"journal":{"name":"2012 IEEE 8th International Conference on Intelligent Computer Communication and Processing","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115693234","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
Accurate localization of mobile robot under the weakly callibrated motion model 弱标定运动模型下移动机器人的精确定位
P. Jeong, Dan Pojar, S. Nedevschi
{"title":"Accurate localization of mobile robot under the weakly callibrated motion model","authors":"P. Jeong, Dan Pojar, S. Nedevschi","doi":"10.1109/ICCP.2012.6356177","DOIUrl":"https://doi.org/10.1109/ICCP.2012.6356177","url":null,"abstract":"This paper proposes an accurate localization method, which consists of a non-probabilistic motion model and Generalized Iterative Closet Point (GICP). The most encountered problem of using motion models is to determine empirical parameters, which represent the systemic errors and the non-systemic errors. The perfect representation of those errors is an extremely difficult task, and it is practically impossible. Therefore, in order to compensate those errors, generally a probabilistic approach is used in the grid map. However, this generic approach shows a drifting problem due to systemic/non-systemic errors of the motion model and discrepancy of the grid map. To avoid those problems, we use GICP framework instead of using the grid map. In addition, this GICP helps to obtain accurate localization results even though we calibrate motion model parameters roughly.","PeriodicalId":406461,"journal":{"name":"2012 IEEE 8th International Conference on Intelligent Computer Communication and Processing","volume":"1048 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116278216","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
Finger vein recognition using linear Kernel Entropy Component Analysis 基于线性核熵分量分析的手指静脉识别
S. Damavandinejadmonfared
{"title":"Finger vein recognition using linear Kernel Entropy Component Analysis","authors":"S. Damavandinejadmonfared","doi":"10.1109/ICCP.2012.6356194","DOIUrl":"https://doi.org/10.1109/ICCP.2012.6356194","url":null,"abstract":"Based on the previous research, Kernel Entropy Component Analysis (KECA) is introduced as a more appropriate method than Kernel Principal Component Analysis (KPCA) for face recognition. In this paper, an algorithm using KECA is proposed to merit finger vein recognition. The proposed algorithm is then compared to Principal Component Analysis (PCA) and Different types of KECA in order to determine the most appropriate one in terms of finger vein recognition.","PeriodicalId":406461,"journal":{"name":"2012 IEEE 8th International Conference on Intelligent Computer Communication and Processing","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126227481","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 13
A real-time multiple vehicle classification and tracking system with occlusion handling 基于遮挡处理的实时多车辆分类与跟踪系统
A. Ghasemi, R. Safabakhsh
{"title":"A real-time multiple vehicle classification and tracking system with occlusion handling","authors":"A. Ghasemi, R. Safabakhsh","doi":"10.1109/ICCP.2012.6356172","DOIUrl":"https://doi.org/10.1109/ICCP.2012.6356172","url":null,"abstract":"In this paper, we propose a new traffic surveillance system with the ability to perform surveillance tasks in real time. The proposed classification method is able to classify objects into vehicles and non-vehicles (pedestrians and motorcycles). In addition, the system can detect the type of vehicle as large or small efficiently, without considering size-based features. Our tracking algorithm uses a region-based tracker to explicitly define occlusion relationships between vehicles. For occlusion handling, we use a Kalman filter to estimate the position of moving vehicles and a tree structure by which moving regions are arranged in a tree. In this way, we obtain robust motion estimates and trajectories for vehicles, even in presence of occlusions. We show the efficient performance of the proposed system in some experiments with real world traffic scenes.","PeriodicalId":406461,"journal":{"name":"2012 IEEE 8th International Conference on Intelligent Computer Communication and Processing","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124926399","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}
引用次数: 17
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学术官方微信