DOCSLIB.ORG

Low-Complexity Enhanced Lapped Transform for Image Coding in Jpeg

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Low-Complexity Enhanced Lapped Transform for Image Coding in Jpeg Low-Complexity Enhanced Lapped Transform for Image Coding in JPEG XR / HD Photo Aldo Maalouf, Member IEEE, Mohamed-Chaker Larabi, Senior Member IEEE XLIM Laboratory, Department of Signal, Image and Communication, UMR CNRS 6172 University of Poitiers, SP2MI-2 Bd Marie et Pierre Curie, PO Box 30179 86962 Futuroscope Chasseneuil, France {maalouf, larabi}@sic.sp2mi.univ-poitiers.fr Abstract— JPEG-XR is a new image compression standard Hence, POT improves compression efficiency, while at the that aims at achieving state-of-the-art image compression, while same time reducing blocking artifacts. simultaneously keeping the encoder and decoder complexities as In this work, we propose to replace the LBT by a representa- low as possible. JPEG-XR [1] is based on Microsoft technology known as HDPHOTO and makes use of a block-transform. This tion in Legendre polynomials basis. The motivation is that transform, known as Lapped Biorthogonal Transform (LBT), orthogonal polynomials have demonstrated much desirable requires only a small memory footprint while providing the strength in the field of image processing [7], especially in compression benefits of a larger block transform. In this work, pattern recognition [4], edge detection [6] and texture analysis we propose to replace the LBT by a representation in Legendre [8]. Moreover, it has been shown in [2] that orthogonal orthogonal polynomial basis. The motivation behind using the Legendre polynomials is that, in general, moment functions of polynomial have some properties related to the human visual orthogonal polynomials provide better feature representations system (HVS). In fact, visual analysis in the visual cortex, over other type of moments [7] [11] and have some properties from the mathematical point of view, can be regarded as a related to the human visual system (HVS) [2]. However, Legendre process of expansion of the curve of spatial distribution of polynomials have a unit weight function and recurrence relation brightness within the receptive fields in an orthogonal polyno- involving real coefficients, which make them suitable for defining image representation. We show that the expansion in Legendre mial basis. Therefore, orthogonal polynomials provide better polynomial basis can be implemented via lifting operations opportunities to qualitatively optimize image data representa- and has the same computation complexity as the LBT. The tion. However, Legendre polynomials are of special interest experimental evaluation of our modified JPEG-XR scheme shows in our case, because they have unit weight and algebraic beneficial improvements in terms of visual quality over the recurrence relations involving real coefficients, which make standard JPEG-XR. them suitable for defining image transforms for compression. Index Terms— JPEG-XR, image coding, HDPHOTO, orthog- The integration of the Legendre polynomial expansion allows onal polynomials. incorporating human visual system (HVS) properties in the JPEG-XR compression scheme. As a result, an improvement I. INTRODUCTION in terms of visual quality of the compressed images is obtained JPEG-XR is a recent compression algorithm developed by by our modified JPEG-XR scheme. Microsoft for digital imaging applications [12] [13]. JPEG- It is to be noted that the image representation in the Legendre XR is characterized by a block-based image compression polynomial basis can be implemented via lifting operations. scheme. The codec design aims at optimizing image quality Therefore, our modified approach does not add any complexity and compression efficiency while at the same time requiring to the standard JPEG-XR scheme. low-complexity in encoder and decoder implementations. As a The remainder of the paper is organized as follows. In sec- result, even if it uses many of the same fundamental building tion 2 an overview of the JPEG-XR is given. In section 3 blocks as in other traditional image and video compression our modified Legendre polynomial-based JPEG-XR approach schemes, i.e. color conversion, domain transform, quantiza- is described. Section 4 is devoted for experimental results. tion, coefficient scanning and entropy coding, the JPEG-XR Finally, section 5 draws some concluding remarques. have led to different improvements in terms of complexity when compared to other state of the art compression methods. II. OVERVIEW OF JPEG-XR To convert spatial domain image data to frequency domain, JPEG-XR uses a hierarchical two stages LBT [5] which is The coding structure of JPEG-XR, which shares some simi- based on a flexible concatenation of two operators: the Photo larities with traditional image coding techniques, is composed Core Transform (PCT) and the Photo Overlap Transform of the following steps: color conversion, reversible Lapped Bi- (POT). PCT is similar to the widely used DCT and exploits orthogonal Transform (LBT), flexible quantization, inter-block spatial correlation within the block. However, it fails to exploit prediction, adaptive” coefficient scanning, and entropy coding redundancy across block boundaries and may introduce block- of transform coefficients [12]. The distinguishing features are ing artifacts at low bit rates. To alleviate these drawbacks, POT the LBT and the advanced coding of coefficients. is designed to exploit the correlation across block boundaries. To convert spatial domain image data to frequency domain, 978-1-4244-5654-3/09/$26.00 ©2009 IEEE 5 ICIP 2009 JPEG-XR uses a hierarchical two stage LBT which is based on a discrete domain x =0, 1,...,N − 1. on a flexible concatenation of two operators: the Photo Core In this paper, we propose to use an image representation Transform (PCT) and the Photo Overlap Transform (POT). scheme similar to a 4 × 4 PCT, based on an image transform PCT is similar to the widely used DCT and exploits spatial requiring only polynomials of degree 0 through 3. For an correlation within the block. However, it fails to exploit re- image I(x, y), this representation is defined by: dundancy across block boundaries and may introduce blocking 3 3 artifacts at low bit rates. To alleviate these drawbacks, POT is Lpq = lp (x) lq (y)I (x, y), p, q =0,...,3 (2) designed to exploit the correlation across block boundaries. x=0 y=0 Hence, POT improves compression efficiency, while at the same time reducing blocking artifacts. The inverse transformation of (2) has the form The transform is performed in a two-stage hierarchical struc- 3 3 ture. For the sake of simplicity, we consider the case of I (x, y)= Lpqlp (x) lq (y) (3) the luminance channel. At the first stage, a 4 × 4 POT is p=0 q=0 optionally applied, followed by a compulsory 4x4 PCT. The resulting 16 DC coefficients of all 4×4 blocks within a 16x16 B. Implementation via lifting operators macroblock are grouped into a single 4 × 4 DC block. The From equation (2), a 4 × 4 transform matrix, denoted by A, remaining 240 AC coefficients are referred to as the High can be defined by: Pass (HP) coefficients. At the second stage, the DC blocks ⎡ ⎤ 4 × 4 lp (0) lq (0) lp (0) lq (1) ...... lp (0) lq (3) are further processed. Another optional POT is first ⎢ ⎥ ⎢ lp (1) lq (0) lp (1) lq (1) ...... lp (1) lq (3) ⎥ performed on the DC blocks, followed by the application of A = ⎣ ⎦ a compulsory 4x4 PCT. This yields 16 new coefficients: one ... ... ...... ... (3) (0) (3) (1) (3) (3) second stage DC coefficient and 15 second stage AC coeffi- l⎡p lq lp lq ...... lp ⎤lq 0 5050505 cients, referred to as the DC and Low Pass (LP) coefficients . ⎢ 0 67 0 224 −0 224 −0 67 ⎥ respectively. The DC, LP and HP bands are then quantized = ⎢ . ⎥ ⎣ 0 5 −0 5 −0 505 ⎦ and coded independently. All transforms are implemented by . 0 224 −0 67 0 67 −0 224 lifting steps [3]. The chrominance channels are processed in . (4) a similar way. Whenever POT and PCT are concatenated, the The matrix A indicates that the image representation in transform becomes equivalent to LBT [5]. In order to enable Legendre polynomial basis is an even/odd transform; that is, the optimization of the Quantization Parameters (QP) based one half of its row are odd vectors: on the sensitivity of the HVS and the coefficient statistics, JPEG-XR uses a flexible coefficient quantization approach. To vi = −vM+1−i, i =1, 2,...,M/2, (5) further improve compression efficiency, inter-block coefficient prediction is then used to remove inter-block redundancy in the while the others are even vectors: quantized transform coefficients. Adaptive coefficient scanning vi = vM+1−i, i =1, 2,...,M/2, (6) is then used to convert the 2-D transform coefficients within a block into a 1D vector to be encoded. Scan patterns are By re-arranging the rows of the transform matrix A, such adapted dynamically based on the local statistics of coded that rows 1, 3,...,M − 1 are the first M/2 rows and rows coefficients. Coefficients with higher probability of non-zero 2, 4,...,M are the last M/2 rows, the transform matrix can be written as a partitioned matrix: values are scanned earlier. Finally, the transform coefficients are entropy coded. Q Q¯ A = , (7) D −D¯ III. IMAGE REPRESENTATION IN LEGENDRE BASIS where Q and D are M/2 × M/2 orthogonal matrices, and In this section, we make use of Legendre orthogonal basis Q¯ and D¯ are formed by reversing the order of the columns in in order to represent the image and improve the quality Q and D;thatis, of the JPEG-XR compression scheme. Our modified JPEG- XR scheme is similar to the JPEG-XR baseline. The only Q¯ = QI¯ and D¯ = DI¯, difference is that we replaced the PCT with a lapped rep- the permutation matrix I¯ being the opposite diagonal identity resentation in Legendre polynomial basis. First, we describe matrix. The matrix A can then be factored into the product of this representation, then, we show how it can be implemented two matrices by using lifting operators.
Load more

Recommended publications
  • Fast Computational Structures for an Efficient Implementation of The
    ARTICLE IN PRESS Signal Processing ] (]]]]) ]]]–]]] Contents lists available at ScienceDirect Signal Processing journal homepage: www.elsevier.com/locate/sigpro Fast computational structures for an efficient implementation of the complete TDAC analysis/synthesis MDCT/MDST filter banks Vladimir Britanak a,Ã, Huibert J. Lincklaen Arrie¨ns b a Institute of Informatics, Slovak Academy of Sciences, Dubravska cesta 9, 845 07 Bratislava, Slovak Republic b Delft University of Technology, Department of Electrical Engineering, Mathematics and Computer Science, Mekelweg 4, 2628 CD Delft, The Netherlands article info abstract Article history: A new fast computational structure identical both for the forward and backward Received 27 May 2008 modified discrete cosine/sine transform (MDCT/MDST) computation is described. It is Received in revised form the result of a systematic construction of a fast algorithm for an efficient implementa- 8 January 2009 tion of the complete time domain aliasing cancelation (TDAC) analysis/synthesis MDCT/ Accepted 10 January 2009 MDST filter banks. It is shown that the same computational structure can be used both for the encoder and the decoder, thus significantly reducing design time and resources. Keywords: The corresponding generalized signal flow graph is regular and defines new sparse Modified discrete cosine transform matrix factorizations of the discrete cosine transform of type IV (DCT-IV) and MDCT/ Modified discrete sine transform MDST matrices. The identical fast MDCT computational structure provides an efficient Modulated
    [Show full text]
  • LOW COMPLEXITY H.264 to VC-1 TRANSCODER by VIDHYA
    LOW COMPLEXITY H.264 TO VC-1 TRANSCODER by VIDHYA VIJAYAKUMAR Presented to the Faculty of the Graduate School of The University of Texas at Arlington in Partial Fulfillment of the Requirements for the Degree of MASTER OF SCIENCE IN ELECTRICAL ENGINEERING THE UNIVERSITY OF TEXAS AT ARLINGTON AUGUST 2010 Copyright © by Vidhya Vijayakumar 2010 All Rights Reserved ACKNOWLEDGEMENTS As true as it would be with any research effort, this endeavor would not have been possible without the guidance and support of a number of people whom I stand to thank at this juncture. First and foremost, I express my sincere gratitude to my advisor and mentor, Dr. K.R. Rao, who has been the backbone of this whole exercise. I am greatly indebted for all the things that I have learnt from him, academically and otherwise. I thank Dr. Ishfaq Ahmad for being my co-advisor and mentor and for his invaluable guidance and support. I was fortunate to work with Dr. Ahmad as his research assistant on the latest trends in video compression and it has been an invaluable experience. I thank my mentor, Mr. Vishy Swaminathan, and my team members at Adobe Systems for giving me an opportunity to work in the industry and guide me during my internship. I would like to thank the other members of my advisory committee Dr. W. Alan Davis and Dr. William E Dillon for reviewing the thesis document and offering insightful comments. I express my gratitude Dr. Jonathan Bredow and the Electrical Engineering department for purchasing the software required for this thesis and giving me the chance to work on cutting edge technologies.
    [Show full text]
  • Perceptual Audio Coding Contents
    12/6/2007 Perceptual Audio Coding Henrique Malvar Managing Director, Redmond Lab UW Lecture – December 6, 2007 Contents • Motivation • “Source coding”: good for speech • “Sink coding”: Auditory Masking • Block & Lapped Transforms • Audio compression •Examples 2 1 12/6/2007 Contents • Motivation • “Source coding”: good for speech • “Sink coding”: Auditory Masking • Block & Lapped Transforms • Audio compression •Examples 3 Many applications need digital audio • Communication – Digital TV, Telephony (VoIP) & teleconferencing – Voice mail, voice annotations on e-mail, voice recording •Business – Internet call centers – Multimedia presentations • Entertainment – 150 songs on standard CD – thousands of songs on portable music players – Internet / Satellite radio, HD Radio – Games, DVD Movies 4 2 12/6/2007 Contents • Motivation • “Source coding”: good for speech • “Sink coding”: Auditory Masking • Block & Lapped Transforms • Audio compression •Examples 5 Linear Predictive Coding (LPC) LPC periodic excitation N coefficients x()nen= ()+−∑ axnrr ( ) gains r=1 pitch period e(n) Synthesis x(n) Combine Filter noise excitation synthesized speech 6 3 12/6/2007 LPC basics – analysis/synthesis synthesis parameters Analysis Synthesis algorithm Filter residual waveform N en()= xn ()−−∑ axnr ( r ) r=1 original speech synthesized speech 7 LPC variant - CELP selection Encoder index LPC original gain coefficients speech . Synthesis . Filter Decoder excitation codebook synthesized speech 8 4 12/6/2007 LPC variant - multipulse LPC coefficients excitation Synthesis
    [Show full text]
  • Using Daala Intra Frames for Still Picture Coding
    Using Daala Intra Frames for Still Picture Coding Nathan E. Egge, Jean-Marc Valin, Timothy B. Terriberry, Thomas Daede, Christopher Montgomery Mozilla Mountain View, CA, USA Abstract—Recent advances in video codec technology have techniques. Unsignaled horizontal and vertical prediction (see been successfully applied to the field of still picture coding. Daala Section II-D), and low complexity prediction of chroma coef- is a new royalty-free video codec under active development that ficients from their spatially coincident luma coefficients (see contains several novel coding technologies. We consider using Daala intra frames for still picture coding and show that it is Section II-E) are two examples. competitive with other video-derived image formats. A finished version of Daala could be used to create an excellent, royalty-free image format. I. INTRODUCTION The Daala video codec is a joint research effort between Xiph.Org and Mozilla to develop a next-generation video codec that is both (1) competitive performance with the state- of-the-art and (2) distributable on a royalty free basis. In work- ing to produce a royalty free video codec, Daala introduces new coding techniques to replace those used in the traditional block-based video codec pipeline. These techniques, while not Fig. 1. State of blocks within the decode pipeline of a codec using lapped completely finished, already demonstrate that it is possible to transforms. Immediate neighbors of the target block (bold lines) cannot be deliver a video codec that meets these goals. used for spatial prediction as they still require post-filtering (dotted lines). All video codecs have, in some form, the ability to code a still frame without prior information.
    [Show full text]
  • Lapped Transforms in Perceptual Coding of Wideband Audio
    Lapped Transforms in Perceptual Coding of Wideband Audio Sien Ruan Department of Electrical & Computer Engineering McGill University Montreal, Canada December 2004 A thesis submitted to McGill University in partial fulfillment of the requirements for the degree of Master of Engineering. c 2004 Sien Ruan ° i To my beloved parents ii Abstract Audio coding paradigms depend on time-frequency transformations to remove statistical redundancy in audio signals and reduce data bit rate, while maintaining high fidelity of the reconstructed signal. Sophisticated perceptual audio coding further exploits perceptual redundancy in audio signals by incorporating perceptual masking phenomena. This thesis focuses on the investigation of different coding transformations that can be used to compute perceptual distortion measures effectively; among them the lapped transform, which is most widely used in nowadays audio coders. Moreover, an innovative lapped transform is developed that can vary overlap percentage at arbitrary degrees. The new lapped transform is applicable on the transient audio by capturing the time-varying characteristics of the signal. iii Sommaire Les paradigmes de codage audio d´ependent des transformations de temps-fr´equence pour enlever la redondance statistique dans les signaux audio et pour r´eduire le taux de trans- mission de donn´ees, tout en maintenant la fid´elit´e´elev´ee du signal reconstruit. Le codage sophistiqu´eperceptuel de l’audio exploite davantage la redondance perceptuelle dans les signaux audio en incorporant des ph´enom`enes de masquage perceptuels. Cette th`ese se concentre sur la recherche sur les diff´erentes transformations de codage qui peuvent ˆetre employ´ees pour calculer des mesures de d´eformation perceptuelles efficacement, parmi elles, la transformation enroul´e, qui est la plus largement r´epandue dans les codeurs audio de nos jours.
    [Show full text]
  • Daala: a Perceptually-Driven Still Picture Codec
    DAALA: A PERCEPTUALLY-DRIVEN STILL PICTURE CODEC Jean-Marc Valin, Nathan E. Egge, Thomas Daede, Timothy B. Terriberry, Christopher Montgomery Mozilla, Mountain View, CA, USA Xiph.Org Foundation ABSTRACT and vertical directions [1]. Also, DC coefficients are com- bined recursively using a Haar transform, up to the level of Daala is a new royalty-free video codec based on perceptually- 64x64 superblocks. driven coding techniques. We explore using its keyframe format for still picture coding and show how it has improved over the past year. We believe the technology used in Daala Multi-Symbol Entropy Coder could be the basis of an excellent, royalty-free image format. Most recent video codecs encode information using binary arithmetic coding, meaning that each symbol can only take 1. INTRODUCTION two values. The Daala range coder supports up to 16 values per symbol, making it possible to encode fewer symbols [6]. Daala is a royalty-free video codec designed to avoid tra- This is equivalent to coding up to four binary values in parallel ditional patent-encumbered techniques used in most cur- and reduces serial dependencies. rent video codecs. In this paper, we propose to use Daala’s keyframe format for still picture coding. In June 2015, Daala was compared to other still picture codecs at the 2015 Picture Perceptual Vector Quantization Coding Symposium (PCS) [1,2]. Since then many improve- Rather than use scalar quantization like the vast majority of ments were made to the bitstream to improve its quality. picture and video codecs, Daala is based on perceptual vector These include reduced overlap in the lapped transform, finer quantization (PVQ) [7].
    [Show full text]
  • Wiener Filter-Based Error Resilient Time Domain Lapped Transform Jie Liang, Member, IEEE, Chengjie Tu, Member, IEEE, Lu Gan, Member, IEEE, Trac D
    IEEE TRANSACTIONS ON IMAGE PROCESSING, SUBMITTED JAN. 2006 1 Wiener Filter-based Error Resilient Time Domain Lapped Transform Jie Liang, Member, IEEE, Chengjie Tu, Member, IEEE, Lu Gan, Member, IEEE, Trac D. Tran, Member, IEEE, and Kai-Kuang Ma, Senior Member, IEEE Abstract— In this paper, the design of the error resilient time- DCT and reducing the blocking artifact associated with DCT- domain lapped transform is formulated as a linear minimal based schemes. On the other hand, the postfilter can also mean squared error (LMMSE) problem. The optimal Wiener be designed to spread out the information of a block to its solution and several simplifications with different tradeoffs be- tween complexity and performance are developed. We also prove neighboring blocks. This is helpful when we need to recover the persymmetric structure of these Wiener filters. The existing a lost block during image transmission. mean reconstruction method is proven to be a special case of In [10], various techniques were proposed to estimate the the proposed framework. Our method also includes as a special lost data when the lapped orthogonal transform (LOT) was case the linear interpolation method used in DCT-based systems used. A mean reconstruction method and a nonlinear sharp- when there is no pre/postfiltering and when the quantization noise is ignored. The design criteria in our previous results are ening method were found to be quite effective, under the scrutinized and improved solutions are obtained. Various design assumption that DC coefficients were intact. In particular, in examples and multiple description image coding experiments the mean reconstruction method, each lost block was estimated are reported to demonstrate the performance of the proposed by averaging its available neighboring blocks.
    [Show full text]
  • Nonlinearly-Adapted Lapped Transforms for Intra-Frame Coding
    NONLINEARLY-ADAPTED LAPPED TRANSFORMS FOR INTRA-FRAME CODING Dan Lelescu DoCoMo Communications Labs USA 181 Metro Drive, San Jose, CA. 95110 Email: [email protected] ABSTRACT Lapped transforms can be implemented (e.g., [6]) as block boundary pre- and post- filtering outside a block transform codec. The use of block transforms for coding intra-frames in video coding From an implementation point of view, the lapped transform can may preclude higher coding performance due to residual correlation be added to a block transform codec without changing the existing across block boundaries and insufficient energy compaction, which block transform of the codec. The gains that a lapped transform translates into unrealized rate-distortion gains. Subjectively, the oc- brings compared to a block transform are diminished by the use currence of blocking artifacts is common. Post-filters and lapped of other complementary methods such as intra-prediction and adap- transforms offer good solutions to these problems. Lapped trans- tive post-filters. For increased performance, it is useful to design a forms offer a more general framework which can incorporate coor- signal-adapted rather than a fixed lapped transform, and evaluate the dinated pre- and post-filtering operations. Most common are fixed transform when incorporated in a state-of-art codec that uses tech- lapped transforms (such as lapped orthogonal transforms), and also niques such as intra-prediction and post-filtering. transforms with adaptive basis function length. In contrast, in this We present in this paper the determination and use of an adaptive paper we determine a lapped transform that non-linearly adapts its lapped transform for coding intra-frames in a video codec.
    [Show full text]
  • Analysis and Integrated Architecture Design for Overlap Smooth and In-Loop Deblocking Filter in Vc-1
    ANALYSIS AND INTEGRATED ARCHITECTURE DESIGN FOR OVERLAP SMOOTH AND IN-LOOP DEBLOCKING FILTER IN VC-1 Yen-Lin Lee and Truong Nguyen ECE Dept., UCSD, La Jolla, CA 92093-0407 Email: [email protected], [email protected] http://videoprocessing.ucsd.edu 0RWLRQ ABSTRACT 9HFWRU 3UHGLFWLRQ )UDPH1 =LJ]DJ (QWURS\ 7UDQVIRUP 4XDQWL]H Unlike familiar macroblock-based in-loop deblocking filter in H.264, FXUUHQW 6FDQ &RGLQJ the filters of VC-1 perform all horizontal edges (for in-loop deblock- 0RWLRQ LQWUDFRGLQJ ing filtering) or vertical edges (for overlap smoothing) first and then (VWLPDWLRQ 0RWLRQ ,QWUD &RPSHQVDWLRQ &RHIILFLHQW LQWHUFRGLQJ 3UHGLFWLRQ the other directional filtering edges. The entire procedure is very LQWUDFRGLQJ )UDPH1 time-consuming and with high memory access loading for the whole UHFRQVWUXFWHG ,QORRS 2YHUODS ,QYHUVH ,QYHUVH system. This paper presents a novel method and the efficient in- 'HEORFNLQJ 6PRRWK 7UDQVIRUP 4XDQWL]H tegrated architecture design, which involves an 12×12 overlapped )LOWHU LQWUDFRGLQJ block that combines overlap smoothing with loop filtering for per- Fig. 1. Encoding loop of VC-1 codec. formance and cost by sharing circuits and resources. This architec- ture has capability to process HDTV1080p 30fps video and HDTV 2048×1536 24fps video at 180MHz. The same concept is applicable to other video processing algorithms, especially in deblocking filter neighboring unreconstructed macroblocks. If these previous meth- for video post-processing in a frame-based order. ods directly apply to VC-1 deblocking filter, they could cause many unnecessary processing cycles and inefficient memory access. Index Terms— Overlap smoothing, in-loop deblocking filter, In this paper, we propose a method to solve the data dependency VC-1, SMPTE-421M, VLSI architecture problem and accelerate the processing time.
    [Show full text]
  • Audio Coding Based on the Modulated Lapped Transform (Mlt) and Set Partitioning in Hierarchical Trees
    AUDIO CODING BASED ON THE MODULATED LAPPED TRANSFORM (MLT) AND SET PARTITIONING IN HIERARCHICAL TREES Mohammed Raad, Alfred Mertins and Ian Burnett School of Electrical, Computer and Telecommunications Engineering University Of Wollongong Northfields Ave Wollongong NSW 2522, Australia email: [email protected] ABSTRACT an Internet audio transmission scheme [4]. The HILN coder focuses on signal bandwidth less than 8 kHz and utilizes a per- This paper presents an audio coder based on the combination ceptual re-ordering scheme of the parameters. of the Modulated Lapped Transform (MLT) with the Set Par- titioning In Hierarchical Trees (SPIHT) algorithm. SPIHT al- This paper presents an audio compression scheme that uti- lows scalable coding by transmitting more important informa- lizes the MLT and a transmission algorithm known as Set Par- tion first in an efficient manner. The results presented reveal titioning In Hierarchical Trees (SPIHT) [6]. The algorithm that the Modulated Lapped Transform (MLT) based scheme was initially proposed as an image compression solution but produces a high compression ratio for little or no loss of quality. it is general enough to have been applied to audio and elec- A modification is introduced to SPIHT which further improves trocardiogram (ECG) signal compression, in combination with the performance of the algorithm when it is being used with the Wavelet transform, as well [7][8]. The algorithm aims at uniform M-band transforms and masking. Further, the MLT- performing an ordered bit plane transmission and sorts trans- SPIHT scheme is shown to achieve high quality synthesized form coefficients in an efficient manner allowing more bits to audio at 54 kbps through subjective listening tests.
    [Show full text]
  • An Overview of Ogg Vorbis
    An Overview of Ogg Vorbis Presented by: Shi Yong MUMT 611 Overview • Ogg – A multimedia container format, contains audio and video data streams in a single file, similar to mov and avi. – Functions: framing, sync, error correction, positioning – Stream oriented, suitable for internet streaming. – Used with various Codecs: • Vorbis: Audio codec • Tremor: Fixed-point decoder • Theora: Video codec • FLAC: Free Lossless Audio Codec • Speex: Speech codec • OggWrit: Text phrase codec (subtitles) • Ogg Metadata: Arbitrary metadata format Overview • Vorbis – General purpose lossy audio compression algorithm/format, similar to MP3, WMA, etc.. – Designed to be contained in a transport mechanism that provides framing, sync and error correction functions, such as Ogg (for file transport) or RTP (for webcast) – When used with Ogg, it is called Ogg Vorbis. – A great number of player now support Ogg Vorbis – Encode CD/DAT quality at below 48kbps – Wide range of sample rates: from 8kHz to 192kHz – Strong channel representations: monaural, polyphonic, stereo, quadraphonic, 5.1, up to 255 discrete channels Overview • Both Ogg and Vorbis are developed by the Xiph.Org Foundation, a non-profit corporation (http://www.xiph.org/ ) • LGPL licensing: – open standard – open source – patent free – completely free for commercial or noncommercial use • Software can be downloaded from http://www.vorbis.com/setup/ Encode • Overview – Accepting input audio, dividing it into frames, compressing frames into raw packets – As a generic perceptual audio encoder, psycho acoustic model is used to remove redundant audio information – Function blocks is similar to most other lossy audio encoders, such as Time/Frequency Analysis, Psychoacoustic Analysis, Quantization and Encoding, Bit Allocation, Entropy Coding, etc.
    [Show full text]
  • Multi Mode Harmonic Transform Coding for Speech and Music
    THE JOURNAL OF THE ACOUSTICAL SOCIETY Cff KOREA Vol.22, No.3E 2003. 9. pp. 101-109 Multi Mode Harmonic Transform Coding for Speech and Music Jonghark *,Kim Jae-Hyun ,Shin* Insung *Lee 허 Dept, of Radio Engineering, Chungbuk National University (Received September 18 2002； revised Feb「나 ary 1 2003； accepted February 17 2003) Abstract A multi-mode harmonic transfbnn coding (MMHTC) for speech and music signals is proposed. Its structure is organized as a linear prediction model with an input of harmonic and transform-based excitation. The proposed coder also utilizes harmonic prediction and an improved quantizer of excitation signal. To efficiently quantize the excitation of music signals, rhe modulated lapped transfbnn (MLT) is introduced. In other words, the coder combines both the time domain (linear prediction) and the frequency domain technique to achieve the best perceptual quality. The proposed coder showed better speech quality than that of the 8 kbps QCELP coder at a bit-rate of 4 kbps. Keywords： Speech coding, Harmonic coding, CELP, Audio coding I. Introduction this area, however, has shown that increased quality levels at low bit rates could only be achieved at the expense of Recently, there has been increasing interests in coding higher algorithmic delay, or complexity, or a compro­ of speech and audio signals for several applications such mised quality for more diverse signals. as audio/video teleconferencing, wireless multimedia, Specially, a harmonic coding scheme showed a good wideband telephony over packet networks, and Internet quality at demanding complexity and delay at low rate applications. These applications usually require the speech coder, because the coding method uses only the modeling method of mixture signals such as speech and simple extracting structure for excitation signal by audio[l-4].
    [Show full text]