Sharif Digital Repository

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 usual attacks to a watermarked image. In this paper we introduce a method that is suitable for any spatial domain watermarking algorithms, such 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 n bits, we embed it s times. 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 number of... 

In this paper, Quad-Tree decomposition method is applied for areal upscaling of irregular shaped petroleum reservoirs. Quad-Tree decomposition is a recursive data structuring technique which generates an upscaled model with non-uniform (unstructured) gridblocks. This type of coarsening reduces the number of gridblocks, but preserves the main heterogeneity features of the original fine model. Because of the quadruplet nature of the Quad-Tree decomposition, this method cannot be used for upscaling of irregular-shaped models, directly. In this study, by circumscribing a square to the irregular-shaped reservoirs, a temporary model is obtained which can be upscaled by Quad-Tree decomposition.... 

A novel approach for mesoscale modelling of concrete composites is proposed by combining enriched scaled boundary finite element methods with quad-tree mesh. The concrete meso-structures are comprised of randomly distributed aggregates, mortar matrix, and interface transition zone. An improved random aggregate generation technique is developed to construct digital images of mesoscale concrete models. Based on the quadtree decomposition algorithm, meshes can be generated automatically from the digital images of concrete mesostructure. The whole mesh generation process is highly efficient without any artificial interference and eliminates the issue of hanging nodes faced by standard finite... 

Determining the capacity of watermark for images is a complex task. This capacity may be influenced by many factors such as the content of image and also the strength of watermark. In some recent works the image content has been considered for calculation of watermark capacity. One such approach is to use the Noise Visibility Function (NVF) introduced in [3]. In this paper we introduced a new method for finding NVF according to the quad tree representation of image instead of using pixel neighborhood data. Our experimental results showed that the depth of a pixel in image quad tree represents much information about the pixel and its maximum allowable distortion compared to pixel neighborhood... 

The main attempt of this paper is to present a new methodology to model a generic low-level flight close to terrain, which guarantees terrain collision avoidance. Benefiting the advantages of high-speed computer technology, this method uses satellite elevation maps to generate so-called "quad-tree forms". The latter is then used to find the optimal trajectories for low-level flights. The novelty of this approach, entitled the "cost map," lies in the integration of aircraft dynamics into the segmented map. This procedure results in some near-optimal trajectories with respect to aircraft dynamics that could easily be used for minimization of flight path together with pilot effort. Different... 

In this study, in order to investigate the effect of the underlying pore-scale processes on continuum scale simulations of porous media dissolution, we improve the standard Lattice Boltzmann method using Quadtree grid refinement approach to simulate fluid flow and reactive transport through large domain sizes. Our results have shown considerable computational improvements up to 80% in simulation time together with increased numerical accuracy. The results and the added value of the new approach are discussed using comparison of our model with the conventional LBM. Moreover, we have applied a systematic analysis by increasing complexity levels and starting from fluid flow and continuing with... 

One of the most important parameters in evaluating a watermarking algorithm is its capacity. In fact, capacity has a paradoxical relation with other two important parameters: image quality and robustness. Some works have been done on watermarking capacity and a few on image complexities. Most works on watermarking capacity is based on information theory and the capacity values which are calculated based on these methods are very tolerate. In this paper we propose a new method for calculating image complexity based on Region Of Interest (ROI) concept. After that we analyze three complexity measures named: Image compositional complexity (ICC), Quad tree and ROI method, with three different...