Kidney tumors are of different types having different characteristics and also remain challenging in the field of biomedicine. It becomes very important to detect the tumor and classify it at the early stage so that appropriate treatment can be planned. Accurate estimation of kidney tumor volume is essential for clinical diagnoses and therapeutic decisions related to renal diseases. The main objective of this research is to use the Computer-Aided Diagnosis (CAD) algorithms to help the early detection of kidney tumors that addresses the challenges of accurate kidney tumor volume estimation caused by extensive variations in kidney shape, size and orientation across subjects.
In this paper, have tried to implement an automated segmentati

The study aimed to investigate the effect of using the intructional computer individually or through the cooperative groups on the achievement of the ninth grade students in mathematics compared to the traditional method. The experimental method adapted three groups out of three schools were chosen, two groups of the students where applied the computer method. The comtrol group used the simple random method, and it used the diagnostic test as tool for the study.The result showed that there is a statistically significant difference between the mean scores of the experimental groups and the control group on the post-test for the two experimental groups.

   Neural stem cells (NSCs) are progenitor cells which have the ability to self‑renewal and potential for differentiating into neurons, oligodendrocytes, and astrocytes. The in vitro isolation, culturing, identification, cryopreservation were investigated to produce neural stem cells in culture as successful sources for further studies before using it for clinical trials. In this study, mouse bone marrow was the source of neural stem cells. The results of morphological study and immunocytochemistry of isolated cells showed that NSCs can be produced successfully and maintaining their self‑renewal and successfully forming neurosphere for multiple passages. The spheres preserved their morphology in culture and cryopreserved t

In this paper three techniques for image compression are implemented. The proposed techniques consist of three dimension (3-D) two level discrete wavelet transform (DWT), 3-D two level discrete multi-wavelet transform (DMWT) and 3-D two level hybrid (wavelet-multiwavelet transform) technique. Daubechies and Haar are used in discrete wavelet transform and Critically Sampled preprocessing is used in discrete multi-wavelet transform. The aim is to maintain to increase the compression ratio (CR) with respect to increase the level of the transformation in case of 3-D transformation, so, the compression ratio is measured for each level. To get a good compression, the image data properties, were measured, such as, image entropy (He), percent r

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

Groupwise 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