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

W. K. Gu

dblp:63/9374 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 1992
—ORCID · none

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

Artificial intelligence and machine learning · 3 · 3 first-authorGraphics, computer vision, multimedia, augmented reality and games · 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
2 papers
Geometric modeling and processing · 57% Image and video processing · 43%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%
Artificial intelligence
1 paper
Planning, search and constraint satisfaction · 100%

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

TopicWeightPapersLastEvidence papers
Image and video processing › feature extraction
line drawing extraction
0.011985
Connected Line Drawing Extraction from a Perspective View of a Polyhedron · IEEE Trans. Pattern Anal. Mach. Intell. 1985
Data mining
clustering
0.011987
Matching Perspective Views of a Polyhedron Using Circuits · IEEE Trans. Pattern Anal. Mach. Intell. 1987
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
heuristic search
0.011985
Connected Line Drawing Extraction from a Perspective View of a Polyhedron · IEEE Trans. Pattern Anal. Mach. Intell. 1985

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

clustering · 0.0boundary shape code · 0.0RLCC code · 0.0world model · 0.0heuristic search · 0.0corner detection · 0.0
YearPublicationVenuePosition
1992 A robust image processing approach used to ALV road following
abstract
A robust image processing approach used for ALV (autonomous land vehicle) road following is presented. The approach can cope with illumination variation, bad road surface condition such as shadows, defects, dirt and water stains. And it is effective for images of multi-branched road intersections. The approach consists of key techniques: color band automatic selection; adaptive road area segmentation; binary image post-processing and knowledge-based road trend line fitting. The approach is easy to implement in real time because its processing stages can be arranged into a pipeline. A set of experimental results is also presented.>
W. K. Gu
ICPR (1)1
1987 Matching Perspective Views of a Polyhedron Using Circuits
abstract
We present a novel approach for finding corresponding points between two line drawings extracted from perspective views of a moving object whose surface is composed of planar polygons. In our approach, each circuit of the drawings is encoded with a boundary shape code which we call the RLCC code (run length code of convex and concave strings), then a clustering technique is used to obtain the matching result recursively. A series of measures are taken to make the algorithm tolerate considerable dissimilarities which may exist between the two drawings, such as missing lines, scale differences, rotation, perspective shape distortions, etc. Experimental results are presented.
W. K. Gu, Thomas S. Huang
IEEE Trans. Pattern Anal. Mach. Intell.1
1985 Connected Line Drawing Extraction from a Perspective View of a Polyhedron
abstract
To extract line drawings with positional information from perspective veiws of three-dimensional objects is essential in image analysis and understanding. A new heuristic-search algorithm driven by a priori knowledge contained in a world model is presented which extracts a connected line drawing from a perspective view of a polyhedron. A main feature of our algorithm is that the search is concentrated on local areas centered at corners found with a corner finder. Therefore, the search time is significantly reduced and so are the positional errors in the extracted line drawing. An iterative process removes the false corners and lines and thus guarantees that our algorithm will work stably and reliably even in a noisy environment. Experimental results are presented.
W. K. Gu, Thomas S. Huang
IEEE Trans. Pattern Anal. Mach. Intell.1