Mehran Ebrahimi
Research Subjects
Mehran Ebrahimi has a total of 70 co-authors. Here are the top co-authors by number of shared publications:
Anne L. Martel
Department of Medical Biophysics, University of Toronto, Imaging Research, Sunnybrook Health Sciences Centre, 2075 Bayview Ave., Ontario, Canada M4N 3M5
4 shared publicationsMihaela Pop
Sunnybrook Research Institute,Toronto,Ontario,Canada
4 shared publications- Anne L . Martel
University of Toronto
3 shared publications Edward R. Vrscay
Department of Applied Mathematics, University of Waterloo, Ontario, Canada N2L 3G1
3 shared publications- Kamyar Nazeri
Faculty of Science University of Ontario Institute of Technology Canada
3 shared publications Anthony Lausch
2 shared publications
Latest Publications
- Open Access
- 22 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 70-76
Robust Ensemble of Selectively Strengthened and Augmented Predictors
- 22 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 70-76
Open AccessRobust Ensemble of Selectively Strengthened and Augmented Predictors
- 24 July 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1909-1916
Multi-Modality Image Inpainting Using Generative Adversarial Networks
Deep learning techniques, especially Generative Adversarial Networks (GANs) have significantly improved image inpainting and image-to-image translation tasks over the past few years. To the best of our knowledge, the problem of combining the image inpainting task with the multi-modality image-to-image translation remains intact. In this paper, we propose a model to address this problem. The model will be evaluated on combined night-to-day image translation and inpainting, along with promising qualitative and quantitative results.
- 24 July 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1909-1916
Multi-Modality Image Inpainting Using Generative Adversarial Networks
Deep learning techniques, especially Generative Adversarial Networks (GANs) have significantly improved image inpainting and image-to-image translation tasks over the past few years. To the best of our knowledge, the problem of combining the image inpainting task with the multi-modality image-to-image translation remains intact. In this paper, we propose a model to address this problem. The model will be evaluated on combined night-to-day image translation and inpainting, along with promising qualitative and quantitative results.
- 24 July 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 536-541
Deep Learning-Based MR Image Re-parameterization
Magnetic resonance (MR) image re-parameterization refers to the process of generating an MR image with a new set of MRI scanning parameters using simulations. Different parameter values generate distinct contrast between different tissues, helping identify pathologic tissue. Typically, more than one scan is required for diagnosis; however, acquiring repeated scans can be costly, time-consuming, and difficult for patients. Thus, using MR image re-parameterization to predict and estimate the contrast in these imaging scans can be an effective alternative. In this work, we propose a novel deep learning (DL) based convolutional model for MRI re-parameterization. Based on our preliminary results, DL-based techniques hold the potential to learn the nonlinearities that govern the re-parameterization.
- 24 July 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 536-541
Deep Learning-Based MR Image Re-parameterization
Magnetic resonance (MR) image re-parameterization refers to the process of generating an MR image with a new set of MRI scanning parameters using simulations. Different parameter values generate distinct contrast between different tissues, helping identify pathologic tissue. Typically, more than one scan is required for diagnosis; however, acquiring repeated scans can be costly, time-consuming, and difficult for patients. Thus, using MR image re-parameterization to predict and estimate the contrast in these imaging scans can be an effective alternative. In this work, we propose a novel deep learning (DL) based convolutional model for MRI re-parameterization. Based on our preliminary results, DL-based techniques hold the potential to learn the nonlinearities that govern the re-parameterization.
- 1 July 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-9
Multi-Objective Coordinate Search Optimization
Many real-world optimization problems can be modelled with several competing objectives. Most of the time, such optimization problems fall under the category of expensive problems. These are problems in which each fitness evaluation is time-consuming, for example, one fitness call could take hours or even days to compute. The time-consuming process of evaluating the function values or gradient of the objective functions may degrade the running speed of many optimization algorithms. The coordinate search (CS) approach is introduced as a single-objective gradient-free method for addressing large-scale, non-convex, and costly optimization problems. Due to the low computation and memory requirements of the CS algorithm, it can also be efficiently extended to address multi-objective optimization problems. The subject of this study is to develop a CS-based algorithm aimed at computationally expensive multi-objective optimization problems. In order to generate a set of non-dominated solutions, a population is created to apply the CS algorithm on each individual and finally reach an optimized interval. We demonstrate the efficacy of the proposed multi-objective CS method by comparing it with NSGA-II and MOEA/D as one of the well-known multi-objective algorithms on ZDT benchmark functions. Promising results are reported with the assumption of a limited number of fitness evaluations (NFF) which is desired during tackling complex and expensive optimization problems. Another major advantage of the proposed algorithm is that it provides regions of the Pareto front, that using sampling can generate as many Pareto front solutions as needed unlike other common optimization algorithms including NSGA-II.
- 1 July 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-9
Multi-Objective Coordinate Search Optimization
Many real-world optimization problems can be modelled with several competing objectives. Most of the time, such optimization problems fall under the category of expensive problems. These are problems in which each fitness evaluation is time-consuming, for example, one fitness call could take hours or even days to compute. The time-consuming process of evaluating the function values or gradient of the objective functions may degrade the running speed of many optimization algorithms. The coordinate search (CS) approach is introduced as a single-objective gradient-free method for addressing large-scale, non-convex, and costly optimization problems. Due to the low computation and memory requirements of the CS algorithm, it can also be efficiently extended to address multi-objective optimization problems. The subject of this study is to develop a CS-based algorithm aimed at computationally expensive multi-objective optimization problems. In order to generate a set of non-dominated solutions, a population is created to apply the CS algorithm on each individual and finally reach an optimized interval. We demonstrate the efficacy of the proposed multi-objective CS method by comparing it with NSGA-II and MOEA/D as one of the well-known multi-objective algorithms on ZDT benchmark functions. Promising results are reported with the assumption of a limited number of fitness evaluations (NFF) which is desired during tackling complex and expensive optimization problems. Another major advantage of the proposed algorithm is that it provides regions of the Pareto front, that using sampling can generate as many Pareto front solutions as needed unlike other common optimization algorithms including NSGA-II.
- Open Access
Single MR Image Super-Resolution using Generative Adversarial Network
Spatial resolution of medical images can be improved using super-resolution methods. Real Enhanced Super Resolution Generative Adversarial Network (Real-ESRGAN) is one of the recent effective approaches utilized to produce higher resolution images, given input images of lower resolution. In this paper, we apply this method to enhance the spatial resolution of 2D MR images. In our proposed approach, we slightly modify the structure of the Real-ESRGAN to train 2D Magnetic Resonance images (MRI) taken from the Brain Tumor Segmentation Challenge (BraTS) 2018 dataset. The obtained results are validated qualitatively and quantitatively by computing SSIM (Structural Similarity Index Measure), NRMSE (Normalized Root Mean Square Error), MAE (Mean Absolute Error), and VIF (Visual Information Fidelity) values.
Open AccessSingle MR Image Super-Resolution using Generative Adversarial Network
Spatial resolution of medical images can be improved using super-resolution methods. Real Enhanced Super Resolution Generative Adversarial Network (Real-ESRGAN) is one of the recent effective approaches utilized to produce higher resolution images, given input images of lower resolution. In this paper, we apply this method to enhance the spatial resolution of 2D MR images. In our proposed approach, we slightly modify the structure of the Real-ESRGAN to train 2D Magnetic Resonance images (MRI) taken from the Brain Tumor Segmentation Challenge (BraTS) 2018 dataset. The obtained results are validated qualitatively and quantitatively by computing SSIM (Structural Similarity Index Measure), NRMSE (Normalized Root Mean Square Error), MAE (Mean Absolute Error), and VIF (Visual Information Fidelity) values.
- 8 December 2021
- Published by SPIE-Intl Soc Optical Eng in Journal of Medical Imaging
- Vol. 8 (06) , 064003-13
Medical image alignment based on landmark- and approximate contour-matching
Purpose: Our goal is to propose a landmark- and contour-matching (LCM) registration method that uses both landmark information and approximate point correspondences to boost the similarity between image pairs with sparse landmark information. Approach: A model for registering two-dimensional (2D) medical images with landmark information and contour-approximating landmarks was proposed. The model was also extended to accommodate the registration of three-dimensional (3D) cardiac images. We validated the LCM method on 2D hand x-rays and 3D porcine cardiac magnetic resonance images. The following metrics were used to assess the quality of specific aspects of the registered images: Dice similarity coefficient for the overall image overlap, target registration error for pointwise correspondence, and interior angle for local curvature. Results: Target registrations were reduced from 27.12 to 0.01 mm post-LCM registration. Implementing the proposed algorithm also led to a 112% average improvement in image similarity in terms of Dice coefficients. In addition, interior angle measurements indicate that the proposed method preserved the local curvature at major reference landmarks and mitigated the appearance of deformities in the registered images. Conclusions: The proposed method addressed several issues associated with purely landmark-based techniques, such as iterative closest point registration and thin plate spline interpolation. Furthermore, it provided accurate registration results even in the presence of landmark localization errors.
- 8 December 2021
- Published by SPIE-Intl Soc Optical Eng in Journal of Medical Imaging
- Vol. 8 (06) , 064003-13
Medical image alignment based on landmark- and approximate contour-matching
Purpose: Our goal is to propose a landmark- and contour-matching (LCM) registration method that uses both landmark information and approximate point correspondences to boost the similarity between image pairs with sparse landmark information. Approach: A model for registering two-dimensional (2D) medical images with landmark information and contour-approximating landmarks was proposed. The model was also extended to accommodate the registration of three-dimensional (3D) cardiac images. We validated the LCM method on 2D hand x-rays and 3D porcine cardiac magnetic resonance images. The following metrics were used to assess the quality of specific aspects of the registered images: Dice similarity coefficient for the overall image overlap, target registration error for pointwise correspondence, and interior angle for local curvature. Results: Target registrations were reduced from 27.12 to 0.01 mm post-LCM registration. Implementing the proposed algorithm also led to a 112% average improvement in image similarity in terms of Dice coefficients. In addition, interior angle measurements indicate that the proposed method preserved the local curvature at major reference landmarks and mitigated the appearance of deformities in the registered images. Conclusions: The proposed method addressed several issues associated with purely landmark-based techniques, such as iterative closest point registration and thin plate spline interpolation. Furthermore, it provided accurate registration results even in the presence of landmark localization errors.
- 1 April 2020
- Published by Elsevier in Computer Methods and Programs in Biomedicine
- Vol. 187, 105200
Novel atlas of fiber directions built from ex-vivo diffusion tensor images of porcine hearts
- 1 April 2020
- Published by Elsevier in Computer Methods and Programs in Biomedicine
- Vol. 187, 105200
Novel atlas of fiber directions built from ex-vivo diffusion tensor images of porcine hearts
- Open Access
EdgeConnect: Generative Image Inpainting with Adversarial Edge Learning
Over the last few years, deep learning techniques have yielded significant improvements in image inpainting. However, many of these techniques fail to reconstruct reasonable structures as they are commonly over-smoothed and/or blurry. This paper develops a new approach for image inpainting that does a better job of reproducing filled regions exhibiting fine details. We propose a two-stage adversarial model EdgeConnect that comprises of an edge generator followed by an image completion network. The edge generator hallucinates edges of the missing region (both regular and irregular) of the image, and the image completion network fills in the missing regions using hallucinated edges as a priori. We evaluate our model end-to-end over the publicly available datasets CelebA, Places2, and Paris StreetView, and show that it outperforms current state-of-the-art techniques quantitatively and qualitatively. Code and models available at: https://github.com/knazeri/edge-connect
Open AccessEdgeConnect: Generative Image Inpainting with Adversarial Edge Learning
Over the last few years, deep learning techniques have yielded significant improvements in image inpainting. However, many of these techniques fail to reconstruct reasonable structures as they are commonly over-smoothed and/or blurry. This paper develops a new approach for image inpainting that does a better job of reproducing filled regions exhibiting fine details. We propose a two-stage adversarial model EdgeConnect that comprises of an edge generator followed by an image completion network. The edge generator hallucinates edges of the missing region (both regular and irregular) of the image, and the image completion network fills in the missing regions using hallucinated edges as a priori. We evaluate our model end-to-end over the publicly available datasets CelebA, Places2, and Paris StreetView, and show that it outperforms current state-of-the-art techniques quantitatively and qualitatively. Code and models available at: https://github.com/knazeri/edge-connect
- Open Access
- 1 January 2019
- Published by Elsevier in NeuroImage: Clinical
- Vol. 21, 101663
Identifying lesions in paediatric epilepsy using morphometric and textural analysis of magnetic resonance images
- 1 January 2019
- Published by Elsevier in NeuroImage: Clinical
- Vol. 21, 101663
Open AccessIdentifying lesions in paediatric epilepsy using morphometric and textural analysis of magnetic resonance images
- 12 September 2018
- Published by Springer Nature
- p. 42-52
An Unbiased Groupwise Registration Algorithm for Correcting Motion in Dynamic Contrast-Enhanced Magnetic Resonance Images
- 12 September 2018
- Published by Springer Nature
- p. 42-52
An Unbiased Groupwise Registration Algorithm for Correcting Motion in Dynamic Contrast-Enhanced Magnetic Resonance Images