Inversion of Seabed Geotechnical Properties in the Arctic Chukchi Deep Sea Basin Based on Time Domain Adaptive Search Matching Algorithm

The chirp sub-bottom profiler,for its high resolution,easy accessibility and cost-effectiveness,has been widely used in acoustic detection.In this paper,the acoustic impedance and grain size compositions were obtained based on the chirp sub-bottom profiler data collected in the Chukchi Plateau area during the 11th Arctic Expedition of China.The time-domain adaptive search matching algorithm was used and validated on our established theoretical model.The misfit between the inversion result and the theoretical model is less than 0.067%.The grain size was calculated according to the empirical relationship between the acoustic impedance and the grain size of the sediment.The average acoustic impedance of sub-seafloor strata is 2.5026×10^(6) kg(s m^(2))^(-1)and the average grain size(θvalue)of the seafloor surface sediment is 7.1498,indicating the predominant occurrence of very fine silt sediment in the study area.Comparison of the inversion results and the laboratory measurements of nearby borehole samples shows that they are in general agreement.

GPS probe map matching algorithm based on spatial data model

To improve the performance of the traditional map matching algorithms in freeway traffic state monitoring systems using the low logging frequency GPS （global positioning system） probe data, a map matching algorithm based on the Oracle spatial data model is proposed. The algorithm uses the Oracle road network data model to analyze the spatial relationships between massive GPS positioning points and freeway networks, builds an N-shortest path algorithm to find reasonable candidate routes between GPS positioning points efficiently, and uses the fuzzy logic inference system to determine the final matched traveling route. According to the implementation with field data from Los Angeles, the computation speed of the algorithm is about 135 GPS positioning points per second and the accuracy is 98.9%. The results demonstrate the effectiveness and accuracy of the proposed algorithm for mapping massive GPS positioning data onto freeway networks with complex geometric characteristics.

Spectral matching algorithm based on nonsubsampled contourlet transform and scale-invariant feature transform

A new spectral matching algorithm is proposed by us- ing nonsubsampled contourlet transform and scale-invariant fea- ture transform. The nonsubsampled contourlet transform is used to decompose an image into a low frequency image and several high frequency images, and the scale-invariant feature transform is employed to extract feature points from the low frequency im- age. A proximity matrix is constructed for the feature points of two related images. By singular value decomposition of the proximity matrix, a matching matrix （or matching result） reflecting the match- ing degree among feature points is obtained. Experimental results indicate that the proposed algorithm can reduce time complexity and possess a higher accuracy.

A reliable algorithm for image matching based on SIFT

A novel algorithm is presented to make the results of image matching more reliable and accurate based on SIFT (Scale Invariant Feature Transform). SIFT algorithm has been identified as the most resistant matching algorithm to common image deformations; however, if there are similar regions in images, SIFT algorithm still generates some analogical descriptors and provides many mismatches. This paper examines the local image descriptor used by SIFT and presents a new algorithm by integrating SIFT with two-dimensional moment invariants and disparity gradient to improve the matching results. In the new algorithm, decision tree is used, and the whole matching process is divided into three levels with different primitives. Matching points are considered as correct ones only when they satisfy all the three similarity measurements. Experiment results demonstrate that the new approach is more reliable and accurate.

Adaptive impedance matching using quantum genetic algorithm

An adaptive technique adopting quantum genetic algorithm （QGA） for antenna impedance tuning is presented. Three examples are given with different types of antenna impedance. The frequency range of the dual standards is from 1.7 to 2.2 GHz. Simulation results show that the proposed tuning technique can achieve good accuracy of impedance matching and load power. The reflection coefficient and VSWR obtained are also very close to their ideal values. Comparison of the proposed QGA tuning method with conventional genetic algorithm based tuning method is Moreover, the proposed method can be useful for software wireless bands. also given, which shows that the QGA tuning algorithm is much faster. defined radio systems using a single antenna for multiple mobile and

Fast M-fold matching pursuit algorithm for image approximation

A simple and effective greedy algorithm for image approximation is proposed. Based on the matching pursuit approach, it is characterized by a reduced computational complexity benefiting from two major modifications. First, it iteratively finds an approximation by selecting M atoms instead of one at a time. Second, the inner product computations are confined within only a fraction of dictionary atoms at each iteration. The modifications are implemented very efficiently due to the spatial incoherence of the dictionary. Experimental results show that compared with full search matching pursuit, the proposed algorithm achieves a speed-up gain of 14.4-36.7 times while maintaining the approximation quality.

Speeded-Up Robust Feature Matching Algorithm Based on Image Improvement Technology

Due to requirements and necessities in digital image research, image matching is considered as a key, essential and complicating point especially for machine learning. According to its convenience and facility, the most applied algorithm for image feature point extraction and matching is Speeded-Up Robust Feature (SURF). The enhancement for scale invariant feature transform (SIFT) algorithm promotes the effectiveness of the algorithm as well as facilitates the possibility, while the application of the algorithm is being applied in a present time computer vision system. In this research work, the aim of SURF algorithm is to extract image features, and we have incorporated RANSAC algorithm to filter matching points. The images were juxtaposed and asserted experiments utilizing pertinent image improvement methods. The idea based on merging improvement technology through SURF algorithm is put forward to get better quality of feature points matching the efficiency and appropriate image improvement methods are adopted for different feature images which are compared and verified by experiments. Some results have been explained there which are the effects of lighting on the underexposed and overexposed images.

A Novel Symbolic Algorithm for Maximum Weighted Matching in Bipartite Graphs

The maximum weighted matching problem in bipartite graphs is one of the classic combinatorial optimization problems, and arises in many different applications. Ordered binary decision diagram (OBDD) or algebraic decision diagram (ADD) or variants thereof provides canonical forms to represent and manipulate Boolean functions and pseudo-Boolean functions efficiently. ADD and OBDD-based symbolic algorithms give improved results for large-scale combinatorial optimization problems by searching nodes and edges implicitly. We present novel symbolic ADD formulation and algorithm for maximum weighted matching in bipartite graphs. The symbolic algorithm implements the Hungarian algorithm in the context of ADD and OBDD formulation and manipulations. It begins by setting feasible labelings of nodes and then iterates through a sequence of phases. Each phase is divided into two stages. The first stage is building equality bipartite graphs, and the second one is finding maximum cardinality matching in equality bipartite graph. The second stage iterates through the following steps: greedily searching initial matching, building layered network, backward traversing node-disjoint augmenting paths, updating cardinality matching and building residual network. The symbolic algorithm does not require explicit enumeration of the nodes and edges, and therefore can handle many complex executions in each step. Simulation experiments indicate that symbolic algorithm is competitive with traditional algorithms.

A Multi-stage Heuristic Algorithm for Matching Problem in the Modified Miniload Automated Storage and Retrieval System of E-commerce

E-commerce, as an emerging marketing mode, has attracted more and more attention and gradually changed the way of our life. However, the existing layout of distribution centers can＇t fulfill the storage and picking demands of e-commerce sufficiently. In this paper, a modified miniload automated storage/retrieval system is designed to fit these new characteristics of e-commerce in logistics. Meanwhile, a matching problem, concerning with the improvement of picking efficiency in new system, is studied in this paper. The problem is how to reduce the travelling distance of totes between aisles and picking stations. A multi-stage heuristic algorithm is proposed based on statement and model of this problem. The main idea of this algorithm is, with some heuristic strategies based on similarity coefficients, minimizing the transportations of items which can not arrive in the destination picking stations just through direct conveyors. The experimental results based on the cases generated by computers show that the average reduced rate of indirect transport times can reach 14.36% with the application of multi-stage heuristic algorithm. For the cases from a real e-commerce distribution center, the order processing time can be reduced from 11.20 h to 10.06 h with the help of the modified system and the proposed algorithm. In summary, this research proposed a modified system and a multi-stage heuristic algorithm that can reduce the travelling distance of totes effectively and improve the whole performance of e-commerce distribution center.

Middle matching mining algorithm

A new algorithm for fast discovery of sequential patterns to solve the problems of too many candidate sets made by SPADE is presented, which is referred to as middle matching algorithm. Experiments on a large customer transaction database consisting of customer_id, transaction time, and transaction items demonstrate that the proposed algorithm performs better than SPADE attributed to its philosophy to generate a candidate set by matching two sequences in the middle place so as to reduce the number of the candidate sets.

Research on the Algorithm of Image Matching based on Improved SIFT

The paper analyze and improve the SIFT optimized algorithm, and proposes an image matching method for SIFT algorithm based on quasi Euclidean distance and KD-tree. Experiments show that this algorithm has matching more points, high matching accuracy, no repealed points and higher advantage of matching efficiency based on keeping the basic characteristics of SIFT algorithm unchanged, and provides precise matching point to generate precise image stitching and other related fields of the follow-up product. At the same time, this method was applied to the layout optimization and achieved good results.

Four Sliding Windows Pattern Matching Algorithm (FSW)

This paper presents an efficient pattern matching algorithm (FSW). FSW improves the searching process for a pattern in a text. It scans the text with the help of four sliding windows. The windows are equal to the length of the pattern, allowing multiple alignments in the searching process. The text is divided into two parts;each part is scanned from both sides simultaneously using two sliding windows. The four windows slide in parallel in both parts of the text. The comparisons done between the text and the pattern are done from both of the pattern sides in parallel. The conducted experiments show that FSW achieves the best overall results in the number of attempts and the number of character comparisons compared to the pattern matching algorithms: Two Sliding Windows (TSW), Enhanced Two Sliding Windows algorithm (ETSW) and Berry-Ravindran algorithm (BR). The best time case is calculated and found to be??while the average case time complexity is??.

Enhancing ERS-A Algorithm for Pattern Matching (EERS-A)

Pattern matching is a very important topic in computer science. It has been used in various applications such as information retrieval, virus scanning, DNA sequence analysis, data mining, machine learning, network security and pattern recognition. This paper has presented a new pattern matching algorithm—Enhanced ERS-A, which is an improvement over ERS-S algorithm. In ERS-A, two sliding windows are used to scan the text from the left and the right simultaneously. The proposed algorithm also scans the text from the left and the right simultaneously as well as making comparisons with the pattern from both sides simultaneously. The comparisons done between the text and the pattern are done from both sides in parallel. The shift technique used in the Enhanced ERS-A is the four consecutive characters in the text immediately following the pattern window. The experimental results show that the Enhanced ERS-A has enhanced the process of pattern matching by reducing the number of comparisons performed.

Research on the measurement of belt speed by video in coal mine based on improved template matching algorithm

In order to improve the intelligence of video monitoring system of belt and make up the deficiency of higher failure rate and bad real-time performance in the traditional systems of measurement of belt speed, according to the fact that the light of coal mine is uneven, the strength of light changes greatly, the direction of belt movement is constant, and the position of camera was fixed, various algorithms of speed measurement by video were studied, and algorithm for template matching based on sum of absolute differences （SAD） and correlation coefficient was proposed and improved, besides, the tracking of feature regions was realized. Then, a camera calibration method using the invariance of the cross-ratio was adopted and the real-time measurement of belt speed by the hardware platform based on DM642 was realized. Finally, experiment results show that this method not only has advantages of high precision and strong anti-jamming capability but also can real-time reflect the changes of belt speed, so it has a comprehensive applicability.

Adaptive Phase Matching in Grover’s Algorithm

When the Grover’s algorithm is applied to search an unordered database, the successful probability usually decreases with the increase of marked items. In order to solve this problem, an adaptive phase matching is proposed. With application of the new phase matching, when the fraction of marked items is greater , the successful probability is equal to 1 with at most two Grover iterations. The validity of the new phase matching is verified by a search example.

A Line-Surface Integrated Algorithm for Underwater Terrain Matching

The current underwater terrain surface matching algorithm,which uses Hu moment as the similarity index,cannot gain accurate location due to the algorithm’s disadvantage in detecting slight differences.To solve this problem,a line-surface integrated terrain matching algorithm is presented.First,the similarity evaluation method of the traditional Terrain Contour Matching(TERCOM)algorithm is improved,and the strategy used to select the matching regions is developed.Then,a surface matching algorithm based on the geometric similarity is established to determine the optimum match between the reference maps and the actual measured terrains.Finally,a means of“line matching algorithm”and“surface matching algorithm”integration is proposed based on a fixed threshold.The experimental results show that the proposed algorithm can obtain a more accurate location and has greater robustness than that of the surface underwater matching algorithm based on Hu moment.

Heterogeneous Task Allocation Model and Algorithm for Intelligent Connected Vehicles

With the development of vehicles towards intelligence and connectivity,vehicular data is diversifying and growing dramatically.A task allocation model and algorithm for heterogeneous Intelligent Connected Vehicle(ICV)applications are proposed for the dispersed computing network composed of heterogeneous task vehicles and Network Computing Points(NCPs).Considering the amount of task data and the idle resources of NCPs,a computing resource scheduling model for NCPs is established.Taking the heterogeneous task execution delay threshold as a constraint,the optimization problem is described as the problem of maximizing the utilization of computing resources by NCPs.The proposed problem is proven to be NP-hard by using the method of reduction to a 0-1 knapsack problem.A many-to-many matching algorithm based on resource preferences is proposed.The algorithm first establishes the mutual preference lists based on the adaptability of the task requirements and the resources provided by NCPs.This enables the filtering out of un-schedulable NCPs in the initial stage of matching,reducing the solution space dimension.To solve the matching problem between ICVs and NCPs,a new manyto-many matching algorithm is proposed to obtain a unique and stable optimal matching result.The simulation results demonstrate that the proposed scheme can improve the resource utilization of NCPs by an average of 9.6%compared to the reference scheme,and the total performance can be improved by up to 15.9%.

Fast Adaptive Support-Weight Stereo Matching Algorithm

Adaptive support-weight (ASW) stereo matching algorithm is widely used in the field of three-dimensional (3D) reconstruction owing to its relatively high matching accuracy. However, since all the weight coefficients need to be calculated in the whole disparity range for each pixel, the algorithm is extremely time-consuming. To solve this problem, a fast ASW algorithm is proposed using twice aggregation. First, a novel weight coefficient which adapts cosine function to satisfy the weight distribution discipline is proposed to accomplish the first cost aggregation. Then, the disparity range is divided into several sub-ranges and local optimal disparities are selected from each of them. For each pixel, only the ASW at the location of local optimal disparities is calculated, and thus, the complexity of the algorithm is greatly reduced. Experimental results show that the proposed algorithm can reduce the amount of calculation by 70% and improve the matching accuracy by 6% for the 15 images on Middlebury Website on average. © 2017, Tianjin University and Springer-Verlag Berlin Heidelberg.

An Algorithm for the Optimal Matching Speeds of Pass enger and Freight Trains in Mixed Operations

This paper models the calculation of the optimal matching speeds of passenger and freight trains with various stage control methods for speed in mixed operations, presents a algorithm for the solution and justifies it with a practical example.

A new parallel algorithm for image matching based on entropy

Presents a new parallel image matching algorithm based on the concept of entropy feature vector and suitable to SIMD computer, which, in comparison with other algorithms, has the following advantages:(1)The spatial information of an image is appropriately introduced into the definition of image entropy. (2) A large number of multiplication operations are eliminated, thus the algorithm is sped up. (3) The shortcoming of having to do global calculation in the first instance is overcome, and concludes the algorithm has very good locality and is suitable for parallel processing.