Fast algorithm on string cross pattern matching

Given a set U which is consisted of strings defined on alphabet Σ, string cross pattern matching is to find all the matches between every two strings in U. It is utilized in text processing like removing the duplication of strings. This paper presents a fast string cross pattern matching algorithm based on extracting high frequency strings. Compared with existing algorithms including single-pattern algorithms and multi-pattern matching algorithms, this algorithm is featured by both low time complexity and low space complexity. Because Chinese alphabet is large and the average length of Chinese words is much short, this algorithm is more suitable to process the text written by Chinese, especially when the size of Σ is large and the number of strings is far more than the maximum length of strings of set U.

A Novel Method for Multi-image Matching Synthesizing Image and Object-space Information

A novel method for multi-image matching by synthesizing image and object-space information is proposed. Firstly, four levels of image pyramids are generated according to the rule that the next pyramid level is generated from the previous level using the average gray values of the 3 by 3 pixels, and the first level of pyramid image is generated from the original image. The initial horizontal parallaxes between the reference image and each searching image are calculated at the highest level of the image pyramid. Secondly, corresponding image points are searched in each stereo image pair from the third level of image pyramid, and the matching results in all stereo pairs are integrated in the object space, by which the mismatched image points can be eliminated and more accurate spatial information can be obtained for the subsequent pyramid image matching. The matching method based on correlation coefficient with geometric constraints and global relaxation matching is introduced in the process of image matching. Finally, the feasibility of the method proposed in this paper is verified by the experiments using a set of digital frame aerial images with big overlap. Compared with the traditional image matching method with two images, the accuracy of the digital surface model (DSM) generated using the proposed method shows that the multiimage matching method can eliminate the mismatched points effectively and can improve the matching success rate significantly.

A vehicle re-identification algorithm based on multi-sensor correlation

Magnetic sensors can be applied in vehicle recognition.Most of the existing vehicle recognition algorithms use one sensor node to measure a vehicle’s signature.However,vehicle speed variation and environmental disturbances usually cause errors during such a process.In this paper we propose a method using multiple sensor nodes to accomplish vehicle recognition.Based on the matching result of one vehicle’s signature obtained by different nodes,this method determines vehicle status and corrects signature segmentation.The co-relationship between signatures is also obtained,and the time offset is corrected by such a co-relationship.The corrected signatures are fused via maximum likelihood estimation,so as to obtain more accurate vehicle signatures.Examples show that the proposed algorithm can provide input parameters with higher accuracy.It improves the average accuracy of vehicle recognition from 94.0%to 96.1%,and especially the bus recognition accuracy from 77.6%to 92.8%.

Inhomogeneous lens antenna design with fan-beam radiation pattern

This Letter presents an original technique to design and synthesize an inhomogeneous asymmetrical lens resulting in a special fan-beam radiation pattern in a wide frequency bandwidth. The vertical and horizontal planes of the fan-beam radiation pattern can be determined separately. Wide angle search and detection are achievable by using this type of lens antenna because of its suitable radiation pattern. The proposed relative index profile is validated by the means of commercial CST software and an FDTD scheme.