Maryam Mohammadi
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
Maryam Mohammadi has a total of 25 co-authors. Here are the top co-authors by number of shared publications:
- Reza Mokhtari
Department of Mathematical Sciences, Isfahan University of Technology, Isfahan, Iran
7 shared publications - Esmail Babolian
Department of Computer Science, Kharazmi University, Tehran, Iran
3 shared publications - Fahimeh Saberi Zafarghandi
Faculty of Mathematical Sciences and Computer, Kharazmi University, 50 Taleghani Avenue, Tehran 1561836314, Iran
3 shared publications - Shahnam Javadi
Faculty of Mathematical Sciences and Computer, Kharazmi University, Tehran, Iran
3 shared publications Fahimeh Saberi Zafarghandi
2 shared publicationsMohammad Heidari
2 shared publications
Latest Publications
- 21 July 2026
- Published by Elsevier in Engineering Analysis with Boundary Elements
- Vol. 191
Spatially variable shape parameters for RBF interpolation: A curvature-based adaptive strategy
- 21 July 2026
- Published by Elsevier in Engineering Analysis with Boundary Elements
- Vol. 191
Spatially variable shape parameters for RBF interpolation: A curvature-based adaptive strategy
- 12 April 2025
- Published by Elsevier in Applied Mathematics Letters
- Vol. 168
Unisolvence of Kansa collocation for elliptic equations by polyharmonic splines with random fictitious centers
- 12 April 2025
- Published by Elsevier in Applied Mathematics Letters
- Vol. 168
Unisolvence of Kansa collocation for elliptic equations by polyharmonic splines with random fictitious centers
- 4 September 2023
- Published by Vilnius Gediminas Technical University in Mathematical Modelling and Analysis
- Vol. 28 (3) , 415-433
CURVATURE BASED CHARACTERIZATION OF RADIAL BASIS FUNCTIONS: APPLICATION TO INTERPOLATION
Choosing the scale or shape parameter of radial basis functions (RBFs) is a well-documented but still an open problem in kernel-based methods. It is common to tune it according to the applications, and it plays a crucial role both for the accuracy and stability of the method. In this paper, we first devise a direct relation between the shape parameter of RBFs and their curvature at each point. This leads to characterizing RBFs to scalable and unscalable ones. We prove that all scalable RBFs lie in the c12-class which means that their curvature at the point xj is proportional to c21, where cj is the corresponding spatially variable shape parameter at j xj. Some of the most commonly used RBFs are then characterized and classified accordingly to their curvature. Then, the fundamental theory of plane curves helps us recover univariate functions from scattered data, by enforcing the exact and approximate solutions have the same curvature at the point where they meet. This leads to introducing curvature-based scaled RBFs with shape parameters depending on the function values and approximate curvature values of the function to be approximated. Several numerical experiments are devoted to show that the method performs better than the standard fixed-scale basis and some other shape parameter selection methods.
- 4 September 2023
- Published by Vilnius Gediminas Technical University in Mathematical Modelling and Analysis
- Vol. 28 (3) , 415-433
CURVATURE BASED CHARACTERIZATION OF RADIAL BASIS FUNCTIONS: APPLICATION TO INTERPOLATION
Choosing the scale or shape parameter of radial basis functions (RBFs) is a well-documented but still an open problem in kernel-based methods. It is common to tune it according to the applications, and it plays a crucial role both for the accuracy and stability of the method. In this paper, we first devise a direct relation between the shape parameter of RBFs and their curvature at each point. This leads to characterizing RBFs to scalable and unscalable ones. We prove that all scalable RBFs lie in the c12-class which means that their curvature at the point xj is proportional to c21, where cj is the corresponding spatially variable shape parameter at j xj. Some of the most commonly used RBFs are then characterized and classified accordingly to their curvature. Then, the fundamental theory of plane curves helps us recover univariate functions from scattered data, by enforcing the exact and approximate solutions have the same curvature at the point where they meet. This leads to introducing curvature-based scaled RBFs with shape parameters depending on the function values and approximate curvature values of the function to be approximated. Several numerical experiments are devoted to show that the method performs better than the standard fixed-scale basis and some other shape parameter selection methods.
- 1 October 2019
- Published by Elsevier in Applied Numerical Mathematics
- Vol. 144, 59-82
Numerical approximations for the Riesz space fractional advection-dispersion equations via radial basis functions
- 1 October 2019
- Published by Elsevier in Applied Numerical Mathematics
- Vol. 144, 59-82
Numerical approximations for the Riesz space fractional advection-dispersion equations via radial basis functions
- 1 September 2019
- Vol. 7 (3) , 319-336
Numerical solution of sigularly perturbed parabolic problems by a local kernel-based method with an adaptive algorithm
- 1 September 2019
- Vol. 7 (3) , 319-336
Numerical solution of sigularly perturbed parabolic problems by a local kernel-based method with an adaptive algorithm
- 3 April 2019
- Published by Wiley in Mathematical Methods in the Applied Sciences
- Vol. 42 (11) , 3877-3899
On the fractional derivatives of radial basis functions: Theories and applications
- 3 April 2019
- Published by Wiley in Mathematical Methods in the Applied Sciences
- Vol. 42 (11) , 3877-3899
On the fractional derivatives of radial basis functions: Theories and applications
- 1 April 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 45-49
Fragile Watermarking for Image Authentication Using QR factorization and Fourier Transform
Image authentication technique is one of the important methods for a large number of multimedia applications. When a digital image is passed over non-secure channels such as the Internet, it may be changed and manipulated. For some important images such as military and medical images, these manipulations are very harmful and such images should be protected against them. There are several ways such as fragile and semi-fragile watermarking to authenticate images from malicious attacks. This paper presents a fragile watermarking algorithm for image authentication by using QR factorization and Fourier Transform (FT). By applying Fourier transform to host image, frequency domain which causes visual quality in watermarking is achieved. After applying FT, it is factorized by QR decomposition. QR factorization is also applied to watermark image. After factorizing both images, a coefficient of the upper triangular matrix R from watermark image is embedded to the upper triangular matrix R from host image. So a sign of the watermark image is hidden in the host image. This method is a fragile watermarking and it is sensitive to a little attack. So if an image is attacked over the Internet, the watermark image can not be extracted and it means that it has been attacked and it helps us to recognize if an image is changed after being transmitted over the Internet. The experimental results show that this method is sensitive to every weak attack and extraction part can not extract watermark image if it has been attacked.
- 1 April 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 45-49
Fragile Watermarking for Image Authentication Using QR factorization and Fourier Transform
Image authentication technique is one of the important methods for a large number of multimedia applications. When a digital image is passed over non-secure channels such as the Internet, it may be changed and manipulated. For some important images such as military and medical images, these manipulations are very harmful and such images should be protected against them. There are several ways such as fragile and semi-fragile watermarking to authenticate images from malicious attacks. This paper presents a fragile watermarking algorithm for image authentication by using QR factorization and Fourier Transform (FT). By applying Fourier transform to host image, frequency domain which causes visual quality in watermarking is achieved. After applying FT, it is factorized by QR decomposition. QR factorization is also applied to watermark image. After factorizing both images, a coefficient of the upper triangular matrix R from watermark image is embedded to the upper triangular matrix R from host image. So a sign of the watermark image is hidden in the host image. This method is a fragile watermarking and it is sensitive to a little attack. So if an image is attacked over the Internet, the watermark image can not be extracted and it means that it has been attacked and it helps us to recognize if an image is changed after being transmitted over the Internet. The experimental results show that this method is sensitive to every weak attack and extraction part can not extract watermark image if it has been attacked.
- 5 October 2018
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 342, 224-246
Radial basis functions method for solving the fractional diffusion equations
- 5 October 2018
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 342, 224-246
Radial basis functions method for solving the fractional diffusion equations
- 1 October 2018
- Vol. 7 (1) , 21-34
Bases for polynomial-based spaces