DOCSLIB.ORG

Color Documents on the Web with Djvu

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Color Documents on the Web with Djvu Color Do cuments on the Web with DjVu Patrick Ha ner, Yann LeCun, Leon Bottou, Paul Howard, Pascal Vincent, Bill Riemers AT&T Labs - Research 100 Schulz Drive, Red Bank, NJ 07701, USA fha ner,yann,leonb,pgh,vincent,b [email protected] Abstract catalogs for e-commerce sites, online publishing, forms pro cessing, and scienti c publication, are in need of an We present a new image compression technique ecient compression technique for color do cuments. cal led \DjVu" that is speci cal ly geared towards the The availability of low-cost, high quality color scan- compression of scanned documents in color at high ners, the recent emergence of high-sp eed pro duction resolution. With DjVu, a magazine page in color at color scanners, and the app earance of ultra high res- 300dpi typical ly occupies between 40KB and 80KB, olution digital cameras op ens the do or to such appli- approximately 5 to 10 times better than JPEG for cations. a similar level of readability. Using a combination of Hidden Markov Model techniques and MDL-driven Standard color image compression algorithms are heursitics, DjVu rst classi es each pixel in the image inadequate for such applications b ecause they pro- as either foreground text, drawings or background duces excessively large les if one wants to preserve pictures, photos, paper texture. The pixel categories the readabilityofthe text. Compressed with JPEG, form a bitonal image which is compressed using a pat- a color image of atypical magazine page scanned at tern matching technique that takes advantage of the 100dpi dots per inch is around 100-200KB, and is similarities between character shapes. A progessive, barely readable. The same page at 300dpi has accept- wavelet-based compression technique, combined with able quality, but o ccupies 300-600 KB. These sizes are a masking algorithm, is then used to compress the impractical for online do cument browsing, even with foreground and background images at lower resolution broadband connections. while minimizing the number of bits spent on the pixels Preserving the readability of the text and the sharp- that are not visible in the foreground and background ness of line art requires high resolution and ecient planes. Encoders, decoders, and real-time, memory ef- co ding of sharp edges typically 300dpi. On the other cient plug-ins for various web browsers are available hand preserving the app earance of continuous-tone for al l the major platforms. images and background pap er textures do es not re- quire as high a resolution typically 100dpi An obvi- 1 Intro duction ous waytotake advantage of this is to segment these With the generalized use of the Internet and the elements into separate layers. The foreground layer declining cost of scanning and storage hardware, do c- would contain the text and line drawings, while the uments are increasingly archived, communicated, and background layer would contain continuous-tone pic- manipulated in digital form rather than in pap er tures and background textures. form. The growing need for instant access to informa- The separation metho d brings another considerable tion makes the computer screen the preferred display advantage. Since the text layer is separated, it can b e medium. stored in a chunk at the b eginning of the image le Compression technology for bitonal black and and deco ded by the viewer as so on as it arrives in the white do cument image archives has a long history client machine. see [9] and references therein. It is the basis of a large and rapidly growing industry with widely ac- Overall, the requirements for an acceptable user ex- cepted standards Group 3, MMR/Group 4, and less p erience are as follows: The text should app ear on p opular and emerging standards JBIG1, JBIG2. the screen after only a few seconds delay. This means The last few years have seen a growing demand for that the text layer must t in 20-40KB assuming a a technology that could handle color do cuments in a 56Kb/sec connection. The pictures, and backgrounds e ective manner. Such applications as online digital would app ear next, improving the image quality as libraries with ancient or historical do cuments, online more bits arrive. The overall size of the le should A pixel in the deco ded image is constructed as follows: be on the order of 50 to 100 KB to keep the over- if the corresp onding pixel in the mask image is 0, the all transmission time and storage requirements within output pixel takes the value of the corresp onding pixel reasonable b ounds. in the appropriately up-sampled background image. If Large images are also problematic during the de- the mask pixel is 1, the pixel color is taken from the compression pro cess. A magazine-size page at 300dpi foreground image. is 3300 pixels high and 2500 pixels wide and o ccupies 25 MB of memory in uncompressed form, more than The mask image is enco ded with a new bi-level im- what the average PC can prop erly handle. A practi- age compression algorithm dubb ed JB2. It is a varia- cal do cument image viewer should therefore keep the tion on AT&T's prop osal to the emerging JBIG2 stan- image in a compressed form in the memory of the ma- dard. The basic idea of JB2 is to lo cate individual chine and only decompress on-demand the pixels that shap es on the page such as characters, and use a are b eing displayed on the screen. shap e clustering algorithm to nd similarities b etween shap es [1, 5]. Shap es that are representativeof each The DjVu do cument image compression tech- cluster or in a cluster by themselves are co ded as in- nique [2] describ ed in this pap er addresses all the dividual bitmaps with a metho d similar to JBIG1. A ab ove mentioned problems. With DjVu, pages given pixel is co ded with arithmetic co ding using pre- scanned at 300dpi in full color can be compressed viously co ded and neighb oring pixels as a context or down to 30 to 80 KB les from 25 MB originals with predictor. Other shap es in a cluster are co ded using excellent quality. This puts the size of high-quality the cluster prototyp e as a context for the arithmetic scanned pages in the same order of magnitude as an co der, thereby greatly reducing the required number average HTML page which are around 50KB on aver- of bits since shap es in a same cluster have many pixels age. DjVu pages are displayed progressively within a in common. In lossy mo de, shap es that are suciently web browser window through a plug-in, which allows similar to the cluster prototyp e may b e substituted by easy panning and zo oming of very large images with- the prototyp e. A another chunk of bits contains a list out generating the fully deco ded 25MB image. This of shap e indices together with the p osition at which is made p ossible by storing partially deco ded images they should b e painted on the page. all of this is co ded in a data structure that typically o ccupies 2MB, from using arithmetic co ding. which the pixels actually displayed on the screen can b e deco ded on the y. For the background and foreground images, DjVu This pap er gives an overview of the DjVu technol- uses a progressive, wavelet-based compression algo- ogy, which is describ ed in more details in [2]. The rithm called IW44. IW44 o ers many key advan- rst two sections explain the general principles used tages over existing continuous-tone images compres- in DjVu compression and decompression. The remain- sion metho ds. First, the wavelet transform can be ing two sections 4 and 5 study the b ehavior of the the p erformed entirely without multiplication op erations, foreground/background segmentation algorithm. The relying exclusively on shifts and adds, thereby greatly last section details unique features that contribute to reducing the computational requirements. Second, the the p erformance of DjVu. internal memory data structure for IW44 images al- lows in-place progressive deco ding of the wavelet co- 2 The DjVu Compression Metho d ecients without copies, and uses an ecient sparse tree representation. Third, the data structure allows The basic idea b ehind DjVu is to separate the text ecient on-the- y rendering of any sub-image at any from the background and pictures and to use dif- prescrib ed resolution, in a time prop ortional to the ferent techniques to compress each of those comp o- number of rendered pixels not image pixels. This nents. Traditional metho ds are either designed to last feature is particularly useful for ecient panning compress natural images with few edges JPEG, or and zo oming through large images. Lastly, a mask- to compress black and white do cument images al- ing technique based on multiscale successive pro jec- most entirely comp osed of sharp edges Group 3, tions [4] is used to avoid sp ending bits to co de areas of MMR/Group 4, and JBIG1. The DjVu technique the background that are covered by foreground char- improves on b oth and combines the b est of b oth ap- acters or drawings. Both JB2 and IW44 rely on a new proaches. A foreground/background separation algo- typ e of adaptive binary arithmetic co der called the rithm generates three images from which the original ZP-co der[3], that squeezes out any remaining redun- image can be reconstructed: the background image, dancy to within a few p ercent of the Shannon limit.
Load more

Recommended publications
  • Exploring the .BMP File Format
    Exploring the .BMP File Format Don Lancaster Synergetics, Box 809, Thatcher, AZ 85552 copyright c2003 as GuruGram #14 http://www.tinaja.com [email protected] (928) 428-4073 The .BMP image standard is used by Windows and elsewhere to represent graphics images in any of several different display and compression options. The .BMP advantages are that each pixel is usually independently available for any alteration or modification. And that repeated use does not normally degrade the image. Because lossy compression is not used. Its main disadvantage is that file sizes are usually horrendous compared to JPEG, fractal, GIF, or other lossy compression schemes. A comparison of popular image standards can be found here. I’ve long been using the .BMP format for my eBay and my other phototography, scanning, and post processing. I firmly believe that… All photography, scanning, and all image post-processing should always be done using .BMP or a similar non-lossy format. Only after all post-processing is complete should JPEG or another compressed distribution format be chosen. Some current examples of my .BMP work now do include the IMAGIMAG.PDF post-processing tutorial, the Bitmap Typewriterthat generates fully anti-aliased small fonts, the Aerial Photo Combiner, and similar utilities and tutorials found on our Fonts & Images, PostScript, and on our Acrobat library pages. A few projects of current interest involving .BMP files include true view camera swings and tilts for a digital camera, distortion correction, dodging & burning, preventing white punchthrough on knockouts, and emphasis vignetting. Mainly applied to uncompressed RGBX 24-bit color .BMP files.
    [Show full text]
  • Free Lossless Image Format
    FREE LOSSLESS IMAGE FORMAT Jon Sneyers and Pieter Wuille [email protected] [email protected] Cloudinary Blockstream ICIP 2016, September 26th DON’T WE HAVE ENOUGH IMAGE FORMATS ALREADY? • JPEG, PNG, GIF, WebP, JPEG 2000, JPEG XR, JPEG-LS, JBIG(2), APNG, MNG, BPG, TIFF, BMP, TGA, PCX, PBM/PGM/PPM, PAM, … • Obligatory XKCD comic: YES, BUT… • There are many kinds of images: photographs, medical images, diagrams, plots, maps, line art, paintings, comics, logos, game graphics, textures, rendered scenes, scanned documents, screenshots, … EVERYTHING SUCKS AT SOMETHING • None of the existing formats works well on all kinds of images. • JPEG / JP2 / JXR is great for photographs, but… • PNG / GIF is great for line art, but… • WebP: basically two totally different formats • Lossy WebP: somewhat better than (moz)JPEG • Lossless WebP: somewhat better than PNG • They are both .webp, but you still have to pick the format GOAL: ONE FORMAT THAT COMPRESSES ALL IMAGES WELL EXPERIMENTAL RESULTS Corpus Lossless formats JPEG* (bit depth) FLIF FLIF* WebP BPG PNG PNG* JP2* JXR JLS 100% 90% interlaced PNGs, we used OptiPNG [21]. For BPG we used [4] 8 1.002 1.000 1.234 1.318 1.480 2.108 1.253 1.676 1.242 1.054 0.302 the options -m 9 -e jctvc; for WebP we used -m 6 -q [4] 16 1.017 1.000 / / 1.414 1.502 1.012 2.011 1.111 / / 100. For the other formats we used default lossless options. [5] 8 1.032 1.000 1.099 1.163 1.429 1.664 1.097 1.248 1.500 1.017 0.302� [6] 8 1.003 1.000 1.040 1.081 1.282 1.441 1.074 1.168 1.225 0.980 0.263 Figure 4 shows the results; see [22] for more details.
    [Show full text]
  • What Resolution Should Your Images Be?
    What Resolution Should Your Images Be? The best way to determine the optimum resolution is to think about the final use of your images. For publication you’ll need the highest resolution, for desktop printing lower, and for web or classroom use, lower still. The following table is a general guide; detailed explanations follow. Use Pixel Size Resolution Preferred Approx. File File Format Size Projected in class About 1024 pixels wide 102 DPI JPEG 300–600 K for a horizontal image; or 768 pixels high for a vertical one Web site About 400–600 pixels 72 DPI JPEG 20–200 K wide for a large image; 100–200 for a thumbnail image Printed in a book Multiply intended print 300 DPI EPS or TIFF 6–10 MB or art magazine size by resolution; e.g. an image to be printed as 6” W x 4” H would be 1800 x 1200 pixels. Printed on a Multiply intended print 200 DPI EPS or TIFF 2-3 MB laserwriter size by resolution; e.g. an image to be printed as 6” W x 4” H would be 1200 x 800 pixels. Digital Camera Photos Digital cameras have a range of preset resolutions which vary from camera to camera. Designation Resolution Max. Image size at Printable size on 300 DPI a color printer 4 Megapixels 2272 x 1704 pixels 7.5” x 5.7” 12” x 9” 3 Megapixels 2048 x 1536 pixels 6.8” x 5” 11” x 8.5” 2 Megapixels 1600 x 1200 pixels 5.3” x 4” 6” x 4” 1 Megapixel 1024 x 768 pixels 3.5” x 2.5” 5” x 3 If you can, you generally want to shoot larger than you need, then sharpen the image and reduce its size in Photoshop.
    [Show full text]
  • JPEG File Interchange Format Version 1.02
    JPEG File Interchange Format Version 1.02 September 1, 1992 Eric Hamilton C-Cube Microsystems 1778 McCarthy Blvd. Milpitas, CA 95035 +1 408 944-6300 Fax: +1 408 944-6314 E-mail: [email protected] JPEG File Interchange Format Version 1.02 Why a File Interchange Format JPEG File Interchange Format is a minimal file format which enables JPEG bitstreams to be exchanged between a wide variety of platforms and applications. This minimal format does not include any of the advanced features found in the TIFF JPEG specification or any application specific file format. Nor should it, for the only purpose of this simplified format is to allow the exchange of JPEG compressed images. JPEG File Interchange Format features • Uses JPEG compression • Uses JPEG interchange format compressed image representation • PC or Mac or Unix workstation compatible • Standard color space: one or three components. For three components, YCbCr (CCIR 601-256 levels) • APP0 marker used to specify Units, X pixel density, Y pixel density, thumbnail • APP0 marker also used to specify JFIF extensions • APP0 marker also used to specify application-specific information JPEG Compression Although any JPEG process is supported by the syntax of the JPEG File Interchange Format (JFIF) it is strongly recommended that the JPEG baseline process be used for the purposes of file interchange. This ensures maximum compatibility with all applications supporting JPEG. JFIF conforms to the JPEG Draft International Standard (ISO DIS 10918-1). The JPEG File Interchange Format is entirely compatible with the standard JPEG interchange format; the only additional requirement is the mandatory presence of the APP0 marker right after the SOI marker.
    [Show full text]
  • JPEG-Resistant Adversarial Images
    JPEG-resistant Adversarial Images Richard Shin Dawn Song Computer Science Division Computer Science Division University of California, Berkeley University of California, Berkeley [email protected] [email protected] Abstract Several papers have explored the use of JPEG compression as a defense against adversarial images [3, 2, 5]. In this work, we show that we can generate adversarial images which survive JPEG compression, by including a differentiable approxima- tion to JPEG in the target model. By ensembling multiple target models employing varying levels of compression, we generate adversarial images with up to 691× greater success rate than the baseline method on a model using JPEG as defense. 1 Introduction Image classification models has been a highly-studied domain for adversarial examples. While adversarial images generated against these models are nevertheless very close to the original image according to L1 or L2 norm, unnatural high-frequency components or random-looking dot patterns are sometimes noticeable. As such, some proposed defenses to adversarial examples involve an initial input transformation step which attempts to remove such unnatural-looking additions. In particular, several papers [3, 2, 5] have proposed and evaluated JPEG compression as a potential method for preventing adversarial images. To summarize, they compress and then decompress an image using JPEG before providing it to the image classification model. Since JPEG is a lossy image compression method designed to preferentially preserve details important to the human visual system, the hope is that JPEG compression will keep the aspects of the image important for classification, but discard any adversarial perturbations. The method is appealingly simple and, according to the previous work, can reduce the attack success rate of adversarial examples.
    [Show full text]
  • Using Graphics on the Web Keep Graphics Small Most Users Have Little Patience for Slow Loading Pages, and Will Rapidly Abandon a Slow Site
    Using graphics on the web Keep graphics small Most users have little patience for slow loading pages, and will rapidly abandon a slow site. Remember that many of your audience will be using a dial up modem, and try to keep graphics file sizes under 40K. Be willing to sacrifice some image quality. Provide thumbnails for large graphics If you feel your site absolutely requires large graphics, to illustrate an experimental set-up for example, provide an in-line reduced thumbnail of the graphic on your main page, which will link to the larger graphic and a separate page. This way the user has a choice and can decide if she or he wants to view it then, at another time or at all. It's also a kindness to indicate the file size, so the user can estimate how long the display will take to load. Use the same motifs throughout your site Recycle graphics (icons, navigation bars), as they are cached locally once downloaded. Standardizing on a set of graphic arrows, bullets, logos etc. also provides your site with a characteristic "look and feel" that your audience can identify with. Provide alternative text for non-graphics browsers Use the [alt="" ] command to provide a text description for those with text-only browsers or those who may have graphics loading disabled on their browsers. This also follows guidelines for Americans with Disabilities Act (ADA) Compliance. Use the appropriate file format Graphics Interchange format - GIF - was originally developed for the rapid transfer of images. GIF compression works by encoding the identical repeating elements within any given graphic, storing the code in an attached table and using the data to display the image when called upon by the web browser.
    [Show full text]
  • Understanding Image Formats and When to Use Them
    Understanding Image Formats And When to Use Them Are you familiar with the extensions after your images? There are so many image formats that it’s so easy to get confused! File extensions like .jpeg, .bmp, .gif, and more can be seen after an image’s file name. Most of us disregard it, thinking there is no significance regarding these image formats. These are all different and not cross‐ compatible. These image formats have their own pros and cons. They were created for specific, yet different purposes. What’s the difference, and when is each format appropriate to use? Every graphic you see online is an image file. Most everything you see printed on paper, plastic or a t‐shirt came from an image file. These files come in a variety of formats, and each is optimized for a specific use. Using the right type for the right job means your design will come out picture perfect and just how you intended. The wrong format could mean a bad print or a poor web image, a giant download or a missing graphic in an email Most image files fit into one of two general categories—raster files and vector files—and each category has its own specific uses. This breakdown isn’t perfect. For example, certain formats can actually contain elements of both types. But this is a good place to start when thinking about which format to use for your projects. Raster Images Raster images are made up of a set grid of dots called pixels where each pixel is assigned a color.
    [Show full text]
  • JPEG Standard
    JPEG standard JPEG: “Joint Photographic Experts Group” Formally: ISO/IEC JTC1/SC29/WG10 Working Group 10 International (JBIG, JPEG) Organization for Subcommittee 29 Standardization Joint ISO/IEC (Coding of Audio, Technical International Picture, Multimedia Committee Electrotechnical and Hypermedia (Information Commission Information) Technology) Joint effort with CCITT (International Telephone and Telegraph Consultative Committee, now ITU-T) Study Group VIII Work commenced in 1986 International standard ISO/IEC 10918-1 and CCITT Rec. T.81 in 1992 Widely used for image exchange, WWW, and digital photography Motion-JPEG is de facto standard for digital video editing Bernd Girod: EE398A Image and Video Compression JPEG standard no. 1 JPEG: image partition into 8x8 block 8x8 blocks Padding of right boundary blocks Padding of lower boundary blocks Bernd Girod: EE398A Image and Video Compression JPEG standard no. 2 Baseline JPEG coder DC Huffman tables dc quantization indices Differential coding VLC Level 8x8 Uniform Compressed scalar image data input offset DCT quantization image Zig-zag Run-level scan coding VLC Compressed image data ac quantization indices Quantization tables AC Huffman tables Bernd Girod: EE398A Image and Video Compression JPEG standard no. 3 Recommended quantization tables Based on psychovisual threshold experiments Luminance Chrominance, subsampled 2:1 16 11 10 16 24 40 51 61 17 18 24 47 99 99 99 99 12 12 14 19 26 58 60 55 18 21 26 66 99 99 99 99 14 13 16 24 40 57 69 56 24 26 56 99 99 99 99 99 14 17 22 29 51 87 80 62 47 66 99 99 99 99 99 99 18 22 37 56 68 109 103 77 99 99 99 99 99 99 99 99 24 36 55 64 81 104 113 92 99 99 99 99 99 99 99 99 49 64 78 87 103 121 120 101 99 99 99 99 99 99 99 99 72 92 95 98 112 100 103 99 99 99 99 99 99 99 99 99 [JPEG Standard, Annex K] Bernd Girod: EE398A Image and Video Compression JPEG standard no.
    [Show full text]
  • On the Efficiency of the Wavelet Based Compression Techniques
    IS&T©s 2001 PICS Conference Proceedings On the Efficiency of the Wavelet Based Compression Techniques £ ? ¾ B. Smolka M. Szlezak K.N. Plataniotis A. N. Venetsanopoulos ½ Silesian University of Technology, Department of Automatic Control, Akademicka 16 Str, 44-101 Gliwice, Poland, ¾ Edward S. Rogers Sr. Department of Electrical and Computer Engineering University of Toronto. 10 King’s College Road, Toronto, Canada, ? Abstract structured correlated errors typical to JPEG and wavelet In this paper we address the problem of the correlation be- based compression methods (Fig. 1, Tab. 1, Fig. 4). To as- tween the objective quality measures, like mean squared sess the efficiency of the three losssy compression methods error or signal to noise ratio and the subjective quality per- a joint subjective and objective study was undertaken. ceived by human viewers. Using both the objective and For the experiments a set of 3 gray-scale and 3 color subjective quality measures we aimed to compare the effi- test images was used (Fig. 2). The images were com- ciency of the wavelet based lossy codecs DJVU and LWF pressed at nearly the same compression ratios and the stan- with the DCT based standard JPEG compression method. dard quality measures like RMS, MSE, SNR and PSNR For the experiments a set of 3 gray-scale and 3 color were calculated for all images at different compression lev- test images was used. The images were encoded at the els. same compression levels and standard objective quality mea- For the visual assessment of the quality of the com- sures were calculated for all images.
    [Show full text]
  • Arxiv:2101.00973V1 [Eess.IV] 30 Dec 2020 Ternet Users Mainly Communicated in the Form of Plain Text, Reduce the Data Size [8]
    TOWARDS ROBUST DATA HIDING AGAINST (JPEG) COMPRESSION: A PSEUDO-DIFFERENTIABLE DEEP LEARNING APPROACH Chaoning Zhang∗, Adil Karjauv∗, Philipp Benz∗, In So Kweon [email protected], [email protected], [email protected], [email protected] ABSTRACT in the compressed form, such as JPEG or MPEG. This kind Data hiding is one widely used approach for protecting au- of lossy operation can easily destroy the hidden information thentication and ownership. Most multimedia content like for most existing data hiding approaches [1, 2]. Thus, robust images and videos are transmitted or saved in the compressed data hiding in multimedia that can resist non-malicious attack, form. This kind of lossy compression, such as JPEG, can de- lossy compression, has become a hot research direction. stroy the hidden data, which raises the need of robust data Recently, deep learning has also shown large success in hiding. It is still an open challenge to achieve the goal of data hiding data in images [3, 4, 5, 6, 7]. For improving the robust- hiding that can be against these compressions. Recently, deep ness against JPEG compression, the SOTA approaches need learning has shown large success in data hiding, while non- to include the JPEG compression in the training process [6, 7]. differentiability of JPEG makes it challenging to train a deep The challenge of this task is that JPEG compression is non- pipeline for improving robustness against lossy compression. differentiable. Prior works have either roughly simulated the The existing SOTA approaches replace the non-differentiable JPEG compression [6] or carefully designed the differentiable parts with differentiable modules that perform similar oper- function to mimic every step of the JPEG compression [7].
    [Show full text]
  • Widetek® Wide Format MFP Solutions 17
    ® The WideTEK 36CL-MF scanner forms the basis of all of the MF solutions and is the fastest, most productive wide format MFP so- lution on the market, running at 10 inches per second at 200 dpi in full color, at the lowest possible price. At the full width of 36“ and 600 dpi resolution, the scanner still runs at 1.7 inches per second. ® WideTEK 36CL-MF is the best choice to build a powerful and high quality MFP with either an integrated printer series specifi c stand, a high stand or a standalone stand. All MFP solutions come with a built in closed loop color calibration function producing the best possible copies on your selected printer and paper combination. Scanner Optics CIS camera, scans in color, grayscale, B&W Resolution 1200 x 1200 dpi scanner resolution 9600 x 9600 dpi interpolated (optional) Document Size 965 mm (38 inch) width, nearly unlimited length Scans 915 mm (36 inch) widths Scanning Speed 200 dpi - 15 m/min (10 inch/s) in color Face up scanning with on the fl y rotation and modifi cation 600 dpi - 8 m/min (5 inch/s) in grayscale of images without rescanning. Automated crop & deskew. Color Depth 48 bit color, 16 bit grayscale Built in closed loop color calibration function for best possible copies Scan output 24 bit color, 8 bit grayscale, bitonal, enhanced half- tone LED lamps, no warm up, IR/UV free Output Formats Multipage PDF (PDF/A) and TIFF, JPEG, JPEG 2000, Large 21“ full HD color touchscreen for simple operation in PNM, PNG, BMP, TIFF (Raw, G3, G4, LZW, JPEG), optional bundles AutoCAD DWF, JBIG, DjVu, DICOM, PCX, Postscript, EPS, Raw data Scan2USB, FTP, SMB and Network.
    [Show full text]
  • Optimization of Image Compression for Scanned Document's Storage
    ISSN : 0976-8491 (Online) | ISSN : 2229-4333 (Print) IJCST VOL . 4, Iss UE 1, JAN - MAR C H 2013 Optimization of Image Compression for Scanned Document’s Storage and Transfer Madhu Ronda S Soft Engineer, K L University, Green fields, Vaddeswaram, Guntur, AP, India Abstract coding, and lossy compression for bitonal (monochrome) images. Today highly efficient file storage rests on quality controlled This allows for high-quality, readable images to be stored in a scanner image data technology. Equivalently necessary and faster minimum of space, so that they can be made available on the web. file transfers depend on greater lossy but higher compression DjVu pages are highly compressed bitmaps (raster images)[20]. technology. A turn around in time is necessitated by reconsidering DjVu has been promoted as an alternative to PDF, promising parameters of data storage and transfer regarding both quality smaller files than PDF for most scanned documents. The DjVu and quantity of corresponding image data used. This situation is developers report that color magazine pages compress to 40–70 actuated by improvised and patented advanced image compression kB, black and white technical papers compress to 15–40 kB, and algorithms that have potential to regulate commercial market. ancient manuscripts compress to around 100 kB; a satisfactory At the same time free and rapid distribution of widely available JPEG image typically requires 500 kB. Like PDF, DjVu can image data on internet made much of operating software reach contain an OCR text layer, making it easy to perform copy and open source platform. In summary, application compression of paste and text search operations.
    [Show full text]