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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Dynamic Time-Constrained Path Recommendation with User’s Preference

Dynamic Time-Constrained Path Recommendation with User’s Pr...

引用

IEEE International Conference on systems, Man and Cybernetics

作者： Yixi Wu Yaying Zhang Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China

ISBN: (纸本)9781665442084

Path recommendation is an essential application in people’s daily life. However, drivers’ experience hidden in their driving history and their personal preferences are less considered in path planning. In this paper we propose a dynamic time-constrained path recommendation method, utilizing the historical GPS trajectory information and user preferences. First, based on graph entropy, critical intersections are extracted from trajectory information to simplify the road network structure. Then the time-dependent mostly chosen path (TDMCP) is obtained by trajectories processing to determine the time-varying paths between critical intersections. Thus the original complex road network is abstracted as a search subnet. Finally we propose an improved dynamic A* search (IDAS) on the search sub-net to find the candidate paths satisfying the time-constraints, and further allow users to set personal preferences to select the final optimal path. The proposed method is validated on the real-world data set, and the result shows that the proposed method surpasses the competing ones especially on long distance path recommendation.

关键词： Roads Conferences Entropy Trajectory History Data mining Cybernetics

来源：评论

学校读者我要写书评

暂无评论

Edge-weight-Based link prediction in heterogeneous graph

Edge-weight-Based link prediction in heterogeneous graph

引用

IEEE International Conference on Networking, Sensing and Control

作者： Jie Zong Zhijun Ding The key laboratory of embedded system and service computing ministry of education TONGJI University Shanghai China

ISBN: (纸本)9781665472449

Link prediction is to predict whether there is a link between two nodes in the graph, it is a very important application and plays a great role in various industries. In recent years, with the development of graph neural network technology, many algorithms make effort to study the expression of each node from the original graph data and use them to infer new links. However, most of the existing algorithms have a common problem when facing heterogeneous graphs, which is, they do not consider the weight of edges in graphs. Instead, they put all their energies into computing node features. Although a few algorithms such as RGCN are trying to take the influence of different link types into account while extracting node features, these implicit feature extractions do not start from the global information, but just calculate independently for each node. In other words, in these algorithms, even the same type of links will be abstracted into different features on different nodes. This is obviously inconsistent with reality. On the same map, the feature of the same link should be relatively fixed and should not be changed just because of different positions. In addition, when the current graph neural network algorithm is applied to link prediction, the link type to be predicted must be specified in advance, which makes the algorithm extremely inflexible. In order to solve these problems, we propose an edge weight calculation algorithm that extracts the edge feature from the whole graph. We also propose the edge-weight-based link prediction algorithm. By introducing edge weight into the MLP, there is no need to specify the target link type at the beginning of model training. It improves both the performance and efficiency of the link prediction model. Experiments on two datasets show that this edge-weight-based link prediction algorithm performs better than current algorithms and reaches SOTA.

关键词： Training Industries Semantics Predictive models Prediction algorithms Feature extraction Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

The preference relation and its application in the information system

The preference relation and its application in the informati...

引用

IEEE International Conference on Computer Science and Automation Engineering (CSAE)

作者： Zhao Mingqing Key Laboratory of Embedded System and Service Computing Ministry of Education University of Tongji Shanghai China

In order to strengthen the traditional information system's capacity of describing practical problems, preference relation is introduced into information system and the concepts of preference information system, preference decision table, and information utility function are offered in this paper. In addition, the existence theorem of information utility function and several applications of information utility function in knowledge acquisition are provided.

关键词： Information systems Knowledge acquisition Economics Clustering methods Transforms Information science Approximation methods

来源：评论

学校读者我要写书评

暂无评论

Improvement of rotation matrix based differential limited feedback with DFT codebook and its application in CoMP environment

引用

Journal of Communications 2014年第6期9卷 498-505页

作者： Zhu, Yin Ji, Yusheng Wang, Ping Liu, Fuqiang Broadband Wireless Communications and Multimedia Laboratory Key Laboratory of Embedded System and Service Computing supported by Ministry of Education Tongji University Shanghai 201804 China National Institute of Informatics Tokyo Japan

Recently, exploiting the temporal correlation of slowly varied multiple input multiple output (MIMO) channels to further improve the system performance or the feedback efficient in MIMO wireless communication systems with limited feedback has been investigated in many papers. Among them, T. Kim et al. proposed a rotation matrix based differential feedback scheme which is shown to have good performance with regard to the system throughput for spatial multiplexing MIMO systems. Although the rotation matrix codebook and the precoding codebook in their scheme are optimally constructed, they are not fit for a practical system due to the structure constraints. In this paper, we propose to replace the optimal codebook in the rotation matrix based differential feedback scheme with discrete Fourier transform (DFT) structured codebook, and propose a search-based method to decrease the performance degradation induced by the un-optimality of the DFT codebook. In addition, the modified algorithm is also applied to a per-cell codebook based coordinated multi-point (CoMP) transmission system to verify its applicability to different MIMO scenarios. Simulation results show the effectiveness of our modified scheme. © 2014 Engineering and Technology Publishing.

关键词： Discrete Fourier transforms

来源：评论

学校读者我要写书评

暂无评论

Quality assessment for color images with tucker decomposition

Quality assessment for color images with tucker decompositio...

引用

IEEE International Conference on Image Processing

作者： Cheng, Cheng Wang, Hanli Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China

As an extension of the singular value decomposition based approaches, a novel metric based on Tucker decomposition for color image quality assessment is proposed in this paper. It extracts both the spacial and chromatic information of a color image with Tucker decomposition. As compared to most of the other existing quality metrics for color images, the key advantage of the proposed metric is that it treats the color image as a whole entity instead of an assembly of three independent visual channels, and thus the interrelation among the different visual channels is well involved. Experimental results on the LIVE Database Release 2 demonstrate that the proposed metric can generally achieve similar or better performance than other metrics.

关键词： Tensile stress Measurement Image color analysis Color Matrix decomposition Image quality Vectors

来源：评论

学校读者我要写书评

暂无评论

An Adaptive Heterogeneous Credit Card Fraud Detection Model Based on Deep Reinforcement Training Subset Selection

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2024年第8期5卷 4026-4041页

作者： Zhu, Kun Zhang, Nana Ding, Weiping Jiang, Changjun the Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai201804 China Collaborative Innovation Center for Financial Network Security Tongji University Shanghai201804 China the School of Computer Science and Technology Donghua University Shanghai201620 China the School of Information Science and Technology Nantong University Nantong226019 China

Heterogeneous fraud detection is an important means of credit card security assurance, which can utilize historical transaction records in a source and target domain to build an effective fraud detection model. Nevertheless, large feature distribution differences between source and target transaction instances and the complex intrinsic structure hidden behind transaction data make it difficult for existing credit card fraud detection (CCFD) models to capture and transfer the most informative feature representations and seriously hinder detection performance. In this work, we propose a novel adaptive heterogeneous CCFD model named adaptive heterogeneous credit card fraud detection model based on deep reinforcement training subset selection (RTAHC) based on deep reinforcement training subset selection, which mainly contains two components: selection distribution generator (SDG) and transaction fraud detector (TFD, including feature extractor with an attention mechanism and classifier). The SDG can generate the selection probability distribution vector via the reinforcement reward mechanism, and then transaction instances in the source domain relevant to the target domain are selected. The feature extractor with an attention mechanism can learn the abstract deep semantic feature representations of selected source transaction instances and the target domain. The joint training of SDG and TFD can provide more real-time and accurate transaction feature representations to reduce the distribution discrepancy between the two domains. We verify the detection performance of RTAHC across a large real-world credit card transaction dataset and four public datasets. Experimental results demonstrate that the RTAHC model can exhibit competitive CCFD performance. Impact Statement—With the rise of artificial intelligence (AI)generated models, credit card fraud has become increasingly rampant, which also causes tens of billions of U.S. dollars in credit card losses worldwide every year

关键词： Hidden Markov models

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Reader activation scheduling in multi-reader RFID systems: A study of general case

Reader activation scheduling in multi-reader RFID systems: A...

引用

25th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2011

作者： Tang, Shaojie Wang, Cheng Li, Xiang-Yang Jiang, Changjun Department of Computer Science Illinois Institute of Technology Chicago IL 60616 United States Department of Computer Science Tongji University Shanghai China Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai China

ISBN: (纸本)9780769543857

Radio frequency identification (RFID) is a technology where a reader device can "sense" the presence of a close by object by reading a tag device attached to the object. To guarantee the coverage quality, multiple RFID readers can be deployed in the given region. In this paper, we consider the problem of activation schedule for readers in a multi-reader environment. In particular, we try to design a schedule for readers to maximize the number of served tags per time-slot while avoiding various interferences. We first develop a centralized algorithm under the assumption that different readers may have different interference and interrogation radius. Next, we propose a novel algorithm which does not need any location information of the readers. Finally, we extend the previous algorithm in distributed manner in order to suit the case where no central entity exists. We conduct extensive simulations to study the performances of our proposed algorithm. And our evaluation results corroborate our theoretical analysis. © 2011 IEEE.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：