block size
Recently Published Documents


TOTAL DOCUMENTS

1265
(FIVE YEARS 365)

H-INDEX

39
(FIVE YEARS 9)

2022 ◽  
Vol 345 (3) ◽  
pp. 112740
Author(s):  
R. Julian R. Abel ◽  
Thomas Britz ◽  
Yudhistira A. Bunjamin ◽  
Diana Combe

2022 ◽  
pp. 811-822
Author(s):  
B.V. Dhandra ◽  
Satishkumar Mallappa ◽  
Gururaj Mukarambi

In this article, the exhaustive experiment is carried out to test the performance of the Segmentation based Fractal Texture Analysis (SFTA) features with nt = 4 pairs, and nt = 8 pairs, geometric features and their combinations. A unified algorithm is designed to identify the scripts of the camera captured bi-lingual document image containing International language English with each one of Hindi, Kannada, Telugu, Malayalam, Bengali, Oriya, Punjabi, and Urdu scripts. The SFTA algorithm decomposes the input image into a set of binary images from which the fractal dimension of the resulting regions are computed in order to describe the segmented texture patterns. This motivates use of the SFTA features as the texture features to identify the scripts of the camera-based document image, which has an effect of non-homogeneous illumination (Resolution). An experiment is carried on eleven scripts each with 1000 sample images of block sizes 128 × 128, 256 × 256, 512 × 512 and 1024 × 1024. It is observed that the block size 512 × 512 gives the maximum accuracy of 86.45% for Gujarathi and English script combination and is the optimal size. The novelty of this article is that unified algorithm is developed for the script identification of bilingual document images.


A Cache plays a vital role in improving performance in the multicore environment, especially the Last Level Cache (LLC). The improvements in performance are based on the block size, associativity, and replacement policies. Most of the papers concentrate on traditional Least Recently Used (LRU) based replacement policies for their replacement decisions. Unfortunately, the replacement decisions do not enhance performance of the cache as expected. An enhanced modified Pseudo LRU policy is proposed, which is an approximation of LRU. The proposed methodology uses counters to enhance the confidence of replacement decisions based on the history of the replaceable blocks in cache. It is very clear from the Simulation results that the replacement scheme proposed exhibits better performance improvement in terms of miss ratio of about 3% and energy efficiency of about 2% on an average.


Author(s):  
Paavni Gaur

Abstract: An Image Encryption and Decryption Using AES (Advance Encryption Standard) Algorithm is proposed in the project. Due to increasing use of image in various field, it is very important to protect the confidential image data from unauthorized access. The design uses the iterative approach with block size of 128 bit and key size of 128, 192 or 256 bit. The numbers of round for key size of 256 bits is 14 , for 128 bits is 10 and for 192 bits is 12. As secret key increases the security as well as complexity of the cryptography algorithms. In this paper , an algorithm in which the image is an input to AES Encryption to get the encrypted image and then input it to AES Decryption to get the original image is proposed and explained which will further be implemented by me. The paper shows the study in which a system could be used for effective image data encryption and key generation in diversified application areas, where sensitive and confidential data needs to be transmitted along with the image.


2021 ◽  
pp. 5035-5043
Author(s):  
Alaa Ali Hussein ◽  
Atheer Yousif Oudah

In this research, a new technique is suggested to reduce the long time required by the encoding process by using modified moment features on domain blocks. The modified moment features were used in accelerating the matching step of the Iterated Function System (IFS). The main disadvantage facing the fractal image compression (FIC) method is the over-long encoding time needed for checking all domain blocks and choosing the least error to get the best matched domain for each block of ranges. In this paper, we develop a method that can reduce the encoding time of FIC by reducing the size of the domain pool based on the moment features of domain blocks, followed by a comparison with threshold (the selected  threshold based on experience is 0.0001). The experiment was conducted on three images with size of 512x512 pixel, resolution of 8 bits/pixel, and different block size (4x4, 8x8 and, 16x16 pixels). The resulted encoding time (ET) values achieved by the proposed method were 41.53, 39.06, and  38.16 sec, respectively, for boat , butterfly, and house images of block size 4x4 pixel.  These values were compared with those obtained by the traditional algorithm for the same images with the same block size, which were 1073.85, 1102.66, and 1084.92 sec, respectively. The results imply that the proposed algorithm could remarkably reduce the ET of the images in comparison with the traditional algorithm.


Author(s):  
Mahmoud Showky Mohammed Ahmed, Rasha Nabil Sami, Noha Adel E Mahmoud Showky Mohammed Ahmed, Rasha Nabil Sami, Noha Adel E

The aim of the study was to assess fracture resistance under cyclic loading of Rosetta®SM CAD vs. IPS e.max CAD (control) vonlays restoring maxillary premolars. According to the sample size calculation, a total of 20 samples will be selected and then divided into two equal groups; 10 sample each based on the material type: Group (A): Ten vonlays (n=10) manufactured from IPS e. max CAD blocks (control). Group ( B): Ten vonlays (n=10) manufactured from Rosetta®SM CAD blocks (intervention). A natural tooth presenting an upper first premolar was prepared in accordance with the ceramic onlay restorations preparation guidelines with an occlusal box with half of the bucco-lingual distance and a 2 mm depth from the cusp tip to pulpal floor, gingival seat with 1 mm depth from pulpal floor, occlusal reduction of 2 mm of the functional cusp with extending the preparation at the palatal surface by 2 mm in the cervical direction, occlusal reduction of 1.5 mm of non-functional cusp and 12º divergence angle. The preparation was then extended to the labial surface, with a 0.5 mm chamfer finish line. All line angles were finally rounded, and all margins were finished. For duplication of the natural tooth; the epoxy dies were constructed. Base and catalyst of the epoxy resin material were mixed as instructed by the manufacturer at a rate of 200r/min and then was poured into the silicon mould under vibration to eliminate any air voids, then was allowed to set completely following the manufacturer instructions for 24 hours, this procedure was repeated 20 times for creating 20 epoxy resin dies which replicating the prepared natural tooth. The die was then scanned by optical scanning using Medit i500 oral scanner. Milling of Vonlays was achieved using Sirona MCX5 milling machine using IPS e. max CAD blocks and Rosetta SM CAD blocks: 10 IPS e.max CAD blocks with block size C14 and 10 Rosetta®SM CAD blocks with block size C14 were used. Vonlays were then seated on their corresponding dies and cemented with dual cured self-adhesive resin cement (Variolink, Ivoclar Vivadent). Cementation procedures were performed by keeping each sample under a constant pressure of 5Kg using a custom designed cementation device for standardization the applied load during cementation process. All samples were mechanically aged (cyclic loading) to simulate 6 months of clinical use. Following that, all samples were subjected to fracture resistance testing under a compressive load to the center of their long axis using computer controlled universal testing machine with a load cell of 5 Kilo newton (K N) with a computer software used for data recording (Instron® Bluehill Lite Software). The mean values ± SDs values for e.max group were (502.39 ±102.89 N) with minimum value (338.16 N) and maximum value (721.29 N). The mean values ± SDs values. Rosetta group were (468.76 ± 67.54 N) with minimum value (367.11 N) and maximum value (648.48 N). Failure modes were determined under stereomicroscope and classified into repairable and catastrophic in both groups and showed that 60% of e.max group exhibited repairable failure while 40% of specimens showed catastrophic failure while in Rosetta group, 90% of the specimens exhibited repairable failure. Only 10% displayed catastrophic failure. Then a fractured part within each group was examined under scanning electron microscope (SEM) to reveal and compare their microstructure.


2021 ◽  
Vol 2021 ◽  
pp. 1-8
Author(s):  
Yongfeng Li ◽  
Kaina Wang ◽  
Li Gao ◽  
Xiaojun Lu

This study was to explore the adoption effect of magnetic resonance imaging (MRI) image features based on back propagation neural network (BPNN) in evaluating the curative effect of Chengqi Decoction (CD) for intestinal obstruction (ileus), so as to evaluate the clinical adoption value of this algorithm. Ninety patients with ileus were recruited, and the patients were treated with CD and underwent MRI scans of the lower abdomen. A BPNN model was fabricated and applied to segment the MRI images of patients and identify the lesion. As a result, when the overlap step was 16 and the block size was 32 × 32, the running time of the BPNN algorithm was the shortest. The segmentation accuracy was the highest if there were two hidden layer (HL) nodes, reaching 97.3%. The recognition rates of small intestinal stromal tumor (SIST), colon cancer, adhesive ileus, and volvulus of MRI images segmented by the algorithm were 91.5%, 88.33%, 90.3%, and 88.9%, respectively, which were greatly superior to those of manual interpretation ( P < 0.05 ). After the intervention of CD, the percentages of patients with ileus that were cured, markedly effective, effective, and ineffective were 65.38%, 23.16%, 5.38%, and 6.08%, respectively. The cure rate after intervention of CD (65.38%) was much higher in contrast to that before intervention (13.25%) ( P < 0.05 ). In short, CD showed a good therapeutic effect on ileus and can effectively improve the prognosis of patients. In addition, MRI images based on BPNN showed a good diagnostic effect on ileus, and it was worth applying to clinical diagnosis.


2021 ◽  
Author(s):  
paavni gaur

Abstract An Image Encryption and Decryption Using AES (Advance Encryption Standard) Algorithm is proposed in the project. Due to increasing use of image in various field, it is very important to protect the confidential image data from unauthorized access. The design uses the iterative approach with block size of 128 bit and key size of 128, 192 or 256 bit. The numbers of round for key size of 256 bits is 14, for 128 bits is 10 and for 192 bits is 12. As secret key increases the security as well as complexity of the cryptography algorithms. In this paper , an algorithm in which the image is an input to AES Encryption to get the encrypted image and then input it to AES Decryption to get the original image is proposed and explained which will further be implemented by me.The paper shows the study in which a system could be used for effective image data encryption and key generation in diversified application areas, where sensitive and confidential data needs to be transmitted along with the image.


Sign in / Sign up

Export Citation Format

Share Document