2016 IEEE 12th International Conference on Intelligent Computer Communication and Processing (ICCP)最新文献

筛选
英文 中文
Artemis - an extensible natural language framework for data querying and manipulation Artemis——用于数据查询和操作的可扩展自然语言框架
Ionut Tamas, I. Salomie
{"title":"Artemis - an extensible natural language framework for data querying and manipulation","authors":"Ionut Tamas, I. Salomie","doi":"10.1109/ICCP.2016.7737127","DOIUrl":"https://doi.org/10.1109/ICCP.2016.7737127","url":null,"abstract":"Filtering and finding items of interest in large volumes of data, such as products in an e-commerce application or invoices in an ERP web platform can be a burdensome task, either for novice users that do not have insights on how the data is modeled or for those users who are already accustomed to the used system, but usually their filtering needs are significantly more complex. Natural language processing provides a way to dramatically improve the search experience for end-users and even though NLP is an AI-complete problem for the moment, based on the underlying data models the user can conduct comprehensive queries in a large set of scenarios guided by powerful context-aware prediction mechanisms. Based on this we have built Artemis, an extensible framework that transforms valid query inputs into filters applicable to underlying data models, stored either in-memory or in RDBMS, along with an extension mechanism to further enrich queries expressiveness via annotations or custom configuration and a context-aware prediction mechanism to direct the user into providing a valid query input, while decreasing the searching time. The conducted usability tests, showed that Artemis yields significantly reduced time-to-search, both for novice or experienced end-users with little or no training and for application developers it provides a straightforward apparatus for further improving expressivity based on custom, business-specific vocabulary.","PeriodicalId":343658,"journal":{"name":"2016 IEEE 12th International Conference on Intelligent Computer Communication and Processing (ICCP)","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116664512","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
Scheduling crowdsensing data to smart city applications in the cloud 将众测数据调度到云中的智慧城市应用程序
Aseel Alkhelaiwi, D. Grigoras
{"title":"Scheduling crowdsensing data to smart city applications in the cloud","authors":"Aseel Alkhelaiwi, D. Grigoras","doi":"10.1109/ICCP.2016.7737179","DOIUrl":"https://doi.org/10.1109/ICCP.2016.7737179","url":null,"abstract":"Mobile phones and their sensing capabilities might be the main source of data for smart city applications. However, before sending a large amount of data to the cloud, it is essential to make sure that the data collected are useful. In this paper, we present a cloud architecture for smart city applications that provides, as a main service, a scheduler for controlling the transmission of data to the cloud. This scheduler will run as close to the crowd data sources as possible (i.e., public local servers). Data with a high priority value are sent to the cloud first. We designed an application for the Android platform to carry out experiments with the scheduling process. The simulation results are included in this paper.","PeriodicalId":343658,"journal":{"name":"2016 IEEE 12th International Conference on Intelligent Computer Communication and Processing (ICCP)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114806725","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
Multi-camera-based smoke detection and traffic pollution analysis system 基于多摄像头的烟雾探测与交通污染分析系统
P. Pyykönen, P. Peussa, M. Kutila, K. Fong
{"title":"Multi-camera-based smoke detection and traffic pollution analysis system","authors":"P. Pyykönen, P. Peussa, M. Kutila, K. Fong","doi":"10.1109/ICCP.2016.7737152","DOIUrl":"https://doi.org/10.1109/ICCP.2016.7737152","url":null,"abstract":"This article studies the smoke and exhaust detection system that has been developed for monitoring exhaust gases to enforce environmental laws and regulations. In many highly populated countries the HSU (Hart ridge Smoke Unit) grade is used to impose penalties. In many cases, HSU values over 40 ... 50 are leading to legal actions. This paper proposes a method that adopts two cameras, a far infrared camera and a high-resolution visible wavelength camera, as a detection system for smoky vehicle detection. The far infrared camera is used for detecting the location of the vehicle exhaust fumes. This thermal information is fused with visible spectrum information from the high-resolution camera. An algorithm evaluates if the identified vehicles are causing visible exhaust smoke. If smoke is detected, the system stores evidence for further actions. The first prototype version of the system needed an automatic adaptation procedure in order to calibrate far infrared and high-resolution images together. Mechanically, the system can be set up quickly in the chosen roadside location. A developed prototype system is one step towards future tools for authorities to automatically detect and classify vehicles emitting smoke. If a permanent set-up is desired, the system can be installed on a lamp post, beneath an overhead bridge or on other similar structures.","PeriodicalId":343658,"journal":{"name":"2016 IEEE 12th International Conference on Intelligent Computer Communication and Processing (ICCP)","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127297604","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}
引用次数: 22
A Kinect based adaptive exergame 基于Kinect的自适应游戏
I. Mocanu, Cosmin Marian, L. Rusu, R. Arba
{"title":"A Kinect based adaptive exergame","authors":"I. Mocanu, Cosmin Marian, L. Rusu, R. Arba","doi":"10.1109/ICCP.2016.7737132","DOIUrl":"https://doi.org/10.1109/ICCP.2016.7737132","url":null,"abstract":"This paper describes an application that aims to stimulate physical activity adapted to elderly people. The application is implemented as a game with two avatars: user and trainer. The user avatar must reproduce the movements of the trainer's avatar. The similarity between two movements is computed using Dynamic Time Warping. Also the speed of the trainer is adapted to the user's movements using cross-correlation. Thus the game can stimulate for a long time physically activity. The preliminary evaluations with ten people have shown that the system can be an effective tool that engages users into physical activity.","PeriodicalId":343658,"journal":{"name":"2016 IEEE 12th International Conference on Intelligent Computer Communication and Processing (ICCP)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131640248","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
A stereovision based rear-end collision warning system on mobile devices 基于立体视觉的移动设备追尾预警系统
Andra Petrovai, R. Danescu, M. Negru, C. Vancea, S. Nedevschi
{"title":"A stereovision based rear-end collision warning system on mobile devices","authors":"Andra Petrovai, R. Danescu, M. Negru, C. Vancea, S. Nedevschi","doi":"10.1109/ICCP.2016.7737161","DOIUrl":"https://doi.org/10.1109/ICCP.2016.7737161","url":null,"abstract":"In this paper, we tackle the challenge of developing a stereovision-based driving assistance system for collision avoidance on a mobile device. This novel system is aimed to work in an urban environment, where a driver experiences lots of stop and go situations. In cities, rear-end accidents are the most common type of accidents, since a momentary lapse of concentration can lead to unsafe headway. The system detects and tracks the vehicle in front of the host vehicle and issues a warning if a crash is imminent, such that the driver has sufficient time to brake or take another action to avoid the accident. Complex functions were developed for lane detection and tracking and vehicle detection and tracking. The rear-end collision warning is based on the computation of Time-To-Collision and Time-Gap taking into account host vehicle speed, relative speed and relative acceleration. Stereovision-based algorithms for driving assistance are computational intensive and mobile devices as they are today have reduced resources. Our algorithms run in real-time, at 20-22 frames/second and at the same time they are robust and have high accuracy.","PeriodicalId":343658,"journal":{"name":"2016 IEEE 12th International Conference on Intelligent Computer Communication and Processing (ICCP)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130745989","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
Optimal maximum likelihood estimates fusion in distributed network of sensors 分布式传感器网络的最优最大似然估计融合
B. Madan, Doina Bein
{"title":"Optimal maximum likelihood estimates fusion in distributed network of sensors","authors":"B. Madan, Doina Bein","doi":"10.1109/ICCP.2016.7737176","DOIUrl":"https://doi.org/10.1109/ICCP.2016.7737176","url":null,"abstract":"A distributed network of sensors leverages its performance by aggregating information gathered by individual sensors through the process of sensor data fusion. Estimating parameters using a centralized scheme entails transporting data from multiple sensors to a centralized fusion center, leading to high network bandwidth consumption. Additionally, fusing raw sensor data from sensors with different sensing modalities may not be feasible. We propose an alternative approach in which each sensor first individually estimates the unknown parameters based solely on its own sensor data. Since sensors may not have a-priori knowledge of the probability distribution of the unknown parameters, each sensor independently computes its individual maximum likelihood estimates. Individual estimates along with their sufficient statistics are then communicated to the fusion center, which treats these estimates as observations to compute the optimum aggregated maximum likelihood estimates by maximizing the new likelihood function of these observations. The proposed technique offers two significant advantages: (i) Since each sensor computes its individual estimates based solely on its own sensed data, it is easily applicable to sensor networks having multi-modal sensors, and (ii) As compared to raw sensor data, communicating estimates and their sufficient statistics to the fusion center requires substantially less network bandwidth. Performance of the aggregated estimates is evaluated through simulations and by computing the Cramer-Rao lower bound.","PeriodicalId":343658,"journal":{"name":"2016 IEEE 12th International Conference on Intelligent Computer Communication and Processing (ICCP)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122396339","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
Multimedia sharing over opportunistic networks 机会网络上的多媒体共享
Radu Dragan, Radu-Ioan Ciobanu, C. Dobre, C. Mavromoustakis, G. Mastorakis
{"title":"Multimedia sharing over opportunistic networks","authors":"Radu Dragan, Radu-Ioan Ciobanu, C. Dobre, C. Mavromoustakis, G. Mastorakis","doi":"10.1109/ICCP.2016.7737181","DOIUrl":"https://doi.org/10.1109/ICCP.2016.7737181","url":null,"abstract":"The massive increase in the use of mobile devices lately led to the congestion of the mobile networks. One solution to offload part of the traffic is to send data, whenever possible, through direct phone-to-phone communication. Such opportunistic networks rely on wireless communication to support a decentralized model of communication where nodes can store, carry and forward data directly to others. Up-until-now most work focused on constructing algorithms designed to forward or disseminate data to nodes having a better chance of routing it to its destination. Here, we extend on our previous work, and propose Opportunistic Multimedia Sharing, an algorithm designed to support dissemination of multimedia content over an opportunistic communication model. The algorithm uses the predictability of the node encounters to determine which multimedia files a specific node can deliver closer to the interested nodes. Experimental results show the algorithm can deliver a high success rate (over 80% in same cases), while maintaining a low delivery latency and cost.","PeriodicalId":343658,"journal":{"name":"2016 IEEE 12th International Conference on Intelligent Computer Communication and Processing (ICCP)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122800760","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
Organizing intelligent vehicles at traffic lights to decrease travel time in a double lane road 在红绿灯处组织智能车辆,减少双车道道路的行驶时间
R. Reghelin, Eduardo da Silva
{"title":"Organizing intelligent vehicles at traffic lights to decrease travel time in a double lane road","authors":"R. Reghelin, Eduardo da Silva","doi":"10.1109/ICCP.2016.7737163","DOIUrl":"https://doi.org/10.1109/ICCP.2016.7737163","url":null,"abstract":"In this paper, we propose a central coordination system to compute optimized trajectories of intelligent vehicles in a double lane road with traffic lights. The focus is to decrease travel time when comparing to human drivers traffic. First, we predict the waiting line formation order when vehicles approach traffic lights. Then, we compute a global motion plan in order to force trajectories result in a reordered line formation. The idea is to place faster vehicles in front of the slower ones which will result in less obstruction and consequently travel time gain. A motion planning algorithm is proposed.","PeriodicalId":343658,"journal":{"name":"2016 IEEE 12th International Conference on Intelligent Computer Communication and Processing (ICCP)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126597938","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 activity recognition and monitoring for elderly people 老年人人体活动识别与监测
G. Sebestyen, I. Stoica, A. Hangan
{"title":"Human activity recognition and monitoring for elderly people","authors":"G. Sebestyen, I. Stoica, A. Hangan","doi":"10.1109/ICCP.2016.7737171","DOIUrl":"https://doi.org/10.1109/ICCP.2016.7737171","url":null,"abstract":"Statistics show that the population in Europe is aging and in the near future human assistance for elderly persons will be prohibitive. This paper analyses the possibilities to implement a supervision system, which is capable of monitoring a person's activity in his/her home without violating intimacy. The main idea is to collect information from various sensors placed in house and on mobile devices and infer a most probable sequence of activities performed by the supervised person. A Hidden Markov chain method is adapted for the activity chain recognition.","PeriodicalId":343658,"journal":{"name":"2016 IEEE 12th International Conference on Intelligent Computer Communication and Processing (ICCP)","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127251663","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}
引用次数: 40
Discriminant color texture descriptors for diabetic retinopathy recognition 鉴别颜色纹理描述符用于糖尿病视网膜病变识别
Holly H. Vo, Abhishek Verma
{"title":"Discriminant color texture descriptors for diabetic retinopathy recognition","authors":"Holly H. Vo, Abhishek Verma","doi":"10.1109/ICCP.2016.7737165","DOIUrl":"https://doi.org/10.1109/ICCP.2016.7737165","url":null,"abstract":"Diabetic retinopathy (DR) is a common eye disease that could lead to irreversible vision loss but hard to be noticed by carriers in early stages. Instead of isolating DR signs for DR recognition, this paper examines discriminant texture features obtained by color multi-scale uniform local binary pattern (LBPs) descriptors on five common color spaces and two proposed hybrid color spaces. The extracted features are evaluated by the enhanced Fisher linear discriminant, EFM. Experiments are done on a large dataset of 35,126 training images and 53,576 testing images that have been taken by different devices with high variance in dimensions, quality and luminance. The best performance is above 71.45% by HSI-LBPs, a*SI-LBPs, and bSI-LBPs descriptors.","PeriodicalId":343658,"journal":{"name":"2016 IEEE 12th International Conference on Intelligent Computer Communication and Processing (ICCP)","volume":"25 11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133920821","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
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学术官方微信