Fuzzy morphisms between graphs
A Perchant, I Bloch - Fuzzy Sets and Systems, 2002 - Elsevier
A generic definition of fuzzy morphism between graphs (GFM) is introduced that includes
classical graph related problem definitions as sub-cases (such as graph and subgraph …
classical graph related problem definitions as sub-cases (such as graph and subgraph …
A new graph matching method for point-set correspondence using the EM algorithm and Softassign
Finding correspondences between two point-sets is a common step in many vision
applications (eg, image matching or shape retrieval). We present a graph matching method …
applications (eg, image matching or shape retrieval). We present a graph matching method …
A randomized heuristic for scene recognition by graph matching
We propose a new strategy for solving the non-bijective graph matching problem in model-
based pattern recognition. The search for the best correspondence between a model and an …
based pattern recognition. The search for the best correspondence between a model and an …
A genetic algorithm approach to Chinese handwriting normalization
DS Lin, JJ Leou - IEEE Transactions on Systems, Man, and …, 1997 - ieeexplore.ieee.org
Normalization can be used to absorb writing variations and distortions, simplify the
recognition processing steps, and improve the recognition rate of a Chinese handwriting …
recognition processing steps, and improve the recognition rate of a Chinese handwriting …
[PDF][PDF] Model-based scene recognition using graph fuzzy homomorphism solved by genetic algorithm
We present in this paper a new formalism for graph matching, based on fuzzy
homomorphism. The optimal solution is found by a genetic algorithm adapted to this …
homomorphism. The optimal solution is found by a genetic algorithm adapted to this …
Cooperation between branch and bound and evolutionary approaches to solve a bi-objective flow shop problem
Over the years, many techniques have been established to solve NP-Hard Optimization
Problems and in particular multiobjective problems. Each of them are efficient on several …
Problems and in particular multiobjective problems. Each of them are efficient on several …
A new definition for fuzzy attributed graph homomorphism with application to structural shape recognition in brain imaging
A Perchant, I Bloch - IMTC/99. Proceedings of the 16th IEEE …, 1999 - ieeexplore.ieee.org
We propose in this paper an original definition for fuzzy attributed graph homomorphism that
deals with both the structural aspect and the maximization of similarity between attributes …
deals with both the structural aspect and the maximization of similarity between attributes …
Stroke extraction for Chinese characters using a trend-followed transcribing technique
J Lin, CF Chen - Pattern recognition, 1996 - Elsevier
The merit of the stroke extraction algorithms which utilize the thinning process is the ease of
the feature abstracting from the skeleton of a character. The two main tasks for this kind of …
the feature abstracting from the skeleton of a character. The two main tasks for this kind of …
An experimental comparison of fingerprint classification methods using graphs
In this paper, an experimental comparison among three structural approaches to fingerprint
classification is reported. Main pros and cons of such approaches are investigated by …
classification is reported. Main pros and cons of such approaches are investigated by …
A neural network recognition system for handwritten Chinese character using structured approach
DS Yeung, HS Fong - Proceedings of 1994 IEEE International …, 1994 - ieeexplore.ieee.org
In this paper, a neural network based off-line recognition system for handwritten Chinese
characters is presented. Seventeen character categories are handled with a recognition rate …
characters is presented. Seventeen character categories are handled with a recognition rate …