Compression Artifacts Reduction by a Deep Convolutional Network

Total Page:16

File Type:pdf, Size:1020Kb

Compression Artifacts Reduction by a Deep Convolutional Network Compression Artifacts Reduction by a Deep Convolutional Network Chao Dong, Yubin Deng, Chen Change Loy, and Xiaoou Tang Department of Information Engineering, The Chinese University of Hong Kong {dc012,dy015,ccloy,xtang}@ie.cuhk.edu.com Abstract Lossy compression introduces complex compression ar- tifacts, particularly the blocking artifacts, ringing effects and blurring. Existing algorithms either focus on removing blocking artifacts and produce blurred output, or restores sharpened images that are accompanied with ringing ef- fects. Inspired by the deep convolutional networks (DCN) on super-resolution [5], we formulate a compact and effi- (a) Left: the JPEG-compressed image, where we could see blocking arti- cient network for seamless attenuation of different compres- facts, ringing effects and blurring on the eyes, abrupt intensity changes on sion artifacts. We also demonstrate that a deeper model can the face. Right: the restored image by the proposed deep model (AR-CNN), be effectively trained with the features learned in a shal- where we remove these compression artifacts and produce sharp details. low network. Following a similar “easy to hard” idea, we systematically investigate several practical transfer settings and show the effectiveness of transfer learning in low-level vision problems. Our method shows superior performance than the state-of-the-arts both on the benchmark datasets and the real-world use case (i.e. Twitter). 1. Introduction (b) Left: the Twitter-compressed image, which is first re-scaled to a small Lossy compression (e.g. JPEG, WebP and HEVC-MSP) image and then compressed on the server-side. Right: the restored image by the proposed deep model (AR-CNN) is one class of data encoding methods that uses inexact Figure 1. Example compressed images and our restoration results approximations for representing the encoded content. In on the JPEG compression scheme and the real use case – Twitter. this age of information explosion, lossy compression is indispensable and inevitable for companies (e.g. Twitter save storage space. This step will cause a complex com- and Facebook) to save bandwidth and storage space. How- bination of different artifacts, as depicted in Figure 1(a). ever, compression in its nature will introduce undesired Blocking artifacts arise when each block is encoded with- complex artifacts, which will severely reduce the user ex- out considering the correlation with the adjacent blocks, re- perience (e.g. Figure 1). All these artifacts not only de- sulting in discontinuities at the 8×8 borders. Ringing ef- crease perceptual visual quality, but also adversely affect fects along the edges occur due to the coarse quantization various low-level image processing routines that take com- of the high-frequency components (also known as Gibbs pressed images as input, e.g. contrast enhancement [16], phenomenon [9]). Blurring happens due to the loss of super-resolution [30, 5], and edge detection [3]. However, high-frequency components. To cope with the various com- under such a huge demand, effective compression artifacts pression artifacts, different approaches have been proposed, reduction remains an open problem. some of which can only deal with certain types of artifacts. We take JPEG compression as an example to explain For instance, deblocking oriented approaches [18, 21, 26] compression artifacts. JPEG compression scheme divides perform filtering along the block boundaries to reduce only an image into 8×8 pixel blocks and applies block discrete blocking artifacts. Liew et al.[17] and Foi et al.[6] cosine transformation (DCT) on each block individually. use thresholding by wavelet transform and Shape-Adaptive Quantization is then applied on the DCT coefficients to DCT transform, respectively. These approaches are good at 576 removing blocking and ringing artifacts, but tend to produce The contributions of this study are two-fold: (1) We blurred output. Jung et al.[13] propose restoration method formulate a new deep convolutional network for efficient based on sparse representation. They produce sharpened reduction of various compression artifacts. Extensive ex- images but accompanied with noisy edges and unnatural periments, including that on real use cases, demonstrate smooth regions. the effectiveness of our method over state-of-the-art meth- To date, deep learning has shown impressive results on ods [6, 12] both perceptually and quantitatively. (2) We ver- both high-level and low-level vision problems . In particu- ify that reusing the features in shallow networks is helpful lar, the SRCNN proposed by Dong et al.[5] shows the great in learning a deeper model for compression artifact reduc- potential of an end-to-end DCN in image super-resolution. tion. Under the same intuitive idea – easy to hard, we reveal The study also points out that conventional sparse-coding- a number of interesting and practical transfer settings. Our based image restoration model can be equally seen as a deep study is the first attempt to show the effectiveness of feature model. However, we find that the three-layer network is not transfer in a low-level vision problem. well suited in restoring the compressed images, especially in dealing with blocking artifacts and handling smooth re- 2. Related work gions. As various artifacts are coupled together, features ex- tracted by the first layer is noisy, causing undesirable noisy Existing algorithms can be classified into deblocking ori- patterns in reconstruction. ented and restoration oriented methods. The deblocking oriented methods focus on removing blocking and ring- To eliminate the undesired artifacts, we improve the SR- ing artifacts. In the spatial domain, different kinds of fil- CNN by embedding one or more “feature enhancement” ters [18, 21, 26] have been proposed to adaptively deal with layers after the first layer to clean the noisy features. Experi- blocking artifacts in specific regions (e.g., edge, texture, ments show that the improved model, namely “Artifacts Re- and smooth regions). In the frequency domain, Liew et duction Convolutional Neural Networks (AR-CNN)”, is ex- al.[17] utilize wavelet transform and derive thresholds at ceptionally effective in suppressing blocking artifacts while different wavelet scales for denoising. The most success- retaining edge patterns and sharp details (see Figure 1). ful deblocking oriented method is perhaps the Pointwise However, we are met with training difficulties in training Shape-Adaptive DCT (SA-DCT) [6], which is widely ac- a deeper DCN. “Deeper is better” is widely observed in knowledged as the state-of-the-art approach [12, 16]. How- high-level vision problems, but not in low-level vision tasks. ever, as most deblocking oriented methods, SA-DCT could Specifically, “deeper is not better” has been pointed out in not reproduce sharp edges, and tend to overly smooth tex- super-resolution [4], where training a five-layer network be- ture regions. The restoration oriented methods regard the comes a bottleneck. The difficulty of training is partially compression operation as distortion and propose restoration due to the sub-optimal initialization settings. algorithms. They include projection on convex sets based The aforementioned difficulty motivates us to investigate method (POCS) [32], solving an MAP problem (FoE) [25], a better way to train a deeper model for low-level vision sparse-coding-based method [13] and the Regression Tree problems. We find that this can be effectively solved by Fields based method (RTF) [12], which is the new state-of- transferring the features learned in a shallow network to the art method. The RTF takes the results of SA-DCT [6]as a deeper one and fine-tuning simultaneously1. This strat- bases and produces globally consistent image reconstruc- egy has also been proven successful in learning a deeper tions with a regression tree field model. It could also be CNN for image classification [24]. Following a similar gen- optimized for any differentiable loss functions (e.g. SSIM), eral intuitive idea, easy to hard, we discover other interest- but often at the cost of other evaluation metrics. ing transfer settings in this low-level vision task: (1) We Super-Resolution Convolutional Neural Network (SR- transfer the features learned in a high-quality compression CNN) [5] is closely related to our work. In the study, in- model (easier) to a low-quality one (harder), and find that dependent steps in the sparse-coding-based method are for- it converges faster than random initialization. (2) In the mulated as different convolutional layers and optimized in real use case, companies tend to apply different compres- a unified network. It shows the potential of deep model in sion strategies (including re-scaling) according to their pur- low-level vision problems like super-resolution. However, poses (e.g. Figure 1(b)). We transfer the features learned the model of compression is different from super-resolution in a standard compression model (easier) to a real use case in that it consists of different kinds of artifacts. Designing (harder), and find that it performs better than learning from a deep model for compression restoration requires a deep scratch. understanding into the different artifacts. We show that di- 1Generally, the transfer learning method will train a base network first, rectly applying the SRCNN architecture for compression and copy the learned parameters or features of several layers to the corre- restoration will result in undesired noisy patterns in the re- sponding layers of a target network. These transferred layers can be left frozen or fine-tuned to the target dataset. The remaining layers are ran- constructed image. domly initialized and trained to the target task. Transfer learning in deep neural networks becomes pop- 577 “noisy” feature maps “cleaner” feature maps “restored” feature maps Compressed image Reconstructed image (Input) (Output) Feature extraction Feature enhancement Mapping Reconstruction Figure 2. The framework of the Artifacts Reduction Convolutional Neural Network (AR-CNN). The network consists of four convolutional layers, each of which is responsible for a specific operation.
Recommended publications
  • A Comprehensive Benchmark for Single Image Compression Artifact Reduction
    IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 29, 2020 7845 A Comprehensive Benchmark for Single Image Compression Artifact Reduction Jiaying Liu , Senior Member, IEEE, Dong Liu , Senior Member, IEEE, Wenhan Yang , Member, IEEE, Sifeng Xia , Student Member, IEEE, Xiaoshuai Zhang , and Yuanying Dai Abstract— We present a comprehensive study and evaluation storage processes to save bandwidth and resources. Based on of existing single image compression artifact removal algorithms human visual properties, the codecs make use of redundan- using a new 4K resolution benchmark. This benchmark is called cies in spatial, temporal, and transform domains to provide the Large-Scale Ideal Ultra high-definition 4K (LIU4K), and it compact approximations of encoded content. They effectively includes including diversified foreground objects and background reduce the bit-rate cost but inevitably lead to unsatisfactory scenes with rich structures. Compression artifact removal, as a visual artifacts, e.g. blockiness, ringing, and banding. These common post-processing technique, aims at alleviating undesir- able artifacts, such as blockiness, ringing, and banding caused artifacts are derived from the loss of high-frequency details by quantization and approximation in the compression process. during the quantization process and the discontinuities caused In this work, a systematic listing of the reviewed methods is by block-wise batch processing. These artifacts not only presented based on their basic models (handcrafted models and degrade user visual experience, but they are also detrimental deep networks). The main contributions and novelties of these for successive image processing and computer vision tasks. methods are highlighted, and the main development directions In our work, we focus on the degradation of compressed are summarized, including architectures, multi-domain sources, images.
    [Show full text]
  • Learning a Virtual Codec Based on Deep Convolutional Neural
    JOURNAL OF LATEX CLASS FILES 1 Learning a Virtual Codec Based on Deep Convolutional Neural Network to Compress Image Lijun Zhao, Huihui Bai, Member, IEEE, Anhong Wang, Member, IEEE, and Yao Zhao, Senior Member, IEEE Abstract—Although deep convolutional neural network has parameters are always assigned to the codec in order to been proved to efficiently eliminate coding artifacts caused by achieve low bit-rate coding leading to serious blurring and the coarse quantization of traditional codec, it’s difficult to ringing artifacts [4–6], when the transmission band-width is train any neural network in front of the encoder for gradient’s back-propagation. In this paper, we propose an end-to-end very limited. In order to alleviate the problem of Internet image compression framework based on convolutional neural transmission congestion [7], advanced coding techniques, network to resolve the problem of non-differentiability of the such as de-blocking, and post-processing [8], are still the hot quantization function in the standard codec. First, the feature and open issues to be researched. description neural network is used to get a valid description in The post-processing technique for compressed image can the low-dimension space with respect to the ground-truth image so that the amount of image data is greatly reduced for storage be explicitly embedded into the codec to improve the coding or transmission. After image’s valid description, standard efficiency and reduce the artifacts caused by the coarse image codec such as JPEG is leveraged to further compress quantization. For instance, adaptive de-blocking filtering is image, which leads to image’s great distortion and compression designed as a loop filter and integrated into H.264/MPEG-4 artifacts, especially blocking artifacts, detail missing, blurring, AVC video coding standard [9], which does not require an and ringing artifacts.
    [Show full text]
  • New Image Compression Artifact Measure Using Wavelets
    New image compression artifact measure using wavelets Yung-Kai Lai and C.-C. Jay Kuo Integrated Media Systems Center Department of Electrical Engineering-Systems University of Southern California Los Angeles, CA 90089-256 4 Jin Li Sharp Labs. of America 5750 NW Paci c Rim Blvd., Camas, WA 98607 ABSTRACT Traditional ob jective metrics for the quality measure of co ded images such as the mean squared error (MSE) and the p eak signal-to-noise ratio (PSNR) do not correlate with the sub jectivehuman visual exp erience well, since they do not takehuman p erception into account. Quanti cation of artifacts resulted from lossy image compression techniques is studied based on a human visual system (HVS) mo del and the time-space lo calization prop ertyofthe wavelet transform is exploited to simulate HVS in this research. As a result of our research, a new image quality measure by using the wavelet basis function is prop osed. This new metric works for a wide variety of compression artifacts. Exp erimental results are given to demonstrate that it is more consistent with human sub jective ranking. KEYWORDS: image quality assessment, compression artifact measure, visual delity criterion, human visual system (HVS), wavelets. 1 INTRODUCTION The ob jective of lossy image compression is to store image data eciently by reducing the redundancy of image content and discarding unimp ortant information while keeping the quality of the image acceptable. Thus, the tradeo of lossy image compression is the numb er of bits required to represent an image and the quality of the compressed image.
    [Show full text]
  • ITC Confplanner DVD Pages Itcconfplanner
    Comparative Analysis of H.264 and Motion- JPEG2000 Compression for Video Telemetry Item Type text; Proceedings Authors Hallamasek, Kurt; Hallamasek, Karen; Schwagler, Brad; Oxley, Les Publisher International Foundation for Telemetering Journal International Telemetering Conference Proceedings Rights Copyright © held by the author; distribution rights International Foundation for Telemetering Download date 25/09/2021 09:57:28 Link to Item http://hdl.handle.net/10150/581732 COMPARATIVE ANALYSIS OF H.264 AND MOTION-JPEG2000 COMPRESSION FOR VIDEO TELEMETRY Kurt Hallamasek, Karen Hallamasek, Brad Schwagler, Les Oxley [email protected] Ampex Data Systems Corporation Redwood City, CA USA ABSTRACT The H.264/AVC standard, popular in commercial video recording and distribution, has also been widely adopted for high-definition video compression in Intelligence, Surveillance and Reconnaissance and for Flight Test applications. H.264/AVC is the most modern and bandwidth-efficient compression algorithm specified for video recording in the Digital Recording IRIG Standard 106-11, Chapter 10. This bandwidth efficiency is largely derived from the inter-frame compression component of the standard. Motion JPEG-2000 compression is often considered for cockpit display recording, due to the concern that details in the symbols and graphics suffer excessively from artifacts of inter-frame compression and that critical information might be lost. In this paper, we report on a quantitative comparison of H.264/AVC and Motion JPEG-2000 encoding for HD video telemetry. Actual encoder implementations in video recorder products are used for the comparison. INTRODUCTION The phenomenal advances in video compression over the last two decades have made it possible to compress the bit rate of a video stream of imagery acquired at 24-bits per pixel (8-bits for each of the red, green and blue components) with a rate of a fraction of a bit per pixel.
    [Show full text]
  • Life Science Journal 2013; 10 (2) [email protected] 102 P
    Life Science Journal 2013; 10 (2) http://www.lifesciencesite.com Performance And Analysis Of Compression Artifacts Reduction For Mpeq-2 Moving Pictures Using Tv Regularization Method M.Anto bennet 1, I. Jacob Raglend2 1Department of ECE, Nandha Engineering College, Erode- 638052, India 2Noorul Islam University, TamilNadu, India [email protected] Abstract: Novel approach method for the reduction of compression artifact for MPEG–2 moving pictures is proposed. Total Variation (TV) regularization method, and obtain a texture component in which blocky noise and mosquito noise are decomposed. These artifacts are removed by using selective filters controlled by the edge information from the structure component and the motion vectors. Most discrete cosine transforms (DCT) based video coding suffers from blocking artifacts where boundaries of (8x8) DCT blocks become visible on decoded images. The blocking artifacts become more prominent as the bit rate is lowered. Due to processing and distortions in transmission, the final display of visual data may contain artifacts. A post-processing algorithm is proposed to reduce the blocking artifacts of MPEG decompressed images. The reconstructed images from MPEG compression produce noticeable image degradation near the block boundaries, in particular for highly compressed images, because each block is transformed and quantized independently. The goal is to improve the visual quality, so perceptual blur and ringing metrics are used in addition to PSNR evaluation and the value will be approx. 43%.The experimental results show much better performances for removing compression artifacts compared with the conventional method. [M.Anto bennet, I. Jacob Raglend. Performance And Analysis Of Compression Artifacts Reduction For Mpeq-2 Moving Pictures Using Tv Regularization Method.
    [Show full text]
  • Image Compression Using Anti-Forensics Method
    IMAGE COMPRESSION USING ANTI-FORENSICS METHOD M.S.Sreelakshmi1 and D. Venkataraman1 1Department of Computer Science and Engineering, Amrita Vishwa Vidyapeetham, Coimbatore, India [email protected] [email protected] ABSTRACT A large number of image forensics methods are available which are capable of identifying image tampering. But these techniques are not capable of addressing the anti-forensics method which is able to hide the trace of image tampering. In this paper anti-forensics method for digital image compression has been proposed. This anti-forensics method is capable of removing the traces of image compression. Additionally, technique is also able to remove the traces of blocking artifact that are left by image compression algorithms that divide an image into segments during compression process. This method is targeted to remove the compression fingerprints of JPEG compression. Keywords Forensics, JPEG compression, anti-forensics, blocking artifacts. 1. INTRODUCTION Due to wide availability of powerful graphic editing software image forgeries can be done very easily. As a result a number of forensics methods have been developed for detecting digital image forgeries even when they are visually convincing. In order to improve the existing forensics method anti-forensics methods have to be developed and studies, so that the loopholes in the existing forensics methods can be identified and hence forensics methods can be improved. By doing so, researchers can be made aware of which forensics techniques are capable of being deceived, thus preventing altered images from being represented as authentic and allowing forensics examiners to establish a degree of confidence in their findings. 2. OVERVIEW OF PROPOSED METHOD When a digital image undergoes JPEG compression it’s first divided into series of 8x8 pixel blocks.
    [Show full text]
  • Differentiable GIF Encoding Framework
    GIFnets: Differentiable GIF Encoding Framework Innfarn Yoo, Xiyang Luo, Yilin Wang, Feng Yang, and Peyman Milanfar Google Research - Mountain View, California [innfarn, xyluo, yilin, fengyang, milanfar]@google.com Abstract Graphics Interchange Format (GIF) is a widely used im- age file format. Due to the limited number of palette col- ors, GIF encoding often introduces color banding artifacts. Traditionally, dithering is applied to reduce color banding, but introducing dotted-pattern artifacts. To reduce artifacts and provide a better and more efficient GIF encoding, we introduce a differentiable GIF encoding pipeline, which in- cludes three novel neural networks: PaletteNet, DitherNet, and BandingNet. Each of these three networks provides an (a) Original (b) Palette important functionality within the GIF encoding pipeline. PaletteNet predicts a near-optimal color palette given an input image. DitherNet manipulates the input image to re- duce color banding artifacts and provides an alternative to traditional dithering. Finally, BandingNet is designed to detect color banding, and provides a new perceptual loss specifically for GIF images. As far as we know, this is the first fully differentiable GIF encoding pipeline based on deep neural networks and compatible with existing GIF de- coders. User study shows that our algorithm is better than Floyd-Steinberg based GIF encoding. (c) Floyd-Steinberg (d) Our Method Figure 1: Comparison of our method against GIF encod- 1. Introduction ing with no dithering and Floyd-Steinberg dithering. Com- pared to GIF without dithering (b) and Floyd-Steinberg (c), GIF is a widely used image file format. At its core, GIF our method (d) shows less banding artifacts as well as less represents an image by applying color quantization.
    [Show full text]
  • Arxiv:1803.04680V4 [Cs.CV] 16 Mar 2018 1
    Multi-Frame Quality Enhancement for Compressed Video Ren Yang, Mai Xu,∗ Zulin Wang and Tianyi Li School of Electronic and Information Engineering, Beihang University, Beijing, China fyangren, maixu, wzulin, [email protected] HEVC Our MFQE approach PQF Abstract PSNR (dB) PSNR 81 85 90 95 100 105 Frames The past few years have witnessed great success in ap- Compressed frame 93 Compressed frame 96 Compressed frame 97 plying deep learning to enhance the quality of compressed image/video. The existing approaches mainly focus on en- hancing the quality of a single frame, ignoring the similar- ity between consecutive frames. In this paper, we investi- gate that heavy quality fluctuation exists across compressed MF-CNN of our MFQE approach video frames, and thus low quality frames can be enhanced DS-CNN [42] using the neighboring high quality frames, seen as Multi- Frame Quality Enhancement (MFQE). Accordingly, this pa- per proposes an MFQE approach for compressed video, as a first attempt in this direction. In our approach, we Enhanced frame 96 Enhanced frame 96 Raw frame 96 firstly develop a Support Vector Machine (SVM) based de- Figure 1. Example for quality fluctuation (top) and quality enhancement tector to locate Peak Quality Frames (PQFs) in compressed performance (bottom). video. Then, a novel Multi-Frame Convolutional Neural Recently, there has been increasing interest in enhanc- Network (MF-CNN) is designed to enhance the quality of ing the visual quality of compressed image/video [27, 10, compressed video, in which the non-PQF and its nearest 18, 36, 6, 9, 38, 12, 24, 24, 42].
    [Show full text]
  • Gifnets: Differentiable GIF Encoding Framework
    GIFnets: Differentiable GIF Encoding Framework Innfarn Yoo, Xiyang Luo, Yilin Wang, Feng Yang, and Peyman Milanfar Google Research - Mountain View, California [innfarn, xyluo, yilin, fengyang, milanfar]@google.com Abstract Graphics Interchange Format (GIF) is a widely used im- age file format. Due to the limited number of palette col- ors, GIF encoding often introduces color banding artifacts. Traditionally, dithering is applied to reduce color banding, but introducing dotted-pattern artifacts. To reduce artifacts and provide a better and more efficient GIF encoding, we introduce a differentiable GIF encoding pipeline, which in- cludes three novel neural networks: PaletteNet, DitherNet, and BandingNet. Each of these three networks provides an (a) Original (b) Palette important functionality within the GIF encoding pipeline. PaletteNet predicts a near-optimal color palette given an input image. DitherNet manipulates the input image to re- duce color banding artifacts and provides an alternative to traditional dithering. Finally, BandingNet is designed to detect color banding, and provides a new perceptual loss specifically for GIF images. As far as we know, this is the first fully differentiable GIF encoding pipeline based on deep neural networks and compatible with existing GIF de- coders. User study shows that our algorithm is better than Floyd-Steinberg based GIF encoding. (c) Floyd-Steinberg (d) Our Method Figure 1: Comparison of our method against GIF encod- 1. Introduction ing with no dithering and Floyd-Steinberg dithering. Com- pared to GIF without dithering (b) and Floyd-Steinberg (c), GIF is a widely used image file format. At its core, GIF our method (d) shows less banding artifacts as well as less represents an image by applying color quantization.
    [Show full text]
  • Review of Artifacts in JPEG Compression and Reduction
    ISSN: 2278 – 909X International Journal of Advanced Research in Electronics and Communication Engineering (IJARECE) Volume 6, Issue 3, March - 2017 Review of Artifacts In JPEG Compression And Reduction Sima Sonawane, B.H.Pansambal Encoding Abstract— In recent years, the development of social networking and multimedia devices has grown fast which requires wide bandwidth and more storage space. The other approach is to use the available bandwidth and storage space efficiently as it is not feasible to change devices often. On social networking sites large volume of data and images are collected and stored daily. Compression is a key technique to solve the issue. JPEG compression gives good and clear results but the decompression technique usually results in artifacts in images. In this paper types of artifact and reduction techniques are discussed. Index Terms— JPEG compression; artifact; artifact reduction; post-processing; lossy compression; lossless Fig. 1: JPEG Encoder and Decoder compression Each eight-bit sample is level shifted by subtracting 28-1=7 I. INTRODUCTION = 128 before being DCT coded. This is known as DC level Generally, compression techniques represent the image in shifting. The 64 DCT coefficients are then uniformly fewer bits representing the original image. The main quantized according to the step size given in the objective of image compression is to reduce irrelevant application-specific quantization matrix. After quantization, information and redundancy of the image so that the image the DC (commonly referred to as (0, 0)) coefficient and the can be transmitted in an efficient form. Compression can be 63 AC coefficients are coded separately. The DC coefficients classified into lossless and lossy compression techniques.
    [Show full text]
  • Dail and Hammar's Pulmonary Pathology
    Dail and Hammar's Pulmonary Pathology Third Edition Dail and Hammar's Pulmonary Pathology Volume I: Nonneoplastic Lung Disease Third Edition Editor Joseph F. Tomashefski, Jr., MD Professor, Department of Pathology, Case Western Reserve University School of Medicine; Chairman, Department of Pathology, MetroHealth Medical Center, Cleveland, Ohio, USA Associate Editors Philip T. Cagle, MD Professor, Department of Pathology, Weill Medical College of Cornell University, New York, New York; Director, Pulmonary Pathology, Department of Pathology, The Methodist Hospital, Houston, Texas, USA Carol F. Farver, MD Director, Pulmonary Pathology, Department of Anatomic Pathology, The Cleveland Clinic Foundation, Cleveland, Ohio, USA Armando E. Fraire, MD Professor, Department of Pathology, University of Massachusetts Medical School, Worcester, Massachusetts, USA ~ Springer Editor: Joseph F. Tomashefski, Jr., MD Professor, Department of Pathology, Case Western Reserve University School of Medicine; Chairman, Department of Pathology, MetroHealth Medical Center, Cleveland, OH, USA Associate Editors: Philip T. Cagle, MD Professor, Department of Pathology, Weill Medical College of Cornell University, New York, NY; Director, Pulmonary Pathology, Department of Pathology, The Methodist Hospital, Houston, TX, USA Carol F. Farver, MD Director, Pulmonary Pathology, Department of Anatomic Pathology, The Cleveland Clinic Foundation, Cleveland, OH, USA Armando E. Fraire, MD Professor, Department of Pathology, University of Massachusetts Medical School, Worcester, MA, USA Library of Congress Control Number: 2007920839 Volume I ISBN: 978-0-387-98395-0 e-ISBN: 978-0-387-68792-6 DOl: 10.1 007/978-0-387 -68792-6 Set ISBN: 978-0-387-72139-2 © 2008 Springer Science+Business Media, LLC. All rights reserved. This work may not be translated or copied in whole or in part without the written permission of the publisher (Springer Science+Business Media, LLC., 233 Spring Street, New York, NY 10013, USA), except for brief excerpts in connection with reviews or scholarly analysis.
    [Show full text]
  • Progress in Respiratory Research
    Clinical Chest Ultrasound: From the ICU to the Bronchoscopy Suite Progress in Respiratory Research Vol. 37 Series Editor Chris T. Bolliger Cape Town Clinical Chest Ultrasound From the ICU to the Bronchoscopy Suite Volume Editors C.T. Bolliger Cape Town F.J.F. Herth Heidelberg P.H. Mayo New Hyde Park, N.Y. T. Miyazawa Kawasaki J.F. Beamis Burlington, Mass. 214 figures, 41 in color, 11 tables, and online supplementary material, 2009 Basel · Freiburg · Paris · London · New York · Bangalore · Bangkok · Shanghai · Singapore · Tokyo · Sydney Prof. Dr. Chris T. Bolliger Prof. Dr. Teruomi Miyazawa Department of Medicine Division of Respiratory and Infectious Diseases Faculty of Health Sciences Department of Internal Medicine University of Stellenbosch St. Marianna University School of Medicine 19063 Tygerberg 7505, Cape Town (South Africa) 2-16-1 Sugao miyamae-ku Kawasaki, Kanagawa 216-8511 (Japan) Prof. Dr. Felix J.F. Herth Department of Pneumology and Critical Care Medicine Dr. John F. Beamis Thoraxklinik, University of Heidelberg Section Pulmonary and Critical Care Medicine Amalienstrasse 5 Lahey Clinic DE-69126 Heidelberg (Germany) 41 Mall Road Burlington, MA 01805 (USA) Dr. Paul H. Mayo Long Island Jewish Medical Center Division of Pulmonary, Critical Care, and Sleep Medicine 410 Lakeville Road New Hyde Park, NY 11040 (USA) Library of Congress Cataloging-in-Publication Data Clinical chest ultrasound : from the ICU to the bronchoscopy suite / volume editors, C.T. Bolliger ... [et al.]. p. ; cm. -- (Progress in respiratory research ; v. 37) Includes bibliographical references and index. ISBN 978-3-8055-8642-9 (hard cover : alk. paper) 1. Chest--Ultrasonic imaging. I. Bolliger, C.
    [Show full text]