NDLI: Greedy quantization of control points for 2D and 3D data using blending surfaces representation

Content Provider	IEEE Xplore Digital Library
Author	Mayer, J.
Copyright Year	1999
Description	Author affiliation: Dept. of Electr. Eng., Univ. Fed. de Santa Catarina, Florianapolis, Brazil (Mayer, J.)
Abstract	A greedy optimization algorithm for quantization of control points is proposed. These control points define the triangular surfaces found in 2D polynomial blending coding and in VRML 3D objects. The control point quantization poses an interesting problem: each control point is shared by the neighboring triangles and, as a consequence, both the distortion and bit-rate are not independent as assumed in quantization schemes based on Lagrangian optimization. The proposed sub-optimal greedy algorithm addresses this dependency problem and significantly improves the coding performance achieved by Mayer and Langdon (see 32nd Asilomar Conference on Signals, Systems and Computers, 1998). The algorithm reduces the entropy at each iteration while introduces the least distortion possible. We also propose the extension of this algorithm for encoding 3D coordinates as found in VRML files and present results for an approximation of a sphere generated by a mesh of triangles.
Starting Page	1441
Ending Page	1445
File Size	471986
Page Count	5
File Format	PDF
ISBN	0780357000
ISSN	10586393
DOI	10.1109/ACSSC.1999.831944
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1999-10-24
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Quantization Partitioning algorithms Greedy algorithms Costs Polynomials Lagrangian functions Encoding Instruments Rate distortion theory Entropy
Content Type	Text
Resource Type	Article
Subject	Signal Processing Computer Networks and Communications

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

A blending model for efficient compression of smooth images

On entropy-constrained residual vector quantization design

A Lagrangian formulation of fixed-rate quantization

Encoder optimization in an extended H.263 framework

∈-entropy of piecewise polynomial functions and tree partitioning compression

Low Complexity Inter-Mode Selection for H.264

Tree Partitioning Compression of Piecewise Polynomial Functions

Quantization with joint entropy/memory constraints

Rate Estimation, Using Forward Adaptive Quantization: H.264 Fast Intra Mode Selection at High Data Rates

Greedy quantization of control points for 2D and 3D data using blending surfaces representation

Similar Documents

A blending model for efficient compression of smooth images

On entropy-constrained residual vector quantization design

A Lagrangian formulation of fixed-rate quantization

Encoder optimization in an extended H.263 framework

∈-entropy of piecewise polynomial functions and tree partitioning compression

Low Complexity Inter-Mode Selection for H.264

Tree Partitioning Compression of Piecewise Polynomial Functions

Quantization with joint entropy/memory constraints

Rate Estimation, Using Forward Adaptive Quantization: H.264 Fast Intra Mode Selection at High Data Rates

Greedy quantization of control points for 2D and 3D data using blending surfaces representation