An improved adaptive genetic algorithm for image segmentation and vision alignment used in microelectronic bonding
In order to improve the precision and efficiency of microelectronic bonding, this paper
presents an improved adaptive genetic algorithm (IAGA) for the image segmentation and …
presents an improved adaptive genetic algorithm (IAGA) for the image segmentation and …
Deterministic Sparse Pattern Matching via the Baur-Strassen Theorem
N Fischer - Proceedings of the 2024 Annual ACM-SIAM …, 2024 - SIAM
How fast can you test whether a constellation of stars appears in the night sky? This
question can be modeled as the computational problem of testing whether a set of points P …
question can be modeled as the computational problem of testing whether a set of points P …
Geometric Pattern Matching Reduces to k-SUM
We prove that some exact geometric pattern matching problems reduce in linear time to k-
SUM when the pattern has a fixed size k. This holds in the real RAM model for searching for …
SUM when the pattern has a fixed size k. This holds in the real RAM model for searching for …
Point pattern matching algorithm for planar point sets under Euclidean transform
X Wang, X Zhang - Journal of Applied Mathematics, 2012 - Wiley Online Library
Point pattern matching is an important topic of computer vision and pattern recognition. In
this paper, we propose a point pattern matching algorithm for two planar point sets under …
this paper, we propose a point pattern matching algorithm for two planar point sets under …
Chaotic mutated bat algorithm optimized edge potential function for target matching
Y Deng, H Duan - 2015 IEEE 10th Conference on Industrial …, 2015 - ieeexplore.ieee.org
In this paper, we present a novel edge based matching approach to target recognition. To
recognize the marker on a rotorcraft, a chaotic mutated bat algorithm optimized edge …
recognize the marker on a rotorcraft, a chaotic mutated bat algorithm optimized edge …
Morphological analysis and feature extraction of neurons from mouse cortices multiscale 3D microscopic images
A Zubiolo, K Harb, M Studer… - 2015 37th Annual …, 2015 - ieeexplore.ieee.org
In this paper, we propose a framework to analyze the morphology of mouse neurons in the
layer V of the cortex from 3D microscopic images. We are given 8 sets of images, each of …
layer V of the cortex from 3D microscopic images. We are given 8 sets of images, each of …
Projective contour point matching using FPI, GRA and PSO
Q Wang, X Liu, G Wang, G Zhang, Y Cai - 2012 - IET
The contour point set is a very important feature for an object image. Finding the
correspondences between two sets of contour points is a difficult task, especially under …
correspondences between two sets of contour points is a difficult task, especially under …
Circle-Point Containment, Monte Carlo Method for Shape Matching Based on Feature Points Using the Technique of Sparse Uniform Grids
Shape matching using their critical feature points is useful in mechanical processes such as
precision measure of manufactured parts and automatic assembly of parts. In this paper, we …
precision measure of manufactured parts and automatic assembly of parts. In this paper, we …
A GPU-based algorithm for approximately finding the largest common point set in the plane under similarity transformation
We consider the following geometric pattern matching problem: Given two sets of points in
the plane, P and Q, and some (arbitrary) δ> 0, find the largest subset B⊂ P and a similarity …
the plane, P and Q, and some (arbitrary) δ> 0, find the largest subset B⊂ P and a similarity …
Efficient point pattern matching algorithm for planar point sets under transform of translation, rotation and scale
Point pattern matching is an important topic in computer vision and pattern recognition, and
finds many applications such as image registration, motion detection, object tracking and …
finds many applications such as image registration, motion detection, object tracking and …