Mahmoud Hamed Annaby
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Mahmoud Hamed Annaby has a total of 35 co-authors. Here are the top co-authors by number of shared publications:
- Rashad Mudhish Asharabi
Department of Mathematics, College of Arts and Sciences, Najran University, Najran, Saudi Arabia
7 shared publications - Hassan Atef Hassan
Department of Mathematics, Faculty of Science, Cairo University, Giza, Egypt
5 shared publications - Shimaa Elsayed-Abdullah
Department of Mathematics, Faculty of Science, Fayoum University, Fayoum, Egypt
5 shared publications - Mohammed M. Tharwat
Dept. of Math. and Computer Sci., Faculty of Science, Beni Suef University, Egypt
4 shared publications - Muhammad Ali Rushdi
Department of Biomedical Engineering and Systems, Faculty of Engineering, Cairo University, Cairo University St, Giza, 12613, Egypt.
4 shared publications H. A. Abdusalam
Department of Mathematics, Faculty of Science, Cairo University, Giza, Egypt
3 shared publications
Latest Publications
- 26 August 2026
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 492
Irregular Hermite interpolations by contour integration method in the linear canonical transform domain
- 26 August 2026
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 492
Irregular Hermite interpolations by contour integration method in the linear canonical transform domain
- Open Access
- 23 August 2026
- Published by Elsevier in SSRN Electronic Journal
Learning Superpixel Ensemble and Hierarchy Graphs for Melanoma Detection
Background and Objective: Graph signal processing (GSP) becomes a major tool in biomedical signal and image analysis. In most GSP techniques, graph structures have been set via statistical and computational methods. Recently, graph structure learning methods offered optimized data representations. Methods: we introduce a graph optimized learning approach for melanoma detection in dermoscopic images using two models: superpixel ensemble graphs (SEG) and superpixel hierarchy graphs (SHG). For both types, superpixel maps of a skin lesion image are respectively generated at multiple levels with and without parent-child constraints among superpixels at adjacent levels. Each level corresponds to a subgraph with a different number of nodes (20, 40, 60, 80, or 100 nodes). Two edge weight assignment techniques are explored: handcrafted Gaussian weights and learned weights based on optimization methods. Nodal signals are assigned based on texture, geometric, and color superpixel features. Furthermore, the effect of graph edge thresholding is investigated by applying thresholds (25%, 50%, and 75%) to prune the weakest edges. Experimental evaluation of the proposed method is performed with different classifiers trained and tested on the publicly available ISIC2017 dataset. Data augmentation is applied to alleviate class imbalance by adding more melanoma images from the ISIC archive. Results: Learned superpixel ensemble graphs with textural nodal signals give the highest performance reaching an accuracy of 99.00% and an AUC of 99.59%. Conclusions: Learned graph-based representations combined with textural features provide highly effective melanoma detection in dermoscopic images. This approach demonstrates the potential of graph learning methods to improve diagnostic performance.
- 23 August 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessLearning Superpixel Ensemble and Hierarchy Graphs for Melanoma Detection
Background and Objective: Graph signal processing (GSP) becomes a major tool in biomedical signal and image analysis. In most GSP techniques, graph structures have been set via statistical and computational methods. Recently, graph structure learning methods offered optimized data representations. Methods: we introduce a graph optimized learning approach for melanoma detection in dermoscopic images using two models: superpixel ensemble graphs (SEG) and superpixel hierarchy graphs (SHG). For both types, superpixel maps of a skin lesion image are respectively generated at multiple levels with and without parent-child constraints among superpixels at adjacent levels. Each level corresponds to a subgraph with a different number of nodes (20, 40, 60, 80, or 100 nodes). Two edge weight assignment techniques are explored: handcrafted Gaussian weights and learned weights based on optimization methods. Nodal signals are assigned based on texture, geometric, and color superpixel features. Furthermore, the effect of graph edge thresholding is investigated by applying thresholds (25%, 50%, and 75%) to prune the weakest edges. Experimental evaluation of the proposed method is performed with different classifiers trained and tested on the publicly available ISIC2017 dataset. Data augmentation is applied to alleviate class imbalance by adding more melanoma images from the ISIC archive. Results: Learned superpixel ensemble graphs with textural nodal signals give the highest performance reaching an accuracy of 99.00% and an AUC of 99.59%. Conclusions: Learned graph-based representations combined with textural features provide highly effective melanoma detection in dermoscopic images. This approach demonstrates the potential of graph learning methods to improve diagnostic performance.
- Open Access
On the Zeros of $q$-Hankel Transform by Using Pólya-Hurwitz Partial Fraction Method
The technique of Pólya-Hurwitz of partial fractions is implemented to investigate the zeros of finite $q$-Hankel transforms, which are defined in terms of the third $q$-Bessel function of Jackson. The new approach, which is a $q$-counterpart of Pólya-Hurwitz technique relaxes the restrictive conditions imposed on $q$ in the previously obtained results. In the present study, we use the $q$-type sampling theorems of the $q$-Hankel transforms, which lead directly to $q$-partial fractions. Various experimental examples are established.Open AccessOn the Zeros of $q$-Hankel Transform by Using Pólya-Hurwitz Partial Fraction Method
The technique of Pólya-Hurwitz of partial fractions is implemented to investigate the zeros of finite $q$-Hankel transforms, which are defined in terms of the third $q$-Bessel function of Jackson. The new approach, which is a $q$-counterpart of Pólya-Hurwitz technique relaxes the restrictive conditions imposed on $q$ in the previously obtained results. In the present study, we use the $q$-type sampling theorems of the $q$-Hankel transforms, which lead directly to $q$-partial fractions. Various experimental examples are established. - 31 January 2025
- Published by Springer Nature in Complex Analysis and its Synergies
- Vol. 11 (1) , 1-9
On Kakeya’s geometric proof of Eneström-Kakeya’s theorem
- 31 January 2025
- Published by Springer Nature in Complex Analysis and its Synergies
- Vol. 11 (1) , 1-9
On Kakeya’s geometric proof of Eneström-Kakeya’s theorem
- Open Access
- 15 October 2024
- Published by Springer Nature in The Journal of Analysis
- Vol. 33 (1) , 369-385
A q-theorem of Pólya using Hurwitz partial fraction method
We establish a q-counterpart of the method of partial fraction developed by Hurwitz-Pólya to investigate the zeros of q-cosine and q-sine transforms, where $$q \in (0,1)$$ is a fixed number. We prove reality and simplicity of the zeros and give a precise description of their distribution. The conditions imposed on both q and the integrand are less restrictive than previously assumed in the literature. A direct infinite partial fraction expansion is obtained via q-sampling theory.- 15 October 2024
- Published by Springer Nature in The Journal of Analysis
- Vol. 33 (1) , 369-385
Open AccessA q-theorem of Pólya using Hurwitz partial fraction method
We establish a q-counterpart of the method of partial fraction developed by Hurwitz-Pólya to investigate the zeros of q-cosine and q-sine transforms, where $$q \in (0,1)$$ is a fixed number. We prove reality and simplicity of the zeros and give a precise description of their distribution. The conditions imposed on both q and the integrand are less restrictive than previously assumed in the literature. A direct infinite partial fraction expansion is obtained via q-sampling theory. - Open Access
- 10 June 2024
- Published by Springer Nature in Multimedia Systems
- Vol. 30 (4) , 1-21
2D Representations of 3D Point Clouds Via the Stereographic Projection with Encryption Applications
Using the topological equivalence between the Riemann sphere $$\mathbb {S}$$ and the extended complex plane $$\overline{\mathbb {C}} = \mathbb {C} \cup \{\infty \}$$ , where $$\mathbb {C}$$ is the field of complex numbers, we establish 2D-bijective representations of 3D point clouds. Points of 3D point clouds are mapped into the Riemann sphere $$\mathbb {S}$$ , and a stereographic projection is implemented to map the points into the complex plane $$\mathbb {C}$$ . The way the 3D objects are mapped into $$\mathbb {S}$$ may be varied for various applications. To prove the accuracy and efficiency of the proposed 2D representation of 3D objects, we apply this correspondence to 3D point cloud encryption. We utilize chaotic permutations, chaotic circuits, and Latin cubes in addition to the stereographic projection representation to construct our scheme. The permutation steps using chaotic maps and Latin cubes are carried out on the object data points in both $$\mathbb {S}$$ and $$\overline{\mathbb {C}}$$ , while the chaotic circuits are applied to 2D projections of the 3D objects. To the best of our knowledge, no earlier work employed stereographic projections for 3D object encryption. Experimental simulations of this method show high encryption strength and strong confusion and diffusion properties based on quantitative and statistical measures.- 10 June 2024
- Published by Springer Nature in Multimedia Systems
- Vol. 30 (4) , 1-21
Open Access2D Representations of 3D Point Clouds Via the Stereographic Projection with Encryption Applications
Using the topological equivalence between the Riemann sphere $$\mathbb {S}$$ and the extended complex plane $$\overline{\mathbb {C}} = \mathbb {C} \cup \{\infty \}$$ , where $$\mathbb {C}$$ is the field of complex numbers, we establish 2D-bijective representations of 3D point clouds. Points of 3D point clouds are mapped into the Riemann sphere $$\mathbb {S}$$ , and a stereographic projection is implemented to map the points into the complex plane $$\mathbb {C}$$ . The way the 3D objects are mapped into $$\mathbb {S}$$ may be varied for various applications. To prove the accuracy and efficiency of the proposed 2D representation of 3D objects, we apply this correspondence to 3D point cloud encryption. We utilize chaotic permutations, chaotic circuits, and Latin cubes in addition to the stereographic projection representation to construct our scheme. The permutation steps using chaotic maps and Latin cubes are carried out on the object data points in both $$\mathbb {S}$$ and $$\overline{\mathbb {C}}$$ , while the chaotic circuits are applied to 2D projections of the 3D objects. To the best of our knowledge, no earlier work employed stereographic projections for 3D object encryption. Experimental simulations of this method show high encryption strength and strong confusion and diffusion properties based on quantitative and statistical measures. - Open Access
- 11 July 2023
- Published by Springer Nature in Numerical Algorithms
- Vol. 94 (3) , 1281-1308
Hermite interpolation theorems for band-limited functions of the linear canonical transforms with equidistant samples
We establish convergence analysis for Hermite-type interpolations for $$L^{2} ( \mathbb {R})$$ -entire functions of exponential type whose linear canonical transforms (LCT) are compactly supported. The results bridges the theoretical gap in implementing the derivative sampling theorems for band-limited signals in the LCT domain. Both complex analysis and real analysis techniques are established to derive the convergence analysis. The truncation error is also investigated and rigorous estimates for it are given. Nevertheless, the convergence rate is $$O(1/\sqrt{N})$$ , which is slow. Consequently the work on regularization techniques is required.- 11 July 2023
- Published by Springer Nature in Numerical Algorithms
- Vol. 94 (3) , 1281-1308
Open AccessHermite interpolation theorems for band-limited functions of the linear canonical transforms with equidistant samples
We establish convergence analysis for Hermite-type interpolations for $$L^{2} ( \mathbb {R})$$ -entire functions of exponential type whose linear canonical transforms (LCT) are compactly supported. The results bridges the theoretical gap in implementing the derivative sampling theorems for band-limited signals in the LCT domain. Both complex analysis and real analysis techniques are established to derive the convergence analysis. The truncation error is also investigated and rigorous estimates for it are given. Nevertheless, the convergence rate is $$O(1/\sqrt{N})$$ , which is slow. Consequently the work on regularization techniques is required. - Open Access
- 9 June 2023
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 83 (3) , 6469-6496
Fast template matching and object detection techniques using φ-correlation and binary circuits
In this paper, two new accelerated and robust template matching and object detection algorithms are established. The algorithms retain the accuracy measures compared to relevant well-known standard and recent schemes, and remarkably accelerate the execution time simultaneously. Instead of dealing with images in the grayscale or color representations, the proposed methods are established by measuring resemblance on extracted binary images. The two different techniques are based on the φ-correlation coefficient and logical circuits. Both techniques enhance the accuracy, compared to two classical and two recent methods, while giving very efficient running time. The algorithms are carried out on two different datasets used in state-of-the-art methods with performance and comparison analysis. Robustness of the proposed algorithms against normal and artificial noises is examined and assured as well.
- 9 June 2023
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 83 (3) , 6469-6496
Open AccessFast template matching and object detection techniques using φ-correlation and binary circuits
In this paper, two new accelerated and robust template matching and object detection algorithms are established. The algorithms retain the accuracy measures compared to relevant well-known standard and recent schemes, and remarkably accelerate the execution time simultaneously. Instead of dealing with images in the grayscale or color representations, the proposed methods are established by measuring resemblance on extracted binary images. The two different techniques are based on the φ-correlation coefficient and logical circuits. Both techniques enhance the accuracy, compared to two classical and two recent methods, while giving very efficient running time. The algorithms are carried out on two different datasets used in state-of-the-art methods with performance and comparison analysis. Robustness of the proposed algorithms against normal and artificial noises is examined and assured as well.
- Open Access
- 19 May 2023
- Published by Springer Nature in Research Square
Geometrically Stable 3D-Point Cloud Encryption via Chaotic Permutations and Pointwise Rotations
Three-dimensional point-cloud data has been enormously abundant with the emergence of numerous technologies for 3D data acquisition, processing, and visualization. Encryption algorithms have been recently introduced to ensure secure storage and communication for this type of data. However, maintaining the correctness and the geometric stability of such algorithms are still key challenges towards the construction of reliable, trustful, and practical ciphers of 3D point clouds. Few attempts have been made to establish geometrically stable algorithms for 3D point cloud encryption, without compromising the cipher robustness. In particular, Jolfaei et al. [IEEE Transactions on Information Forensics and Security , vol. 10, no. 2, pp. 409-422, 2015] proposed a 3D object encryption algorithm along with geometric notions of dimensional and spatial stability. However, these notions are not consistent and the geometric stability and correctness of that cipher are not guaranteed as we show through counterexamples. In this paper, we introduce an enhanced cipher with correctness, reversibility, and geometric stability guarantees. The soundness and significance of the proposed scheme are demonstrated by rigorous mathematical proofs, extensive experimentation, and comparisons against state-of-the-art methods.
- 19 May 2023
- Published by Springer Nature in Research Square
Open AccessGeometrically Stable 3D-Point Cloud Encryption via Chaotic Permutations and Pointwise Rotations
Three-dimensional point-cloud data has been enormously abundant with the emergence of numerous technologies for 3D data acquisition, processing, and visualization. Encryption algorithms have been recently introduced to ensure secure storage and communication for this type of data. However, maintaining the correctness and the geometric stability of such algorithms are still key challenges towards the construction of reliable, trustful, and practical ciphers of 3D point clouds. Few attempts have been made to establish geometrically stable algorithms for 3D point cloud encryption, without compromising the cipher robustness. In particular, Jolfaei et al. [IEEE Transactions on Information Forensics and Security , vol. 10, no. 2, pp. 409-422, 2015] proposed a 3D object encryption algorithm along with geometric notions of dimensional and spatial stability. However, these notions are not consistent and the geometric stability and correctness of that cipher are not guaranteed as we show through counterexamples. In this paper, we introduce an enhanced cipher with correctness, reversibility, and geometric stability guarantees. The soundness and significance of the proposed scheme are demonstrated by rigorous mathematical proofs, extensive experimentation, and comparisons against state-of-the-art methods.
- Open Access
- 20 March 2023
- Published by Springer Nature in Research Square
On the Extraction of Amicable Pairs Between Ibn Sīnā- al-Baghdādī and al-Kāshī
In this note, we briefly analyse the works Ibn Sīnā (c.980-1037), al-Baghdādī (c.980-1037) and al-Kāshī (d. c. 1429) on the extraction of amicable pairs. We compare these works in the view of the well-known Thābit ibn Qurrā’s rule. Contrary to the belief that these authors are merely stating variations of the famous Thābit ibn Qurrā’s (d. 901) rule in different manners, we show that their statements are different. We prove that the statements of both ibn Sīnā and al-Baghdādī led to an unsolved conjecture, while al-Kāshī’s statement led to the wrong amicable pair . The conjecture implied by ibn Sīnā and al-Baghdādī statements requires testing big primes corresponding to the known 51 Mersenne primes, and we show that no counterexamples yet exist.
- 20 March 2023
- Published by Springer Nature in Research Square
Open AccessOn the Extraction of Amicable Pairs Between Ibn Sīnā- al-Baghdādī and al-Kāshī
In this note, we briefly analyse the works Ibn Sīnā (c.980-1037), al-Baghdādī (c.980-1037) and al-Kāshī (d. c. 1429) on the extraction of amicable pairs. We compare these works in the view of the well-known Thābit ibn Qurrā’s rule. Contrary to the belief that these authors are merely stating variations of the famous Thābit ibn Qurrā’s (d. 901) rule in different manners, we show that their statements are different. We prove that the statements of both ibn Sīnā and al-Baghdādī led to an unsolved conjecture, while al-Kāshī’s statement led to the wrong amicable pair . The conjecture implied by ibn Sīnā and al-Baghdādī statements requires testing big primes corresponding to the known 51 Mersenne primes, and we show that no counterexamples yet exist.