The objective of all planning research is to plan for human comfort and safety, and one of the most significant natural dangers to which humans are exposed is earthquake risk; therefore, earthquake risks must be anticipated, and with the advancement of global technology, it is possible to obtain information on earthquake hazards. GIS has been utilized extensively in the field of environmental assessment research due to its high potential, and GIS is a crucial application in seismic risk assessment. This paper examines the methodologies used in recent GIS-based seismic risk studies, their primary environmental impacts on urban areas, and the complexity of the relationship between the applied methodological approaches and the resulting environmental risk assessments. Using spatial analysis techniques based on the history of spatial earthquakes, fault lines, and residential complexes. This article provides map which depict the most significant seismic danger zones in Iran. The analysis reveals that the area of very dangerous and earthquake-prone zone is equal to (12%) from the residential areas, it is concentrated in the western region, adjacent to Iraq and close to the tectonic plate. The dangerous areas are concentrated in the western side of Iran, extending from the north to the south (20%), which is a fairly large percentage. As for the critical area by earthquake-prone, they are concentrated in the northern regions (23%), The medium critical areas are frequent in the centre and the north-east in Iran, and it is the largest area (26%), while the areas that less affected by the risk of an earthquake, are concentrated in the middle (17%), As for the areas that are not affected by the risk of earthquakes, (1%).
Steganography is a mean of hiding information within a more obvious form of
communication. It exploits the use of host data to hide a piece of information in such a way
that it is imperceptible to human observer. The major goals of effective Steganography are
High Embedding Capacity, Imperceptibility and Robustness. This paper introduces a scheme
for hiding secret images that could be as much as 25% of the host image data. The proposed
algorithm uses orthogonal discrete cosine transform for host image. A scaling factor (a) in
frequency domain controls the quality of the stego images. Experimented results of secret
image recovery after applying JPEG coding to the stego-images are included.
Data hiding is the process of encoding extra information in an image by making small modification to its pixels. To be practical, the hidden data must be perceptually invisible yet robust to common signal processing operations. This paper introduces a scheme for hiding a signature image that could be as much as 25% of the host image data and hence could be used both in digital watermarking as well as image/data hiding. The proposed algorithm uses orthogonal discrete wavelet transforms with two zero moments and with improved time localization called discrete slantlet transform for both host and signature image. A scaling factor ? in frequency domain control the quality of the watermarked images. Experimental results of signature image
... Show More
In this paper, a subspace identification method for bilinear systems is used . Wherein a " three-block " and " four-block " subspace algorithms are used. In this algorithms the input signal to the system does not have to be white . Simulation of these algorithms shows that the " four-block " gives fast convergence and the dimensions of the matrices involved are significantly smaller so that the computational complexity is lower as a comparison with " three-block " algorithm .
in this paper we adopted ways for detecting edges locally classical prewitt operators and modification it are adopted to perform the edge detection and comparing then with sobel opreators the study shows that using a prewitt opreators
(12)
(11)
This paper introduces a relation between resultant and the Jacobian determinant
by generalizing Sakkalis theorem from two polynomials in two variables to the case of (n) polynomials in (n) variables. This leads us to study the results of the type: , and use this relation to attack the Jacobian problem. The last section shows our contribution to proving the conjecture.
Digital image is widely used in computer applications. This paper introduces a proposed method of image zooming based upon inverse slantlet transform and image scaling. Slantlet transform (SLT) is based on the principle of designing different filters for different scales.
First we apply SLT on color image, the idea of transform color image into slant, where large coefficients are mainly the signal and smaller one represent the noise. By suitably modifying these coefficients , using scaling up image by box and Bartlett filters so that the image scales up to 2X2 and then inverse slantlet transform from modifying coefficients using to the reconstructed image .
&nbs
... Show MoreIn this paper, an algorithm for reconstruction of a completely lost blocks using Modified
Hybrid Transform. The algorithms examined in this paper do not require a DC estimation
method or interpolation. The reconstruction achieved using matrix manipulation based on
Modified Hybrid transform. Also adopted in this paper smart matrix (Detection Matrix) to detect
the missing blocks for the purpose of rebuilding it. We further asses the performance of the
Modified Hybrid Transform in lost block reconstruction application. Also this paper discusses
the effect of using multiwavelet and 3D Radon in lost block reconstruction.