检索结果-内蒙古大学图书馆

Traffic sign classification base on latent dirichlet allocation 1

6th International Conference on Frontier computing, FC 2017

作者： Song, Lei Liu, Zheyuan Zhang, Xiaoteng Duan, Huixian Liu, Na Dai, Jie The Third Research Institute of the Ministry of Public Security Shanghai China The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China Shanghai International Technology and Trade United Co. Ltd Shanghai China

ISBN: (数字)9789811073984

ISBN: (纸本)9789811073977

Traffic sign classification is a significant issue in the intelligent vehicle domain, which helps vehicles to follow the traffic rules and ensure the safety. Feature selection and description are very important and difficult for classification. In this paper, a novel traffic sign classification method is proposed which is based on the Latent Dirichlet Allocation (LDA) model. Feature topics are modeled based on various traffic signs by the LDA automatically. And traffic signs captured onboard are classified according to the modeled features. The experiment results show the efficiency of our work. © 2018, Springer Nature Singapore Pte Ltd.

关键词： Traffic signs

来源：评论

学校读者我要写书评

暂无评论

Vehicle localisation using a single camera

Vehicle localisation using a single camera

引用

IEEE Symposium on Intelligent Vehicle

作者： Jianzhu Cui Fuqiang Liu Zhipeng Li Zhen Jia Key Laboratory of Embedded System and Service Computing supported by Ministry of Education University of Tongji Shanghai China United Technologies Research Center Shanghai China

Lots of rear end collisions due to driver inattention have been identified as a major automotive safety issue. A short advance warning can reduce the number and severity of the rear end collisions. This paper describes a Forward Collision Warning (FCW) system based on monocular vision, and presents a new vehicle detection method: appearance-based hypothesis generation, template tracking-based hypothesis verification which can remove false positive detections and automatic image matting for detection refinement. The FCW system uses time to collision (TTC) to trigger the *** order to compute time to collision (TTC), firstly, haar and adaboost algorithm is utilized to detect the vehicle; Secondly, we use simplified Lucas-Kanade algorithm and virtual edge to remove false positive detection and use automatic image matting to do detection refinement; Thirdly, hierarchical tracking system is introduced for vehicle tracking; Camera calibration is utilized to get the headway distance and TTC at last. The use of a single low cost camera results in an affordable system which is simple to install. The FCW system has been tested in outdoor environment, showing robust and accurate performance.

关键词： Cameras Vehicle detection Road accidents Radar tracking Image edge detection Calibration Radar detection Laser radar Educational technology Vehicle safety

来源：评论

学校读者我要写书评

暂无评论

Evolutionary behavior verification to the trustworthy banking software

Evolutionary behavior verification to the trustworthy bankin...

引用

International Conference on Computer Engineering and Technology

作者： Jiang, Zuo-Wen Tang, Xian-Fei Ding, Zhi-Jun Jiang, Chang-Jun Electronics and Information Engineering School Tongji University 201804 China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University 200092 China College of Science and Technology NingBo University 315211 China

ISBN: (纸本)9781424463503

Oriented to the goal of high-quality banking softwares, trustworthiness is emerging to be important property. This paper studies how to apply formal methods into the trustworthy property preservation of evolutionary components, focusing on the safety property of the concurrent software behavior, this paper presents a new approach to curb the state explosion problem in the model checking based trustworthiness verification. By adopting the environment reduction paradigm, our method is able to reduce the global states of the system by hiding the internal actions of the environment that does not join in the interleaving composition. The method presented is proved and testified with a bank software case study. Experiment data shows that our method is able to improve the verification efficiency. © copy;2010 IEEE.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

A framework of video coding for compressing near-duplicate videos

A framework of video coding for compressing near-duplicate v...

引用

20th Anniversary International Conference on MultiMedia Modeling, MMM 2014

作者： Wang, Hanli Ma, Ming Jiang, Yu-Gang Wei, Zhihua Department of Computer Science and Technology Tongji University Shanghai China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China School of Computer Science Fudan University Shanghai China

ISBN: (纸本)9783319041131

With the development of multimedia technique and social network, the amount of videos has grown rapidly, which brings about an increasingly substantial percentage of Near-Duplicate Videos (NDVs). It has been a hot research topic to retrieve NDVs for a number of applications such as copyright detection, Internet video ranking, etc. However, there exist a lot of redundancies in NDVs, and to the best of our knowledge it is an untouched research area on how to efficiently compress NDVs in a joint manner. In this work, a novel video coding framework is proposed to effectively compress NDVs by making full use of the relevance among them. Experimental results demonstrate that a significant storage saving can be achieved by the proposed NDV coding framework. © 2014 Springer International Publishing.

关键词： Video signal processing

来源：评论

学校读者我要写书评

暂无评论

Trust-drive minimize cost within deadline algorithm for instance-intensive workflows in cloud computing environment

引用

Journal of Convergence Information Technology 2012年第13期7卷 412-419页

作者： Daoguo, Li Mukuai, Wang Rong, Zhao Hangzhou Dianzi University China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University China

Cloud computing is an emerging paradigm and it has been accepted and researched widely both in industry and academic fields. Instance-intensive workflows are workflows with a great number of concurrent instances;they are typical applications in cloud computing environment. However, cloud resources consist of unreliable servers;it becomes increasingly important to provide reliable scheduling strategy. Considering unreliable cloud resources and QoS requirements of instanceintensive workflows, we propose Trust-drive Minimize Cost Within Deadline (TD-MCWD) scheduling algorithm. On the one hand, the TD-MCWD algorithm staggers deadlines of the large number of concurrent instances of the same nature, expecting to get cheaper and more intensively competitive resources. On the other hand, considering the risk factors on the basis of resource reliability was estimated by trust model, the TD-MCWD algorithm tends to assign the task to the high reliable resource. Simulation experiment shows TD-MCWD algorithm can reduce the rate of delayed instance completion and the average execution cost of successful instance completion. Besides, TD-MCWD has a better load balancing and shows a better performance.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

Analysis for one-place unbounded Petri nets based on modified reachability trees

Analysis for one-place unbounded Petri nets based on modifie...

引用

IEEE International Conference on Networking, Sensing and Control

作者： Yu Wang Zhi Jun Ding Key Laboratory of Embedded System and Service Computing Ministry of Education University of Tongji Shanghai China Key Laboratory of Embedded ystem nd Service Computing Ministry of Education University of Tongji Shanghai China

Analysis approaches of reachability decision is fundamental to Petri nets theory; however, the relevant research work in the past cannot always guarantee the correctness of analysis conclusions. This paper firstly reveals the root cause of wrong conclusions, which are drawn in analysis for deadlock of Petri nets based on modified reachability trees (MRT), and then proposes the rectified calculation of the next-state function and some corresponding definitions, which guarantee MRT's usefulness and correctness in analyzing reachability and deadlock of one-place unbounded Petri nets. Finally, a necessary and sufficient condition of MRT's reachability and the theoretical proof are presented. Examples are given to illustrate the method.

关键词： Petri nets system recovery Firing Laboratories Educational institutions Analytical models Mathematical model

来源：评论

学校读者我要写书评

暂无评论

Estimating the direction of motion based on active RFID

Estimating the direction of motion based on active RFID

引用

5th International Conference on New Trends in Information Science and service Science, NISS 2011

作者： Yujian Yangwei Zhang, Yaing School of Electronics and Information Tongji University Shanghai China School of Economics and Management Shanghai Ocean University Shanghai China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China

ISBN: (纸本)9788988678626

RFID is one of the crucial technology of the IOT (Internet of things), and it has been applying to the fields of manufacturing, logistics management, public security, etc. Active RFID, as one important component of RFID, has striking features of low power consumption, stable signals, long-range read and strong anti-jamming ability. Active RFID is thus widely used in the areas of long-range identification of people and vehicles and Real Time Location system. In the various applications of active RFID, estimating the direction of motion is a vital technical issue. This paper puts forward a new method to estimate. In other words, using several directional antennae, it forms several reading zones, extracts events of tag-entering or tag-leaving and then realizes the estimation by the order of events. In this way, it is feasible to estimate not only the direction of motion of tags accurately, but also other complicated logic, e.g. tag return midway. © 2011 AICIT.

关键词： Radio frequency identification (RFID)

来源：评论

学校读者我要写书评

暂无评论

Probabilistic Convergent Hough Transform

Probabilistic Convergent Hough Transform

引用

International Conference on Information and Automation (ICIA)

作者： Lei Zhu Zhaoqi Chen The Key Laboratory of Embedded System and Service Computing Ministry of Education University of Tongji Shanghai China

To reduce the computational complexity, a novel method of standard Hough transform (SHT), named probabilistic convergent Hough transform (PCHT), is proposed in this paper. PCHT avoids unnecessary cost of SHT in computation by intermittently detecting several points of a line through fast convergence and in memory by using a one-dimensional accumulator. Considering the inevitable error initiated by PCHT, Sensitivity of detection method is introduced to limit the error rate of detecting a fake line within the tolerable range. Experiment is done in various circumstances. Results and comparison between several line detections and PCHT are shown next, and further discussion is given in the final.

关键词： Transforms Noise Convergence Sensitivity Artificial neural networks Probabilistic logic Shape

来源：评论

学校读者我要写书评

暂无评论

Implicit cooperative caching based on information popularity for vehicular networks 12

Implicit cooperative caching based on information popularity...

引用

12th Workshop on Challenged Networks, CHANTS 2017

作者： Li, Yuhong Wang, Ji Lindgren, Anders Su, Xiang Riekki, Jukka State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China RISE SICS Sweden Luleå University of Technology Sweden Centre for Ubiquitous Computing University of Oulu Finland

ISBN: (纸本)9781450351447

Information-centric networking (ICN) technology is becoming a popular research topic in vehicular networks due to the connectionless and lightweight characteristics of this networking paradigm. Caching plays an essential role in information-centric networks, but current caching techniques for ICN are not ideal for the dynamic and wireless vehicular networks. This paper presents a caching approach for ICN-based vehicular networks that takes into account both the dynamicity of vehicular networks and the popularity of the information being distributed. We introduce an interval metric for selective caching. With this metric and estimates of information popularity and vehicle density, cooperative caching can be realized without exchanging cache management information among the vehicular nodes. Simulation results show that the proposed approach can increase the storage space utilization and has low data response time for vehicular networks. © 2017 Association for computing Machinery.

关键词： Digital storage

来源：评论

学校读者我要写书评

暂无评论

Feedback-based Coarse Time-Granularity POI Recommendation and Itinerary Planning

Feedback-based Coarse Time-Granularity POI Recommendation an...

引用

Chinese Automation Congress (CAC)

作者： Jie Zong Zhijun Ding The Key Laboratory of Embedded System and Service Computing Ministry of Education TONGJI University Shanghai China

ISBN: (纸本)9781665426480

For tourists, planning their own travel itinerary to a strange city is really challenging. Although there are many researches on Point of Interests (POIs) recommendation and itinerary planning, two problems occur in currently proposed recommendation algorithms. First, the time granularity of the algorithms is too fine. POI recommendation should be considered within a more coarse-grained time factor. For example, a visitor wouldn’t like to visit a water park in winter, although he appears to love such places. However, seldom researches have taken this into consideration. Second, most of the algorithms build their models based on the tourists’ trajectory, which means, they did not consider users’ feedback. In fact, quite a number of tourists do not like their travel experience and give negative feedbacks after their visits. In this situation, we shouldn’t recommend similar POIs to this user because he may not like such kind of scenic spots at all. To address these two problems, this paper proposes an algorithm called Feedback-based Coarse Time-Granularity POI Recommendation, which can extract information from comments and distinguish tourists’ attitudes towards the POIs they have visited. At the same time, the coarse-grained time factor is considered while making recommendations. In addition, an itinerary planning algorithm is proposed. Experiments show that our algorithm can reach SOTA.

关键词： Negative feedback Automation Urban areas Planning Trajectory Time factors Data mining

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：