Ayesha Khan
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
Ayesha Khan has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Kashif Zafar
National University of Computer and Emerging Sciences, Lahore, Pakistan
4 shared publications Asma Naseer
National University of Computer and Emerging Sciences, Lahore, Pakistan
2 shared publications- Asma Naseer
Department of Computer Science, National University of Computer and Emerging Sciences, Lahore, Pakistan
2 shared publications - Maria Tamoor
Forman Christian College, Lahore, Pakistan
2 shared publications A.R. Baig
1 shared publicationAamir Wali
National University of Computer and Emerging Science
1 shared publication
Latest Publications
- Open Access
On Test Sequence Generation using Multi-Objective Particle Swarm Optimization
Software testing is an important and essential part of the software development life cycle and accounts for almost one-third of system development costs. In the software industry, testing costs can account for about 35% to 40% of the total cost of a software project. Therefore, providing efficient ways to test software is critical to reduce cost, time, and effort. Black-box testing and White-box testing are two essential components of software testing. Black-box testing focuses on the software's functionality, while White-box testing examines its internal structure. These tests contribute significantly to ensuring program coverage, which remains one of the main goals of the software testing paradigm. One of the main problems in this area is the identification of appropriate paths for program coverage, which are referred to as test sequences. Creating an automated and effective test sequence is a challenging task in the software testing process. In the proposed methodology, the challenge of "test sequence generation" is considered a multi-objective optimization problem that includes the Oracle cost and the path, both of which are optimized in a symmetrical manner to achieve optimal software testing. Multi-Objective Particle Swarm Optimization (MOPSO) is used to represent the test sequences with the highest priority and the lowest Oracle cost as optimal. The performance of the implemented approach is compared with the Multi-Objective Firefly Algorithm (MOFA) for generating test sequences. The MOPSO-based solution outperforms the MOFA-based approach and simultaneously provides the optimal solution for both objectives.
Open AccessOn Test Sequence Generation using Multi-Objective Particle Swarm Optimization
Software testing is an important and essential part of the software development life cycle and accounts for almost one-third of system development costs. In the software industry, testing costs can account for about 35% to 40% of the total cost of a software project. Therefore, providing efficient ways to test software is critical to reduce cost, time, and effort. Black-box testing and White-box testing are two essential components of software testing. Black-box testing focuses on the software's functionality, while White-box testing examines its internal structure. These tests contribute significantly to ensuring program coverage, which remains one of the main goals of the software testing paradigm. One of the main problems in this area is the identification of appropriate paths for program coverage, which are referred to as test sequences. Creating an automated and effective test sequence is a challenging task in the software testing process. In the proposed methodology, the challenge of "test sequence generation" is considered a multi-objective optimization problem that includes the Oracle cost and the path, both of which are optimized in a symmetrical manner to achieve optimal software testing. Multi-Objective Particle Swarm Optimization (MOPSO) is used to represent the test sequences with the highest priority and the lowest Oracle cost as optimal. The performance of the implemented approach is compared with the Multi-Objective Firefly Algorithm (MOFA) for generating test sequences. The MOPSO-based solution outperforms the MOFA-based approach and simultaneously provides the optimal solution for both objectives.
- Open Access
- 15 August 2023
- Published by MDPI AG in Diagnostics
- Vol. 13 (16) , 2684
Skin Lesion Segmentation Using an Ensemble of Different Image Processing Methods
In recent times, there has been a huge increase in the average number of cases of skin cancer per year, which sometimes become life threatening for humans. Early detection of various skin diseases through automated detection techniques plays a crucial role. However, the presence of numerous artefacts makes this task challenging. Dermoscopic images exhibit various variations, including hair artefacts, markers, and ill-defined boundaries. These artefacts make automatic analysis of skin lesion quite a difficult task. To address these issues, it is essential to have an accurate and efficient automated method which will delineate a skin lesion from the rest of the image. Unfortunately, due to the presence of several types of skin artefacts, there is no such thresholding method that can provide a sufficient segmentation result for every type of skin lesion. To overcome this limitation, an ensemble-based method is proposed that selects the optimal thresholding based on an objective function. A group of state-of-the-art different thresholding methods such as Otsu, Kapur, Harris hawk, and grey level are used. The proposed method obtained superior results (dice score = 0.89 with p-value ≤ 0.05) as compared to other state-of-the-art methods (Otsu = 0.79, Kapur = 0.80, Harris hawk = 0.60, grey level = 0.69, active contour model = 0.72). The experiments conducted in this study utilize the ISIC 2016 dataset, which is publicly available and specifically designed for skin-related research. Accurate segmentation will help in the early detection of many skin diseases.
- 15 August 2023
- Published by MDPI AG in Diagnostics
- Vol. 13 (16) , 2684
Open AccessSkin Lesion Segmentation Using an Ensemble of Different Image Processing Methods
In recent times, there has been a huge increase in the average number of cases of skin cancer per year, which sometimes become life threatening for humans. Early detection of various skin diseases through automated detection techniques plays a crucial role. However, the presence of numerous artefacts makes this task challenging. Dermoscopic images exhibit various variations, including hair artefacts, markers, and ill-defined boundaries. These artefacts make automatic analysis of skin lesion quite a difficult task. To address these issues, it is essential to have an accurate and efficient automated method which will delineate a skin lesion from the rest of the image. Unfortunately, due to the presence of several types of skin artefacts, there is no such thresholding method that can provide a sufficient segmentation result for every type of skin lesion. To overcome this limitation, an ensemble-based method is proposed that selects the optimal thresholding based on an objective function. A group of state-of-the-art different thresholding methods such as Otsu, Kapur, Harris hawk, and grey level are used. The proposed method obtained superior results (dice score = 0.89 with p-value ≤ 0.05) as compared to other state-of-the-art methods (Otsu = 0.79, Kapur = 0.80, Harris hawk = 0.60, grey level = 0.69, active contour model = 0.72). The experiments conducted in this study utilize the ISIC 2016 dataset, which is publicly available and specifically designed for skin-related research. Accurate segmentation will help in the early detection of many skin diseases.
- 29 May 2023
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 83 (2) , 4915-4928
Occupancy detection via thermal sensors for energy consumption reduction
- 29 May 2023
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 83 (2) , 4915-4928
Occupancy detection via thermal sensors for energy consumption reduction
- 6 September 2022
- Published by SAGE Publications in Journal of X-Ray Science and Technology
- Vol. 30 (6) , 1169-1184
Applying an adaptive Otsu-based initialization algorithm to optimize active contour models for skin lesion segmentation
BACKGROUND: Medical image processing has gained much attention in developing computer-aided diagnosis (CAD) of diseases. CAD systems require deep understanding of X-rays, MRIs, CT scans and other medical images. The segmentation of the region of interest (ROI) from those images is one of the most crucial tasks. OBJECTIVE: Although active contour model (ACM) is a popular method to segment ROIs in medical images, the final segmentation results highly depend on the initial placement of the contour. In order to overcome this challenge, the objective of this study is to investigate feasibility of developing a fully automated initialization process that can be optimally used in ACM to more effectively segment ROIs. METHODS: In this study, a fully automated initialization algorithm namely, an adaptive Otsu-based initialization (AOI) method is proposed. Using this proposed method, an initial contour is produced and further refined by the ACM to produce accurate segmentation. For evaluation of the proposed algorithm, the ISIC-2017 Skin Lesion dataset is used due to its challenging complexities. RESULTS: Four different supervised performance evaluation metrics are employed to measure the accuracy and robustness of the proposed algorithm. Using this AOI algorithm, the ACM significantly ( p ≤0.05) outperforms Otsu thresholding method with 0.88 Dice Score Coefficients (DSC) and 0.79 Jaccard Index (JI) and computational complexity of 0(mn). CONCLUSIONS: After comparing proposed method with other state-of-the-art methods, our study demonstrates that the proposed methods is superior to other skin lesion segmentation methods, and it requires no training time, which also makes the new method more efficient than other deep learning and machine learning methods.
- 6 September 2022
- Published by SAGE Publications in Journal of X-Ray Science and Technology
- Vol. 30 (6) , 1169-1184
Applying an adaptive Otsu-based initialization algorithm to optimize active contour models for skin lesion segmentation
BACKGROUND: Medical image processing has gained much attention in developing computer-aided diagnosis (CAD) of diseases. CAD systems require deep understanding of X-rays, MRIs, CT scans and other medical images. The segmentation of the region of interest (ROI) from those images is one of the most crucial tasks. OBJECTIVE: Although active contour model (ACM) is a popular method to segment ROIs in medical images, the final segmentation results highly depend on the initial placement of the contour. In order to overcome this challenge, the objective of this study is to investigate feasibility of developing a fully automated initialization process that can be optimally used in ACM to more effectively segment ROIs. METHODS: In this study, a fully automated initialization algorithm namely, an adaptive Otsu-based initialization (AOI) method is proposed. Using this proposed method, an initial contour is produced and further refined by the ACM to produce accurate segmentation. For evaluation of the proposed algorithm, the ISIC-2017 Skin Lesion dataset is used due to its challenging complexities. RESULTS: Four different supervised performance evaluation metrics are employed to measure the accuracy and robustness of the proposed algorithm. Using this AOI algorithm, the ACM significantly ( p ≤0.05) outperforms Otsu thresholding method with 0.88 Dice Score Coefficients (DSC) and 0.79 Jaccard Index (JI) and computational complexity of 0(mn). CONCLUSIONS: After comparing proposed method with other state-of-the-art methods, our study demonstrates that the proposed methods is superior to other skin lesion segmentation methods, and it requires no training time, which also makes the new method more efficient than other deep learning and machine learning methods.
- 30 November 2021
- Published by Springer Nature in International Journal on Document Analysis and Recognition (IJDAR)
- Vol. 25 (1) , 51-66
A novel normal to tangent line (NTL) algorithm for scale invariant feature extraction for Urdu OCR
- 30 November 2021
- Published by Springer Nature in International Journal on Document Analysis and Recognition (IJDAR)
- Vol. 25 (1) , 51-66
A novel normal to tangent line (NTL) algorithm for scale invariant feature extraction for Urdu OCR
- 11 August 2021
- Published by SAGE Publications in Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology
- Vol. 41 (1) , 1097-1114
Multiple sequence alignment using enhanced bird swarm align algorithm
Discovering structural, functional and evolutionary information in biological sequences have been considered as a core research area in Bioinformatics. Multiple Sequence Alignment (MSA) tries to align all sequences in a given query set to provide us ease in annotation of new sequences. Traditional methods to find the optimal alignment are computationally expensive in real time. This research presents an enhanced version of Bird Swarm Algorithm (BSA), based on bio inspired optimization. Enhanced Bird Swarm Align Algorithm (EBSAA) is proposed for multiple sequence alignment problem to determine the optimal alignment among different sequences. Twenty-one different datasets have been used in order to compare performance of EBSAA with Genetic Algorithm (GA) and Particle Swarm Align Algorithm (PSAA). The proposed technique results in better alignment as compared to GA and PSAA in most of the cases.
- 11 August 2021
- Published by SAGE Publications in Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology
- Vol. 41 (1) , 1097-1114
Multiple sequence alignment using enhanced bird swarm align algorithm
Discovering structural, functional and evolutionary information in biological sequences have been considered as a core research area in Bioinformatics. Multiple Sequence Alignment (MSA) tries to align all sequences in a given query set to provide us ease in annotation of new sequences. Traditional methods to find the optimal alignment are computationally expensive in real time. This research presents an enhanced version of Bird Swarm Algorithm (BSA), based on bio inspired optimization. Enhanced Bird Swarm Align Algorithm (EBSAA) is proposed for multiple sequence alignment problem to determine the optimal alignment among different sequences. Twenty-one different datasets have been used in order to compare performance of EBSAA with Genetic Algorithm (GA) and Particle Swarm Align Algorithm (PSAA). The proposed technique results in better alignment as compared to GA and PSAA in most of the cases.
- Open Access
Ensemble Based Classification of Sentiments Using Forest Optimization Algorithm
Feature subset selection is a process to choose a set of relevant features from a high dimensionality dataset to improve the performance of classifiers. The meaningful words extracted from data forms a set of features for sentiment analysis. Many evolutionary algorithms, like the Genetic Algorithm (GA) and Particle Swarm Optimization (PSO), have been applied to feature subset selection problem and computational performance can still be improved. This research presents a solution to feature subset selection problem for classification of sentiments using ensemble-based classifiers. It consists of a hybrid technique of minimum redundancy and maximum relevance (mRMR) and Forest Optimization Algorithm (FOA)-based feature selection. Ensemble-based classification is implemented to optimize the results of individual classifiers. The Forest Optimization Algorithm as a feature selection technique has been applied to various classification datasets from the UCI machine learning repository. The classifiers used for ensemble methods for UCI repository datasets are the k-Nearest Neighbor (k-NN) and Naïve Bayes (NB). For the classification of sentiments, 15–20% improvement has been recorded. The dataset used for classification of sentiments is Blitzer’s dataset consisting of reviews of electronic products. The results are further improved by ensemble of k-NN, NB, and Support Vector Machine (SVM) with an accuracy of 95% for the classification of sentiment tasks.
Open AccessEnsemble Based Classification of Sentiments Using Forest Optimization Algorithm
Feature subset selection is a process to choose a set of relevant features from a high dimensionality dataset to improve the performance of classifiers. The meaningful words extracted from data forms a set of features for sentiment analysis. Many evolutionary algorithms, like the Genetic Algorithm (GA) and Particle Swarm Optimization (PSO), have been applied to feature subset selection problem and computational performance can still be improved. This research presents a solution to feature subset selection problem for classification of sentiments using ensemble-based classifiers. It consists of a hybrid technique of minimum redundancy and maximum relevance (mRMR) and Forest Optimization Algorithm (FOA)-based feature selection. Ensemble-based classification is implemented to optimize the results of individual classifiers. The Forest Optimization Algorithm as a feature selection technique has been applied to various classification datasets from the UCI machine learning repository. The classifiers used for ensemble methods for UCI repository datasets are the k-Nearest Neighbor (k-NN) and Naïve Bayes (NB). For the classification of sentiments, 15–20% improvement has been recorded. The dataset used for classification of sentiments is Blitzer’s dataset consisting of reviews of electronic products. The results are further improved by ensemble of k-NN, NB, and Support Vector Machine (SVM) with an accuracy of 95% for the classification of sentiment tasks.
- 17 July 2015
- Published by Taylor & Francis in Journal of Experimental & Theoretical Artificial Intelligence
- Vol. 28 (6) , 1061-1073
Multi-objective feature subset selection using mRMR based enhanced ant colony optimization algorithm (mRMR-EACO)
In this research, we propose a novel method to find the relevant feature subset by using ant colony optimisation minimum-redundancy–maximum-relevance. The proposed approach considers the significance of each feature while reducing the dimensionality. The performance of proposed algorithm has been compared with existing biologically inspired feature subset selection algorithms. Eight datasets have been selected from UCI machine learning repository for experimentation. The experimental results indicate that the presented algorithm out performs the other algorithms in terms of the classification accuracy and feature reduction.
- 17 July 2015
- Published by Taylor & Francis in Journal of Experimental & Theoretical Artificial Intelligence
- Vol. 28 (6) , 1061-1073
Multi-objective feature subset selection using mRMR based enhanced ant colony optimization algorithm (mRMR-EACO)
In this research, we propose a novel method to find the relevant feature subset by using ant colony optimisation minimum-redundancy–maximum-relevance. The proposed approach considers the significance of each feature while reducing the dimensionality. The performance of proposed algorithm has been compared with existing biologically inspired feature subset selection algorithms. Eight datasets have been selected from UCI machine learning repository for experimentation. The experimental results indicate that the presented algorithm out performs the other algorithms in terms of the classification accuracy and feature reduction.
- Open Access
- 1 February 2015
- Published by Universidad Nacional Autonoma de Mexico in Journal of Applied Research and Technology
- Vol. 13 (1) , 145-159
Multi-Objective Feature Subset Selection using Non-dominated Sorting Genetic Algorithm
This paper presents an evolutionary algorithm based technique to solve multi-objective feature subset selection problem. The data used for classification contains large number of features called attributes. Some of these attributes are not relevant and needs to be eliminated. In classification procedure, each feature has an effect on the accuracy, cost and learning time of the classifier. So, there is a strong requirement to select a subset of the features before building the classifier. This proposed technique treats feature subset selection as multi-objective optimization problem. This research uses one of the latest multi-objective genetic algorithms (NSGA - II). The fitness value of a particular feature subset is measured by using ID3. The testing accuracy acquired is then assigned to the fitness value. This technique is tested on several datasets taken from the UCI machine repository. The experiments demonstrate the feasibility of using NSGA-II for feature subset selection
- 1 February 2015
- Published by Universidad Nacional Autonoma de Mexico in Journal of Applied Research and Technology
- Vol. 13 (1) , 145-159
Open AccessMulti-Objective Feature Subset Selection using Non-dominated Sorting Genetic Algorithm
This paper presents an evolutionary algorithm based technique to solve multi-objective feature subset selection problem. The data used for classification contains large number of features called attributes. Some of these attributes are not relevant and needs to be eliminated. In classification procedure, each feature has an effect on the accuracy, cost and learning time of the classifier. So, there is a strong requirement to select a subset of the features before building the classifier. This proposed technique treats feature subset selection as multi-objective optimization problem. This research uses one of the latest multi-objective genetic algorithms (NSGA - II). The fitness value of a particular feature subset is measured by using ID3. The testing accuracy acquired is then assigned to the fitness value. This technique is tested on several datasets taken from the UCI machine repository. The experiments demonstrate the feasibility of using NSGA-II for feature subset selection