Mehdi Nasri

Dr. Mehdi Nasri


Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2009 in Neurocomputing
Verified
Journal Article
Closed access
MNMehdi Nasri
Mehdi Nasri
HNHossein Nezamabadi-Pour
Hossein Nezamabadi-Pour

1 August 2017 in Computers and Electrical Engineering
Verified
Journal Article
Closed access
ZHZahra Hossein-Nejad
Zahra Hossein-Nejad
MNMehdi Nasri
Mehdi Nasri

30 September 2019 in Journal of Language and Education
Verified
Journal Article
Open access
PDF file
ENEhsan Namaziandost
Ehsan Namaziandost
VSVida Shatalebi
Vida Shatalebi
MNMehdi Nasri
Mehdi Nasri
This study aimed to investigate the effectiveness of cooperative learning in English language classrooms to enhance Iranian students’ speaking skills and motivations. A pre-test–post-test control group design was employed to compare the impact of the cooperative learning approach with that of traditional whole-class instruction on speaking skills and six aspects of learning motivation: intrinsic motivation, integrated regulation, identified regulation, introjected regulation, external regulation, and amotivation. The data of the current study were gathered at multiple points of time before and after the end of the experiment to determine the effectiveness of cooperative learning on the sample’s speaking skills and motivations. In practical terms, the sample’s speaking skills were first examined through an English oral test prior to and after some cooperative learning instructional activities were provided. Next, a seven-point Likert scale-questionnaire was administered to the sample before and at the end of the course to check students’ motivation towards the use of cooperative learning in English classes. The data were analyzed using basic and inferential statistical methods including mean scores, standard deviations, independent and paired sample t-tests, one-way ANCOVA, and effect size. The findings showed remarkable development in the students’ speaking skills after the introduction of cooperative learning techniques. Moreover, the findings suggested significant differences in favor of cooperative learning for improving intrinsic motivation, but no differences were found on other aspects of motivation. In light of the findings, the researchers recommend that teachers could benefit from applying CL in English classes, which may in turn develop students’ speaking skills and motivation.

1 August 2018 in Biomedical Signal Processing and Control
Verified
Journal Article
Closed access
ZHZahra Hossein-Nejad
Zahra Hossein-Nejad
MNMehdi Nasri
Mehdi Nasri

24 November 2016
Verified
Conference Paper
Closed access
ZHZahra Hossein-Nejad
Zahra Hossein-Nejad
MNMehdi Nasri
Mehdi Nasri
Scale invariant feature transform (SIFT) is one of the most applicable algorithms used in the image registration problem for extracting and matching of the features. One of the efficient methods in reducing mismatches in this algorithm is the RANdom SAmple Consensus (RANSAC) method. Besides the applicability of RANSAC, its threshold value is fixed, and it is empirically chosen. In this paper, a new method is proposed where the threshold value is calculated based on the variance between the correct matches' and of mismatches classes. Simulation results confirm the superiority of the chosen threshold in different situations in comparison with classic RANSAC algorithms in terms of CMR and FMR.

1 January 2017 in IET Image Processing
Verified
Journal Article
Open access
PDF file
ZHZahra Hossein‐Nejad
Zahra Hossein‐Nejad
MNMehdi Nasri
Mehdi Nasri
Image features can be identified using keypoints, and there are various algorithms to detect these important points of an image. Scale‐invariant feature transform (SIFT) is one of the most applicable algorithms in keypoint extraction. One of the deficiencies of SIFT and its modifications is that they extract redundant keypoints along with the important ones. A keypoint is called redundant if it is very close to another keypoint, and its sum of distances to all other keypoints is smaller. Elimination of a redundant keypoint increases the speed of algorithms in addition to image matching precision. In this study, redundant keypoint elimination method (RKEM) is proposed to remove redundant keypoints of the SIFT algorithm. To do this, the distances between keypoints are calculated. Then if the distance is smaller than a pre‐defined threshold, the redundant point is discarded based on the redundancy index. The proposed RKEM method is applied on basic SIFT, and some recent modification of SIFT such as auto‐adaptive SIFT and uniform robust SIFT. To investigate the efficiency of the proposed method, a set of experiments is done in image matching and registration. Experimental results show that the proposed RKEM method can improve the efficiency of SIFT family in terms of TP‐rate, precision, repeatability, and root‐mean‐square error.