HYPER: A New Approach for the Recognition and Positioning of Two-Dimensional Objects
IEEE Transactions on Pattern Analysis and Machine Intelligence
Two-dimensional, model-based, boundary matching using footprints
International Journal of Robotics Research
International Journal of Robotics Research
Solving jigsaw puzzles by computer
Annals of Operations Research
A Space-Economical Suffix Tree Construction Algorithm
Journal of the ACM (JACM)
Piecewise-linear interpolation between polygonal slices
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Local Invariants For Recognition
IEEE Transactions on Pattern Analysis and Machine Intelligence
IEEE Transactions on Pattern Analysis and Machine Intelligence
Partial Surface and Volume Matching in Three Dimensions
IEEE Transactions on Pattern Analysis and Machine Intelligence
Multiresolution banded refinement to accelerate surface reconstruction from polygons
Proceedings of the fourteenth annual symposium on Computational geometry
Bias Error Analysis of the Generalised Hough Transform
Journal of Mathematical Imaging and Vision
SnakeToonz: a semi-automatic approach to creating cel animation from video
NPAR '02 Proceedings of the 2nd international symposium on Non-photorealistic animation and rendering
A global approach to automatic solution of jigsaw puzzles
Proceedings of the eighteenth annual symposium on Computational geometry
On the Recognition and Location of Partially Occluded Objects
Journal of Intelligent and Robotic Systems
Using Geometric Hashing To Repair CAD Objects
IEEE Computational Science & Engineering
Image Map Correspondence for Mobile Robot Self-Location Using Computer Graphics
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Multiscale Method for the Reassembly of Two-Dimensional Fragmented Objects
IEEE Transactions on Pattern Analysis and Machine Intelligence
Alignment-Based Recognition of Shape Outlines
IWVF-4 Proceedings of the 4th International Workshop on Visual Form
A global approach to automatic solution of jigsaw puzzles
Computational Geometry: Theory and Applications - Special issue on the 18th annual symposium on computational geometry—SoCG2002
Measuring the Information Content of Fracture Lines
International Journal of Computer Vision
The influence of perceptual grouping on motion detection
Computer Vision and Image Understanding
Integral Invariants for Shape Matching
IEEE Transactions on Pattern Analysis and Machine Intelligence
Fingerprint matching using ridges
Pattern Recognition
A fast evaluation criterion for the recognition of occluded shapes
Robotics and Autonomous Systems
Kernel PCA for similarity invariant shape recognition
Neurocomputing
Globally Consistent Reconstruction of Ripped-Up Documents
IEEE Transactions on Pattern Analysis and Machine Intelligence
Boundary Shape Recognition Using Accumulated Length and Angle Information
IbPRIA '07 Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part II
Curve matching for open 2D curves
Pattern Recognition Letters
Crazy Cuts: Dissecting Planar Shapes into Two Identical Parts
Proceedings of the 13th IMA International Conference on Mathematics of Surfaces XIII
The influence of perceptual grouping on motion detection
Computer Vision and Image Understanding
A recovery system of broken relics using least squares fitting and vector similarity techniques
Expert Systems with Applications: An International Journal
Continuous curve matching with scale-space curvature and extrema-based scale selection
Scale Space'03 Proceedings of the 4th international conference on Scale space methods in computer vision
Automatic color based reassembly of fragmented images and paintings
IEEE Transactions on Image Processing
A new technique for solving puzzles
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics - Special issue on game theory
Piecewise approximation of contours through scale-space selection of dominant points
IEEE Transactions on Image Processing
A contour matching algorithm to reconstruct ruptured documents
Proceedings of the 32nd DAGM conference on Pattern recognition
Moving edge segment matching for the detection of moving object
ICIAR'11 Proceedings of the 8th international conference on Image analysis and recognition - Volume Part I
An innovative algorithm for solving jigsaw puzzles using geometrical and color features
CIARP'05 Proceedings of the 10th Iberoamerican Congress conference on Progress in Pattern Recognition, Image Analysis and Applications
Two-Dimensional discrete shape matching and recognition
IWCIA'06 Proceedings of the 11th international conference on Combinatorial Image Analysis
An expert system for recovering broken relics using 3-d information
AI'06 Proceedings of the 19th Australian joint conference on Artificial Intelligence: advances in Artificial Intelligence
Outline matching of the 2d shapes using extracting XML data
ICISP'12 Proceedings of the 5th international conference on Image and Signal Processing
A texture based approach to reconstruction of archaeological finds
VAST'05 Proceedings of the 6th International conference on Virtual Reality, Archaeology and Intelligent Cultural Heritage
An environment for the analysis and reconstruction of archaeological objects
VAST'04 Proceedings of the 5th International conference on Virtual Reality, Archaeology and Intelligent Cultural Heritage
Reassembling thin artifacts of unknown geometry
VAST'11 Proceedings of the 12th International conference on Virtual Reality, Archaeology and Cultural Heritage
A re-assembling scheme of fragmented Mokkan images
Proceedings of the 2nd International Workshop on Historical Document Imaging and Processing
Shape similarity by homotopic deformation
The Visual Computer: International Journal of Computer Graphics
| Hi-index | 0.15 |
Two algorithms to find the longest common subcurve of two 2D curves are presented. These algorithms are based on conversion of the curves into shape signature strings and application of string matching techniques to find long matching substrings, followed by direct curve matching of the corresponding candidate subcurves to find the longest matching subcurve. The first algorithm is of complexity O(n), where n is the number of sample points on the curves. The second one, while being theoretically somewhat less efficient, proved to be robust and efficient in practical applications. Both algorithms solve the problem of general curves without being dependent on some set of special points on the curves. The algorithms have industrial applications to problems of object assembly and object recognition. Experimental results are included. The algorithms can be easily extended to the 3D case.