Fractal image compression depends on representing an image using affine transformations. The main concern for researches in the discipline of fractal image compression (FIC) algorithm is to decrease encoding time needed to compress image data. The basic technique is that each portion of the image is similar to other portions of the same image. In this process, there are many models that were developed. The presence of fractals was initially noticed and handled using Iterated Function System (IFS); that is used for encoding images. In this paper, a review of fractal image compression is discussed with its variants along with other techniques. A summarized review of contributions is achieved to determine the fulfillment of fractal ima

Fractal image compression gives some desirable properties like fast decoding image, and very good rate-distortion curves, but suffers from a high encoding time. In fractal image compression a partitioning of the image into ranges is required. In this work, we introduced good partitioning process by means of merge approach, since some ranges are connected to the others. This paper presents a method to reduce the encoding time of this technique by reducing the number of range blocks based on the computing the statistical measures between them . Experimental results on standard images show that the proposed method yields minimize (decrease) the encoding time and remain the quality results passable visually.

Three-dimensional (3D) image and medical image processing, which are considered big data analysis, have attracted significant attention during the last few years. To this end, efficient 3D object recognition techniques could be beneficial to such image and medical image processing. However, to date, most of the proposed methods for 3D object recognition experience major challenges in terms of high computational complexity. This is attributed to the fact that the computational complexity and execution time are increased when the dimensions of the object are increased, which is the case in 3D object recognition. Therefore, finding an efficient method for obtaining high recognition accuracy with low computational complexity is essentia

Phosphorus‐based Schiff base were synthesized by treating bis{3‐[2‐(4‐amino‐1.5‐dimethyl‐2‐phenyl‐pyrazol‐3‐ylideneamino)ethyl]‐indol‐1‐ylmethyl}‐phosphinic acid with paraformaldehyde and characterized as a novel antioxidant. Its corresponding complexes [(VO)₂L(SO₄)₂], [Ni₂LCl₄], [Co₂LCl₄], [Cu₂LCl₄], [Zn₂LCl₄], [Cd₂LCl₄], [Hg₂LCl₄], [Pd₂LCl₄], and [PtL

Background: Pain is one of the most postoperative complications of surgical wound especially within first 24 hrs. leading to delay hospital discharge, stress gastritis and increasing blood pressure. As wound infiltration with long acting local anesthetic (bupivacaine) has been proved to be effective after orthopedic surgeries especially total hip and knee replacements.Objective: our study was designed to determine theeffectiveness of local infiltration of 0.5% of bupivacainebefore closure of surgical wounds in controllingpostoperative pain and improve patient’s outcome after totalhip and knee replacement surgeries in first 24hrspostoperative period.Methods: Twenty patients from class I (healthy patients) and class II (patients mild sys

The study investigated the behaviour of asphalt concrete mixes for aggregate gradations, according to the Iraqi specification using the Bailey method designed by an Excel spreadsheet. In mixing aggregates with varying gradations (coarse and fine aggregate), The Bailey method is a systematic methodology that offers aggregate interlocking as the backbone of the framework and a controlled gradation to complete the blends. Six types of gradation are used according to the bailey method considered in this study. Two-course prepared Asphalt Concrete Wearing and Asphalt Concrete binder, the Nominal Maximum Aggregate Sizes (NMAS) of the mixtures are 19 and 12.5 mm, respectively. The total number of specimens was 240 for both layers (15 samp