Image File Size Research Articles

Exploring Digital Zoom in Scanning Electron Microscopy

Abstract The concept of zoom in scanning electron microscopy (SEM) once referred to increasing the magnification of the sample by reducing the scanned field size. However, with the introduction of digital technology, the concept of zooming has become a little more complicated. Historically, older SEMs operated at a 512 × 512-pixel lateral resolution (262 kB pixel density) at TV scan rates. Today's newest SEMs can achieve up to 32k × 24k (4:3 ratio) pixel lateral resolution, equating to an 805 MB pixel density. In this article, we explore the factors involved in selecting an appropriate frame grabber size for SEM imaging. Specifically, we will delve into the implications of pixel density, including its impact on digital zoom capabilities, image file sizes, and overall image acquisition times.

Maze based image encryption method constructed by random number generation

Due to the large size of image files and the high correlation between the numerical values of the pixels, various improved algorithms have been used for image encryption in recent years. In most cases improvement is obtained by taking into account the characteristics of chaotic and random processes in encryption algorithms. In this study, an algorithm is proposed that encrypts images based on a maze created by keys consisting of random numbers generated with Feigembaum’s quadratic function. For the generation of the maze, deep first search (DFS) algorithm has been used. During the generation with this algorithm, numbers representing the walking paths and as well as the length of the used stack are included in the encryption process. Algorithm security verification was carried out according to key space and differential analysis, statistical analysis such as entropy estimation, and analysis of correlation between the histogram and neighboring pixels of the image.

Perbandingan Algoritma SIMON dan SPECK Dalam Pengamanan Citra Digital

Cryptography is a data security technique by encoding data that is to be kept secret so that the original meaning of the data can no longer be understood. SIMON and SPECK are modern cryptographic algorithms issued by the National Security Agency (NSA). SIMON and SPECK are said to be algorithms that are known for their efficiency and strong security. This research will compare the performance of the SIMON and SPECK algorithms in securing digital images. Comparisons were made by testing time performance, changes in file size, and the level of randomness of image files using the Unified Average Changing Intensity (UACI) and Number of Pixels Change Rate (NPCR) metrics. The research results show that the average encryption and decryption time required by the SIMON algorithm is greater when compared to the SPECK algorithm. The image file size resulting from encryption using the SIMON and SPECK algorithms both increased by 24% from the original image. The level of randomness of the resulting image based on the UACI value obtained using the SIMON algorithm was found to be an average of 19.65%, while the UACI value obtained using the SPECK algorithm was an average of 20.94%. This shows that there is a significant change in intensity between the original image and the encrypted image. However, not all pixels in the encrypted image change when compared to the original image, this is shown by the NPCR value obtained from the SIMON and SPECK algorithm encrypted image, with average results of 49.98% and 50.17%.

Transforming Tele-Ophthalmology: Utilizing Cloud Computing for Remote Eye Care.

Tele-ophthalmology is gaining recognition for its role in improving eye care accessibility via cloud-based solutions. The Google Cloud Platform (GCP) Healthcare API enables secure and efficient management of medical image data such as high-resolution ophthalmic images. This study investigates cloud-based solutions' effectiveness in tele-ophthalmology, with a focus on GCP's role in data management, annotation, and integration for a novel imaging device. Leveraging the Integrating the Healthcare Enterprise (IHE) Eye Care profile, the cloud platform was utilized as a PACS and integrated with the Open Health Imaging Foundation (OHIF) Viewer for image display and annotation capabilities for ophthalmic images. The setup of a GCP DICOM storage and the OHIF Viewer facilitated remote image data analytics. Prolonged loading times and relatively large individual image file sizes indicated system challenges. Cloud platforms have the potential to ease distributed data analytics, as needed for efficient tele-ophthalmology scenarios in research and clinical practice, by providing scalable and secure image management solutions.

Influence of helical pitch and gantry rotation time on image quality and file size in ultrahigh-resolution photon-counting detector CT

The goal of this experimental study was to quantify the influence of helical pitch and gantry rotation time on image quality and file size in ultrahigh-resolution photon-counting CT (UHR-PCCT). Cervical and lumbar spine, pelvis, and upper legs of two fresh-frozen cadaveric specimens were subjected to nine dose-matched UHR-PCCT scan protocols employing a collimation of 120 × 0.2 mm with varying pitch (0.3/1.0/1.2) and rotation time (0.25/0.5/1.0 s). Image quality was analyzed independently by five radiologists and further substantiated by placing normed regions of interest to record mean signal attenuation and noise. Effective mAs, CT dose index (CTDIvol), size-specific dose estimate (SSDE), scan duration, and raw data file size were compared. Regardless of anatomical region, no significant difference was ascertained for CTDIvol (p ≥ 0.204) and SSDE (p ≥ 0.240) among protocols. While exam duration differed substantially (all p ≤ 0.016), the lowest scan time was recorded for high-pitch protocols (4.3 ± 1.0 s) and the highest for low-pitch protocols (43.6 ± 15.4 s). The combination of high helical pitch and short gantry rotation times produced the lowest perceived image quality (intraclass correlation coefficient 0.866; 95% confidence interval 0.807–0.910; p < 0.001) and highest noise. Raw data size increased with acquisition time (15.4 ± 5.0 to 235.0 ± 83.5 GByte; p ≤ 0.013). Rotation time and pitch factor have considerable influence on image quality in UHR-PCCT and must therefore be chosen deliberately for different musculoskeletal imaging tasks. In examinations with long acquisition times, raw data size increases considerably, consequently limiting clinical applicability for larger scan volumes.

Evaluating Urine Cytology Slide Digitization Efficiency: A Comparative Study Using an Artificial Intelligence-Based Heuristic Scanning Simulation and Multiple Z-Plane Scanning

Introduction: Digitizing cytology slides presents challenges because of their three-dimensional features and uneven cell distribution. While multi-Z-plane scan is a prevalent solution, its adoption in clinical digital cytopathology is hindered by prolonged scanning times, increased image file sizes, and the requirement for cytopathologists to review multiple Z-plane images. Methods: This study presents heuristic scan as a novel solution, using an artificial intelligence (AI)-based approach specifically designed for cytology slide scanning as an alternative to the multi-Z-plane scan. Both the 21 Z-plane scan and the heuristic scan simulation methods were used on 52 urine cytology slides from three distinct cytopreparations (Cytospin, ThinPrep, and BD CytoRich™ [SurePath]), generating whole-slide images (WSIs) via the Leica Aperio AT2 digital scanner. The AI algorithm inferred the WSI from 21 Z-planes to quantitate the total number of suspicious for high-grade urothelial carcinoma or more severe cells (SHGUC+) cells. The heuristic scan simulation calculated the total number of SHGUC+ cells from the 21 Z-plane scan data. Performance metrics including SHGUC+ cell coverage rates (calculated by dividing the number of SHGUC+ cells identified in multiple Z-planes or heuristic scan simulation by the total SHGUC+ cells in the 21 Z-planes for each WSI), scanning time, and file size were analyzed to compare the performance of each scanning method. The heuristic scan's metrics were linearly estimated from the 21 Z-plane scan data. Additionally, AI-aided interpretations of WSIs with scant SHGUC+ cells followed The Paris System guidelines and were compared with original diagnoses. Results: The heuristic scan achieved median SHGUC+ cell coverage rates similar to 5 Z-plane scans across three cytopreparations (0.78–0.91 vs. 0.75–0.88, p = 0.451–0.578). Notably, it substantially reduced both scanning time (137.2–635.0 s vs. 332.6–1,278.8 s, p < 0.05) and image file size (0.51–2.10 GB vs. 1.16–3.10 GB, p < 0.05). Importantly, the heuristic scan yielded higher rates of accurate AI-aided interpretations compared to the single Z-plane scan (62.5% vs. 37.5%). Conclusion: We demonstrated that the heuristic scan offers a cost-effective alternative to the conventional multi-Z-plane scan in digital cytopathology. It achieves comparable SHGUC+ cell capture rates while reducing both scanning time and image file size, promising to aid digital urine cytology interpretations with a higher accuracy rate compared to the conventional single (optimal) plane scan. Further studies are needed to assess the integration of this new technology into compatible digital scanners for practical cytology slide scanning.

A hyperspectral surgical microscope with super-resolution reconstruction for intraoperative image guidance.

Hyperspectral imaging (HSI) is an emerging imaging modality in medical applications, especially for intraoperative image guidance. A surgical microscope improves surgeons' visualization with fine details during surgery. The combination of HSI and surgical microscope can provide a powerful tool for surgical guidance. However, to acquire high-resolution hyperspectral images, the long integration time and large image file size can be a burden for intraoperative applications. Super-resolution reconstruction allows acquisition of low-resolution hyperspectral images and generates high-resolution HSI. In this work, we developed a hyperspectral surgical microscope and employed our unsupervised super-resolution neural network, which generated high-resolution hyperspectral images with fine textures and spectral characteristics of tissues. The proposed method can reduce the acquisition time and save storage space taken up by hyperspectral images without compromising image quality, which will facilitate the adaptation of hyperspectral imaging technology in intraoperative image guidance.

Deep Learning Detection of Early Retinal Peripheral Degeneration From Ultra-Widefield Fundus Photographs of Asymptomatic Young Adult (17-19 Years) Candidates to Airforce Cadets.

Artificial intelligence (AI)-assisted ultra-widefield (UWF) fundus photographic interpretation is beneficial to improve the screening of fundus abnormalities. Therefore we constructed an AI machine-learning approach and performed preliminary training and validation. We proposed a two-stage deep learning-based framework to detect early retinal peripheral degeneration using UWF images from the Chinese Air Force cadets' medical selection between February 2016 and June 2022. We developed a detection model for the localization of optic disc and macula, which are used to find the peripheral areas. Then we developed six classification models for the screening of various retinal cases. We also compared our proposed framework with two baseline models reported in the literature. The performance of the screening models was evaluated by area under the receiver operating curve (AUC) with 95% confidence interval. A total of 3911 UWF fundus images were used to develop the deep learning model. The external validation included 760 UWF fundus images. The results of comparison study revealed that our proposed framework achieved competitive performance compared to existing baselines while also demonstrating significantly faster inference time. The developed classification models achieved an average AUC of 0.879 on six different retinal cases in the external validation dataset. Our two-stage deep learning-based framework improved the machine learning efficiency of the AI model for fundus images with high resolution and many interference factors by maximizing the retention of valid information and compressing the image file size. This machine learning model may become a new paradigm for developing UWF fundus photography AI-assisted diagnosis.

Application of singular value decomposition in image compression

The field of computer graphics and multimedia technologies places significant emphasis on the study path of image compression. The increasing prevalence of digital photographs has led to a significant growth in the size of image files, hence presenting storage and transmission issues. The Singular Value Decomposition (SVD) is a matrix decomposition method that possesses significant computational capacity and finds utility in various domains. In recent years, SVD has emerged as a prevalent technique in the domain of image processing, particularly in the context of image compression, yielding notable outcomes. This work primarily employs a literature review research methodology to explore the application of SVD. Specifically, SVD is applied to image compression using Matlab. The approach holds significance due to its ability to achieve efficient compression of digital images, hence enhancing transmission efficiency without compromising image quality.

Reversible Data Hiding of JPEG Image Based on Adaptive Frequency Band Length

JPEG images are widely used on the Internet. Histogram shifting reversible data hiding (RDH) methods based on quantized DCT (discrete cosine transform) coefficients are a research focus for JPEG images. Among them, frequency band selection is a key step that affects the performance of JPEG image RDH. In the existing algorithm, frequency band selection is to evaluate the embedding performance of the whole frequency band. But after DCT block sorting, the distribution of expand AC (alternating current) coefficients (Coefficients that can carry data) is in the front of the frequency band, so the performance evaluation of the whole frequency band will produce errors. This paper proposed an adaptive frequency band length JPEG image RDH method, which determines the used length of the frequency band while selecting the frequency band, so that can effectively reduce the invalid shift. Instead of selecting the whole frequency band length in a fixed mode for performance evaluation, the optimal combination of frequency band lengths will be selected according to the embedding performance of different lengths of each frequency band. Then, a united solution mechanism is used to solve the optimal frequency band length, and the frequency band selection is also completed while solving the frequency band length. Experimental results show that our algorithm outperforms existing state-of-the-art methods in terms of marked image visual quality and file size increment.

Comparative evaluation of slide scanners, scan settings, and cytopreparations for digital urine cytology

BackgroundAcquiring well-focused digital images of cytology slides with scanners can be challenging due to the 3-dimensional nature of the slides. This study evaluates performances of whole-slide images (WSIs) obtained from 2 different cytopreparations by 2 distinct scanners with 3 focus modes. MethodsFourteen urine specimens were collected from patients with urothelial carcinoma. Each specimen was equally divided into 2 portions, prepared with Cytospin and ThinPrep methods and scanned for WSIs using Leica (Aperio AT2) and Hamamatsu (NanoZoomer S360) scanners, respectively. The scan settings included 3 focus modes (default, semi-auto, and manual) for single-layer scanning, along with a manual focus mode for 21 Z-layers scanning. Performance metrics were evaluated including scanning success rate, artificial intelligence (AI) algorithm-inferred atypical cell numbers and coverage rate (atypical cell numbers in single or multiple Z-layers divided by the total atypical cell numbers in 21 Z-layers), scanning time, and image file size. ResultsThe default mode had scanning success rates of 85.7% or 92.9%, depending on the scanner used. The semi-auto mode increased success to 92.9% or 100%, and manual even further to 100%. However, these changes did not affect the standardized median atypical cell numbers and coverage rates. The selection of scanners, cytopreparations, and Z-stacking influenced standardized median atypical cell numbers and coverage rates, scanning times, and image file sizes. DiscussionBoth scanners showed satisfactory scanning. We recommend using semi-auto or manual focus modes to achieve a scanning success rate of up to 100%. Additionally, a minimum of 9-layer Z-stacking at 1 μm intervals is required to cover 80% of atypical cells. These advanced focus methods do not impact the number of atypical cells or their coverage rate. While Z-stacking enhances the AI algorithm's inferred quantity and coverage rates of atypical cells, it simultaneously results in longer scanning times and larger image file sizes.

Analysis of Time Optimization for Watermark Image Quality Using Run Length Encoding Compression

Internet technology continues to have a significant impact on digital media such as text, images, audio and video. One effect is the ease of exchange, distribution, and duplication of digital data; on the other hand, this ease also raises the problem of digital data being protected by copyright or digital data is confidential. Watermarking is a solution to the problem of digital data copyright protection. Extensive research on watermarking was conducted before one of them was a hybrid DWT-DCT-SVD. Several studies have found weaknesses in the process of message insertion; for example, the time to insertion of a watermark image is relatively long, particularly for large images. The problem of long message insertion time is that it is necessary to continue research on watermarking to apply the compression process to the original image before the watermark image insertion process is performed. The original image to be inserted into the watermark image is compressed using the run-length encoding algorithm. The result of the RLE compression shows that the image file size becomes large because the image dataset used has various intensity values. The results from watermarking obtained by watermarked images with RLE compression preprocessing have better imperceptibility than watermarked images without preprocessing RLE compression

A multi-level sorting prediction enhancement-based two-dimensional reversible data hiding algorithm for JPEG images

To improve the performance of reversible data hiding on JPEG images, a multi-level sorting prediction enhancement-based two-dimensional reversible data hiding algorithm for JPEG images is proposed in this paper. Firstly, the smoothness of each DCT block is evaluated by counting the location of the last non-zero coefficient in each DCT block. Then, the gradient of the object block is calculated with the DC coefficients of its surrounding blocks, and the lowest gradient direction blocks are employed to achieve the prediction of object block AC coefficients. Secondly, these gradient of adjacent blocks of the object block are compared to found the lowest gradient direction. The AC coefficient of the object block is accurately predicted by coefficients at the same position of its lowest gradient-direction adjacent blocks. Thirdly, the obtained DCT coefficient prediction errors are paired with a similar prediction-error pairing strategy to construct a two-dimensional prediction-error plane, and the secret data is imperceptibly embedded into the AC coefficients by using the two-dimensional histogram shifting algorithm. The performance of the proposed algorithm is evaluated on different datasets, and six representative images are involved in demonstrating its superiority. Extensive experimental results show that, compared to other state-of-the-art reversible data hiding algorithms, the proposed algorithm can achieve higher visual quality of the data-embedded image while maintaining low JPEG image file size increment.

Photo-Stacking Technique for Neuroanatomical High-Definition Photography and 3-Dimensional Modeling

Three-dimensional (3D) neuroanatomical knowledge is vital in neurosurgery. Technological advances improved 3D anatomical perception, but they are usually expensive and not widely available. The aim of the present study was to provide a detailed description of the photo-stacking technique for high-resolution neuroanatomical photography and 3D modeling. The photo-stacking technique was described in a step-by-step approach. The time for image acquisition, file conversion, processing, and final production was measured using 2 processing methods. The total number and file size of images are presented. Measures of central tendency and dispersion report the measured values. Ten models were used in both methods achieving 20 models with high-definition images. The mean number of acquired images was 40.6 (14-67), image acquisition time 51.50±18.8 s, file conversion time 250±134.6s, processing time 50.46±21.46s and 41.97±20.84s, and 3D reconstruction time was 4.29±0.74s and 3.89±0.60s for methods B and C, respectively. The mean file size of RAW files is 1010±452megabyte (MB) and 101.06±38.09MB for Joint Photographic Experts Group files after conversion. The mean size of the final image means size is 71.9±0.126MB, and the mean file size of the 3D model means is 37.4±0.516MB for both methods. The total equipment used was less expensive than other reported systems. The photo-stacking technique is a simple and inexpensive method to create 3D models and high-definition images that could prove valuable in neuroanatomy training.

Perbandingan algoritma kriptografi simon dan vigenere dalam mengamankan citra digital

Digital image files or images are sometimes a valuable asset. Digital images that are private and confidential are very vulnerable to interception by other parties, especially if the image is distributed via the internet. To increase the security of digital images so that their confidentiality can be maintained, a special technique is needed to protect digital image messages, namely with cryptographic techniques. This study aims to determine the performance of the SIMON algorithm for digital image security. SIMON algorithm performance results are compared with the vigenere cipher algorithm in terms of time and image file size produced. In this study used base64 encode for the encryption process and base64 decode for the decryption process. The performance of the SIMON algorithm in securing digital images results in an average encryption time of 969 ms and an average decryption time of 1537 ms. The SIMON algorithm requires a longer time for the encryption and decryption process when compared to the Vigenere algorithm. The cipher image encrypted by the SIMON algorithm has a size larger than the original file by 36%. However, when compared to the cipher image encrypted by the Vigenere algorithm, there is no significant difference. The UACI value obtained from the SIMON algorithm cipher image obtained an average yield of 18.94%. Based on the theory of differential analysis, it can be said that this value is still vulnerable to differential attack. This is based on the UACI value which has not met the minimum threshold value of 33%.

Energy-aware JPEG image compression: A multi-objective approach

Customer satisfaction is crucially affected by energy consumption in mobile devices. One of the most energy-consuming parts of an application is images. This paper, first, investigates that there is a correlation between energy consumption and image quality as well as image file size. Therefore, these two can be considered as a proxy for energy consumption. In the next step, we focused on proposing a multi-objective strategy to enhance image quality and reduce image file size based on the quantisation table (QT) in JPEG image compression. To this end, we have used two general multi-objective approaches: scalarisation and Pareto-based. In this paper, we embed our strategy into five scalarisation algorithms, including energy-aware multi-objective genetic algorithm (EnMOGA), energy-aware multi-objective particle swarm optimisation (EnMOPSO), energy-aware multi-objective differential evolution (EnMODE), energy-aware multi-objective evolutionary strategy (EnMOES), and energy-aware multi-objective pattern search (EnMOPS). Also, two Pareto-based methods, including a non-dominated sorting genetic algorithm (NSGA-II) and a reference-point-based NSGA-II (NSGA-III) are used for the embedding scheme, and two Pareto-based algorithms, EnNSGAII and EnNSGAIII, are presented. With our proposed scalarisation method, user’s preferences can be set before starting the optimisation process and the algorithm generates only one solution based on the preference, while our Pareto-based approaches generate a set of solutions so that a user can select one of the preferred solutions after the optimisation process.Experimental studies show that the performance of the baseline algorithm is improved by embedding the proposed strategy into metaheuristic algorithms. In particular, EnMOGA, EnMOPS, and EnNSGA-II can perform competitively, among others. From the results, the baseline algorithm in all cases and in comparison to all algorithms yields the worst results. Among the scalarisation methods, EnMOGA and EnMOPS can achieve the first rank in 6 and 7 out of 13 cases and the second rank in 7 and 5 cases in terms of objective function. Also, EnMOES achieved the fifth or worst rank among the scalarisation algorithms. Regarding the Pareto-based algorithms, the table shows that EnNSGAII outperforms EnNSGAIII in 10 out of 13 cases in terms of hyper-volume measure, while it fails in 3 cases. Furthermore, we statistically verify the proposed algorithm’s effectiveness based on the Wilcoxon-signed rank test. Finally, a sensitivity analysis of the parameters is provided. The source code for reproducing the results is available in: https://github.com/SeyedJalaleddinMousavirad/MultiobjectiveJPEGImageCompression.

A sub‐regional compression method for greenhouse images based on CNN image quality assessment

As a major Internet of Things information carrier within the greenhouse, image quality and image file size need to be balanced. To reduce image file size while maintaining image quality, a sub-regional compression (SRC) method is proposed, and its optimal compression quality of the background regions is selected using image quality assessments such as SSIM, BRISQUE, NIQE, and PIQE. In addition, a convolutional neural network-based NIMA model to measure image quality is also being introduced. In the end, the SRC method is compared with JPEG compression default mode and JPEG compression with quality 30 in NIMA score, compression time, and compression efficiency, proving the effectiveness of the method. Practical applications Certain vegetables and fruits, such as cucumbers, tomatoes, etc., in most cases are processed directly into the hands of consumers, so the loss is directly attributable to their growth, especially pests and diseases. Monitoring for the above situation is a great improvement, but the increase in monitoring accuracy brings video/key frame to becoming larger. Therefore, it is better to reduce the file size as well as to ensure clarity in regions of interest, viewing the files faster and detecting the losses by humans or machines as easily as possible. This paper investigates the overall process and innovatively introduces deep learning into image quality assessment to better simulate human perception of images, and the research results of this paper can be applied to different models of surveillance cameras to achieve the same results.

Potential quality pitfalls of digitalized whole slide image of breast pathology in routine practice

AbstractUsing digitalized whole slide images (WSI) in routine histopathology practice is a revolutionary technology. This study aims to assess the clinical impacts of WSI quality and representation of the corresponding glass slides. 40,160 breast WSIs were examined and compared with their corresponding glass slides. The presence, frequency, location, tissue type, and the clinical impacts of missing tissue were assessed. Scanning time, type of the specimens, time to WSIs implementation, and quality control (QC) measures were also considered. The frequency of missing tissue ranged from 2% to 19%. The area size of the missed tissue ranged from 1–70%. In most cases (>75%), the missing tissue area size was <10% and peripherally located. In all cases the missed tissue was fat with or without small entrapped normal breast parenchyma. No missing tissue was identified in WSIs of the core biopsy specimens. QC measures improved images quality and reduced WSI failure rates by seven-fold. A negative linear correlation between the frequency of missing tissue and both the scanning time and the image file size was observed (p < 0.05). None of the WSI with missing tissues resulted in a change in the final diagnosis. Missing tissue on breast WSI is observed but with variable frequency and little diagnostic consequence. Balancing between WSI quality and scanning time/image file size should be considered and pathology laboratories should undertake their own assessments of risk and provide the relevant mitigations with the appropriate level of caution.

Digital Image Compression Using Approximate Addition

This paper analyzes the usefulness of approximate addition for digital image compression. Discrete Cosine Transform (DCT) is an important operation in digital image compression. We used accurate addition and approximate addition individually while calculating the DCT to perform image compression. Accurate addition was performed using the accurate adder and approximate addition was performed using different approximate adders individually. The accurate adder and approximate adders were implemented in an application specific integrated circuit (ASIC)-type design environment using a 32–28 nm complementary metal oxide semiconductor (CMOS) standard cell library and in a field programmable gate array (FPGA)-based design environment using a Xilinx Artix-7 device. Error analysis was performed to calculate the error parameters of various approximate adders by applying one million random input vectors. It is observed that the approximate adders help to better reduce the file size of compressed images than the accurate adder. Simultaneously, the approximate adders enable reductions in design parameters compared to the accurate adder. For an ASIC-type implementation using standard cells, an optimum approximate adder achieved 27.1% reduction in delay, 46.4% reduction in area, and 50.3% reduction in power compared to a high-speed accurate carry look-ahead adder. With respect to an FPGA-based implementation, an optimum approximate adder achieved 8% reduction in delay and 19.7% reduction in power while requiring 47.6% fewer look-up tables (LUTs) and 42.2% fewer flip-flops compared to the native accurate FPGA adder.

Implementasi Algoritma Set Partitioning in Hierarchical Trees (SPIHT) dan Algoritma Huffman Untuk Kompresi File Citra

As technology develops, the process of sending files no longer needs to be done manually. Data or files can be sent electronically via email. The image file size is sometimes very large, where the better the quality of the resulting image, the bigger the pixel size needed to record the image. With a very large image file size, the transfer process may fail, because the media storage space exceeds its limit. The solution to this problem is how the image file can be compressed in order to speed up the transfer and storage of image files. Image compression is done by reducing the size of the image file by reducing the bits in the image file, but not eliminating the information data in it. By compressing, large data will be reduced in size so as to save storage space. In this study, the algorithm used is the Swiss army knife data compression, using this method, the compression results from the value of k have different compression results for each value, and the compression results will be beneficial in sending and moving image files more easily