No abstract

No abstract

Given a set of moving objects as well as their friend relationships, a time-aware road network, and a time threshold per friend pair, the proximity detection problem in time-aware road networks is to find each pair of moving objects such that the time distance (defined as the shortest time needed for two moving objects to meet each other) between them is within the given threshold. The problem of proximity detection is often encountered in autonomous driving and traffic safety related applications, which require low-latency, real time proximity detection with relatively low communication cost. However, (i) most existing proximity detection solutions focus on the Euclidean space which cannot be used in road network space, (ii) the solutions for road networks focus on static road networks and do not consider time distance and thus cannot be applied in time-aware road networks, and (iii) there are no works aiming to simultaneously reduce the communication cost, the communication latency, and computational cost. Motivated by these, we first design a low-latency proximity detection architecture based on Mobile Edge Computing (MEC) with the purpose of achieving low communication latency, then propose a proximity detection method including a client-side algorithm and a server-side algorithm, aiming at reducing the communication cost, and subsequently propose server-side computational cost optimization techniques to reduce the computational cost. Experimental results show that our MEC enhanced proximity detection architecture, our proximity detection method, and the server-side computational cost optimization techniques can reduce the communication latency, the communication cost, and the computational cost effectively. INDEX TERMS Cost optimization, low latency, mobile edge computing, proximity detection, time-aware road networks, time distance.

No abstract

No abstract

No abstract

No abstract

Image deformation has ubiquitous usage in multimedia applications. It morphs one image into another through a seamless transition. Existing techniques either mainly focus on the correspondence mapping of interior features of the objects in two images, without considering object contours, or sketch contours manually, resulting in tedious work for users. Thus, we propose a 2D image deformation method, which extracts object contours automatically, considers both inner features and contours as constraints and preserves image features in terms of visual importance. Our method first automatically extracts the object contours in the source and target images and then allows users to sketch some interior features in both the images. Then, our method tessellates two images to generate two triangular meshes and builds a guaranteed bijective mesh mapping between them. We also prove the bijectivity of our mesh mapping and discuss its other desirable properties. Then, our method generates the intermediate images between the source and target images by calculating the intermediate meshes and pixels of each intermediate image. Our method realizes automatic contour extraction, provides an intuitive user interface and utilizes harmonic maps to establish a bijective mesh mapping. Therefore, it preserves more significant features with less distortion and works well for many image deformation cases in real time. INDEX TERMS 2D image deformation/morphing, automatic contour exaction, Delaunay triangulation, harmonic map.