Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

T. W. Sze

dblp:69/3403 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 2003
—ORCID · none

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

Artificial intelligence and machine learning · 3 · 1 first-authorSystems, architecture and hardware · 1Theory of computation · 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.

Network and information security
1 paper
Cryptographic primitives and cryptanalysis · 100%
Computer graphics and multimedia
2 papers
Geometric modeling and processing · 100%
Artificial intelligence
1 paper
Image recognition and object detection · 100%

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

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › message authentication codes
cartesian authentication codes
0.012003
Logarithm cartesian authentication codes · Inf. Comput. 2003
Cryptographic primitives and cryptanalysis
message authentication codes
0.012003
Logarithm cartesian authentication codes · Inf. Comput. 2003
Computer vision › Image recognition and object detection › attribute recognition
surface recognition
0.011988
Matching of developable surfaces · ICRA 1988
Geometric modeling and processing › shape matching
contour matching
0.011981
A Simple Contour Matching Algorithm · IEEE Trans. Pattern Anal. Mach. Intell. 1981
Geometric modeling and processing
shape analysis
0.011981
A Simple Contour Matching Algorithm · IEEE Trans. Pattern Anal. Mach. Intell. 1981
Algorithms and data structures › sequence algorithms
string algorithms
0.011981
A Simple Contour Matching Algorithm · IEEE Trans. Pattern Anal. Mach. Intell. 1981

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

logarithmic constructions · 0.0line-of-curvature description · 0.0gaussian sphere matching · 0.0string matching · 0.0
YearPublicationVenuePosition
2003 Logarithm cartesian authentication codes
T. W. Sze, Samuel T. Chanson, Cunsheng Ding, Tor Helleseth, Matthew Geoffrey Parker
Inf. Comput.1
2001 The image moment method for the limited range CT image reconstruction and pattern recognition
Tian J. Wang, T. W. Sze
Pattern Recognit.2
1988 Matching of developable surfaces
abstract
A matching algorithm is presented for the recognition of an important class of surfaces called the developable surface. Such a surface is represented by a line-of-curvature description (LCD). The algorithm matches the LCD of an unknown surface and those of model surfaces on the Gaussian sphere to determine the corresponding model surface of the unknown. This matching scheme is capable of recognizing a developable surface not only when it is identical to a model surface, but also when it has different attitude and scale from and/or is only a part of the corresponding model.>
H. Q. Lu, T. W. Sze
ICRA2
1981 A Simple Contour Matching Algorithm
abstract
Two similarity measures between strings are proposed. This correspondence also describes an experiment performed to illustrate the inadequacy of a commonly used measure.
T. W. Sze, Y. H. Yang
IEEE Trans. Pattern Anal. Mach. Intell.1