Sharif Digital Repository

Given a point set S and a polygonal curve P in Rd, we study the problem of finding a polygonal curve through S, which has minimum Fréchet distance to P. We present an efficient algorithm to solve the decision version of this problem in O(nk2) time, where n and k represent the sizes of P and S, respectively. A curve minimizing the Fréchet distance can be computed in O(nk2 log(nk)) time. As a by-product, we improve the map matching algorithm of Alt et al. by an O(log k) factor for the case when the map is a complete grap  

In order to improve the performance of feature-based template matching techniques, several research papers have been published. Real-time applications require the computational complexity of keypoint matching algorithms to be as low as possible. In this paper, we propose a method to improve the keypoint detection stage of feature-based template matching algorithms. Our experiment results show that the proposed method outperforms keypoint matching techniques in terms of speed, keypoint stability and repeatability  

We revisit the problem of deciding whether a given curve resembles some part of a larger curve under a fixed Fréchet distance, achieving a running time of O(nm), for n and m being the number of segments in the two curves. This improves the long-standing result of Alt and Godau by an O(log(nm)) factor. Our solution is based on constructing a simple data structure which we call free-space map. Using this data structure, we obtain improved algorithms for several variants of the Fréchet distance problem, including the Fréchet distance between two closed curves, and the so-called minimum/maximum walk problems. We also improve the map matching algorithm of Alt et al. for the particular case in... 

Back in 1995, Alt and Godau gave an efficient algorithm for deciding whether a given curve resembles some part of a larger curve under a fixed Fréchet distance, achieving a running time of O(nm log(nm)), for n and m being the number of segments in the two curves, respectively. We improve this long-standing result by presenting an algorithm that solves this decision problem in O(nm) time. Our solution is based on constructing a simple data structure which we call free-space map. Using this data structure, we obtain improved algorithms for several variants of the Fréchet distance problem, including the Fréchet distance between two closed curves, and the so-called minimum/maximum walk problems.... 

Consider a collection of files, each of which is a sequence of letters. One of these files is randomly chosen and a random subsequence of the file is revealed. This random subsequence can be the result of a random sampling of the file. The goal is to recover the identity of the file, assuming a simple greedy matching algorithm to search the file collection. We study the fundamental limits on the maximum size of the file collection for reliable recovery in terms of the length of the random subsequence. The sequence of each file is assumed to follow a hidden Markov model (HMM), which is a common model for many data structures such as voice or DNA sequences. The connection between this problem... 

Cloud Manufacturing (CM) as a successful manufacturing business model and a major driver of Industry 4.0 has attracted a lot of attention in recent years. CM idea aims to streamline the on-demand provisioning of manufacturing resources and capabilities as services, providing end-users with flexible and scalable services accessible through global networks. This idea created many opportunities and challenges. One of the critical challenges is resource allocation, which determines who interacts with whom and how in the CM platform. The type of the platform is a determining factor for the selection of the appropriate resource allocation. To analyze the impact of the allocation on the utilities,... 

Error concealment is a useful method for improving the damaged video quality in the decoder side. In this paper, a dynamic method with low computational complexity is presented to improve the visual quality of videos when up to 50% of the frames are damaged. In the proposed method, temporal replacement and the improved outer boundary matching algorithm are used for dynamical error concealment in inter-frames of videos. With the use of motion vectors (MVs) which are close to the damaged macroblock (MB) the method can determine whether the motion in specific areas is either regular, irregular, or zero. Then, based on this knowledge, different methods are performed. It adaptively selects a set... 

In this paper, we study the resource allocation and scheduling problem for a downlink non- orthogonal multiple access (NOMA) network where the base station (BS) allocates the spectrum resources and power to the set of users. We aim to optimize the sub-channel assignment and power allocation to achieve a balance between the number of scheduled users and total sum-rate maximization. To solve the above problem, we propose a many-to-many two-sided user-subchannel matching algorithm in which the set of users and sub-channels are considered as two sets of players pursuing their own interests. The algorithm converges to a pair-wise stable matching after a limited number of iterations. Simulation... 

Patterns on proteins and genomic sequences are vastly analyzed, extracted and collected in databases. Although protein patterns originate from genomic coding regions, very few works have directly or indirectly dealt with coding region patterns induced from protein patterns. Results: In this paper, we have defined a new genomic pattern structure suitable for representing induced patterns from proteins. The provided pattern structure, which is called "Consecutive Positions Scoring Matrix (CPSSM)", is a replacement for protein patterns and profiles in the genomic context. CPSSMs can be identified, discovered, and searched in genomes. Then, we have presented a novel pattern matching algorithm... 

This paper introduces a quantization noise robust algorithm for object's shape prediction in a video sequence. The algorithm is based on pixel representation in the undecimated wavelet domain for tracking of the user-defined shapes contaminated by the compression noise of video sequences. In the proposed algorithm, the amplitude of coefficients in the best basis tree expansion of the undecimated wavelet packet transform is used as feature vectors (FVs). FVs robustness against quantization noise has been achieved through inherent denoising and edge component separation in the best basis selection algorithm. The algorithm uses these FVs to track the pixels of small square blocks located at the...