Hou-Yuan F. Feng

dblp:46/621 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1975
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
1 paper
Geometric modeling and processing · 100%
Artificial intelligence
1 paper
Image recognition and object detection · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Geometric modeling and processing › computational geometry
polygon decomposition
0.011975
Decomposition of Polygons Into Simpler Components: Feature Generation for Syntactic Pattern Recognition · IEEE Trans. Computers 1975
Geometric modeling and processing
shape decomposition
0.011975
Decomposition of Polygons Into Simpler Components: Feature Generation for Syntactic Pattern Recognition · IEEE Trans. Computers 1975
Computer vision › Image recognition and object detection › structural pattern recognition
syntactic pattern recognition
0.011975
Decomposition of Polygons Into Simpler Components: Feature Generation for Syntactic Pattern Recognition · IEEE Trans. Computers 1975

Methods — techniques the papers use, named apart from their topics

fuzzy predicates · 0.0
YearPublicationVenuePosition
1975 Decomposition of Polygons Into Simpler Components: Feature Generation for Syntactic Pattern Recognition
abstract
A technique for decomposition of polygons into simpler components is described and illustrated with applications in the analysis of handwritten Chinese characters and chromosomes. Polygonal approximations of such objects are obtained by methods described in the literature and then parts of their concave angles are examined recursively for separating convex or other simple shape components. Further decomposition of the latter is possible. The final result can be expressed as a labeled graph and processed further through the introduction of either fuzzy predicates or syntactic pattern recognition techniques.
Hou-Yuan F. Feng, Theodosios Pavlidis
IEEE Trans. Computers1