Linear trace similarity matching based on improved longest common substring

2021 ◽  
pp. 1-7
Author(s):  
Chengjun Zhao ◽  
Nan Pan ◽  
Xuemei Jiang ◽  
Dilin Pan ◽  
Yi Liu
Keyword(s):  
Single Point ◽  
Cutting Tools ◽  
Dynamic Programming Algorithm ◽  
Three Dimensional ◽  
Morphological Structure ◽  
Programming Algorithm ◽  
Occurrence Rate ◽  
Similarity Matching ◽  
Longest Common Substring ◽  
Improved Dynamic Programming

The linear trace indicates the external morphological structure of the contact portion of clamping and cutting tools, which is not easy to be destroyed, has a high occurrence rate and high significant on identification. It is of great significance for prosecutor to determine the nature of the case and determine the tools used in the crime so as to find the criminals. The traditional linear trace analyzing methods include microscopy, manual comparison of characteristics, image recognition and three-dimensional scanning methods. The single-point laser picks up the toolmark detection signal, and the longest common substring is obtained after noise reduction. In addition, the improved dynamic programming algorithm calculates and generates matching results. Finally, the effectiveness of the algorithm is verified by the actual detection data.

Robot Path Planning and Obstacle Avoidance: A Design Optimization Approach

1989 ◽  
Author(s):  
E. Sandgren ◽  
S. Venkataraman
Keyword(s):  
Path Planning ◽  
Design Optimization ◽  
Dynamic Programming Algorithm ◽  
Three Dimensional ◽  
Programming Algorithm ◽  
Optimization Approach ◽  
Robot Arm ◽  
Robot Path Planning ◽  
Real Time Control ◽  
Robot Path

Abstract A design optimization approach to robot path planning in a two dimensional workplace is presented. Obstacles are represented as a series of rectangular regions and collision detection is performed by an operation similar to clipping in computer graphics. The feasible design space is approximated by a discrete set of robot arm and gripper positions. Control is applied directly through the angular motion of each link. Feasible positions which are located between the initial and final robot link positions are grouped into stages. A dynamic programming algorithm is applied to locate the best state within each stage which minimizes the overall path length. An example is presented involving a three link planar manipulator. Extensions to three dimensional robot path planning and real time control in a dynamically changing workplace are discussed.

An Improved Dynamic Programming Algorithm for Bitonic TSP

2013 ◽  
Vol 347-350 ◽  
pp. 3094-3098 ◽  
Author(s):  
Jian Li
Keyword(s):  
Dynamic Programming ◽  
Time Complexity ◽  
Dynamic Programming Algorithm ◽  
Space Complexity ◽  
Programming Algorithm ◽  
Time And Space ◽  
Space Requirement ◽  
Classical Algorithm ◽  
Computing Speed ◽  
Improved Dynamic Programming

This paper puts forward an improved dynamic programming algorithm for bitonic TSP and it proves to be correct. Divide the whole loop into right-and-left parts through analyzing the key point connecting to the last one directly; then construct a new optimal sub-structure and recursion. The time complexity of the new algorithm is O(n2) and the space complexity is O(n); while both the time and space complexities of the classical algorithm are O(n2). Experiment results showed that the new algorithm not only reduces the space requirement greatly but also increases the computing speed by 2-3 times compared with the classical algorithm.

Sign in / Sign up

Export Citation Format

Share Document