The aim of this paper is to introduce a comparison between cell tracking using active shape model (ASM)
and active appearance model (AAM) algorithms, to compare the cells tracking quality between the two
methods to track the mobility of the living cells. Where sensitive and accurate cell tracking system is
essential to cell motility studies. The active shape model (ASM) and active appearance model (AAM)
algorithms has proved to be a successful methods for matching statistical models. The experimental results
indicate the ability of (AAM) meth
Medical Image segmentation using Image Mining conceptsEditor IJMTER
Image differencing is usually done by subtracting the low-level skin texture like strength
in images that are already associated. This paper extracts high-level skin texture in order to find out
an efficient image differencing method for the analysis of Brain Tumor. On the other hand, this
produces sets of skin texture that are both spatial. We demonstrate a technique that avoids arbitrary
spatial constraints and is robust in the presence of sound, outliers, and imaging artifact, while
outperforming even profitable products in the analysis of Brain Tumor images. First, the landmark
are establish, and then the top entrant are sorted into a end set. Second, the top sets of the two
descriptions are then differenced through a cluster judgment. The symmetry of the human body is
utilized to increase the accuracy of the finding. We imitate this technique in an effort to understand
and ultimately capture the judgment of the radiologist. The image differencing with clustered
contrast process determines the being there of Brain Tumor. Using the most favorable features
extracted from normal and tumor regions of MRI by using arithmetical features, classifiers are used
to categorize and segment the tumor portion in irregular images. Both the difficult and preparation
phase gives the proportion of accuracy on each parameter in neural networks, which gives the idea to
decide the best one to be used in supplementary works. The results showed outperformance of
algorithm when compared with classification accuracy which works as shows potential tool for
classification and requires extension in brain tumor analysis.
A NOVEL IMAGE SEGMENTATION ENHANCEMENT TECHNIQUE BASED ON ACTIVE CONTOUR AND...acijjournal
This document summarizes a novel image segmentation technique based on active contours and topological alignments. The technique aims to improve boundary detection by incorporating the advantages of both active contours and topological alignments. It presents a two-step algorithm: 1) Initial segmentation is performed using topological alignments to improve cell tracking results. 2) The output is transformed into the input for an active contour model, which evolves toward cell boundaries for analysis of cell mobility. Tests on 70 grayscale cell images showed the technique achieved better segmentation and boundary detection compared to active contours alone, including for low contrast images and cases of under/over-segmentation.
Medical Image Analysis Through A Texture Based Computer Aided Diagnosis Frame...CSCJournals
The document presents a Texture Based Computer Aided Diagnosis (T-CAD) Framework for analyzing medical images through texture analysis. The framework allows defining mathematical models of objects in medical images and automatically generates applications to support tasks like segmentation, mass detection, and reconstruction based on each model. The framework architecture is described, including a Region Based Algorithm for building mathematical models from training images and classifying new images. Several textural image filters used in the framework are also outlined, including filters for measuring informative, texture, and pattern information. The framework is tested on MRI brain images and results are reported.
This document proposes a method for improving medical image registration using mutual information. It aims to address limitations in standard mutual information-based registration when there are local intensity variations. The method incorporates spatial and geometric information by computing mutual information in regions identified by the Harris corner detection operator. These regions have large spatial variations that provide geometric information. The method is tested on synthetic and clinical data, showing improved registration accuracy. It is implemented on a GPU for increased parallel processing efficiency, providing a 4-46% speed improvement over standard registration methods.
Image Registration for Recovering Affine Transformation Using Nelder Mead Sim...CSCJournals
This paper proposes a parallel approach for the Vector Quantization (VQ) problem in image processing. VQ deals with codebook generation from the input training data set and replacement of any arbitrary data with the nearest codevector. Most of the efforts in VQ have been directed towards designing parallel search algorithms for the codebook, and little has hitherto been done in evolving a parallelized procedure to obtain an optimum codebook. This parallel algorithm addresses the problem of designing an optimum codebook using the traditional LBG type of vector quantization algorithm for shared memory systems and for the efficient usage of parallel processors. Using the codebook formed from a training set, any arbitrary input data is replaced with the nearest codevector from the codebook. The effectiveness of the proposed algorithm is indicated.
Survey on Brain MRI Segmentation TechniquesEditor IJMTER
Image segmentation is aimed at cutting out, a ROI (Region of Interest) from an image. For
medical images, segmentation is done for: studying the anatomical structure, identifying ROI ie tumor
or any other abnormalities, identifying the increase in tissue volume in a region, treatment planning.
Currently there are many different algorithms available for image segmentation. This paper lists and
compares some of them. Each has their own advantages and limitations.
International Journal of Engineering Research and Development (IJERD)IJERD Editor
This document provides an overview of medical image segmentation techniques. It discusses fundamental medical image processing steps such as image capture, enhancement, segmentation, and feature extraction. Various segmentation methods are reviewed, including thresholding, region-based, edge detection, and hybrid techniques. The document emphasizes the need for developing robust segmentation methods that can recognize malignant growths early to improve cancer treatment outcomes.
Image registration is the fundamental task used to
match two or more partially overlapping images taken, for
example, at different times,from different sensors, or from
different viewpoints and stitch these images into one
panoramic image comprising the whole scene. It is
afundamental image processing technique and is very useful
in integrating information from different sensors, finding
changes in images taken at different times, inferring threedimensional
information from stereo images, and recognizing
model-based objects.
This paper overviews the theoretical aspects of an image
registration problem. The purpose of this paper is to present a
survey of image registration techniques. This technique of
image registration aligns two images geometrically. These two
images are reference image and sensed image. The ultimate
purpose of digital image filtering is to support the visual
identification of certain features expressed by characteristic
shapes and patterns. Numerous recipes, algorithms and ready
made programs exist nowadays that predominantly have in
common that users have to set certain parameters.
Particularly if processing is fast and shows results rather
immediately, the choice of parameters may be guided by
making the image ―looking nice‖. However, in practical
situations most users are not in a mood to ―play around‖
with a displayed image, particularly if they are in a stressy
situation as it may encountered in security applications. The
requirements for the application of digital image processing
under such circumstances will be discussed with an example
of automaticfiltering without manual parameter settings that
even entails the advantage of delivering unbiased results
Medical Image segmentation using Image Mining conceptsEditor IJMTER
Image differencing is usually done by subtracting the low-level skin texture like strength
in images that are already associated. This paper extracts high-level skin texture in order to find out
an efficient image differencing method for the analysis of Brain Tumor. On the other hand, this
produces sets of skin texture that are both spatial. We demonstrate a technique that avoids arbitrary
spatial constraints and is robust in the presence of sound, outliers, and imaging artifact, while
outperforming even profitable products in the analysis of Brain Tumor images. First, the landmark
are establish, and then the top entrant are sorted into a end set. Second, the top sets of the two
descriptions are then differenced through a cluster judgment. The symmetry of the human body is
utilized to increase the accuracy of the finding. We imitate this technique in an effort to understand
and ultimately capture the judgment of the radiologist. The image differencing with clustered
contrast process determines the being there of Brain Tumor. Using the most favorable features
extracted from normal and tumor regions of MRI by using arithmetical features, classifiers are used
to categorize and segment the tumor portion in irregular images. Both the difficult and preparation
phase gives the proportion of accuracy on each parameter in neural networks, which gives the idea to
decide the best one to be used in supplementary works. The results showed outperformance of
algorithm when compared with classification accuracy which works as shows potential tool for
classification and requires extension in brain tumor analysis.
A NOVEL IMAGE SEGMENTATION ENHANCEMENT TECHNIQUE BASED ON ACTIVE CONTOUR AND...acijjournal
This document summarizes a novel image segmentation technique based on active contours and topological alignments. The technique aims to improve boundary detection by incorporating the advantages of both active contours and topological alignments. It presents a two-step algorithm: 1) Initial segmentation is performed using topological alignments to improve cell tracking results. 2) The output is transformed into the input for an active contour model, which evolves toward cell boundaries for analysis of cell mobility. Tests on 70 grayscale cell images showed the technique achieved better segmentation and boundary detection compared to active contours alone, including for low contrast images and cases of under/over-segmentation.
Medical Image Analysis Through A Texture Based Computer Aided Diagnosis Frame...CSCJournals
The document presents a Texture Based Computer Aided Diagnosis (T-CAD) Framework for analyzing medical images through texture analysis. The framework allows defining mathematical models of objects in medical images and automatically generates applications to support tasks like segmentation, mass detection, and reconstruction based on each model. The framework architecture is described, including a Region Based Algorithm for building mathematical models from training images and classifying new images. Several textural image filters used in the framework are also outlined, including filters for measuring informative, texture, and pattern information. The framework is tested on MRI brain images and results are reported.
This document proposes a method for improving medical image registration using mutual information. It aims to address limitations in standard mutual information-based registration when there are local intensity variations. The method incorporates spatial and geometric information by computing mutual information in regions identified by the Harris corner detection operator. These regions have large spatial variations that provide geometric information. The method is tested on synthetic and clinical data, showing improved registration accuracy. It is implemented on a GPU for increased parallel processing efficiency, providing a 4-46% speed improvement over standard registration methods.
Image Registration for Recovering Affine Transformation Using Nelder Mead Sim...CSCJournals
This paper proposes a parallel approach for the Vector Quantization (VQ) problem in image processing. VQ deals with codebook generation from the input training data set and replacement of any arbitrary data with the nearest codevector. Most of the efforts in VQ have been directed towards designing parallel search algorithms for the codebook, and little has hitherto been done in evolving a parallelized procedure to obtain an optimum codebook. This parallel algorithm addresses the problem of designing an optimum codebook using the traditional LBG type of vector quantization algorithm for shared memory systems and for the efficient usage of parallel processors. Using the codebook formed from a training set, any arbitrary input data is replaced with the nearest codevector from the codebook. The effectiveness of the proposed algorithm is indicated.
Survey on Brain MRI Segmentation TechniquesEditor IJMTER
Image segmentation is aimed at cutting out, a ROI (Region of Interest) from an image. For
medical images, segmentation is done for: studying the anatomical structure, identifying ROI ie tumor
or any other abnormalities, identifying the increase in tissue volume in a region, treatment planning.
Currently there are many different algorithms available for image segmentation. This paper lists and
compares some of them. Each has their own advantages and limitations.
International Journal of Engineering Research and Development (IJERD)IJERD Editor
This document provides an overview of medical image segmentation techniques. It discusses fundamental medical image processing steps such as image capture, enhancement, segmentation, and feature extraction. Various segmentation methods are reviewed, including thresholding, region-based, edge detection, and hybrid techniques. The document emphasizes the need for developing robust segmentation methods that can recognize malignant growths early to improve cancer treatment outcomes.
Image registration is the fundamental task used to
match two or more partially overlapping images taken, for
example, at different times,from different sensors, or from
different viewpoints and stitch these images into one
panoramic image comprising the whole scene. It is
afundamental image processing technique and is very useful
in integrating information from different sensors, finding
changes in images taken at different times, inferring threedimensional
information from stereo images, and recognizing
model-based objects.
This paper overviews the theoretical aspects of an image
registration problem. The purpose of this paper is to present a
survey of image registration techniques. This technique of
image registration aligns two images geometrically. These two
images are reference image and sensed image. The ultimate
purpose of digital image filtering is to support the visual
identification of certain features expressed by characteristic
shapes and patterns. Numerous recipes, algorithms and ready
made programs exist nowadays that predominantly have in
common that users have to set certain parameters.
Particularly if processing is fast and shows results rather
immediately, the choice of parameters may be guided by
making the image ―looking nice‖. However, in practical
situations most users are not in a mood to ―play around‖
with a displayed image, particularly if they are in a stressy
situation as it may encountered in security applications. The
requirements for the application of digital image processing
under such circumstances will be discussed with an example
of automaticfiltering without manual parameter settings that
even entails the advantage of delivering unbiased results
Intelligent computing techniques on medical image segmentation and analysis a...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
New Approach for Detecting and Tracking a Moving Object IJECEIAES
This article presents the implementation of a tracking system for a moving target using a fixed camera. The objective of this work is the ability to detect a moving object and locate their positions. In picture processing, tracking moving objects in a known or unknown environment is commonly studied. It is based on invariance properties of objects of interest. The invariance can affect the geometry of the scene or the objects. The proposed approach is composed of several steps; the first is the extraction of points of interest in the current image. Then, these points will be tracked in the following image by using techniques for calculating the optical flow. After this step, the static points will be removed to focus on moving objects, That is to say, there is only the characteristic points belonging to moving objects. Now, to detect moving targets using images of the video, the background is first extracted from the successive images. In our approach, a method of the average values of every pixel has been developed for modeling background. The last step which stays before switching to tracking moving object is the segmentation which allows identifying every moving object. And by using the characteristic points in the previous steps.
The document presents a study that implemented segmentation and classification techniques for mammogram images to detect breast cancer malignancy. It used Gray Level Difference Method (GLDM) and Gabor texture feature extraction methods with Support Vector Machine (SVM) and K-Nearest Neighbors (K-NN) classifiers. The results showed that GLDM features with SVM achieved the best classification accuracy of 95.83%, outperforming the other combinations. The study concluded the GLDM and SVM approach provided the most effective classification of mammogram images.
Segmentation of Brain MR Images for Tumor Extraction by Combining Kmeans Clus...CSCJournals
Segmentation of images holds an important position in the area of image processing. It becomes more important while typically dealing with medical images where pre-surgery and post surgery decisions are required for the purpose of initiating and speeding up the recovery process [5] Computer aided detection of abnormal growth of tissues is primarily motivated by the necessity of achieving maximum possible accuracy. Manual segmentation of these abnormal tissues cannot be compared with modern day’s high speed computing machines which enable us to visually observe the volume and location of unwanted tissues. A well known segmentation problem within MRI is the task of labeling voxels according to their tissue type which include White Matter (WM), Grey Matter (GM) , Cerebrospinal Fluid (CSF) and sometimes pathological tissues like tumor etc. This paper describes an efficient method for automatic brain tumor segmentation for the extraction of tumor tissues from MR images. It combines Perona and Malik anisotropic diffusion model for image enhancement and Kmeans clustering technique for grouping tissues belonging to a specific group. The proposed method uses T1, T2 and PD weighted gray level intensity images. The proposed technique produced appreciative results
Q UANTUM C LUSTERING -B ASED F EATURE SUBSET S ELECTION FOR MAMMOGRAPHIC I...ijcsit
In this paper, we present an algorithm for feature selection. This algorithm labeled QC-FS: Quantum
Clustering for Feature Selection performs the selection in two steps. Partitioning the original features
space in order to group similar features is performed using the Quantum Clustering algorithm. Then the
selection of a representative for each cluster is carried out. It uses similarity measures such as correlation
coefficient (CC) and the mutual information (MI). The feature which maximizes this information is chosen
by the algorithm
Medical Image Segmentation Based on Level Set MethodIOSR Journals
This document presents a new medical image segmentation technique based on the level set method. The technique uses a combination of thresholding, morphological erosion, and a variational level set method. Thresholding is applied to determine object pixels, followed by optional erosion to remove small fragments. Then a variational level set method is applied on the original image to evaluate the contour and segment objects. The technique is tested on various medical images and provides good segmentation results, though it struggles with complex images containing multiple distinct objects.
A new hybrid method for the segmentation of the brain mrissipij
The magnetic resonance imaging is a method which has undeniable qualities of contrast and tissue
characterization, presenting an interest in the follow-up of various pathologies such as the multiple
sclerosis. In this work, a new method of hybrid segmentation is presented and applied to Brain MRIs. The
extraction of the image of the brain is pretreated with the Non Local Means filter. A theoretical approach is
proposed; finally the last section is organized around an experimental part allowing the study of the
behavior of our model on textured images. In the aim to validate our model, different segmentations were
down on pathological Brain MRI, the obtained results have been compared to the results obtained by
another models. This results show the effectiveness and the robustness of the suggested approach.
This document summarizes a research paper on accurate multimodality registration of medical images. It discusses how image registration is important for aligning images from different modalities (MRI, CT, PET, etc.) to integrate useful data and observe changes over time. The paper presents a registration algorithm that uses mutual information as a metric to match images without relying on direct pixel intensity comparisons. It describes the basic components of registration including transforms, interpolators, metrics and optimizers. Results show the algorithm successfully registers MRI and proton density MRI images without limits. The algorithm could provide a useful approach for multi-modal medical image registration.
The purpose of this paper is to present a survey of image registration techniques. Registration is a fundamental task in image processing used to match two or more pictures taken, for example, at different times, from different sensors, or from different viewpoints. It geometrically aligns two images the reference and sensed images. Specific examples of systems where image registration is a significant component include matching a target with a real-time image of a scene. Various applications of image registration are target recognition, monitoring global land usage using satellite images, matching stereo images to recover shape for navigation, and aligning images from different medical modalities for diagnosis.
Segmentation of Tumor Region in MRI Images of Brain using Mathematical Morpho...CSCJournals
This paper introduces an efficient detection of brain tumor from cerebral MRI images. The methodology consists of two steps: enhancement and segmentation. To improve the quality of images and limit the risk of distinct regions fusion in the segmentation phase an enhancement process is applied. We applied mathematical morphology to increase the contrast in MRI images and to segment MRI images. Some of experimental results on brain images show the feasibility and the performance of the proposed approach.
Detection of uveal melanoma using fuzzy and neural networks classifiersTELKOMNIKA JOURNAL
The use of image processing is increasingly utilized for disease detection. In this article, an algorithm is proposed to detect uveal melanoma (UM) which is a type of intraocular cancer. The proposed method integrates algorithms related to iris segmentation and proposes a novel algorithm for the detection of UM from the approach of fuzzy logic and neural networks. The study case results show 76% correct classification in the fuzzy logic system and 96.04% for the artificial neural networks.
Brain Tumor Extraction from T1- Weighted MRI using Co-clustering and Level Se...CSCJournals
The aim of the paper is to propose effective technique for tumor extraction from T1-weighted magnetic resonance brain images with combination of co-clustering and level set methods. The co-clustering is the effective region based segmentation technique for the brain tumor extraction but have a drawback at the boundary of tumors. While, the level set without re-initialization which is good edge based segmentation technique but have some drawbacks in providing initial contour. Therefore, in this paper the region based co-clustering and edge-based level set method are combined through initially extracting tumor using co-clustering and then providing the initial contour to level set method, which help in cancelling the drawbacks of co-clustering and level set method. The data set of five patients, where one slice is selected from each data set is used to analyze the performance of the proposed method. The quality metrics analysis of the proposed method is proved much better as compared to level set without re-initialization method.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
MRIIMAGE SEGMENTATION USING LEVEL SET METHOD AND IMPLEMENT AN MEDICAL DIAGNOS...cseij
Image segmentation plays a vital role in image processing over the last few years. The goal of image segmentation is to cluster the pixels into salient image regions i.e., regions corresponding to individual surfaces, objects, or natural parts of objects. In this paper, we propose a medical diagnosis system by using level set method for segmenting the MRI image which investigates a new variational level set algorithm without re- initialization to segment the MRI image and to implement a competent medical diagnosis system by using MATLAB. Here we have used the speed function and the signed distance function of the image in segmentation algorithm. This system consists of thresholding technique, curve evolution technique and an eroding technique. Our proposed system was tested on some MRI Brain images, giving promising results by detecting the normal or abnormal condition specially the existence of tumers. This system will be applied to both simulated and real images with promising results
This document proposes a hybrid approach using genetic algorithm, K-nearest neighbor, and probabilistic neural network for classifying MRI brain tumors. It extracts texture features using gray level co-occurrence matrix from wavelet decomposed MRI images. A genetic algorithm is then used for feature selection to identify an optimal feature subset for classification. Finally, probabilistic neural network is used to classify tumors into seven types based on the selected features, achieving accurate classification results.
Image Fusion and Image Quality Assessment of Fused ImagesCSCJournals
Accurate diagnosis of tumor extent is important in radiotherapy. This paper presents the use of image fusion of PET and MRI image. Multi-sensor image fusion is the process of combining information from two or more images into a single image. The resulting image contains more information as compared to individual images. PET delivers high-resolution molecular imaging with a resolution down to 2.5 mm full width at half maximum (FWHM), which allows us to observe the brain\'s molecular changes using the specific reporter genes and probes. On the other hand, the 7.0 T-MRI, with sub-millimeter resolution images of the cortical areas down to 250 m, allows us to visualize the fine details of the brainstem areas as well as the many cortical and sub-cortical areas. The PET-MRI fusion imaging system provides complete information on neurological diseases as well as cognitive neurosciences. The paper presents PCA based image fusion and also focuses on image fusion algorithm based on wavelet transform to improve resolution of the images in which two images to be fused are firstly decomposed into sub-images with different frequency and then the information fusion is performed and finally these sub-images are reconstructed into result image with plentiful information. . We also propose image fusion in Radon space. This paper presents assessment of image fusion by measuring the quantity of enhanced information in fused images. We use entropy, mean, standard deviation and Fusion Mutual Information, cross correlation , Mutual Information Root Mean Square Error, Universal Image Quality Index and Relative shift in mean to compare fused image quality. Comparative evaluation of fused images is a critical step to evaluate the relative performance of different image fusion algorithms. In this paper, we also propose image quality metric based on the human vision system (HVS).
Performance Evaluation of Basic Segmented Algorithms for Brain Tumor DetectionIOSR Journals
In the field of computers segmentation of image plays a very important role. By this method the required
portion of object is traced from the image. In medical image segmentation, clustering is very famous
method . By clustering, an image is divided into a number of various groups or can also be called as clusters.
There are various methods of clustering and thresholding which have been proposed in this paper such as otsu
, region growing , K Means , fuzzy c means and Hierarchical self organizing mapping algorithm. Fuzzy c-means
(FCM) is a method of clustering which allows one piece of data to belong to two or more clusters. This method
(developed by Dunn in 1973 and improved by Bezdek in 1981) is frequently used in pattern recognition. As
process of fuzzy c mean is too slow, this drawback is then removed. In this paper by experimental analysis and
performance parameters the segmentation of hierarchical self organizing mapping method is done in a better
way as compared to other algorithms. The various parameters used for the evaluation of the performance are as follows: segmentation accuracy (Sa) , area (A), rand index (Ri),and global consistency error (Gce)
AN AUTOMATIC SCREENING METHOD TO DETECT OPTIC DISC IN THE RETINAijait
The document describes a new automated method for detecting the optic disc in retinal images. The method uses a line operator designed to capture the circular brightness structure of the optic disc. It evaluates image variation along multiple oriented line segments and locates the disc based on the orientation with maximum variation. The method was tested on a dataset and achieved a 96% success rate in detecting the optic disc.
Detection of Cranial- Facial Malformations: Towards an Automatic MethodCSCJournals
This paper presents an original method to detect malformations in cranial facial 3D images. This is a hard task because of the complex structure of the cranium. The method is composed by several stages containing essentially a segmentation phase to localize the bone structure, a 3D image characterization to delineate automatically geometrical characteristics from the segmented images. These need to possess a mathematical definition in order to be calculated and an anatomical pertinence to be representative of the structures’ shape. So, the characteristics retained are the crest lines. And finally a registration phase to identify the deformations place. This method is tested on real and synthetic data and has proved his performance.
Comparative analysis of multimodal medical image fusion using pca and wavelet...IJLT EMAS
nowadays, there are a lot of medical images and their
numbers are increasing day by day. These medical images are
stored in large database. To minimize the redundancy and
optimize the storage capacity of images, medical image fusion is
used. The main aim of medical image fusion is to combine
complementary information from multiple imaging modalities
(Eg: CT, MRI, PET etc.) of the same scene. After performing
image fusion, the resultant image is more informative and
suitable for patient diagnosis. There are some fusion techniques
which are described in this paper to obtain fused image. This
paper presents two approaches to image fusion, namely Spatial
Fusion and Transform Fusion. This paper describes Techniques
such as Principal Component Analysis which is spatial domain
technique and Discrete Wavelet Transform, Stationary Wavelet
Transform which are Transform domain techniques.
Performance metrics are implemented to evaluate the
performance of image fusion algorithm. An experimental result
shows that image fusion method based on Stationary Wavelet
Transform is better than Principal Component Analysis and
Discrete Wavelet Transform.
Mining Maximum Frequent Item Sets Over Data Streams Using Transaction Sliding...ijitcs
As we know that the online mining of streaming data is one of the most important issues in data mining. In
this paper, we proposed an efficient one- .frequent item sets over a transaction-sensitive sliding window),
to mine the set of all frequent item sets in data streams with a transaction-sensitive sliding window. An
effective bit-sequence representation of items is used in the proposed algorithm to reduce the time and
memory needed to slide the windows. The experiments show that the proposed algorithm not only attain
highly accurate mining results, but also the performance significant faster and consume less memory than
existing algorithms for mining frequent item sets over recent data streams. In this paper our theoretical
analysis and experimental studies show that the proposed algorithm is efficient and scalable and perform
better for mining the set of all maximum frequent item sets over the entire history of the data streams.
In Cloud computing, application and desktop delivery are the two emerging technologies that has reduced
application and desktop computing costs and provided greater IT and user flexibility compared to
traditional application and desktop management models. Among the various SaaS technologies, XenApp
that allow numerous end users to connect to their corporate applications from any device. XenApp enables
organizations to improve application management by centralizing applications in the datacenter to reduce
costs, controlling and encrypting access to data and applications to improve security and delivering
applications instantly to users anywhere by remotely accessing or streaming. As per old architecture we
were using the oracle or MS-SQL in the backend of XenApp on Windows Server itself. But as we know for
this we have to pay for database especially because we are not using it for any other purpose. And as we
know windows is GUI based so running database over it consumes much more resources. So, it can lead to
single point of failure. For this, this paper proposes a scheme for removing this problem by using the HA
failover cluster based SQL server (mysql or Oracle) which will run over Linux box having concept of VIP
(Virtual IP).
Intelligent computing techniques on medical image segmentation and analysis a...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
New Approach for Detecting and Tracking a Moving Object IJECEIAES
This article presents the implementation of a tracking system for a moving target using a fixed camera. The objective of this work is the ability to detect a moving object and locate their positions. In picture processing, tracking moving objects in a known or unknown environment is commonly studied. It is based on invariance properties of objects of interest. The invariance can affect the geometry of the scene or the objects. The proposed approach is composed of several steps; the first is the extraction of points of interest in the current image. Then, these points will be tracked in the following image by using techniques for calculating the optical flow. After this step, the static points will be removed to focus on moving objects, That is to say, there is only the characteristic points belonging to moving objects. Now, to detect moving targets using images of the video, the background is first extracted from the successive images. In our approach, a method of the average values of every pixel has been developed for modeling background. The last step which stays before switching to tracking moving object is the segmentation which allows identifying every moving object. And by using the characteristic points in the previous steps.
The document presents a study that implemented segmentation and classification techniques for mammogram images to detect breast cancer malignancy. It used Gray Level Difference Method (GLDM) and Gabor texture feature extraction methods with Support Vector Machine (SVM) and K-Nearest Neighbors (K-NN) classifiers. The results showed that GLDM features with SVM achieved the best classification accuracy of 95.83%, outperforming the other combinations. The study concluded the GLDM and SVM approach provided the most effective classification of mammogram images.
Segmentation of Brain MR Images for Tumor Extraction by Combining Kmeans Clus...CSCJournals
Segmentation of images holds an important position in the area of image processing. It becomes more important while typically dealing with medical images where pre-surgery and post surgery decisions are required for the purpose of initiating and speeding up the recovery process [5] Computer aided detection of abnormal growth of tissues is primarily motivated by the necessity of achieving maximum possible accuracy. Manual segmentation of these abnormal tissues cannot be compared with modern day’s high speed computing machines which enable us to visually observe the volume and location of unwanted tissues. A well known segmentation problem within MRI is the task of labeling voxels according to their tissue type which include White Matter (WM), Grey Matter (GM) , Cerebrospinal Fluid (CSF) and sometimes pathological tissues like tumor etc. This paper describes an efficient method for automatic brain tumor segmentation for the extraction of tumor tissues from MR images. It combines Perona and Malik anisotropic diffusion model for image enhancement and Kmeans clustering technique for grouping tissues belonging to a specific group. The proposed method uses T1, T2 and PD weighted gray level intensity images. The proposed technique produced appreciative results
Q UANTUM C LUSTERING -B ASED F EATURE SUBSET S ELECTION FOR MAMMOGRAPHIC I...ijcsit
In this paper, we present an algorithm for feature selection. This algorithm labeled QC-FS: Quantum
Clustering for Feature Selection performs the selection in two steps. Partitioning the original features
space in order to group similar features is performed using the Quantum Clustering algorithm. Then the
selection of a representative for each cluster is carried out. It uses similarity measures such as correlation
coefficient (CC) and the mutual information (MI). The feature which maximizes this information is chosen
by the algorithm
Medical Image Segmentation Based on Level Set MethodIOSR Journals
This document presents a new medical image segmentation technique based on the level set method. The technique uses a combination of thresholding, morphological erosion, and a variational level set method. Thresholding is applied to determine object pixels, followed by optional erosion to remove small fragments. Then a variational level set method is applied on the original image to evaluate the contour and segment objects. The technique is tested on various medical images and provides good segmentation results, though it struggles with complex images containing multiple distinct objects.
A new hybrid method for the segmentation of the brain mrissipij
The magnetic resonance imaging is a method which has undeniable qualities of contrast and tissue
characterization, presenting an interest in the follow-up of various pathologies such as the multiple
sclerosis. In this work, a new method of hybrid segmentation is presented and applied to Brain MRIs. The
extraction of the image of the brain is pretreated with the Non Local Means filter. A theoretical approach is
proposed; finally the last section is organized around an experimental part allowing the study of the
behavior of our model on textured images. In the aim to validate our model, different segmentations were
down on pathological Brain MRI, the obtained results have been compared to the results obtained by
another models. This results show the effectiveness and the robustness of the suggested approach.
This document summarizes a research paper on accurate multimodality registration of medical images. It discusses how image registration is important for aligning images from different modalities (MRI, CT, PET, etc.) to integrate useful data and observe changes over time. The paper presents a registration algorithm that uses mutual information as a metric to match images without relying on direct pixel intensity comparisons. It describes the basic components of registration including transforms, interpolators, metrics and optimizers. Results show the algorithm successfully registers MRI and proton density MRI images without limits. The algorithm could provide a useful approach for multi-modal medical image registration.
The purpose of this paper is to present a survey of image registration techniques. Registration is a fundamental task in image processing used to match two or more pictures taken, for example, at different times, from different sensors, or from different viewpoints. It geometrically aligns two images the reference and sensed images. Specific examples of systems where image registration is a significant component include matching a target with a real-time image of a scene. Various applications of image registration are target recognition, monitoring global land usage using satellite images, matching stereo images to recover shape for navigation, and aligning images from different medical modalities for diagnosis.
Segmentation of Tumor Region in MRI Images of Brain using Mathematical Morpho...CSCJournals
This paper introduces an efficient detection of brain tumor from cerebral MRI images. The methodology consists of two steps: enhancement and segmentation. To improve the quality of images and limit the risk of distinct regions fusion in the segmentation phase an enhancement process is applied. We applied mathematical morphology to increase the contrast in MRI images and to segment MRI images. Some of experimental results on brain images show the feasibility and the performance of the proposed approach.
Detection of uveal melanoma using fuzzy and neural networks classifiersTELKOMNIKA JOURNAL
The use of image processing is increasingly utilized for disease detection. In this article, an algorithm is proposed to detect uveal melanoma (UM) which is a type of intraocular cancer. The proposed method integrates algorithms related to iris segmentation and proposes a novel algorithm for the detection of UM from the approach of fuzzy logic and neural networks. The study case results show 76% correct classification in the fuzzy logic system and 96.04% for the artificial neural networks.
Brain Tumor Extraction from T1- Weighted MRI using Co-clustering and Level Se...CSCJournals
The aim of the paper is to propose effective technique for tumor extraction from T1-weighted magnetic resonance brain images with combination of co-clustering and level set methods. The co-clustering is the effective region based segmentation technique for the brain tumor extraction but have a drawback at the boundary of tumors. While, the level set without re-initialization which is good edge based segmentation technique but have some drawbacks in providing initial contour. Therefore, in this paper the region based co-clustering and edge-based level set method are combined through initially extracting tumor using co-clustering and then providing the initial contour to level set method, which help in cancelling the drawbacks of co-clustering and level set method. The data set of five patients, where one slice is selected from each data set is used to analyze the performance of the proposed method. The quality metrics analysis of the proposed method is proved much better as compared to level set without re-initialization method.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
MRIIMAGE SEGMENTATION USING LEVEL SET METHOD AND IMPLEMENT AN MEDICAL DIAGNOS...cseij
Image segmentation plays a vital role in image processing over the last few years. The goal of image segmentation is to cluster the pixels into salient image regions i.e., regions corresponding to individual surfaces, objects, or natural parts of objects. In this paper, we propose a medical diagnosis system by using level set method for segmenting the MRI image which investigates a new variational level set algorithm without re- initialization to segment the MRI image and to implement a competent medical diagnosis system by using MATLAB. Here we have used the speed function and the signed distance function of the image in segmentation algorithm. This system consists of thresholding technique, curve evolution technique and an eroding technique. Our proposed system was tested on some MRI Brain images, giving promising results by detecting the normal or abnormal condition specially the existence of tumers. This system will be applied to both simulated and real images with promising results
This document proposes a hybrid approach using genetic algorithm, K-nearest neighbor, and probabilistic neural network for classifying MRI brain tumors. It extracts texture features using gray level co-occurrence matrix from wavelet decomposed MRI images. A genetic algorithm is then used for feature selection to identify an optimal feature subset for classification. Finally, probabilistic neural network is used to classify tumors into seven types based on the selected features, achieving accurate classification results.
Image Fusion and Image Quality Assessment of Fused ImagesCSCJournals
Accurate diagnosis of tumor extent is important in radiotherapy. This paper presents the use of image fusion of PET and MRI image. Multi-sensor image fusion is the process of combining information from two or more images into a single image. The resulting image contains more information as compared to individual images. PET delivers high-resolution molecular imaging with a resolution down to 2.5 mm full width at half maximum (FWHM), which allows us to observe the brain\'s molecular changes using the specific reporter genes and probes. On the other hand, the 7.0 T-MRI, with sub-millimeter resolution images of the cortical areas down to 250 m, allows us to visualize the fine details of the brainstem areas as well as the many cortical and sub-cortical areas. The PET-MRI fusion imaging system provides complete information on neurological diseases as well as cognitive neurosciences. The paper presents PCA based image fusion and also focuses on image fusion algorithm based on wavelet transform to improve resolution of the images in which two images to be fused are firstly decomposed into sub-images with different frequency and then the information fusion is performed and finally these sub-images are reconstructed into result image with plentiful information. . We also propose image fusion in Radon space. This paper presents assessment of image fusion by measuring the quantity of enhanced information in fused images. We use entropy, mean, standard deviation and Fusion Mutual Information, cross correlation , Mutual Information Root Mean Square Error, Universal Image Quality Index and Relative shift in mean to compare fused image quality. Comparative evaluation of fused images is a critical step to evaluate the relative performance of different image fusion algorithms. In this paper, we also propose image quality metric based on the human vision system (HVS).
Performance Evaluation of Basic Segmented Algorithms for Brain Tumor DetectionIOSR Journals
In the field of computers segmentation of image plays a very important role. By this method the required
portion of object is traced from the image. In medical image segmentation, clustering is very famous
method . By clustering, an image is divided into a number of various groups or can also be called as clusters.
There are various methods of clustering and thresholding which have been proposed in this paper such as otsu
, region growing , K Means , fuzzy c means and Hierarchical self organizing mapping algorithm. Fuzzy c-means
(FCM) is a method of clustering which allows one piece of data to belong to two or more clusters. This method
(developed by Dunn in 1973 and improved by Bezdek in 1981) is frequently used in pattern recognition. As
process of fuzzy c mean is too slow, this drawback is then removed. In this paper by experimental analysis and
performance parameters the segmentation of hierarchical self organizing mapping method is done in a better
way as compared to other algorithms. The various parameters used for the evaluation of the performance are as follows: segmentation accuracy (Sa) , area (A), rand index (Ri),and global consistency error (Gce)
AN AUTOMATIC SCREENING METHOD TO DETECT OPTIC DISC IN THE RETINAijait
The document describes a new automated method for detecting the optic disc in retinal images. The method uses a line operator designed to capture the circular brightness structure of the optic disc. It evaluates image variation along multiple oriented line segments and locates the disc based on the orientation with maximum variation. The method was tested on a dataset and achieved a 96% success rate in detecting the optic disc.
Detection of Cranial- Facial Malformations: Towards an Automatic MethodCSCJournals
This paper presents an original method to detect malformations in cranial facial 3D images. This is a hard task because of the complex structure of the cranium. The method is composed by several stages containing essentially a segmentation phase to localize the bone structure, a 3D image characterization to delineate automatically geometrical characteristics from the segmented images. These need to possess a mathematical definition in order to be calculated and an anatomical pertinence to be representative of the structures’ shape. So, the characteristics retained are the crest lines. And finally a registration phase to identify the deformations place. This method is tested on real and synthetic data and has proved his performance.
Comparative analysis of multimodal medical image fusion using pca and wavelet...IJLT EMAS
nowadays, there are a lot of medical images and their
numbers are increasing day by day. These medical images are
stored in large database. To minimize the redundancy and
optimize the storage capacity of images, medical image fusion is
used. The main aim of medical image fusion is to combine
complementary information from multiple imaging modalities
(Eg: CT, MRI, PET etc.) of the same scene. After performing
image fusion, the resultant image is more informative and
suitable for patient diagnosis. There are some fusion techniques
which are described in this paper to obtain fused image. This
paper presents two approaches to image fusion, namely Spatial
Fusion and Transform Fusion. This paper describes Techniques
such as Principal Component Analysis which is spatial domain
technique and Discrete Wavelet Transform, Stationary Wavelet
Transform which are Transform domain techniques.
Performance metrics are implemented to evaluate the
performance of image fusion algorithm. An experimental result
shows that image fusion method based on Stationary Wavelet
Transform is better than Principal Component Analysis and
Discrete Wavelet Transform.
Mining Maximum Frequent Item Sets Over Data Streams Using Transaction Sliding...ijitcs
As we know that the online mining of streaming data is one of the most important issues in data mining. In
this paper, we proposed an efficient one- .frequent item sets over a transaction-sensitive sliding window),
to mine the set of all frequent item sets in data streams with a transaction-sensitive sliding window. An
effective bit-sequence representation of items is used in the proposed algorithm to reduce the time and
memory needed to slide the windows. The experiments show that the proposed algorithm not only attain
highly accurate mining results, but also the performance significant faster and consume less memory than
existing algorithms for mining frequent item sets over recent data streams. In this paper our theoretical
analysis and experimental studies show that the proposed algorithm is efficient and scalable and perform
better for mining the set of all maximum frequent item sets over the entire history of the data streams.
In Cloud computing, application and desktop delivery are the two emerging technologies that has reduced
application and desktop computing costs and provided greater IT and user flexibility compared to
traditional application and desktop management models. Among the various SaaS technologies, XenApp
that allow numerous end users to connect to their corporate applications from any device. XenApp enables
organizations to improve application management by centralizing applications in the datacenter to reduce
costs, controlling and encrypting access to data and applications to improve security and delivering
applications instantly to users anywhere by remotely accessing or streaming. As per old architecture we
were using the oracle or MS-SQL in the backend of XenApp on Windows Server itself. But as we know for
this we have to pay for database especially because we are not using it for any other purpose. And as we
know windows is GUI based so running database over it consumes much more resources. So, it can lead to
single point of failure. For this, this paper proposes a scheme for removing this problem by using the HA
failover cluster based SQL server (mysql or Oracle) which will run over Linux box having concept of VIP
(Virtual IP).
New development in sensors, radar and ultrasonic technologies has proved to be a boon for electronics
travelling aids (ETAs). These devices are widely used by blind and physically challenged peoples. C5 laser
cane, Mowat sensor, belt and binaural sonic aid, NAV guide cane are among popular electronic travelling
aids used by blind peoples. For physically challenged person electric wheel chairs controlled by joystick,
eye movement and voice recognition are also available but they have their own limitation in terms of
operating complexity, noise environment and cost. Our paper proposes an automated innovative
wheelchair controlled by neck position of person. It uses simple LEDs, photo sensor, motor and
microcontroller to control the movement of wheelchair
ADAPTIVESYNCHRONIZER DESIGN FOR THE HYBRID SYNCHRONIZATION OF HYPERCHAOTIC ZH...ijitcs
This paper derives new adaptive synchronizers for the hybrid synchronization of hyperchaotic Zheng
systems (2010) and hyperchaotic Yu systems (2012). In the hybrid synchronization design of master and
slave systems, one part of the systems, viz. their odd states, are completely synchronized (CS), while the
other part, viz. their even states, are completely anti-synchronized (AS) so that CS and AS co-exist in the
process of synchronization. The research problem gets even more complicated, when the parameters of the
hyperchaotic systems are not known and we handle this complicate problem using adaptive control. The
main results of this research work are established via adaptive control theory andLyapunov stability
theory. MATLAB plotsusing classical fourth-order Runge-Kutta method have been depictedfor the new
adaptive hybrid synchronization results for the hyperchaotic Zheng and hyperchaotic Yu systems.
Making isp business profitable using data miningijitcs
This Data mining is a new powerful technology with great potential to extract hidden predictive
information from large databases. Tools of data mining scour databases for hidden patterns, predict future
trends and behaviours which allow businesses to make proactive, knowledge driven decision. This paper
analyzes ISP’s (Internet Service Provider) data to generate association rules for frequent patterns and
apply the criteria support and confidence to identify the most important relationships. Here, Apriori
algorithm is used to mine association rules. Furthermore, the conclusion point out business challenges and
provides the proposals of making ISP business profitable.
ASSESSING THE ORGANIZATIONAL READINESS FOR IMPLEMENTING BI SYSTEMSijitcs
Implementation of business intelligence systems (BIS) is very complex and requires a lot of resources and
time. Business intelligence (BI) is a difficult concept and has a multi-tier architecture. The metadata causes
the complexity of the BI. That is why a BI readiness model is required. The frequency of BI maturity
models, such as the data warehousing (TDW), has been provided, but there are few frameworks for
measuring the readiness. Moreover, readiness frameworks often provide a general model for all
organizations. Hence, the objective of this study was to examine whether the factors affecting the
organizational readiness for BI implementation in all organizations are identical. For this purpose, based
on a comprehensive literature review, four factors of culture, people, strategy, and management were
extracted as the most important factors affecting the readiness and implementation of BI, and they were
studied in three educational, commerce, and IT organizations. Based on the findings, different factors
affect various organizations, and using a general model should not be advised.
ASSESSMENT OF ALTERNATIVE PRECISION POSITIONING SYSTEMSijitcs
The continuous evolution of technology, electronics, and software along with the dramatic decrease in the
cost of electronic devices has led to the spread of sensing, surveillance, and control devices. The Internetof-Things
(IoT) benefits from the spread of devices (things) by processing device feeds using Machine-toMachine
(M2M) technologies. At the heart of the M2M technologies lies the ability of devices (things) to identify their own location on the globe or relative to known landmark. Since location awareness is fundamental to processing sensing and control feeds, it has attracted researchers to identify ways to
identify and improve location accuracy. The article looks at Global Positioning Systems (GPS) along with the enhancements and amendments that apply to satellite based solutions. The article also looks at medium to short-range wireless solutions such as cellular, Wi-Fi, Dedicated Short-Range Communications (5.9 GHz DSRC) and similar solutions.
Social navigation can be considered as an effective approach for supporting information management issues particularly privacy and security concern that prevail in the management of information systems. Any of these management information system security issues are a matter of critical acknowledgement for knowledge management systems as well. This paper outlines multiple privacy and security risks that can be applied to information systems in general. Including examples from different sectors such as health care, public information, and e-commerce, these management information issues provide an outline of the present situation. It also observes the key concerns of information system executive in these areas, highlighting the identification and explanation of regional differences and similarities. Selecting on a current issue in management information system the paper provides a detailed amount of knowledge on the possible reasons for the issues such as factors of economic development, technological status, and political/legal environment. The paper concludes by providing a revised framework for the management information issues formulated with effective literature searches. This is going to be effective enough for the studies that will more likely support such reasoning in the future.
The Internet Engineering Task Force (IETF) proposed proxy mobile ipv6 (PMIPv6) is a very promising
network based mobility management protocol. There are three entities LMA MAG and AAA server required
for the proper functioning of PMIPv6.. In PMIPv6 Networks having many disadvantages like signaling
overhead , handover latency ,packet loss problem and long authentication latency problems during
handoff. So we propose a new mechanism called SPAM which performs efficient authentication procedure
globally with low computational cost. It also supports global access technique using ticket based
algorithm. Which allows user’s mobile terminals to use only one ticket to communicate with their neighbor
Access Points? This algorithm not only reduces the mobile terminal’s computational cost but also provides
user ID protection to protect user privacy. Through this technique, it can implement handover
authentication protocol, which in turn results in less computation cost and communication delay when
compared with other existing methods.
An Efficient Algorithm to Calculate The Connectivity of Hyper-Rings Distribut...ijitcs
The aim of this paper is develop a software module to test the connectivity of various odd-sized HRs and attempted to answer an open question whether the node connectivity of an odd-sized HR is equal to its degree. We attempted to answer this question by explicitly testing the node connectivity's of various oddsized HRs. In this paper, we also study the properties, constructions, and connectivity of hyper-rings. We usually use a graph to represent the architecture of an interconnection network, where nodes represent processors and edges represent communication links between pairs of processors. Although the number of edges in a hyper-ring is roughly twice that of a hypercube with the same number of nodes, the diameter and the connectivity of the hyper-ring are shorter and larger, respectively, than those of the corresponding hypercube. These properties are advantageous to hyper-ring as desirable interconnection networks. This paper discusses the reliability in hyper-ring. One of the major goals in network design is to find the best way to increase the system’s reliability. The reliability of a distributed system depends on the reliabilities of its communication links and computer elements
In recent years there has been an exponential growth of e-Governance in India. It is growing to such a
scale that requires full attention of the Government to ensure collaboration among different government
departments, private sectors and Non-Governmental Organisations(NGOs). In order to achieve successful
e-Governance, Government has to facilitate delivery of services to citizens, business houses and other
public or private organisations according to their requirements. In this paper, we have proposed
integration of different government departments using a Service Oriented e-Governance(SOeGov)
approach with web services technology and Service Oriented Architecture(SOA). The proposed approach
can be effectively used for achieving integration and interoperability in an e-Governance system.We have
demonstrated the working of our approach through a case study where integration of several departments
of the provincial Government of Odisha (India) has been made possible.
A SERVICE ORIENTED DESIGN APPROACH FOR E-GOVERNANCE SYSTEMSijitcs
The document describes a service-oriented design approach for e-governance systems. It discusses key challenges in developing e-governance systems and proposes addressing these challenges through a service-oriented paradigm. The approach defines concepts like service types (readily available, composable, collaborative), service windows, service composition, and service collaboration. Service types depend on the complexity of processing required - readily available services require minimal processing, composable services may invoke other related services, and collaborative services require coordination across service windows. The approach aims to provide reusable, interoperable services and facilitate integration of existing applications in e-governance systems.
Brain tumor detection and localization in magnetic resonance imagingijitcs
A tumor also known as neoplasm is a growth in the abnormal tissue which can be differentiated from the
surrounding tissue by its structure. A tumor may lead to cancer, which is a major leading cause of death and
responsible for around 13% of all deaths world-wide. Cancer incidence rate is growing at an alarming rate
in the world. Great knowledge and experience on radiology are required for accurate tumor detection in
medical imaging. Automation of tumor detection is required because there might be a shortage of skilled
radiologists at a time of great need. We propose an automatic brain tumor detectionand localization
framework that can detect and localize brain tumor in magnetic resonance imaging. The proposed brain
tumor detection and localization framework comprises five steps: image acquisition, pre-processing, edge
detection, modified histogram clustering and morphological operations. After morphological operations,
tumors appear as pure white color on pure black backgrounds. We used 50 neuroimages to optimize our
system and 100 out-of-sample neuroimages to test our system. The proposed tumor detection and localization
system was found to be able to accurately detect and localize brain tumor in magnetic resonance imaging.
The preliminary results demonstrate how a simple machine learning classifier with a set of simple
image-based features can result in high classification accuracy. The preliminary results also demonstrate the
efficacy and efficiency of our five-step brain tumor detection and localization approach and motivate us to
extend this framework to detect and localize a variety of other types of tumors in other types of medical
imagery.
PDHPE is a key learning area in the NSW primary school curriculum that helps children develop important life skills through physical development, health, and physical education. It supports the development of skills like communication, decision making, interaction, movement, and problem solving. PDHPE also helps children develop motor skills and an active lifestyle by encouraging at least 30 minutes of physical activity per day. Additionally, it provides an understanding of physical development, covers a wide range of health topics, and supports children's learning across other subjects by giving opportunities to be creative, active, and develop friendships.
Load balancing using ant colony in cloud computingijitcs
Ants are very small insects.They are capable to find food even they are complete blind. The ants lives in
their nest and their job is to search food while they get hungry. We are not interested in their living style,
such as how they live, how they sleep. But we are interested in how they search for food, and how they find
the shortest path. The technique for finding the shortest path are now applying in cloud computing. The Ant
Colony approach towards Cloud Computing gives better performance.
MOBILE CLOUD COMPUTING APPLIED TO HEALTHCARE APPROACHijitcs
In the past few years it was clear that mobile cloud computing was established via integrating both mobile computing and cloud computing to be add in both storage space and processing speed. Integrating
healthcare applications and services is one of the vast data approaches that can be adapted to mobile
cloud computing. This work proposes a framework of a global healthcare computing based combining both
mobile computing and cloud computing. This approach leads to integrate all of the required services and overcoming the barriers through facilitating both privacy and security.
Intelligent algorithms for cell tracking and image segmentationijcsit
This research develop the managing within network and relationship mechanism in agribusiness
management through serious game. Agribusiness is represented as sand that work together in the market
(sandpile) to maintain networks and relationships. This research apply agent base model for predicting
activity network based on the parameters that exist in the collaboration. The result indicate that average
selling, average buying and market price (CK = 4) are not approach the value of the open market but
precisely coincide with eachother. Total bought and total sold are tend to be high value. This condition
suggests a very tight competition. The average selling, average buying and market price (CK = 0.01) are
approach the value of the open market. Total bought and total sold are not as high as total bought and total
sold, by using CK = 4, this condition shows the competition is not too tight.
Intelligent algorithms for cell tracking and image segmentationijcsit
Sensitive and accurate cell tracking system is important to cell motility studies. Recently, researchers have
developed several methods for detecting and tracking the living cells. To improve the living cells tracking
systems performance and accuracy, we focused on developing a novel technique for image processing. The
algorithm we propose presents novel image segmentation and tracking system technique to incorporate the
advantages of both Topological Alignments and snakes for more accurate tracking approach. The results
demonstrate that the proposed algorithm achieves accurate tracking for detecting and analyzing the
mobility of the living cells. The RMSE between the manual and the computed displacement was less than
12% on average. Where the Active Contour method gave a velocity RMSE of less than 11%, improves to
less than 8% by using the novel Algorithm. We have achieved better tracking and detecting for the cells,
also the ability of the system to improve the low contrast, under and over segmentation which is the most
cell tracking challenge problems and responsible for lacking accuracy in cell tracking techniques.
A Review on Label Image Constrained Multiatlas SelectionIRJET Journal
This document reviews a label image constrained multi-atlas selection method for automated segmentation of prostate MRI images. The key steps of the proposed method include image normalization, registration of atlases to the target image, atlas selection using a label image constrained manifold ranking approach, and weighted combination of the selected atlases. The atlas selection approach aims to reduce the influence of surrounding anatomical structures by incorporating label image information to constrain the manifold projection. A novel weight computation algorithm is also proposed to improve the combination step. The method shows improvements over existing multi-atlas segmentation approaches and has applications in medical image segmentation tasks.
Multiple Ant Colony Optimizations for Stereo MatchingCSCJournals
The stereo matching problem, which obtains the correspondence between right and left images, can be cast as a search problem. The matching of all candidates in the same line forms a 2D optimization task and the two dimensional (2D) optimization is a NP-hard problem. There are two characteristics in stereo matching. Firstly, the local optimization process along each scan-line can be done concurrently; secondly, there are some relationship among adjacent scan-lines can be explored to promote the matching correctness. Although there are many methods, such as GCPs, GGCPs are proposed, but these so called GCPs maybe not be ground. The relationship among adjacent scan-lines is posteriori, that is to say the relationship can only be discovered after every optimization is finished. The Multiple Ant Colony Optimization(MACO) is efficient to solve large scale problem. It is a proper way to settle down the stereo matching task with constructed MACO, in which the master layer values the sub-solutions and propagate the reliability after every local optimization is finished. Besides, whether the ordering and uniqueness constraints should be considered during the optimization is discussed, and the proposed algorithm is proved to guarantee its convergence to find the optimal matched pairs.
Particle Swarm Optimization for Nano-Particles Extraction from Supporting Mat...CSCJournals
This document summarizes a study that uses Particle Swarm Optimization (PSO) for automatic segmentation of nano-particles in Transmission Electron Microscopy (TEM) images. PSO is applied to specify local and global thresholds for segmentation by treating image entropy as a minimization problem. Results show the PSO method improves over previous techniques by reducing incorrect characterization of nano-particles in images affected by liquid concentrations or supporting materials, with up to a 27% reduction in errors. Compared to manual characterization, PSO provides comparable particle counting with higher computational efficiency suitable for real-time analysis.
MRI Image Segmentation Using Level Set Method and Implement an Medical Diagno...CSEIJJournal
Image segmentation plays a vital role in image processing over the last few years. The goal of image
segmentation is to cluster the pixels into salient image regions i.e., regions corresponding to individual
surfaces, objects, or natural parts of objects. In this paper, we propose a medical diagnosis system by using
level set method for segmenting the MRI image which investigates a new variational level set algorithm
without re- initialization to segment the MRI image and to implement a competent medical diagnosis
system by using MATLAB. Here we have used the speed function and the signed distance function of the
image in segmentation algorithm. This system consists of thresholding technique, curve evolution technique
and an eroding technique. Our proposed system was tested on some MRI Brain images, giving promising
results by detecting the normal or abnormal condition specially the existence of tumers. This system will be
applied to both simulated and real images with promising results.
A Hybrid Technique for the Automated Segmentation of Corpus Callosum in Midsa...IJERA Editor
The corpus callosum (CC) is the largest white-matter structure in human brain. In this paper, we take two techniques to observe the results of segmentation of Corpus Callosum. The first one is mean shift algorithm and morphological operation. The second one is k-means clustering. In this paper, it is performed in three steps. The first step is finding the corpus callosum area using adaptive mean shift algorithm or k-means clustering . In second step, the boundary of detected CC area is then used as the initial contour in the Geometric Active Contour (GAC) mode and final step to remove unknown noise using morphological operation and evolved to get the final segmentation result. The experimental results demonstrate that the mean shift algorithm and k-means clustering has provided a reliable segmentation performance.
Robust Block-Matching Motion Estimation of Flotation Froth Using Mutual Infor...CSCJournals
This document presents a new method for estimating motion in flotation froth images using mutual information as the similarity metric. It proposes using mutual information with a bin size of two (MI2) for block matching motion estimation of froth images. The paper finds that MI2 improves motion estimation accuracy in terms of peak signal-to-noise ratio compared to the commonly used mean absolute difference (MAD) metric, while having a similar computational cost. It tests the MI2 method on two froth video sequences using three-step search and new three-step search, and finds MI2 yields slightly better reconstructed image quality than MAD according to PSNR measurements.
EDGE DETECTION IN SEGMENTED IMAGES THROUGH MEAN SHIFT ITERATIVE GRADIENT USIN...ijscmcj
In this paper, we propose a new method for edge detection in obtained images from the Mean Shift iterative algorithm. The comparable, proportional and symmetrical images are de?ned and the importance of Ring Theory is explained. A relation of equivalence among proportional images are de?ned for image groups in equivalent classes. The length of the mean shift vector is used in order to quantify the homogeneity of the neighborhoods. This gives a measure of how much uniform are the regions that compose the image. Edge detection is carried out by using the mean shift gradient based on symmetrical images. The difference among the values of gray levels are accentuated or these are decreased to enhance the interest region contours. The chosen images for the experiments were standard images and real images (cerebral hemorrhage images). The obtained results were compared with the Canny detector, and our results showed a good performance as for the edge continuity.
Automatic whole-body bone scan image segmentation based on constrained local ...journalBEEI
In Indonesia, cancer is very burdensome financially for sufferers as well as for the country. Increasing the access to early detection of cancer can be a solution to prevent the situation from worsening. Regarding the problem of cancer lesion detection, a whole-body bone scan image is the primary modality of nuclear medicine for the detection of cancer lesions on a bone. Therefore, high segmentation accuracy of the whole-body bone scan image is a crucial step in building the shape model of some predefined regions in the bone scan image where metastasis was predicted to appear frequently. In this article, we proposed an automatic whole-body bone scan image segmentation based on constrained local model (CLM). We determine 111 landmark points on the bone scan image as the input for the model building step. The resulting shape and texture model are further used in the fitting step to estimate the landmark points of predefined regions. We use the CLM-based approach using regularized landmark mean-shift (RLMS) to lessen the effect of ambiguity, which was struggled by the CLM-based approach. From the experimental result, we successfully show that our proposed image segmentation system achieves higher performance than the general CLM-based approach.
A Review on Classification Based Approaches for STEGanalysis DetectionEditor IJCATR
This document summarizes two approaches for image steganalysis detection. The first approach proposes novel steganalysis algorithms based on how data hiding affects the rate-distortion characteristics of images. Features are extracted based on increased image entropy and small, imperceptible distortions from data embedding. A Bayesian classifier is then trained on these features. The second approach uses contourlet transform to represent images. It extracts features based on the first four normalized statistical moments of high and low frequency subbands and structural similarity measure of medium frequency subbands. A non-linear support vector machine is then used for classification. Experimental results show the proposed approaches can efficiently detect stego images with high accuracy and low computational cost.
VARIATIONAL MONTE-CARLO APPROACH FOR ARTICULATED OBJECT TRACKINGcsandit
In this paper, we describe a novel variational Monte Carlo approach for modeling and tracking
body parts of articulated objects. An articulated object (human target) is represented as a
dynamic Markov network of the different constituent parts. The proposed approach combines
local information of individual body parts and other spatial constraints influenced by
neighboring parts. The movement of the relative parts of the articulated body is modeled with
local information of displacements from the Markov network and the global information from
other neighboring parts. We explore the effect of certain model parameters (including the
number of parts tracked; number of Monte-Carlo cycles, etc.) on system accuracy and show that
ourvariational Monte Carlo approach achieves better efficiency and effectiveness compared to
other methods on a number of real-time video datasets containing single targets.
This document summarizes research on using spectral clustering methods to impute missing pixel values in images. It first tests several spectral clustering algorithms on artificial datasets to compare their performance. It then explores feature selection and the number of clusters for image segmentation. Finally, it proposes two imputation algorithms based on pixel proximity and applies them to example images.
Blind Image Seperation Using Forward Difference Method (FDM)sipij
In this paper, blind image separation is performed, exploiting the property of sparseness to represent images. A new sparse representation called forward difference method is proposed. It is known that most of the independent component analysis (ICA) basis functions, extracted from images are sparse and gives unreliable sparseness measure. In the proposed method, the image mixture is first transformed to sparse images. These images are divided into blocks and for each block the sparseness measure ε0 norm is applied. The block having the most sparseness is considered to determine the separation matrix. The efficiency of the proposed method is compared with other sparse representation functions.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
This document summarizes a method for tracking deformable objects in images. It proposes casting the problem as finding optimal cyclic paths in a product space of the template shape and input image. A cost functional is introduced that considers data fidelity, shape consistency, and elastic deformation. The functional is optimized using a minimum ratio cycle algorithm on graphics cards, allowing real-time segmentation and tracking of deformable objects while guaranteeing a globally optimal solution. The method can be extended to track multiple deformable anatomical structures in medical images.
This document summarizes a method for tracking deformable objects in images. It proposes casting the problem as finding optimal cyclic paths in a product space of the template shape and input image. A cost functional is introduced that consists of three terms: data fidelity favoring strong edges, shape consistency favoring similar tangent angles, and an elastic penalty for stretching. Optimization is performed using simulated annealing for segmentation and iterated conditional modes for tracking. The algorithm provides optimal segmentation and point correspondences between template and image curve in linear time.
This document summarizes a research paper that proposes a new approach for tracking multiple deformable anatomical structures in medical images using geometrically deformable templates (GDTs). The GDTs can deform to match similar shapes based on image forces while minimizing a penalty function that measures deformation from the template's equilibrium shape. This allows simultaneous segmentation of multiple objects using intra- and inter-shape information. Simulated annealing is used for segmentation while iterated conditional modes is used for tracking. The paper also reviews previous work on image segmentation, tracking deformable objects, and shape-based image segmentation.
High volume computational histopathology 3Scan3Scan
Light microscopy is the gold standard for investigating microscopic structures and
pathological alterations in both human and animal models of disease. However, due
to tedious manual interventions, quantification of histopathologic markers is
classically performed on only a few 2D tissue sections, thus restricting
measurements and observations to limited portions of the sample volume.
Understanding vascular networks within tissues is a critical component to identifying pathophysiology. The work presented here introduces a methodology for multi-parametric quantification of vascular networks for whole-mount tissues. Our approach streamlines the histopathology workflow, enables observations within large 3D sample volumes, and provides opportunities for automated image analysis.
1) The document presents a novel algorithm to segment overlapped and touching human chromosome images automatically.
2) The algorithm first obtains chromosome contours and calculates a discrete curvature function to identify concave points on the contours.
3) It then detects interesting points like concave and convex points and uses these to plot possible separation lines between chromosomes.
4) The algorithm segments the overlapped chromosomes using a curvature function scheme to separate them, which previous studies have found to be successful.
Similar to CELL TRACKING QUALITY COMPARISON BETWEEN ACTIVE SHAPE MODEL (ASM) AND ACTIVE APPEARANCE MODELS (AAM)- BASED TRACKING (20)
In his public lecture, Christian Timmerer provides insights into the fascinating history of video streaming, starting from its humble beginnings before YouTube to the groundbreaking technologies that now dominate platforms like Netflix and ORF ON. Timmerer also presents provocative contributions of his own that have significantly influenced the industry. He concludes by looking at future challenges and invites the audience to join in a discussion.
Dr. Sean Tan, Head of Data Science, Changi Airport Group
Discover how Changi Airport Group (CAG) leverages graph technologies and generative AI to revolutionize their search capabilities. This session delves into the unique search needs of CAG’s diverse passengers and customers, showcasing how graph data structures enhance the accuracy and relevance of AI-generated search results, mitigating the risk of “hallucinations” and improving the overall customer journey.
20 Comprehensive Checklist of Designing and Developing a WebsitePixlogix Infotech
Dive into the world of Website Designing and Developing with Pixlogix! Looking to create a stunning online presence? Look no further! Our comprehensive checklist covers everything you need to know to craft a website that stands out. From user-friendly design to seamless functionality, we've got you covered. Don't miss out on this invaluable resource! Check out our checklist now at Pixlogix and start your journey towards a captivating online presence today.
Observability Concepts EVERY Developer Should Know -- DeveloperWeek Europe.pdfPaige Cruz
Monitoring and observability aren’t traditionally found in software curriculums and many of us cobble this knowledge together from whatever vendor or ecosystem we were first introduced to and whatever is a part of your current company’s observability stack.
While the dev and ops silo continues to crumble….many organizations still relegate monitoring & observability as the purview of ops, infra and SRE teams. This is a mistake - achieving a highly observable system requires collaboration up and down the stack.
I, a former op, would like to extend an invitation to all application developers to join the observability party will share these foundational concepts to build on:
Building RAG with self-deployed Milvus vector database and Snowpark Container...Zilliz
This talk will give hands-on advice on building RAG applications with an open-source Milvus database deployed as a docker container. We will also introduce the integration of Milvus with Snowpark Container Services.
GraphSummit Singapore | The Art of the Possible with Graph - Q2 2024Neo4j
Neha Bajwa, Vice President of Product Marketing, Neo4j
Join us as we explore breakthrough innovations enabled by interconnected data and AI. Discover firsthand how organizations use relationships in data to uncover contextual insights and solve our most pressing challenges – from optimizing supply chains, detecting fraud, and improving customer experiences to accelerating drug discoveries.
How to Get CNIC Information System with Paksim Ga.pptxdanishmna97
Pakdata Cf is a groundbreaking system designed to streamline and facilitate access to CNIC information. This innovative platform leverages advanced technology to provide users with efficient and secure access to their CNIC details.
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024Albert Hoitingh
In this session I delve into the encryption technology used in Microsoft 365 and Microsoft Purview. Including the concepts of Customer Key and Double Key Encryption.
A tale of scale & speed: How the US Navy is enabling software delivery from l...sonjaschweigert1
Rapid and secure feature delivery is a goal across every application team and every branch of the DoD. The Navy’s DevSecOps platform, Party Barge, has achieved:
- Reduction in onboarding time from 5 weeks to 1 day
- Improved developer experience and productivity through actionable findings and reduction of false positives
- Maintenance of superior security standards and inherent policy enforcement with Authorization to Operate (ATO)
Development teams can ship efficiently and ensure applications are cyber ready for Navy Authorizing Officials (AOs). In this webinar, Sigma Defense and Anchore will give attendees a look behind the scenes and demo secure pipeline automation and security artifacts that speed up application ATO and time to production.
We will cover:
- How to remove silos in DevSecOps
- How to build efficient development pipeline roles and component templates
- How to deliver security artifacts that matter for ATO’s (SBOMs, vulnerability reports, and policy evidence)
- How to streamline operations with automated policy checks on container images
Communications Mining Series - Zero to Hero - Session 1DianaGray10
This session provides introduction to UiPath Communication Mining, importance and platform overview. You will acquire a good understand of the phases in Communication Mining as we go over the platform with you. Topics covered:
• Communication Mining Overview
• Why is it important?
• How can it help today’s business and the benefits
• Phases in Communication Mining
• Demo on Platform overview
• Q/A
Generative AI Deep Dive: Advancing from Proof of Concept to ProductionAggregage
Join Maher Hanafi, VP of Engineering at Betterworks, in this new session where he'll share a practical framework to transform Gen AI prototypes into impactful products! He'll delve into the complexities of data collection and management, model selection and optimization, and ensuring security, scalability, and responsible use.
GraphSummit Singapore | The Future of Agility: Supercharging Digital Transfor...Neo4j
Leonard Jayamohan, Partner & Generative AI Lead, Deloitte
This keynote will reveal how Deloitte leverages Neo4j’s graph power for groundbreaking digital twin solutions, achieving a staggering 100x performance boost. Discover the essential role knowledge graphs play in successful generative AI implementations. Plus, get an exclusive look at an innovative Neo4j + Generative AI solution Deloitte is developing in-house.
Alt. GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using ...James Anderson
Effective Application Security in Software Delivery lifecycle using Deployment Firewall and DBOM
The modern software delivery process (or the CI/CD process) includes many tools, distributed teams, open-source code, and cloud platforms. Constant focus on speed to release software to market, along with the traditional slow and manual security checks has caused gaps in continuous security as an important piece in the software supply chain. Today organizations feel more susceptible to external and internal cyber threats due to the vast attack surface in their applications supply chain and the lack of end-to-end governance and risk management.
The software team must secure its software delivery process to avoid vulnerability and security breaches. This needs to be achieved with existing tool chains and without extensive rework of the delivery processes. This talk will present strategies and techniques for providing visibility into the true risk of the existing vulnerabilities, preventing the introduction of security issues in the software, resolving vulnerabilities in production environments quickly, and capturing the deployment bill of materials (DBOM).
Speakers:
Bob Boule
Robert Boule is a technology enthusiast with PASSION for technology and making things work along with a knack for helping others understand how things work. He comes with around 20 years of solution engineering experience in application security, software continuous delivery, and SaaS platforms. He is known for his dynamic presentations in CI/CD and application security integrated in software delivery lifecycle.
Gopinath Rebala
Gopinath Rebala is the CTO of OpsMx, where he has overall responsibility for the machine learning and data processing architectures for Secure Software Delivery. Gopi also has a strong connection with our customers, leading design and architecture for strategic implementations. Gopi is a frequent speaker and well-known leader in continuous delivery and integrating security into software delivery.
Goodbye Windows 11: Make Way for Nitrux Linux 3.5.0!SOFTTECHHUB
As the digital landscape continually evolves, operating systems play a critical role in shaping user experiences and productivity. The launch of Nitrux Linux 3.5.0 marks a significant milestone, offering a robust alternative to traditional systems such as Windows 11. This article delves into the essence of Nitrux Linux 3.5.0, exploring its unique features, advantages, and how it stands as a compelling choice for both casual users and tech enthusiasts.
Full-RAG: A modern architecture for hyper-personalizationZilliz
Mike Del Balso, CEO & Co-Founder at Tecton, presents "Full RAG," a novel approach to AI recommendation systems, aiming to push beyond the limitations of traditional models through a deep integration of contextual insights and real-time data, leveraging the Retrieval-Augmented Generation architecture. This talk will outline Full RAG's potential to significantly enhance personalization, address engineering challenges such as data management and model training, and introduce data enrichment with reranking as a key solution. Attendees will gain crucial insights into the importance of hyperpersonalization in AI, the capabilities of Full RAG for advanced personalization, and strategies for managing complex data integrations for deploying cutting-edge AI solutions.
Maruthi Prithivirajan, Head of ASEAN & IN Solution Architecture, Neo4j
Get an inside look at the latest Neo4j innovations that enable relationship-driven intelligence at scale. Learn more about the newest cloud integrations and product enhancements that make Neo4j an essential choice for developers building apps with interconnected data and generative AI.
CELL TRACKING QUALITY COMPARISON BETWEEN ACTIVE SHAPE MODEL (ASM) AND ACTIVE APPEARANCE MODELS (AAM)- BASED TRACKING
1. International Journal of Information Technology Convergence and Services (IJITCS) Vol.6, No.4, August 2016
DOI:10.5121/ijitcs.2016.6402 17
CELL TRACKING QUALITY COMPARISON
BETWEEN ACTIVE SHAPE MODEL (ASM)
AND ACTIVE APPEARANCE MODELS (AAM)-
BASED TRACKING
Ashraf A. Aly
Department of computer Science and Information Systems, Morehead State University,
USA
ABSTRACT
The aim of this paper is to introduce a comparison between cell tracking using active shape model (ASM)
and active appearance model (AAM) algorithms, to compare the cells tracking quality between the two
methods to track the mobility of the living cells. Where sensitive and accurate cell tracking system is
essential to cell motility studies. The active shape model (ASM) and active appearance model (AAM)
algorithms has proved to be a successful methods for matching statistical models. The experimental results
indicate the ability of (AAM) method to give better accuracy for tracking the mobility of the WBC than
(ASM) method.
KEYWORDS
Cell tracking, segmentation enhancement, Active Contour, Topological Alignments.
1. INTRODUCTION
Cell tracking and segmentation with high accuracy is important step in the cell motility studies.
Understanding the mechanisms of cell motility is essential part for curative and preventative
treatments to many diseases. For instance, tracking the number and velocity of rolling leukocytes
is essential to understand and successfully treat inflammatory diseases [15]. Sensitive tracking for
moving cells is important to do mathematical modeling to cell locomotion. Moreover, Zimmer
[17] modified the snake model to track the movement of the cells and segment the first frame.
Another research by Mukherjee [19] he developed a technique to handle segmentation process
and tracking problem simultaneously. Li [20] used a technique with two stages; the first one is a
tracker and a filter to detect the cell and also the cells which move in and out of the image area.
Coskun [12] used imaging data to solve the inverse modeling problem to determine the mobility
analysis of the cells. Recently, a number of researchers have been created automated techniques
to track and detect the cells mobility. Segmentation is an essential part in many signal processing
techniques and its applications. Texture analysis is important in many areas such as image
processing, determination of the object shape, scene analysis.
The process of segmentation depends on the determination of the best positions of the points
which represent the image. The purpose of image segmentation is to partition an image into
meaningful regions based on measurements taken from the image and might be grey level, colour,
2. International Journal of Information Technology Convergence and Services (IJITCS) Vol.6, No.4, August 2016
18
texture, depth or motion. Usually the process to determine the image starts with image
segmentation as initial step. The goal of image segmentation is to cluster pixels into salient image
regions, i.e., regions corresponding to individual objects, surfaces, or natural parts of objects.
Active Shape Models (ASM) was originally designed as a method for locating given shapes or
outlines within images (Cootes et al., 2000). An ASM-based procedure starts with the base shape,
approximately aligned to the object, iteratively distorts it and refines its pose to obtain a better fit.
It seeks to minimize the distance between model points and the corresponding pixels found in the
image.
Cootes et al. (2002) introduces the Active Appearance Models (AAM) algorithm. The original
algorithm was described by Edwards’s et.al. (1998). The Active Appearance Model (AAM)
algorithm has been widely used for matching statistical models of appearance to image data. The
models, trained on suitably annotated examples, can synthesize new images of the objects of
interest. To match them to new images one seeks the model parameters, which minimize the
difference between the target image and the synthesized image. The AAM essentially learns the
relationship between the residual differences in such a match and the parameter displacements
required to correct the current offset from the optimal position.
2. RELATED WORK
In recent years, there has been significant research efforts toward the development of automated
methods for segmentation and cell tracking for living cells as in [1][2][3][4][5]. Most of the time,
images from microscopic studies are corrupted during the recording process and due to the noise
from the electronics devices, which affect the quality of the image.
Cell tracking with good accuracy is important in microscopic imaging studies. For instance,
Image analysis of leukocytes cells is essential part for curative and preventative treatments to
many diseases and also important to understand and successfully treat inflammatory diseases as
in Ray et al. [23]. Sensitive tracking for moving cells is important to do mathematical modelling
to cell locomotion. Zimmer [17] modified the Active Contour model to detect the mobility of the
moving cells and also handle the cell division by providing an initial segmentation for the first
frame. Mukherjee et al. [19] developed an algorithm by using threshold decomposition computed
via image level sets to handle tracking problem and segmentation simultaneously. Li [20]
developed an algorithm with two levels, a motion filter and a level set tracker to handle the cell
detection and the cells that move in and out of the image. Coskun et al. [12] used imaging data to
solve the inverse modelling problem to determine the mobility analysis of the cells. Recently
there have been a number of researchers attempt to create automated algorithms to detect and
track the cells from microscopic images as in Mélange [6]; and Mignotte [10].
This paper discusses the tracking cell accuracy as important task in many biological studies to
understand the cell behaviour and the way in which cells interact with the world around them.
One of the major goals of tracking the mobility of living cells is to find the best way to increase
segmentation and tracking accuracy under weak image boundaries, over and under segmentation,
which the most cell tracking challenge problems and responsible for lacking accuracy in cell
tracking techniques.
3. International Journal of Information Technology Convergence and Services (IJITCS) Vol.6, No.4, August 2016
19
3. ALGORITHM
In this section, a comparison between tracking video sequences using AAM model and ASM
model, to investigate the tracking quality between the two methods. In order to achieve that, a set
of video sequences of 32 live cells previously collected and computed manual by Jung et al.
(1998), is used to test the ability of the two models to track the video sequences of WBC frames,
and making a comparison between the tracking quality of the two methods.
3.1 Active Shape Model-Based Tracking (ASM)
A shape consisting of n points can be considered as one data point in 2n dimensional
space. A classical statistical method for dealing with redundancy in multivariate data is the
principal component analysis (PCA). PCA determines the principal axes of a cloud of n points at
locations ix . The principal axes, explaining the principal variation of the shapes, compose an
orthonormal basis equation as },...,,{ 21 nPPP=Φ , of the covariance matrix:
∑ ∑−
−−
−
=
n
i
T
ii xxxx
n 1
.))((
1
1
It can be shown that the variance across the axis corresponding
to the
th
i eigenvalue iλ equals the eigenvalue itself. By deforming the mean shape x , using a
linear combination of eigenvectors Φ, weighted by socalled modal deformation parameters b,
and can generate an instance of the shape. Therefore, the new shape can be expressed in the
following manner: .bxx Φ+= By varying the elements of b and modify the shape. By applying
constraints and ensure that the generated shape is similar to the mean shape from the original
training data. Through applying limits of iλ3± to each element ib of b, where iλ is the
variance of the
th
i parameter ib , and operate on plausible values of b. The deformation of the
shape is constrained to a subspace spanned by a few eigenvectors corresponding to the largest
eigenvalues. If all principal components are employed, ASM can represent any shape and no prior
knowledge about the shape is utilized.
Shape Alignment: Given two 2D shapes, 1x and 2x our aim is to determine the parameters of a
transformation T, which, when applied to 2x can best align it with 1x and one to one point
correspondence. During alignment and utilize an alignment metric that is defined as the weighted
sum of the squares of the distances between corresponding points on the considered shapes, and
choose the parameters t of the transformation T to minimize E:
∑=
−−=
n
i
iti
T
iti xTxWxTxE
1
2121 ))(())(( (3.1)
where W is a diagonal matrix of weights { 1w , 2w ,..., nw }. Expressing tT in the following form:
4. International Journal of Information Technology Convergence and Services (IJITCS) Vol.6, No.4, August 2016
20
(3.2)
where denoting )sin(),cos( θθ sasa yx == and can rewrite equation (3.20) in the following
form: ( )∑=
−−++−+−=
n
i iyixiyixiyixi ytyaxaxtyaxawE 1
2
222
2
122 .)()( The error E
assumes a minimal value when all the partial derivatives are zero. Differentiating the last
equation with regard to xa is obtaining the following:
( ) .0)()((1 2121222
2
2
2
∑=
=++++
n
i iiiiiyixiixi yyxxytxtyxaw
Differentiating w.r.t. remaining parameters and equating to zero gives:
(3.3)
where: ∑ ∑∑∑ = ===
+=+===
n
i
n
i iiiiiiiiii
n
i kiik
n
i kiik yxxywCyyxxwCYwYxwX 1 1 212122121111
),(),(,,
∑∑ ==
=+=
n
i i
n
i iii wWyxwD 11
2
2
2
2 .,)( The parameters xt , yt , xa and ya constitute a solution
which best aligns the shapes. An iterative approach to find the minimum of square distances
between corresponding model and image points is as follows:
Step 1. Initialize shape parameter b to zero.
Step 2. Generate the model instance .bxx Φ+=
Step 3. Find the pose parameters using equation (3.20), which best map x to Y.
Step 4. Invert the pose parameters and then use to project image pixels Y into the model
coordinate frame: )(1
YTy t
−
= .
Step 5. Project y into the tangent plane to x through scaling it by )./(:)./(1 '
xyyyxy = .
Step 6. Update b to match
'
y as follows: )( '
xyb T
−Φ= .
Step 7. If not converged, repeat starting from step 2.
Step 8. Repeat all steps until all frames of the image sequence are processed. The result as a
function of time enable estimation of the position and deformation of the corresponding cells for
each frame in the sequence and update shape and position.
Step 9. Segmentation and tracking transforms the raw images into a file that encodes the
boundaries of every cell at every time point, directly allowing computation of shape and motion
5. International Journal of Information Technology Convergence and Services (IJITCS) Vol.6, No.4, August 2016
21
parameters. These extracted data for shape and position can be used to quantify parameters
characterizing cell shape and motion. Segmentation and tracking transforms the raw images into a
file that encodes the boundaries of every cell at every time point, and allow the computation of
shape and motion of the cells.
3.2 Active Appearance Model-Based Tracking
In this subsection, Cootes et al. (2002) introduces the Active Appearance Models (AAM)
algorithm. The original algorithm was described by Edwards’s et.al. (1998). The Active
Appearance Model (AAM) algorithm has been widely used for matching statistical models of
appearance to image data. The models, trained on suitably annotated examples, can synthesize
new images of the objects of interest. To match them to new images one seeks the model
parameters, which minimize the difference between the target image and the synthesized image.
The AAM essentially learns the relationship between the residual differences in such a match and
the parameter displacements required to correct the current offset from the optimal position.
Statistical Models of Appearance: An appearance model can represent both the shape and texture
variability seen in a training set. The training set consists of labeled images, where key landmark
points are marked on each example object. Using the notation of Cootes et.al. (1998), the shape
of an object can be represented as a vector x and the texture (grey-levels or colour values)
represented as a vector g. The shape and texture are controlled by a statistical model of the form:
ssbPxx += (3.4)
ggbPgg += (3.5)
where sb are shape parameters, gb are texture parameters. Since often shape and texture are
correlated and can take this into account in a combined statistical model of the form:
cCb ss = (3.6)
cCb gg = (3.7)
The combined appearance model has parameters, c, controlling the shape and texture at the same
time. Combining the equations (3.22, 3.23) and (3.24, 3.25) gives:
cQxx s+= (3.8)
cQgg s+= (3.9)
where x is the mean shape (in a normalized frame), g the mean texture and sQ , gQ are
matrices describing the modes of variation derived from the training set. To generate the positions
of points in an image and use the following equation:
6. International Journal of Information Technology Convergence and Services (IJITCS) Vol.6, No.4, August 2016
22
)(xTX t= (3.10)
where x are the points in the model frame, X are the points in the image, and )(xTt applies a
global transformation with parameters t. For instance, in 2D, )(xTt is commonly a similarity
transform with four parameters describing the translation, rotation and scale. The texture in the
image frame is generated by applying a scaling and offset to the intensities, )(gTg uim = where u
is the vector of transformation parameters. AAM Tracking: The AAM algorithm is a method of
rapidly matching an appearance model to an image. It is a form of gradient descent algorithm, in
which the gradient is assumed to be fixed at all iterations, and can thus be estimated in advance
from a training set. This allows efficient matching to take place, even when there are many model
parameters. The original matching algorithm was first described by Edwards’s et.al. (1998) and
expanded and refined by Cootes et.al. (2001). Basic algorithm: The appearance model
parameters, c, and shape transformation parameters, t, define the position of the model points in
the image frame, X, which gives the shape of the image patch to be represented by the model.
During matching the pixels in this region of the image, img , are sampled and projected into the
texture model frame, )(
1
ims gTg
−
= . The current model texture is given by cQgg gm += .
The difference between model and image (measured in the normalized texture frame) is giving by
the equation (3.30):
ms ggPr −=)( (3.11)
where P are the parameters of the model, ).||( TTTT
utcP = A simple scalar measure of
difference is the sum of squares of elements of r, .)( rrPE T
= In addition, Cootes et al., (2001)
can be used to minimize and modify the parameters the following:
)( PRrP −=δ where,
P
r
P
r
P
r
R
TT
∂
∂
∂
∂
∂
∂
= −1
)( (3.12)
P
r
∂
∂
is estimated by numeric differentiation, systematically displacing each parameter from the
known optimal value on typical images and computing an average over the training set. R is
computed and used in all subsequent searches with the model.
Basic AAM Search: Equation (3.30) can be used to suggest a correction to make in the model
parameters based on a measured residual r. Given a current estimate of the model parameters, c,
the pose t, the texture transformation u, and the image sample at the current estimate, img , one
step of the iterative matching procedure is as follows:
step1. Project the texture sample into the texture model frame using )(
1
ims gTg
−
=
step 2. evaluate the error vector, ms ggr −= , and the current error,
2
|| rE =
step 3. compute the predicted displacements, )( PRrP −=δ
7. International Journal of Information Technology Convergence and Services (IJITCS) Vol.6, No.4, August 2016
23
step 4. update the model parameters ,PkPP δ+→ where initially k=1,
step 5. calculate the new points, X` and model frame texture
,
mg
step 6. sample the image at the new points to obtain
,
img
step 7. calculate a new error vector, ,,1,
)( mimu ggTr −= −
step 8. if Er ≤2,
|| then accept the new estimate, otherwise try at k=0.5, k=o.25 etc.
This procedure is repeated until no improvement is made to the error,
2,
|| r , and convergence is
declared (or a maximum number of iterations is reached).
Shape AAM: Cootes et.al. (1998), proposed a variant on the AAM in which instead of the
residuals driving the appearance model parameters, c, they could be used to drive the pose, t, and
shape model parameters, sb , alone. The texture model parameters could then be directly
estimated by fitting to the current texture, and rRdt t= , .rRdb ss = The matching procedure
modified as follows:
step 1. Normalize the current texture sample to obtain sg .
step 2. Fit the texture model to the sample using )( ggPb s
T
gg −= .
step 3. Compute the residual as ms ggr −= .
step 4. Predict the pose and shape parameter updates using Edwards et al. (1998).
step 5. Apply and test the updates as for the basic algorithm.
Step 6. Repeat all steps until all frames of the image sequence are processed. The result as a
function of time enable estimation of the position and deformation of the corresponding cells for
each frame in the sequence and update shape and position.
Step7. Segmentation and tracking transforms the raw images into a file that encodes the
boundaries of every cell at every time point, directly allowing computation of shape and motion
parameters. These extracted data for shape and position can be used to quantify parameters
characterizing cell shape and motion. Segmentation and tracking transforms the raw images into a
file that encodes the boundaries of every cell at every time point, and allow the computation of
shape and motion of the cells.
These extracted data for shape and position can be used to quantify parameters characterizing cell
shape and motion. Segmentation and tracking transforms the raw images into a file that encodes
the boundaries of every cell at every time point, and allow the computation of shape and motion
of the cells.
3.3 Accuracy Performance Measure
The performance of the enhanced cell tracking technique is measured by how well the system can
track the WBC. Two methods are used to evaluate the enhanced technique.
8. International Journal of Information Technology Convergence and Services (IJITCS) Vol.6, No.4, August 2016
24
• Percentage of frames tracked. If a computed cell center is within one cell radius of the
manually observed cell center, then we consider that frame as tracked. The percentage is
computed as the ratio of number of frames tracked to the total number of frames in the
sequence.
total
P
N
N
f = (3.13)
where Pf is the percentage of frames tracked, N is the number of frames tracked, and totalN is
the total number of frames in the image sequence.
• The second method is used to measure the performance of our enhanced technique is
calculating the Root Mean Squared Error (RMSE) between the manual (ground truth) and
the computed displacement. In addition, compare the RMSE achieved with the RMSE for
the other methods (Jung et al., (1998), and also earlier observation of Ley et al., (1996)).
The RMSE (in microns) describes how accurately the tracker tracks the cell as compared
predicted (computed) to the actual (ground truth or manual) data. RMSE gives the standard
deviation of the model prediction error.
A smaller value indicates better model performance. The root mean square error (RMSE) is
giving a sense of the predicted values error. Also how close the predicted values are to the actual
values. The RMSE mathematical formula is giving by:
n
XX
RMSE
n
i ipredictediactual∑ =
−
= 1
2
,, )(
(3.14)
where Xactual is actual values and Xpredicted is predicted values, and i represent the current predictor,
and n represents the number of predictors. The combination of the percentage of frames tracked
and the RMSE yields the qualitative performance Ratings.
3.4 Validation and Benchmarks
To validation and evaluate the quality of an automated cell tracking procedure, a comparison
have been made between the manually marked data, also known as ground-truth, of three video
sequences protocols and the automated extracted data, to compare a computationally produced
tracking with the ground truth annotation.
In addition, compare the experiment results with the other research methods results such as Jung
et al., (1998), Scott et al. (2001), and earlier observation of Ley et al. (1996).
4. RESULTS AND DISCUSSION
9. International Journal of Information Technology Convergence and Services (IJITCS) Vol.6, No.4, August 2016
25
An Active Appearance Model (AAM) is a statistical model that describes both the shape of an
object and the image texture around the shape. The AAM is an extension of an Active Shape
Model (ASM).
As shown in Table 4.4, Figure 4.11, and Figure 4.12, the result of the comparison between the
AAM, ASM automated methods, and the Manual calculation shows that AAM has better
accuracy in tracking the WBC, where the results of AAM is similar to the manual
calculation(ground truth).
The main objective here is comparing the mobility results between the two methods. The results
indicate the ability of AAM to give better accuracy for tracking the mobility of the WBC.
The conclusion for the comparison shows that although an AAM may be more robust than an
ASM, but an ASM tends to have a larger capture range if started from a poorly initialized
solution. This is because an ASM searches around the current location, whereas the AAM only
examines the image directly under its current area.
Table 4.1: Some mobility results for both Manual(ground truth), (AAM) and (ASM) tracking of the
leukocytes cells.
Cell
GTVel
(µm/s
)
AAMVel
(Experimen
tal) (µm/s)
ASMVel
(Experimen
tal)
(µm/s)
GTIndexShape. AAMIndexShape.
(Experimental)
)(
.
alExperiment
ASMindexShape
1 7.0 7.2 6.7 2.4 2.2 2.3
2 3.5 3.4 3.1 2.7 2.7 2.5
3 2.5 2.4 2.6 1.5 1.7 1.4
4 2.1 2.2 2.4 2.2 2.3 2.3
5 3.1 3.3 3.2 2.5 2.6 2.1
6 5.6 5.7 5.8 1.5 1.5 1.4
7 6.8 6.7 6.3 1.3 1.2 1.5
8 7.5 7.5 7.2 2.5 2.6 2.4
9 1.3 1.2 3.3 2.9 2.9 2.5
10 2.4 2.4 2.1 1.7 1.8 1.6
11 3.5 3.6 3.2 2.5 2.6 2.2
12 7.6 7.6 7.1 2.6 2.4 2.4
13 2.8 2.7 2.4 2.8 2.7 2.5
14 2.6 2.8 2.1 2.1 2.2 1.9
15 2.4 2.4 2.2 1.2 1.3 1.4
16 7.5 7.4 7.2 2.6 2.5 2.2
17 4.3 4.4 4.1 2.3 2.1 1.9
18 4.5 4.4 4.3 1.3 1.4 1.8
19 7.8 7.7 7.3 2.5 2.4 2.1
20 1.6 1.7 1.5 1.1 1.2 1.5
10. International Journal of Information Technology Convergence and Services (IJITCS) Vol.6, No.4, August 2016
26
GTVel :GROUND TRUTH AAMVel : AAM VELOCITY (EXPERIMENTAL) ASMVel : ASM
VELOCITY (EXPERIMENTAL)
GTIndexShape. :GROUND TRUTH (CHANGE SHAPE INDICATOR) AAMindexShape. : CHANGE SHAPE
(EXPERIMENTA) ASMindexShape. :CHANGE SHAPE(EXPERIMENTAL)
Figure 4.1: Experiments results for the automated deformation tracking results for the tracked cells from
video sequences. A comparison between AAM, ASM, and the manual calculation from Jung et al. (1998).
Figure 4.2: Experiments results for the automated velocity tracking results for the tracked cells from video
sequences. A comparison between AAM, ASM, and the manual calculation from Jung et al. (1998).
11. International Journal of Information Technology Convergence and Services (IJITCS) Vol.6, No.4, August 2016
27
5. CONCLUSION
In this paper, a comparison between cell tracking using active shape model (ASM) and active
appearance model (AAM) algorithms has been made, to investigate the cells tracking quality
between the two methods. Sensitive and accurate cell tracking system is essential to cell motility studies.
The active shape model (ASM) and active appearance model (AAM) algorithms has proved to be a
successful methods for matching statistical models.
The comparison between (AAM), (ASM) methods, and the manual calculation (ground truth)
method based on experimental result, shows that the (AAM) algorithm results indicate the ability
of (AAM) method to give better accuracy for tracking the mobility of the WBC than (ASM)
method.
6. REFERENCES
[1] Aly, Ashraf A., Deris, S., Zaki, N., (2014) "Intelligent Algorithms for Cell Tracking and Image
Segmentation", International Journal of Computer Science & Information Technology (IJCSIT) Vol
6, No 5, October 2014.
[2] Jie, S., Hao, F., Guoping, Q., Philip, K., and Mohammad, I. (2013) "Segmenting Overlapping
Cell Nuclei In Digital Histopathology Images", 35th Annual International Conference of the
IEEE (EMBS Osaka).
[3] Siegel, R., Naishadham, D., Ahmedin, J. (2013) "Cancer Statistics", 2013ǁ, CA Cancer J Clin,
63:11- 30.
[4] Anders, E., Dufort, P., Daniel, F., and Stephen, L. (2013) "Medical Image Processing on the
GPU: Past, Present and Future" Medical Image Analysis.
[5] Xin, Q., Fuyong, X., David, Foran J., and Lin Y. (2012) "Robust Segmentation of Overlapping
Cells in Histopathology Specimens Using Parallel Seed Detection and Repulsive Level Set"
IEEE Trans. On Biomed. Eng., vol. 59, no. 3.
[6] Aly, Ashraf A., Deris, S., Zaki, N., (2011) "A Novel Image Segmentation Enhancement
Technique Based On Active Contour and Topological Alignments ", Advanced Computing: An
International Journal (ACIJ), Vol.2, No.3, May 2011.
[7] Danuser, G., Meijering, E., and Smal, I. 2011. Tracking in molecular bioimaging. Signal
Processing Magazine IEEE, 23(3):46-53.
[8] Melange, T., Nachtegael, M., and Kerre, E. 2011. Fuzzy Random Impulse Noise Removal
From Color Image Sequences. IEEE Trans. 20: 1023 – 1035.
[9] Danuser, G., Meijering, E., and Smal, I. 2011. Tracking in molecular bioimaging. Signal
Processing Magazine, IEEE, 23(3):46-53.
[10] Mignotte, M. 2010. A Label Field Fusion Bayesian Model and Its Penalized Maximum Rand
Estimator for Image Segmentation. IEEE Trans. 19: 1610 - 1624.
[11] Bradski, G. 2000. The Open CV Library. Dr. Dobb’s Software Tools for the Professional
Programmer.
[12] Coskun, H., Li, Y., and Mackey, M. A. 2007. Ameboid cell motility: A model and inverse
problem, with an application to live cell imaging data. Journal of heoretical Biology,
244(2):169–179.
[13] Kass, M., Witkin, A., and Terzopoulos, D. 1987. Snakes: Active Contour models. International
Journal of Computer Vision, pages 321–331.
[14] Li, K., Miller, E., Weiss, L., Campbell, P., and Kanade, T. 2006. Online tracking of migrating and
proliferating cells imaged with phase - contrast microscopy”, Proc. of the 2006 Conf, on
Computer Vision and Pattern Recognition Workshop (CVPRW’06), pages 65–72.
[15] Mukherjee, D., Ray, N., and Acton, S., 2004. Level set analysis for leukocyte detection and
tracking. IEEE Trans Image Process, 13(4)562-72.
12. International Journal of Information Technology Convergence and Services (IJITCS) Vol.6, No.4, August 2016
28
[16] Ray, N., Acton, S., and Ley, K. 2002. Tracking leukocytes in vivo with shape and size
constrained Active Contours, IEEE Trans Med Imaging 21(10):1222–1235.
[17] Zimmer, C., Zhang, B., Dufour, A., Thebaud, S., Berlemont, V. and Marin, O. 2006. On the
Digital Trail of Mobile Cells. Signal Processing Magazine, 23(3):54-62.
[18] Miura, K., 2005. Tracking Movement in Cell Biology. Advances in Biochemical Engineering
Biotechnology, 95:267-295.
[19] Mukherjee, D., Ray, N., and Acton, S. 2004. Level set analysis for leukocyte detection and
tracking. IEEE Trans Image Process, 13(4):562-572.
[20] Li,Y., Zheng,Y., Doermann, D., and Jaeger, S. 2008. Script-Independent Text Line Segmentation
Segmentation in Freestyle Handwritten Documents. IEEE Trans Pattern Anal Mach Intell,
30(8):1313-1329.
[21] Ersoy, I., Bunyak, F., Mackey, M., and Palaniappan, K. 2008. Cell Segmentation Using Hessian-
Based Detection and Contour Evolution with Directional Derivatives. International Conference on
Image Processing, 1804-1807.
[22] Jung, U., Norman, K., Ramos, C., Scharffetter-Kochanek, K., Beaudet, A., and Ley, K. 1998.
Transit time of leukocytes rolling through venules controls cytokine- induced inflammatory cell
recruitment in vivo. J. Clin. Invest. 102, 1526–1533.
[23] Ray, N., Acton, S., and Ley, K. 2002. Tracking leukocytes in vivo with shape and size
constrained Active Contours”, IEEE Trans Med Imaging, 21(10):1222-1235.
[24] Debeir, O., Ham, P., Kiss, R., and Decaestecker C. 2005. Tracking of migrating cells under
phase-contrast video microscopy with combined mean-shift processes. IEEE Trans Med Imaging ,
24(6):697-711.
[25] Sacan, A., Ferhatosmanoglu, H., and Coskun, H. 2008. CellTrack: an opensource software for cell
tracking and motility analysis. Bioinformatics, 24(14):1647-1649.
[26] Rodrigo, M., and Leyza, B. 2007. White blood cell segmentation using morphological
operators and scale – space analysis. Brazilian Symposiun on computer graphics and Image
Processing, 1530-1834/07.
[27] Scott, T., Klaus, W., and Klaus, L. 2002. Automatic Tracking of Rolling Leukocytes in
Vivo, Microvascular Research, vol 63, pp. 139 – 148.
AUTHOR
Dr. ASHRAF ALY
Morehead state University
Morehead, KY 40351, USA