When soft tissue planning is important, usually, the Magnetic Resonance Imaging (MRI) is a medical imaging technique of selection. In this work, we show a modern method for automated diagnosis depending on a magnetic resonance images classification of the MRI. The presented technique has two main stages; features extraction and classification. We obtained the features corresponding to MRI images implementing Discrete Wavelet Transformation (DWT), inverse and forward, and textural properties, like rotation invariant texture features based on Gabor filtering, and evaluate the meaning of every property in the classification. The classifier is according to Feed Forward Back Propagation Artificial Neural Network (FP-ANN) in the classification stage. The properties thereafter derived to be implemented to teach a neural network based binary classifier that will be automatically able to conclude whether the image is that of a pathological, suffering from brain lesion, or a normal brain. The proposed algorithm obtained the sensitivity of 97.50%, specificity of 82.86% and accuracy of 94.3% for clinical Brain MRI database. This outcome proofs that the presented algorithm is robust and effective compared with other recent techniques.
The rapid development of telemedicine services and the requirements for exchanging medical information between physicians, consultants, and health institutions have made the protection of patients’ information an important priority for any future e-health system. The protection of medical information, including the cover (i.e. medical image), has a specificity that slightly differs from the requirements for protecting other information. It is necessary to preserve the cover greatly due to its importance on the reception side as medical staff use this information to provide a diagnosis to save a patient's life. If the cover is tampered with, this leads to failure in achieving the goal of telemedicine. Therefore, this work provides an in
... Show MoreMultispectral remote sensing image segmentation can be achieved using a multithresholding technique. This paper studies the effect of changing the window size of the two dimensional (2D) fast Otsu algorithm that presented by Zhang. From the results, it shown that this method behaves as a search machine for the valleys (an automatic threshold), between the gray levels of the histogram with changing the size of slide window.
Keywords Image Segmentation, (2D) Fast Otsu method, Multithresholding, Automatic thresholding, (2D) histogram image.
In this paper we describe several different training algorithms for feed forward neural networks(FFNN). In all of these algorithms we use the gradient of the performance function, energy function, to determine how to adjust the weights such that the performance function is minimized, where the back propagation algorithm has been used to increase the speed of training. The above algorithms have a variety of different computation and thus different type of form of search direction and storage requirements, however non of the above algorithms has a global properties which suited to all problems.
Lowpass spatial filters are adopted to match the noise statistics of the degradation seeking
good quality smoothed images. This study imply different size and shape of smoothing
windows. The study shows that using a window square frame shape gives good quality
smoothing and at the same time preserving a certain level of high frequency components in
comparsion with standard smoothing filters.
With the increased development in digital media and communication, the need for methods to protection and security became very important factor, where the exchange and transmit date over communication channel led to make effort to protect these data from unauthentication access.
This paper present a new method to protect color image from unauthentication access using watermarking. The watermarking algorithm hide the encoded mark image in frequency domain using Discrete Cosine Transform. The main principle of the algorithm is encode frequent mark in cover color image. The watermark image bits are spread by repeat the mark and arrange in encoded method that provide algorithm more robustness and security. The propos
... Show MoreGroupwise non-rigid image alignment is a difficult non-linear optimization problem involving many parameters and often large datasets. Previous methods have explored various metrics and optimization strategies. Good results have been previously achieved with simple metrics, requiring complex optimization, often with many unintuitive parameters that require careful tuning for each dataset. In this chapter, the problem is restructured to use a simpler, iterative optimization algorithm, with very few free parameters. The warps are refined using an iterative Levenberg-Marquardt minimization to the mean, based on updating the locations of a small number of points and incorporating a stiffness constraint. This optimization approach is eff
... Show MoreMedical image segmentation is one of the most actively studied fields in the past few decades, as the development of modern imaging modalities such as magnetic resonance imaging (MRI) and computed tomography (CT), physicians and technicians nowadays have to process the increasing number and size of medical images. Therefore, efficient and accurate computational segmentation algorithms become necessary to extract the desired information from these large data sets. Moreover, sophisticated segmentation algorithms can help the physicians delineate better the anatomical structures presented in the input images, enhance the accuracy of medical diagnosis and facilitate the best treatment planning. Many of the proposed algorithms could perform w
... Show More