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

Wassim El-Masri

dblp:22/2202 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 1990
—ORCID · none

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

Artificial intelligence and machine learning · 2Graphics, computer vision, multimedia, augmented reality and games · 1

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
Image and video processing · 61% Geometric modeling and processing · 39%

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

TopicWeightPapersLastEvidence papers
Image and video processing
document image analysis
0.011990
A System for Interpretation of Line Drawings · IEEE Trans. Pattern Anal. Mach. Intell. 1990
Geometric modeling and processing › spatial reasoning › geometric reasoning
line drawing interpretation
0.011990
A System for Interpretation of Line Drawings · IEEE Trans. Pattern Anal. Mach. Intell. 1990
Image and video processing › document image analysis › page segmentation
text/graphics separation
0.011990
A System for Interpretation of Line Drawings · IEEE Trans. Pattern Anal. Mach. Intell. 1990
Geometric modeling and processing
shape analysis
0.011990
A System for Interpretation of Line Drawings · IEEE Trans. Pattern Anal. Mach. Intell. 1990

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

line segment analysis · 0.0hough transform · 0.0connected component analysis · 0.0
YearPublicationVenuePosition
1990 A System for Interpretation of Line Drawings
abstract
A system for interpretation of images of paper-based line drawings is described. Since a typical drawing contains both text strings and graphics, an algorithm has been developed to locate and separate text strings of various font sizes, styles, and orientations. This is accomplished by applying the Hough transform to the centroids of connected components in the image. The graphics in the segmented image are processed to represent thin entities by their core-lines and thick objects by their boundaries. The core-lines and boundaries are segmented into straight line segments and curved lines. The line segments and their interconnections are analyzed to locate minimum redundancy loops which are adequate to generate a succinct description of the graphics. Such a description includes the location and attributes of simple polygonal shapes, circles, and interconnecting lines, and a description of the spatial relationships and occlusions among them. Hatching and filling patterns are also identified. The performance of the system is evaluated using several test images, and the results are presented. The superiority of these algorithms in generating meaningful interpretations of graphics, compared to conventional data compression schemes, is clear from these results.>
Rangachar Kasturi, Sing T. Bow, Wassim El-Masri, Jayesh Shah, James R. Gattiker, Umesh B. Mokate
IEEE Trans. Pattern Anal. Mach. Intell.3
1988 A system for recognition and description of graphics
abstract
A system for automatic recognition and description of graphical primitives and their interconnections in a mixed text/graphics image is described. The input to the system is a high-resolution binary image obtained by scanning paper-based documents. The Hough transform is applied to the connected components of the image to locate and separate text strings of various font size and orientation. The graphics in the segmented image is processed to represent thin entities by their core lines and thick objects by their boundaries. Lines of various types are identified and segmented into straight line and curved line segments during this process. The line segments and their interconnections are analyzed to locate minimum redundancy loops which are adequate to generate a succinct description of the graphics. Various hatching and filling patterns in the image are identified and described. The algorithm has been implemented as software, and its robustness and performance have evaluated tested using a number of test images. The results for a simple test image are reported.>
Rangachar Kasturi, Sing T. Bow, James R. Gattiker, Jayesh Shah, Wassim El-Masri, Umesh B. Mokate, Suresh Honnenahalli
ICPR5