|
|
|
|
|
|
|
|
 |
Estimation of Mean Radius, Length and Density of Microvasculature Using Diffusion and Perfusion MRI
M. Ashoor (PhD.)
M. Jahed [PhD.]
M. Chopp [PhD.]
A. Mireshghi [PhD.]
Preview
Download PDF
|
|
|
In theory, diusion and perfusion information in MRI maps can be combined to yield
morphological information, such as capillary density, volume and possibly capillary plasma
velocity. This paper suggests a new method for determination of mean radius, length and capillary
density in normal regions using diusion and perfusion MRI. Mean Transit Time (MTT), Cerebral
Blood Volume (CBV), Apparent Diusion Coecient (ADC), pseudo-diusion coecient (D)
and R2 and R
2 values were utilized to calculate mean radius, length and capillary density.
To verify the proposed theory, a special protocol was designed and tested on normal regions
of a male Wistar rat using obtained functions. Mean radius, length and capillary density in
the normal regions were calculated to be 2:48 0:35 (mean SD), 234 12 microns
and 11897 219=mm3, respectively. With respect to the values 0.01 through 0.1 for the
CBV/Vol(voxel) parameter and 1 through 1000 sec for R2
2 =R3
2, the mean radius of the
capillary, using the proposed method, varied from 0.076 to 7.58 microns. |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
 |
Achieving Higher Stability in Watermarking According to Image Complexity
M. Jamzad (PhD.)
F. Yaghmaee [PhD.]
Preview
Download PDF
|
|
|
One of the main objectives of all watermarking algorithms is to provide a secure method for detecting all or part of the watermark pattern in case of the usual attacks on a watermarked image. In this paper, a method is introduced that is suitable for any spatial domain watermarking algorithm, so that it can provide a measure for the level of robustness when a given watermark is supposed to be embedded in a known host image. In order to increase the robustness of the watermarked image, for a watermark of $M$ bits, it was embedded N=s\times M times, where $s$ is a small integer. Doing this, the entire image is divided into 16 equal size blocks. For each block, the complexity of the sub-image in that block is measured. The amount of repetition of the watermark bits saved in each block is determined, according to the complexity level of that block. The complexity of a sub-image is measured using its quad tree representation. This approach not only secures the watermarked image with respect to usual attacks, but also, enables one to save longer bit patterns of the watermark, while maintaining a good level of similarity between the original image and the watermarked one. For evaluating the performance of this method, it has been tested on 2000 images having low, medium and high levels of complexity and the result have been compared with the same set of images, without considering the complexity of sub-images in blocks. The new method provided 17% higher stability. |
|
|
|
|