Please use this identifier to cite or link to this item: http://repositorio.unicamp.br/jspui/handle/REPOSIP/100286
Full metadata record
DC FieldValueLanguage
dc.contributor.CRUESPUNIVERSIDADE DE ESTADUAL DE CAMPINASpt_BR
dc.identifier.isbnpt
dc.typeArtigo de eventopt_BR
dc.titleLow-complexity Waveform Coding Via Alphabet And Sample-set Partitioningpt_BR
dc.contributor.authorSaid A.pt_BR
dc.contributor.authorPearlman W.A.pt_BR
unicamp.authorSaid, A., Faculty of Electrical Engineering, State University of Campinas (UNICAMP), Campinas, SP 13081, Brazil, Iterated Systems, Inc., Atlanta, GA, United Statespt_BR
unicamp.author.externalPearlman, W.A., Electrical, Computer and Systems Engineering Dept., Rensselaer Polytechnic Institute, Troy, NY 12180, United Statespt
dc.description.abstractWe propose a new low-complexity entropy-coding method to be used for coding waveform signals. It is based on the combination of two schemes: (1) an alphabet partitioning method to reduce the complexity of the entropy-coding process; (2) a new recursive set partitioning entropy-coding process that achieves rates smaller than first order entropy even with fast Huffman adaptive codecs. Numerical results with its application for lossy and lossless image compression show the efficacy of the new method, comparable to the best known methods.en
dc.relation.ispartofProceedings of SPIE - The International Society for Optical Engineeringpt_BR
dc.publisherpt_BR
dc.date.issued1997pt_BR
dc.identifier.citationProceedings Of Spie - The International Society For Optical Engineering. , v. 3024, n. , p. 25 - 37, 1997.pt_BR
dc.language.isoenpt_BR
dc.description.volume3024pt_BR
dc.description.issuenumberpt_BR
dc.description.initialpage25pt_BR
dc.description.lastpage37pt_BR
dc.rightsabertopt_BR
dc.sourceScopuspt_BR
dc.identifier.issn0277786Xpt_BR
dc.identifier.doi10.1117/12.263240pt_BR
dc.identifier.urlhttp://www.scopus.com/inward/record.url?eid=2-s2.0-33644993221&partnerID=40&md5=74af0b611b02f0655b89ab009c1327ecpt_BR
dc.date.available2015-06-30T14:50:12Z
dc.date.available2015-11-26T15:07:02Z-
dc.date.accessioned2015-06-30T14:50:12Z
dc.date.accessioned2015-11-26T15:07:02Z-
dc.description.provenanceMade available in DSpace on 2015-06-30T14:50:12Z (GMT). No. of bitstreams: 1 2-s2.0-33644993221.pdf: 653393 bytes, checksum: 147d542c8ff78e976ce56ea5caba7002 (MD5) Previous issue date: 1997en
dc.description.provenanceMade available in DSpace on 2015-11-26T15:07:02Z (GMT). No. of bitstreams: 2 2-s2.0-33644993221.pdf: 653393 bytes, checksum: 147d542c8ff78e976ce56ea5caba7002 (MD5) 2-s2.0-33644993221.pdf.txt: 39875 bytes, checksum: 1ecc611518cb26590845fdd8dc06369c (MD5) Previous issue date: 1997en
dc.identifier.urihttp://www.repositorio.unicamp.br/handle/REPOSIP/100286
dc.identifier.urihttp://repositorio.unicamp.br/jspui/handle/REPOSIP/100286-
dc.identifier.idScopus2-s2.0-33644993221pt_BR
dc.description.referenceRabbani, M., Jones, P.W., (1991) Digital Image Compression Techniques, , SPIE Opt. Eng. Press, Bellingham, Washingtonpt_BR
dc.description.referenceWallace, G.K., The JPEG still picture compression standard (1991) Comm. ACM, 34, pp. 30-44. , Aprilpt_BR
dc.description.referenceTodd, S., Langdon Jr., G.G., Rissanen, J., Parameter reduction and context selection for compression of gray-scale images (1985) IBM J. Res. Develop, 29, pp. 188-193. , Marchpt_BR
dc.description.referenceRabbani, M., Melnychuck, P.W., Conditioning contexts for the arithmetic coding of bit planes (1992) IEEE Trans. Signal Processing, 40, pp. 232-236. , Janpt_BR
dc.description.referenceStearns, S.D., Arithmetic coding in lossless waveform compression (1995) IEEE Trans. Signal Processing, 43, pp. 1874-1879. , Augpt_BR
dc.description.reference(1991) Subband Image Coding, , J.W. Woods, ed, Kluwer Academic Publishers, Boston, MApt_BR
dc.description.referenceSaid, A., Pearlman, W.A., Reversible image compression via multiresolution representation and predictive coding (1993) Proc. SPIE, 2094, pp. 664-674. , Visual Commun. and Image Processing, pp, Novpt_BR
dc.description.referenceWitten, I.H., Neal, R.M., Cleary, J.G., Arithmetic coding for data compression (1987) Commun. ACM, 30, pp. 520-540. , Junept_BR
dc.description.referencePennebaker, W.B., Mitchell, J.L., Langdon Jr., G.G., Arps, R.B., An overview of the basic principles of the Q-coder adaptive binary arithmetic coder (1988) IBM J. Res. Develop, 32, pp. 717-726. , Novpt_BR
dc.description.referenceSaid, A., Pearlman, W.A., Reduced-Complexity Waveform Coding via Alphabet Partitioning (1995) IEEE Int. Symposium on Information Theory, p. 373. , Whistler, B.C, Canada, p, Septpt_BR
dc.description.referenceSaid, A., Pearlman, W.A., A new fast and efficient codec based on set partitioning in hierarchical trees (1996) IEEE Trans. on Circuits and Systems for Video Technology, 6, pp. 243-250. , Junept_BR
dc.description.referenceSaid, A., Pearlman, W.A., An image multiresolution representation for lossless and lossy compression (1996) IEEE Trans. on Image Processing, 5, pp. 1303-1310. , Septpt_BR
dc.description.referenceAntonini, M., Barlaud, M., Mathieu, P., Daubechies, I., Image coding using wavelet transform (1992) IEEE Trans. Image Processing, 1, pp. 205-220. , Aprilpt_BR
dc.description.referenceTsai, M.J., Villasenor, J.D., Chen, F., Stack-run image coding (1996) IEEE Trans. on Circuils and Systems for Video Technology, 6, pp. 519-521. , Octpt_BR
Appears in Collections:Unicamp - Artigos e Outros Documentos

Files in This Item:
File Description SizeFormat 
2-s2.0-33644993221.pdf638.08 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.