Yasser Abd El-Latif

Yasser Abd El-Latif
Ain Shams University · Department of Mathematics (Computer Science Division)

PhD

About

26
Publications
5,042
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
56
Citations
Additional affiliations
December 1993 - present
Ain Shams University
Position
  • Professor (Associate)

Publications

Publications (26)
Article
Recently, the Iris Recognition system has been considered an effective biometric model for recognizing humans. This paper introduces an effective hybrid technique combining edge detection and segmentation, in addition to the convolutional neural network (CNN) and Hamming Distance (HD), for extracting features and classification. The proposed model...
Article
Full-text available
Plant diseases enormously affect the agricultural crop production and quality with huge economic losses to the farmers and the country. This in turn increases the market price of crops and food, which increase the purchase burden of customers. Therefore, early identification and diagnosis of plant diseases at every stage of plant life cycle is a ve...
Article
Full-text available
Leaf recognition is used in various applications in domains like agriculture, forest, biodiversity protection. Leaf recognition based on images is a challenging task for computer, due to the appearance and complex structure of leaves, high variability between classes, and small differences between leaves in the same class. This paper reviews a stat...
Article
Full-text available
Free-hand sketching is commonly used for communications by humans as a simple, yet powerful, tool. Sketch recognition aims to classify hand-drawn sketches by machines into known categories. This is currently important, particularly because of recent advances in human computer interactions via portable devices. In this paper, we present and explain...
Article
Full-text available
Automatic leaf recognition via image processing has been greatly important for a number of professionals, such as botanical taxonomic, environmental protectors, and foresters. Learn an over-complete leaf dictionary is an essential step for leaf image recognition. Big leaf images dimensions and training images number is facing of fast and complete d...
Article
Full-text available
In the set cover problem (SCP), a set of elements \({X = \{x_{1}, x_{2}, \ldots, x_{n}\}}\) and a collection \({F = \{S_{1}, S_{2}, \ldots, S_{m}\}}\) of subsets of X, for some integers \({n, m \geq 1}\), are given. In addition, each element of \({X}\) belongs to at least one member of F. The problem is to find a sub-collection \({C \subseteq F}\)...
Article
Full-text available
Bioinformatics has been regarded as one of the rapidly-evolving fields with enormous impact on the history of life and biomedical sciences. It is an interdisciplinary science that integrates life sciences, mathematics and computer science in order to extract meaningful biological insights from large data sets of raw DNA and protein sequences. Our o...
Article
Full-text available
This paper presents a hybrid algorithm that combines features form both Sqrt(3) and Loop Subdivision schemes. The algorithm aims at preserving sharp features and trim regions, during the surfaces subdivision, using a set of rules. The implementation is nontrivial due to the computational, topological, and smoothness constraints, which should be sat...
Article
Full-text available
In the approximate Euclidean min-weighted perfect matching problem, a set of points in the plane and a real number are given. Usually, a solution of this problem is a partition of points of into pairs such that the sum of the distances between the paired points is at most times the optimal solution. In this paper, the authors give a randomized algo...
Article
Full-text available
In the approximate Euclidean min-weighted perfect matching problem, a set V of n 2 points in the plane and a real number 0   are given. Usually, a solution of this problem is a partition of points of V into n pairs such that the sum of the distances between the paired points is at most) 1 (  times the optimal solution. In this paper, the author...
Article
Full-text available
This paper proposes a new model for the shapes and details of simple and compound leaves in plants. The layout of leaf is modeled via branching structure generated using B-Splines. The proposed model controls the relationships that govern the shape through the marginal and venation of the considered simple leaf or leaflet. The developed algorithm s...
Article
Full-text available
One of the important open problems in modeling plants is the extension of subdivision algorithms to branching structures. Most of the applications use the concept of L-system to produce branching structures as a sequence of lines and apply the subdivision scheme to appear as curves. In this paper, we explain how L-systems can be modified to produce...
Article
Full-text available
Efficient 3D mesh compression algorithms have been in high demand in the past few years to reduce the storage room needed for large detailed 3D models. In this paper we present simple, linear and efficient algorithms for compressing connectivity of triangular/quadrilateral meshes that contain boundary and/or holes. The algorithms presented are gene...
Conference Paper
Full-text available
In this paper we present an efficient face-based connectivity coding technique for the special class of quadrilateral and the hybrid triangular-quadrilateral meshes. This work extends the main ideas of non-split encoding presented by the first contribution of the authors (Khattab, Abd El-Latif, Abdel Wahab and Tolba, 2007) for triangle meshes and i...
Conference Paper
Full-text available
Compression of digital geometry models is the answer to an industrial demand. Over the last years, many exciting ideas and new theoretical insights have been devoted to finding ways of reducing the amount of storage such models absorb. EdgeBreaker is one of the effective lossless single-rate connectivity compression techniques for triangular meshes...
Article
Full-text available
The purpose of this paper is to provide an evaluation and comparative study for methodologies applied by sites dedicated to evaluate and rank the world universities. The set of the web sites dealing with the ranking of the higher education was listed. It is not a comprehensive list, but rather, offers a general sense of the range of existing resour...
Article
One of the most difficult problems in subdivision surfaces is the quick growth of the number of meshes after every subdivision step. This paper proposes a fast and smooth subdivision scheme as a solution to this problem. Our main goal is to design a fast and robust smooth surface reconstruction from coarse meshes by unifying surface types and adapt...
Article
Full-text available
Subdivision surfaces are rapidly gaining popularity in computer graphics and other applied areas. The major drawbacks of existing subdivision algorithms are the lack of precise definition of the schemes with guaranteed behavior for a sufficiently general type of control meshes, the bad behavior at extraordinary boundary vertices, and in capability...
Article
One of the most difficult problems in subdivision surfaces is the quick growth of the number of meshes after every subdivision step. This paper proposes a fast and smooth subdivision scheme as a solution to this problem. Our main goal is to design a fast and robust smooth surface reconstruction from coarse meshes by unifying surface types and adapt...
Article
Full-text available
One problem in subdivision surfaces is the number of meshes grows quickly after every subdivision step. The surface with huge number of meshes is difficult to manipulate. In this paper we propose a hexagonal scheme which can be considered as a modification to Doo-Sabin scheme. We introduce recursive subdivision rules for meshes with arbitrary topol...
Article
Full-text available
Subdivision surfaces are rapidly gaining popularity in computer graphics, modeling, simulation and animation. Existing of subdivision algorithms is suffer from the lack of precise definition of the schemes with guaranteed behavior for a sufficiently general type of control meshes, non-smoothness due to the existence of regular and non-regular face...
Article
Full-text available
L-system is a tool commonly used for modeling and simulating the growth of fractal plants. The aim of this paper is to join some problems of the computational geometry with the fractal geometry by using the L-system technique to generate fractal plant in 3D. L-system constructs the fractal structure by applying rewriting rules sequentially and this...
Article
Full-text available
Many universities and libraries throughout the world are now making digitized versions of traditional (print) dissertations available online. The Ain Shams University Information Network, ASUNET, is the repository of the scientific theses published by the Egyptian universities since 1992 with more than one hundred fifty thousand, bilingual, Arabic...

Network

Cited By