Stereo Matching of Planar Curves Composed of Time Stamped Points

Matching features such as curve segments in stereo images play a very important role in scene recomtruction. In this paper, a stereo matching algorithm for the trajectories composed of time stamped points is proposed. Based on time stamped points, planar curve match measurements are given first, such as time constraint, cross-ratio invariant constraint and eplpolar geometry constraint; then, a trajectory matching method is proposed based on epipolar geometry constraint and cross-ratio invariant constraint. In order to match the planar curve segments projected by perspective projection system, the curve start time and end time are selected first to prepare match candidates. Then, the epipolar equation is used to discard the unmatched curve segment candidates. At last, a cross ratio invariant constxaint is used to find the most matched curve segments. If their match measurement is higher than the specialized threshold, a candidate with the least cross ratio difference is then selected as the match result; otherwise, no match is found. Unlike the conventional planar curve segments matching algorithm, this paper presents a weakly calibrated binocular stereo vision system which is based on wide baseline. The stamped points are obtained by targets detecting method of flying objects from image sequences. Due to wide baseline, there must exist the projection not in epipolar monotonic order or the curve segments located in very short distance and keeping the epipolar monotonic order. By using the method mentioned above, experiments are made to match planar curve segments not only in epipolar monotonic order but also not in epipolar monotonic order. The results show that the performance of our curve matching algorithm is effective for matching the arc-like planar trajectories composed of time stamped points.

Sharing of Encrypted Lock Keys in the Blockchain-Based Renting House System from Time- and Identity-Based Proxy Reencryption

To design an efficient protocol for sharing the encrypted lock keys in the renting house system,we introduce a new notion called time-and identitybased proxy reencryption(TIPRE)and the blockchain platform.Our CPA secure TIPRE scheme is constructed from Green et al.’s identity-based proxy reencryption scheme by adding the time property.In every time period,a time stamp authority generates a public key embedded with the current time stamp for each user.In our protocol for the renting house system,the TIPRE scheme is the primary building block,and the blockchain platform serves instead of a trusted third party,such as a real estate agency between landlords and tenants.The TIPRE scheme allows the landlord to change the lock key at each time period for safety.The blockchain platform allows the landlords and tenants to directly interact,and all of the interactions are recorded in the blockchain database to provide the desired security requirements,such as nonrepudiation and unforgeability.Finally,we provide the secure analysis of our protocol and test its performance by implementing it in the MacBook Pro and the Intel Edison development platforms.

An Efficient Approach for Historical Storage and Retrieval of Segmented Road Data in Geographic Information System for Transportation

One of the most powerful functions of Geographic Information System for Transportation (GIS-T) is Dynamic Segmentation (DS), which is used to increase the efficiency and precision of road management by generating segments based on attributes. The road segments describing transportation data are both spatially and temporally referenced. For a variety of transportation applications, historical road segments must be preserved. This study presents an appropriate approach to preserve and retrieve the historical road segments efficiently. In the proposed method, only the portions of segments of a time stamp that have been changed into new segments rather than storing the entire segments for every old time stamp are recorded .The storage of these portions is based on the type of changes. A recursive algorithm is developed to retrieve all segments for every old time stamp. Experimental results using real data of Tehran City, Iran justify the strength of the proposed approach in many aspects. An important achievement of the results is that database volume for 2006, 2007 and 2008 within the Historical Line Event Table (HLET) is reduced by 70%, 80% and 78%, respectively. The proposed method has the potential to prevent from vast data redundancy and the unnecessary storage of entire segments for each time stamp. Since the present technique is performed on ordinary plain tables that are readable by all GIS software, special software platforms to manage the storage and retrieval of historical segments are not needed. In addition, this method simplifies spatio-temporal queries.