Pub Date : 2014-12-01DOI: 10.1109/SKIMA.2014.7083538
A. Das, Faisal Ahmed, M. Bhuiyan
In this paper, a statistical analysis of electroencephalogram (EEG) signals is carried out in the empirical mode decomposition (EMD) domain using a publicly available benchmark EEG database. First, the intrinsic mode functions (IMF) are extracted from the EEG signals in the EMD domain. Next, the investigation was carried whether the Bessel k-form (BKF) probability density function (pdf) can appropriately model the IMFs extracted in EMD domain of the EEG signals. It is shown that on an average, the BKF pdf is a suitable prior to model the first five IMFs extracted from various types of EEG recordings. After that, it is shown that the BKF parameters can distinguish among the EEG signals at those five IMF levels quite well. The analysis is further confirmed through the p-values obtained by one way analysis of variance (ANOVA). Thus, the BKF parameters in the EMD domain may be used to characterize EEG signals and help the electroencephalographers in developing fast and effective classifiers for seizure seizure detection.
{"title":"Seizure detection using Bessel k-form parameters in the empirical mode decomposition domain","authors":"A. Das, Faisal Ahmed, M. Bhuiyan","doi":"10.1109/SKIMA.2014.7083538","DOIUrl":"https://doi.org/10.1109/SKIMA.2014.7083538","url":null,"abstract":"In this paper, a statistical analysis of electroencephalogram (EEG) signals is carried out in the empirical mode decomposition (EMD) domain using a publicly available benchmark EEG database. First, the intrinsic mode functions (IMF) are extracted from the EEG signals in the EMD domain. Next, the investigation was carried whether the Bessel k-form (BKF) probability density function (pdf) can appropriately model the IMFs extracted in EMD domain of the EEG signals. It is shown that on an average, the BKF pdf is a suitable prior to model the first five IMFs extracted from various types of EEG recordings. After that, it is shown that the BKF parameters can distinguish among the EEG signals at those five IMF levels quite well. The analysis is further confirmed through the p-values obtained by one way analysis of variance (ANOVA). Thus, the BKF parameters in the EMD domain may be used to characterize EEG signals and help the electroencephalographers in developing fast and effective classifiers for seizure seizure detection.","PeriodicalId":22294,"journal":{"name":"The 8th International Conference on Software, Knowledge, Information Management and Applications (SKIMA 2014)","volume":"140 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89029723","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-12-01DOI: 10.1109/SKIMA.2014.7083520
K. Rabbi, R. Islam, Q. Mamun, M. Kaosar
Test data generation is a significant part of software and/or hardware testing. It is a complex problem and researchers have proposed various solutions to generate optimum number of test data in an acceptable polynomial time. However, most of the solutions are highly complex (NP-hard), interaction limitation and takes substantial time to generate test data set. Therefore, it is an open challenge to propose the best solution. This paper proposes a novel technique called MTTG (Multi-Tuple based T-way Test Generator) which relies on Kid's Card game strategy. The proposed technique finds optimum matching value by searching through all possible combination of similarity matching, based on data generation principle. Our empirical results demonstrate that the proposed MTTG is very efficient in test data generation based on time and interaction strength/level, compared to other existing strategies.
测试数据生成是软件和/或硬件测试的重要组成部分。这是一个复杂的问题，研究人员提出了各种解决方案，以在可接受的多项式时间内生成最优数量的测试数据。然而，大多数解决方案是高度复杂的(NP-hard)，交互限制和需要大量时间来生成测试数据集。因此，提出最佳解决方案是一个公开的挑战。本文提出了一种基于儿童纸牌游戏策略的新技术MTTG (Multi-Tuple based T-way Test Generator)。该方法基于数据生成原理，通过搜索所有可能的相似匹配组合来寻找最优匹配值。我们的实证结果表明，与其他现有策略相比，所提出的MTTG在基于时间和交互强度/水平的测试数据生成方面非常有效。
{"title":"MTTG: An efficient technique for test data generation","authors":"K. Rabbi, R. Islam, Q. Mamun, M. Kaosar","doi":"10.1109/SKIMA.2014.7083520","DOIUrl":"https://doi.org/10.1109/SKIMA.2014.7083520","url":null,"abstract":"Test data generation is a significant part of software and/or hardware testing. It is a complex problem and researchers have proposed various solutions to generate optimum number of test data in an acceptable polynomial time. However, most of the solutions are highly complex (NP-hard), interaction limitation and takes substantial time to generate test data set. Therefore, it is an open challenge to propose the best solution. This paper proposes a novel technique called MTTG (Multi-Tuple based T-way Test Generator) which relies on Kid's Card game strategy. The proposed technique finds optimum matching value by searching through all possible combination of similarity matching, based on data generation principle. Our empirical results demonstrate that the proposed MTTG is very efficient in test data generation based on time and interaction strength/level, compared to other existing strategies.","PeriodicalId":22294,"journal":{"name":"The 8th International Conference on Software, Knowledge, Information Management and Applications (SKIMA 2014)","volume":"68 1","pages":"1-8"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84016367","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-12-01DOI: 10.1109/SKIMA.2014.7083546
Abanti Shama Afroz
Modeling and simulating blood vessels in order to predict their behavior prior to surgical interventions is an emerging research field. These three dimensional models at their region of interest are generated from corresponding computed tomography (CT) or magnetic resonance imaging (MRI) scans and is often referred as the segmentation task. A critical point in similar segmentation and related post processing tasks is to measure the accuracy of the applied method with `Dice Similarity Index'. The standard procedure of evaluating this index is to compare the segmented label masks in their two dimensional phase. However, more cases are coming forward where only the finalized three dimensional structures are available. This work focuses on developing an alternative framework where the dice index of two three dimensional models are computed. The objective has been achieved by slicing the solid structures at multiple planes and for five sets with varying slice numbers. The observed Dice indices vary from 0.67 to 0.9 with a median slightly above 0.8, which is seemingly a fairly reasonable value. The results also indicate that even though dice index for a singular plane of the whole structure is not enough, increasing the slice numbers to a fairly high value does not affect the result as well.
{"title":"An alternative approach of evaluating Dice Similarity Index for Pre-segmented blood vessels","authors":"Abanti Shama Afroz","doi":"10.1109/SKIMA.2014.7083546","DOIUrl":"https://doi.org/10.1109/SKIMA.2014.7083546","url":null,"abstract":"Modeling and simulating blood vessels in order to predict their behavior prior to surgical interventions is an emerging research field. These three dimensional models at their region of interest are generated from corresponding computed tomography (CT) or magnetic resonance imaging (MRI) scans and is often referred as the segmentation task. A critical point in similar segmentation and related post processing tasks is to measure the accuracy of the applied method with `Dice Similarity Index'. The standard procedure of evaluating this index is to compare the segmented label masks in their two dimensional phase. However, more cases are coming forward where only the finalized three dimensional structures are available. This work focuses on developing an alternative framework where the dice index of two three dimensional models are computed. The objective has been achieved by slicing the solid structures at multiple planes and for five sets with varying slice numbers. The observed Dice indices vary from 0.67 to 0.9 with a median slightly above 0.8, which is seemingly a fairly reasonable value. The results also indicate that even though dice index for a singular plane of the whole structure is not enough, increasing the slice numbers to a fairly high value does not affect the result as well.","PeriodicalId":22294,"journal":{"name":"The 8th International Conference on Software, Knowledge, Information Management and Applications (SKIMA 2014)","volume":"17 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77849268","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-12-01DOI: 10.1109/SKIMA.2014.7083536
Prajoy Podder, Md. Mehedi Hasan, T. Z. Khan
A digital system frequently requires memory for storage. To facilitate this requirement, FPGAs offer different types of memory, ranging from block RAM, a highly distributed RAM in the form of the multiple LUTs, right down to the storage of data in the flip-flops. However, unlike the conventional RAMs, dynamic random access memory (DRAM) is best suited for larger volumes of memory, because it permits complex yet advanced levels of integration, occupies less space in motherboard due to reduced feature size, and more importantly, it is inexpensive. Dynamic RAMs evolved from the earliest 1- kilobit (KB) generation to the modern 1-gigabit (GB) generation through the advances and developments in not only semiconductor process but also circuit design technology. This paper proposes resistor transistor logic (RTL) design of the firstgeneration and second-generation high performance (Fast Page Mode) dynamic random access memory. The simulation diagram was experimented using the Verilogger Test bench pro 6.5 software. The timing as well as device utilization summary has been presented in this paper and compared for both normal and fast page mode DRAM. For fast page mode DRAM, the combinational path delay was less compared to the first generation DRAM.
{"title":"FPGA implementation of high performance Fast Page Mode dynamic random access memory","authors":"Prajoy Podder, Md. Mehedi Hasan, T. Z. Khan","doi":"10.1109/SKIMA.2014.7083536","DOIUrl":"https://doi.org/10.1109/SKIMA.2014.7083536","url":null,"abstract":"A digital system frequently requires memory for storage. To facilitate this requirement, FPGAs offer different types of memory, ranging from block RAM, a highly distributed RAM in the form of the multiple LUTs, right down to the storage of data in the flip-flops. However, unlike the conventional RAMs, dynamic random access memory (DRAM) is best suited for larger volumes of memory, because it permits complex yet advanced levels of integration, occupies less space in motherboard due to reduced feature size, and more importantly, it is inexpensive. Dynamic RAMs evolved from the earliest 1- kilobit (KB) generation to the modern 1-gigabit (GB) generation through the advances and developments in not only semiconductor process but also circuit design technology. This paper proposes resistor transistor logic (RTL) design of the firstgeneration and second-generation high performance (Fast Page Mode) dynamic random access memory. The simulation diagram was experimented using the Verilogger Test bench pro 6.5 software. The timing as well as device utilization summary has been presented in this paper and compared for both normal and fast page mode DRAM. For fast page mode DRAM, the combinational path delay was less compared to the first generation DRAM.","PeriodicalId":22294,"journal":{"name":"The 8th International Conference on Software, Knowledge, Information Management and Applications (SKIMA 2014)","volume":"162 1","pages":"1-7"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86184145","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-12-01DOI: 10.1109/SKIMA.2014.7083567
M. Alam, M. M. Naushad Ali, M. A. Syed, Nawaj Sorif, M. Rahaman
This paper proposes an effective algorithm for detecting and distinguishing defects in industrial pipes. In many of the industries, conventional defects detection methods are performed by experienced human inspectors who sketch defect patterns manually. However, such detection methods are much expensive and time consuming. To overcome these problems, a method has been introduced to detect defects automatically and effectively in industrial pipes based on image processing. Although, most of the image-based approaches focus on the accuracy of fault detection, the computation time is also important for practical applications. The proposed algorithm comprises of three steps. At the first step, it converts the RGB image of the pipe into a grayscale image and extracts the edges using Sobel gradient method, after which it eliminates the undesired objects based on their size. Secondly, it extracts the dimensions of the pipe. And finally this algorithm detects and identifies the defects i.e., holes and cracks on the pipe based on their characteristics. Tests on various kinds of pipes have been carried out using the algorithm, and the results show that the accuracy of identification rate is about 96% at hole detection and 93% at crack detection.
{"title":"An algorithm to detect and identify defects of industrial pipes using image processing","authors":"M. Alam, M. M. Naushad Ali, M. A. Syed, Nawaj Sorif, M. Rahaman","doi":"10.1109/SKIMA.2014.7083567","DOIUrl":"https://doi.org/10.1109/SKIMA.2014.7083567","url":null,"abstract":"This paper proposes an effective algorithm for detecting and distinguishing defects in industrial pipes. In many of the industries, conventional defects detection methods are performed by experienced human inspectors who sketch defect patterns manually. However, such detection methods are much expensive and time consuming. To overcome these problems, a method has been introduced to detect defects automatically and effectively in industrial pipes based on image processing. Although, most of the image-based approaches focus on the accuracy of fault detection, the computation time is also important for practical applications. The proposed algorithm comprises of three steps. At the first step, it converts the RGB image of the pipe into a grayscale image and extracts the edges using Sobel gradient method, after which it eliminates the undesired objects based on their size. Secondly, it extracts the dimensions of the pipe. And finally this algorithm detects and identifies the defects i.e., holes and cracks on the pipe based on their characteristics. Tests on various kinds of pipes have been carried out using the algorithm, and the results show that the accuracy of identification rate is about 96% at hole detection and 93% at crack detection.","PeriodicalId":22294,"journal":{"name":"The 8th International Conference on Software, Knowledge, Information Management and Applications (SKIMA 2014)","volume":"5 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75856115","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-12-01DOI: 10.1109/SKIMA.2014.7083555
Golam Md. Muradul Bashir, Arpita Howlader, I. Shemu, E. Ety
Database system is used for access multiple users, prevent loss of data and provide security for access of real life or synthetic data set. The complexity of data requirement increasing day by day; therefore minimization of schema becomes an important role for equi distribution or equalization of two or more problems. We find the effect of normalization and de-normalization on minimization of schema of real life data model as well as synthetic data model. Schema complexity is measured by transmitting schema to a graph with weight or weighted graph. Selected special fundamentals from schema for weight the schema graph are described as major part. Minimization of schema ensures easy to measure the schema complexity. The purpose of this sightsee is to appraisal the effectiveness of weighted graph of schema to minimize as well as to measure the complexity.
{"title":"Effectiveness of weighted graph of schema to aid the minimization and measurement of schema complexity","authors":"Golam Md. Muradul Bashir, Arpita Howlader, I. Shemu, E. Ety","doi":"10.1109/SKIMA.2014.7083555","DOIUrl":"https://doi.org/10.1109/SKIMA.2014.7083555","url":null,"abstract":"Database system is used for access multiple users, prevent loss of data and provide security for access of real life or synthetic data set. The complexity of data requirement increasing day by day; therefore minimization of schema becomes an important role for equi distribution or equalization of two or more problems. We find the effect of normalization and de-normalization on minimization of schema of real life data model as well as synthetic data model. Schema complexity is measured by transmitting schema to a graph with weight or weighted graph. Selected special fundamentals from schema for weight the schema graph are described as major part. Minimization of schema ensures easy to measure the schema complexity. The purpose of this sightsee is to appraisal the effectiveness of weighted graph of schema to minimize as well as to measure the complexity.","PeriodicalId":22294,"journal":{"name":"The 8th International Conference on Software, Knowledge, Information Management and Applications (SKIMA 2014)","volume":"1 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89544170","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-12-01DOI: 10.1109/SKIMA.2014.7083543
Md Shoab Miah, Sabirat Rubya, Md Faisal Kabir
Exposure to excessive noise for long duration is one of the avoidable occupational health hazards with substantial physiological and social effect. When engineering controls and work practices are not realistic, hearing protectors should be used for reducing sound exposure to safe levels. But accurate assessment of noise induction is necessary before taking any adequate measures. The effects of occupational noise induced hearing loss are higher in the developing regions compared to the developed countries. This is due to lack of prevalent epidemiological data regarding risk factors and costs of NIHL. Hence, in this paper, we have estimated the degree of occupational NIHL among people from different professions via a smartphone application: HearlT. We have addressed five different professions primarily but more extensive deployment of this application can reveal more accurate state of occupational NIHL which can be used to raise awareness among workers about the harmful effects of noise on hearing and other body systems by implementing compulsory education or training programs.
{"title":"Assessment of occupational noise induced hearing loss via a smartphone application","authors":"Md Shoab Miah, Sabirat Rubya, Md Faisal Kabir","doi":"10.1109/SKIMA.2014.7083543","DOIUrl":"https://doi.org/10.1109/SKIMA.2014.7083543","url":null,"abstract":"Exposure to excessive noise for long duration is one of the avoidable occupational health hazards with substantial physiological and social effect. When engineering controls and work practices are not realistic, hearing protectors should be used for reducing sound exposure to safe levels. But accurate assessment of noise induction is necessary before taking any adequate measures. The effects of occupational noise induced hearing loss are higher in the developing regions compared to the developed countries. This is due to lack of prevalent epidemiological data regarding risk factors and costs of NIHL. Hence, in this paper, we have estimated the degree of occupational NIHL among people from different professions via a smartphone application: HearlT. We have addressed five different professions primarily but more extensive deployment of this application can reveal more accurate state of occupational NIHL which can be used to raise awareness among workers about the harmful effects of noise on hearing and other body systems by implementing compulsory education or training programs.","PeriodicalId":22294,"journal":{"name":"The 8th International Conference on Software, Knowledge, Information Management and Applications (SKIMA 2014)","volume":"108 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89198261","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-12-01DOI: 10.1109/SKIMA.2014.7083541
Khalid Hussain, Shanto Rahman, S. Khaled, M. Abdullah-Al-Wadud, M. Shoyaib
Image enhancement processes an image to increase the visual information of that image. Image quality can be degraded for several reasons such as lack of operator expertise, quality of image capturing devices, etc. The process of enhancing images may produce different types of noises such as unnatural effects, over-enhancement, artifacts, etc. These drawbacks are more prominent in the dark images. Over the years, many image enhancement techniques have been proposed. However, there have been a few works specifically for dark image enhancement. Though the available methods enhance the dark images, they might not produce desired output for dark images. To overcome the above drawbacks, we propose a method for dark image enhancement. In this paper, we enhance the images by applying local transformation technique on input image histogram. We smooth the input image histogram to find out the location of peaks and valleys from the histogram. Several segments are identified using valley to valley distance. Then a transformation method is applied on each segment of image histogram. Finally, histogram specification is applied on the input image using this transformed histogram. This method improves the quality of the image with minimal unexpected artifacts. Experimental results show that our method outperforms other methods in majority cases.
{"title":"Dark image enhancement by locally transformed histogram","authors":"Khalid Hussain, Shanto Rahman, S. Khaled, M. Abdullah-Al-Wadud, M. Shoyaib","doi":"10.1109/SKIMA.2014.7083541","DOIUrl":"https://doi.org/10.1109/SKIMA.2014.7083541","url":null,"abstract":"Image enhancement processes an image to increase the visual information of that image. Image quality can be degraded for several reasons such as lack of operator expertise, quality of image capturing devices, etc. The process of enhancing images may produce different types of noises such as unnatural effects, over-enhancement, artifacts, etc. These drawbacks are more prominent in the dark images. Over the years, many image enhancement techniques have been proposed. However, there have been a few works specifically for dark image enhancement. Though the available methods enhance the dark images, they might not produce desired output for dark images. To overcome the above drawbacks, we propose a method for dark image enhancement. In this paper, we enhance the images by applying local transformation technique on input image histogram. We smooth the input image histogram to find out the location of peaks and valleys from the histogram. Several segments are identified using valley to valley distance. Then a transformation method is applied on each segment of image histogram. Finally, histogram specification is applied on the input image using this transformed histogram. This method improves the quality of the image with minimal unexpected artifacts. Experimental results show that our method outperforms other methods in majority cases.","PeriodicalId":22294,"journal":{"name":"The 8th International Conference on Software, Knowledge, Information Management and Applications (SKIMA 2014)","volume":"1 1","pages":"1-7"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78325080","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-12-01DOI: 10.1109/SKIMA.2014.7083558
M. Selim, Md. Saeed Siddik, Tajkia Rahman, Alim Ul Gias, S. Khaled
Legacy software, often written in procedural languages, could be a major concern for organizations due to low maintainability. A possible way out could be migrating the software to object oriented architecture, which is easier to maintain due to better modularity. However, a manual migration could take significant time and thus an automated process is required. This migration problem has been modeled as an optimal graph clustering problem where vertices and edges are represented by function and function calls respectively. Solution to this problem is NP-hard and thus meta-heuristic base approaches are potential to get near optimal result. This paper presents a Variable Neighborhood Search (VNS) approach for addressing the modeled graph clustering problem. The method provides a set of clusters that gives a clue for possible structure of the object oriented architecture. This approach is based on the objective to minimize the coupling and maximize the cohesion within the clusters. The proposed algorithm was implemented and its performance was compared with state of the art techniques. It is observed that the proposed method produced 37.15% and 12.02% better results in contrast to genetic algorithm and local search heuristics.
{"title":"Approximating object based architecture for legacy software written in procedural languages using Variable Neighborhood Search","authors":"M. Selim, Md. Saeed Siddik, Tajkia Rahman, Alim Ul Gias, S. Khaled","doi":"10.1109/SKIMA.2014.7083558","DOIUrl":"https://doi.org/10.1109/SKIMA.2014.7083558","url":null,"abstract":"Legacy software, often written in procedural languages, could be a major concern for organizations due to low maintainability. A possible way out could be migrating the software to object oriented architecture, which is easier to maintain due to better modularity. However, a manual migration could take significant time and thus an automated process is required. This migration problem has been modeled as an optimal graph clustering problem where vertices and edges are represented by function and function calls respectively. Solution to this problem is NP-hard and thus meta-heuristic base approaches are potential to get near optimal result. This paper presents a Variable Neighborhood Search (VNS) approach for addressing the modeled graph clustering problem. The method provides a set of clusters that gives a clue for possible structure of the object oriented architecture. This approach is based on the objective to minimize the coupling and maximize the cohesion within the clusters. The proposed algorithm was implemented and its performance was compared with state of the art techniques. It is observed that the proposed method produced 37.15% and 12.02% better results in contrast to genetic algorithm and local search heuristics.","PeriodicalId":22294,"journal":{"name":"The 8th International Conference on Software, Knowledge, Information Management and Applications (SKIMA 2014)","volume":"1 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80210904","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-12-01DOI: 10.1109/SKIMA.2014.7083556
Pooja Lepcha, W. Srisukkham, Li Zhang, Md. Alamgir Hossain
Cell segmentation is a challenging problem due to the complexity and nature of the blood cells. Traditional methods of counting the cells are slow, error prone and often influenced by the performance of the operator. This paper aims to segment and count Red Blood Cells (RBCs) automatically shown in microscopic blood images to determine the condition of the person under examination. We also aim to increase the accuracy of segmentation by precisely looking into the counting of the overlapped cells which is the most conventional challenging task faced by many researchers. The RBCs in this paper are segmented using the integration of marker controlled watershed segmentation with morphological operations. The result of the proposed algorithm was validated with the manual counting method, and a good conformity of about 93.13 % was obtained. The future work will involve segmentation of more complex overlapping cells and the development of Smartphone based realtime disease screening system.
{"title":"Red Blood based disease screening using marker controlled watershed segmentation and post-processing","authors":"Pooja Lepcha, W. Srisukkham, Li Zhang, Md. Alamgir Hossain","doi":"10.1109/SKIMA.2014.7083556","DOIUrl":"https://doi.org/10.1109/SKIMA.2014.7083556","url":null,"abstract":"Cell segmentation is a challenging problem due to the complexity and nature of the blood cells. Traditional methods of counting the cells are slow, error prone and often influenced by the performance of the operator. This paper aims to segment and count Red Blood Cells (RBCs) automatically shown in microscopic blood images to determine the condition of the person under examination. We also aim to increase the accuracy of segmentation by precisely looking into the counting of the overlapped cells which is the most conventional challenging task faced by many researchers. The RBCs in this paper are segmented using the integration of marker controlled watershed segmentation with morphological operations. The result of the proposed algorithm was validated with the manual counting method, and a good conformity of about 93.13 % was obtained. The future work will involve segmentation of more complex overlapping cells and the development of Smartphone based realtime disease screening system.","PeriodicalId":22294,"journal":{"name":"The 8th International Conference on Software, Knowledge, Information Management and Applications (SKIMA 2014)","volume":"42 1","pages":"1-7"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81253857","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：