Web-based progressive geometry transmission using subdivision-surface wavelets
|
|
- Joleen Summers
- 6 years ago
- Views:
Transcription
1 Web-based progressive geometry transmission using subdivision-surface wavelets Jens Jessl TU Kaiserslautern Martin Bertram TU Kaiserslautern Hans Hagen TU Kaiserslautern Figure 1: Progressive level of detail representation of a cube, Catmull-Clark subdivision is done three times to increase the level of detail. Abstract Web-based geometry transmission profits from a transmission system, which is both progressive and compressive. For this application, the wavelet transform has emerged as a suitable tool. We present a new zerotree coding scheme for compressing coefficients resulting from the wavelet transform of B-spline and Catmull-Clark surfaces. It results from a generalization of the original zerotree coding algorithm for image compression. The main idea is the construction of a suitable forest-structure of wavelet coefficients. Furthermore we present a system architecture for web-based progressive geometry transmission. Its main features are the separation of the transmission algorithms from the implementation of several geometry types, a set of parameters for regulating transmission properties, and a thread system for concurrent receiving and visualizing a scene. The power of the zerotree coding scheme is demonstrated by some numerical examples. Keywords: Geometry Compression, Progressive Transmission, Subdivision Surfaces, Wavelet Transform, Web-based 3D Graphics, Zerotree Coding CR Categories: C.2.4 [Computer-Communication Networks]: Distributed Systems Distributed Applications E.4 [Coding and Information Theory]: Data Compaction and Compression G.1.2 [Numerical Analysis]: Approximation Wavelets and Fractals I.3.2 [Computer Graphics]: Graphic Systems Distributed / Network Graphics 1 Introduction Progressive transmission of a three-dimensional scene (see figure 1 for an example) consists of two steps. At first, a coarse version of the scene-components is transmitted, followed by the advancing transmission of their details. Compared to non-progressive transmission, several advantages are obvious: Transmitted scene has scalable level of detail. Transmission of a scene requires a scalable amount of resources (data volume and transmission time). Availability of a coarse version of the scene at the beginning of transmission. Broken connections are not always disastrous. When embedding a progressive transmission system into the environment of the WWW, some peculiarities of the web need to be considered. At first, the power of computers connected to the WWW is varying in a wide range, so scalable level of detail is useful. Further the connections have different bandwidths and / or other restrictions as limitations of time or amount of transmitted data. As with scenes of high complexity transmission time may be long, it is lucrative to receive a coarse version of the scene at the beginning of transmission. Finally, in case the connection has broken, a version with sufficient quality may have been received. It is obvious that all advantages of progressive transmission are extremely useful. There exist many applications for web-based progressive geometry transmission, including: nomaam@t-online.de bertram@informatik.uni-kl.de hagen@informatik.uni-kl.de
2 Virtual reality and entertainment. Presentations and advertising. Web-based learning. Visualization of scientific data. Due to limited resources as bandwidth and time, transmission should be compressive. A general compression scheme consists of three steps [Hilton et al. 1994]: 1. Transformation: removes similarities between adjacent values (de-correlation), lossless or lossy. 2. Quantization: decreases the number of bits used to represent a value, always lossy. 3. Entropy coding: removes statistical redundancy, always lossless. A good choice for the first step is a biorthogonal wavelet transform [Stollnitz et al. 1996]. As a scene consists of two types of components - geometry models and textures - wavelet transforms for both exist. In general a wavelet transform converts a highly detailed function into a coarse version and a sequence of sets of wavelet coefficients representing the details between two adjacent detail steps. Applying the inverse transform successive to the coarse version with the sets of coefficients results in the original function, so progressive transmission is feasible. The coefficients are mostly sparse and the transform and its inverse can be computed in linear time (by using the lifting scheme [Sweldens 1996]). By using float arithmetic, a tradeoff between the quality of the function and the length of the resulting bitstream is possible by selecting proper quantization steps. Due to the relations among the wavelet coefficients at consecutive levels, it is a good decision to split the entropy coding step into two parts. At first, zerotree coding [Shapiro 1993] is done, which compresses the coefficients by taking care of these relations. The resulting bitstream is then processed by an arithmetic coder [Moffat and Witten 1998] removing remaining statistical redundancy. A popular modeling technique are B-spline surfaces and their generalization - surfaces defined by meshes with Catmull-Clark connectivity [Catmull and Clark 1978]. There already exist wavelet transforms for both of them [Bertram et al. 2000]. In the present paper, we present a new zerotree coding scheme for compressing the resulting wavelet coefficients. As a result, these modeling techniques can be used within the described progressive compression scheme. In addition, we describe a system architecture, which implements this scheme in a web-based environment. The next section reflects existing work. Section three contains the new zerotree coding scheme for B-spline and Catmull-Clark surfaces. The architecture of a web-based, progressive geometry transmission system is described in section four. Finally, section five summarizes some numerical results and section six concludes our work. 2 Related Work There exists a variety of systems implementing web-based geometry transmission: Cult 3D [Cycore 2004], Macromedia Shockwave 3D [Macromedia 2004] and Viewpoint VET [Viewpoint 2004] are proprietary products, VRML [Web3D-Consortium 1997] and X3D [Web3D-Consortium 2003] are open standards. Partially they support progressive transmission, but according to our state of knowledge none of them uses a wavelet-based compression scheme. A popular system that uses a wavelet-based and zerotree-based compression scheme is the AFX part of MPEG-4 [MPEG 2004]. [Grabner 2003] describes a client/server multiresolution rendering system for progressive transmission and visualization of compressed nonmanifold triangle meshes. [Chen et al. 2003] shows a mechanism for transmitting geometry over lossy networks, transmitting only important details in a lossless way. An overview on several single and multi-resolution polygonal mesh compressing schemes is given by [Taubin 1999]. Early examples for geometry compression methods are the works from Deering [Deering 1995] and Taubin et al. [Taubin and Rossignac 1998], but they are not progressive. A first progressive method was developed by Hoppe [Hoppe 1996], whose main idea is to divide up a mesh into a coarse version and a set of vertex split functions. A progressive geometry compression scheme basing on the wavelet transform is described by [Khodakovsky et al. 2000]. An introduction on wavelets for computer graphics is given by [Stollnitz et al. 1996]. [Tao and Moorehead 1994] give an overview on progressive transmission using the wavelet transform and describe a biorthogonal wavelet transform for regular meshes. Important works are the Lifting Scheme described by Sweldens [Sweldens 1996] and the wavelet construction for subdivision surfaces described by Lounsbery [Lounsbery 1997]. A highly efficient biorthogonal wavelet transform for B-spline and Catmull-Clark surfaces [Catmull and Clark 1978] is described by Bertram [Bertram 2000] and Bertram et al. [Bertram et al. 2000]. An adequate wavelet transform for surfaces using loop-subdivision on a triangle mesh is described by [Khodakovsky et al. 2000]. [Abasolo and Perales 2003] demonstrate a wavelet analysis for terrain models dealing with both geometry and textures. Textures may be compressed by the wavelet transform contained within the JPEG 2000 [JPE 2000] standard. The zerotree coding scheme is described by [Shapiro 1993] and improved by [Said and Pearlman 1996]. The idea of zerotree coding to replace a tree of coefficients by a single symbol is adapted to coefficients resulting from the wavelet transform of triangle surfaces by Khodakovsky et al. [Khodakovsky et al. 2000]. A good overview on arithmetic coding is given by Moffat and Witten [Moffat and Witten 1998]. [Khodakovsky et al. 2000] and the general idea of a compression scheme described by Hilton et al. [Hilton et al. 1994] serve as an archetype for the compression scheme described in our paper. We present a zerotree coding scheme for coefficients resulting from the wavelet transform of B-spline and Catmull-Clark surfaces on the one side. Furthermore, we describe a system architecture implementing web-based progressive geometry compression that includes wavelet transform, zerotree coding and arithmetic coding. 3 Zerotree Coding of Meshes The original zerotree coder [Shapiro 1993] compresses coefficients resulting from a tensor-product wavelet transform of bitmap images. An analysis step generates LL-, HL-, LH- and HHcoefficients, in which the set of LL-coefficients represents a coarser version that can be further analyzed. The coefficients are arranged in rectangles, subdivided into four at every analysis step. Furthermore a forest is constructed in a way that the coefficients of the final analysis step are its roots (figure 2). A coefficient of type x {HL,LH,HH} at position (i, j) is associated with the father node of the coefficients of type x in the previous analysis step at positions (2i,2 j), (2i + 1,2 j), (2i,2 j + 1), (2i + 1,2 j + 1). The resulting forest consists of regular quad-trees. The zerotree coder
3 LL LH HL HH HL LH HH Figure 3: Example for Catmull-Clark subdivision. Figure 2: Coefficient structure of the original zerotree coder. uses the facts that small values are less crucial for the quality of the reconstructed function than large ones, and that coefficients close to leafs tend to be small. Coding is done per bitplane, hence most of the signal energy is within a prefix of the generated bitstream. If the bit associated with the actual bitplane of a coefficient is zero and the corresponding bits of all descendant coefficients are zero too, a special zerotree symbol is sent. The original zerotree coder consists of two parts. The first part contains the algorithms performing the coding process, the second part contains the forest structure of the coefficients. While the forest structure depends strongly on the coefficient structure and the previous performed wavelet transform, the coding algorithms are independent from those. So it is reasonable to split up the zerotree coder into two architectural units, consisting of algorithms and forest structure. The coding algorithms have to access the forest structure, hence an interface has to be defined (table 2). As a result of this partitioning, it is possible to substitute the forest structure resulting from a tensor-product wavelet transform of bitmap images by forest structures resulting from other wavelet transforms, while the coding algorithms are unmodified. Those forest structures have to satisfy two condition in order to make the zerotree coder work: 1. Coefficients have to be ordered in a forest in a way that child coefficients refine a part of the function, which has already been refined by their parents. So the probability for the existence of many zerotrees is high, since most details are compacted into coefficients corresponding to coarse levels of detail. 2. The forest and the order of processing coefficients needs to be known both by the encoder and by the decoder. Hence, it is possible to assign the sent or received bits to corresponding coefficients. We construct a forest structure suitable for coefficients resulting from B-spline and Catmull-Clark surfaces. A Catmull-Clark surface is generated by successive subdividing a polyhedral base mesh of arbitrary two-manifold topology by using corresponding subdivision rules [Catmull and Clark 1978]. A B-spline surface is a special case of a Catmull-Clark surface with rectangular base mesh. Among the corresponding wavelet transform [Bertram et al. 2000], the vertex coordinates serve as coefficients. A synthesis step (figure 3) adds new vertices from wavelet coefficients for every edge (e-coefficients) and for every face (fcoefficients) and actualizes all vertices according to given rules. Old vertices are denoted as v-vertices. Every edge is substituted by three (if the old edge is at the border) or four (otherwise) new edges. Every face is substituted by n new faces, in which n represents the number of incident vertices of the old face. An analysis step manipulates all vertices according to given rules and declines the substitution of vertices, edges and faces of a synthesis step. Removed vertices are stored as wavelet coefficients. The operations manipulating vertices are implemented by simple local lifting steps. The wavelets of the transform are bicubic biorthogonal B-spline wavelets. In the case of a rectangular base mesh, a tensor product of the one-dimensional wavelet transform is used. In the case of an arbitrary base mesh, two modifications are made. At first, the order of computation is changed in such a way that every vertex is changed only one time within a lifting step. Furthermore the computation of averages is generalized to more than four input values: a b represents the average of all vertices of type a adjacent to a vertex of type b. Synthesis operations arise by using following lifting steps in the order s li ft( 8 3), w li ft( 2 1), s li ft( 2 1), s scale( 2 1 ). Analysis operators result by inverting the synthesis operators and their order of computation. s lift(a) : v v+4a 2 f v + 4a e v (1) e e+2a f e (2) w lift(a) : f f + 4a 2 v f + 4a e f (3) e e+2a v e (4) s scale(a) : v a 2 v (5) e a e (6) Finally, it is feasible to integrate features as sharp vertices and edges by manipulating these rules [Bertram et al. 2000]. We now describe the construction of the coefficient forest structure for the zerotree coder (figure 4). At first, the coefficients of the first synthesis step serve as the roots of our forest. To determine parent-child relations we apply following rules: 1. E denotes an edge, for which an e-coefficient is added in a synthesis step. This e-coefficient is associated with the father node of those coefficients introduced for the edges substituting E in the next synthesis step. 2. F denotes a face, for which a f-coefficient is added in a synthesis step. This f-coefficient is associated with the father node of those coefficients introduced for the faces substituting F in the next synthesis step. Every e-coefficient of the resulting forest has three (if the corresponding edge is at the border) or four (otherwise) descendants. Furthermore every f-coefficient of the first step has as many descendants as its corresponding face has incident vertices and every f-coefficient of further steps has four descendants (due to the fact that Catmull-Clark subdivision produces only quadrilateral faces after the first step). In the special case of B-spline surfaces even f-coefficients of the first step have four descendants. Our construction is suitable for zerotree coding, due to the relations defined above. At first, a coefficient refines a part of the surface that
4 Figure 4: Example for a forest of coefficients resulting from a wavelet transform of a Catmull-Clark surface; f-vertices: {1... 4}, e-vertices: {5... 9, }, f-vertices: { , }. has already been refined by its parents, if the corresponding face is located within the parent s associated face. In a system consisting of transmitter and receiver, the base mesh is sent at the beginning of transmission. The forest can be generated using this base mesh, so it is available at transmitter and receiver, at zerotree encoder and decoder. The order of processing coefficients may be depth-first. The implementation of the forest can be done in a very memoryefficient way, if only B-spline surfaces are considered. In this case there is no need for storing explicit links between the nodes of the forest, since the structure is regular and father-child relationship is trivial. Storing e-coefficients of vertical edges in a matrix HL, e- coefficients of horizontal edges in a matrix LH and f-coefficients in a matrix HH, computation can be done as described in table 1 (r and c denote the row and the column within a matrix). 4 System Architecture To adapt our transmission system to a concrete web-based scenario, we introduce two sets of parameters. The first one deals with the computation power and the memory capacity needed for receiving and visualizing a scene: The maximal number of visualizable polygons p t. Geometric models are not further refined, if their number of polygons is larger than p t. The maximal number of transmitted coefficient levels p l. If the wavelet transform is perfomed more than p l times, only p l levels are considered for transmission. The frame rate p f for redrawing the scene while receiving it. parent HL (r, c) LH (r, c) HH (r, c) children HL (2r,2c) HL (2r,2c+1) LH (2r 1,2c+1) if r 0 LH (2r,2c+1) if r max LH (2r,2c) LH (2r+ 1,2c) HL (2r+ 1,2c 1) if c 0 HL (2r+ 1,2c) if c max HH (2r,2c) HH (2r,2c+1) HH (2r+ 1,2c) HH (2r+ 1,2c+1) Table 1: Relationship between wavelet coefficients of analyzed B- spline surfaces. The other set of parameters deals with the size of the transmitted bitstream: The maximal volume or duration of transmission c m. If the amount of received bits exceeds c m or the amount of elapsed seconds since the beginning of transmission exceeds c m, transmission is aborted. The number of quantization bits c q. It allows a tradeoff between the resulting quality and the bitstream length. The threshold of the zerotree coder c t. If the euclidean norm of a coefficient is less than the given threshold c t (described as a percentage of the maximal existing euclidean norm), it is set to zero. By specifying a suitable threshold, the length of the bitstream is extremely reduced due to the increased number of zerotrees. These two sets of parameters can be considered as orthogonal since they deal with different aspects of the transmission. Our architecture bases on the classical client-server paradigm that is characterized by an asynchronous initiation of communication by the client. A server component is storing persistently scenes and their elements, a client receives a scene and visualizes it. The distribution of functionality is shown in figure 5. Wavelet analysis is done offline by a converter, so persistent data contains the coarse versions and the wavelet coefficients of scene elements. The first step performed by a server transmitting a scene component is the adaption to given parameter values, in which p l, c q and c t are considered. Afterwards the coarse version is transmitted, followed by the advancing transmission of the zerotree coded and entropy coded coefficients. A client receives the coarse version, followed by the bitstream that is entropy decoded and zerotree decoded. According to a given frequency, wavelet synthesis is done and the result presented to the user. Besides this static points we now examine some dynamical aspects of our architecture. There are two threads within the client implementing progressive reception and visualization of an element. They operate on two data structures: 1. The coarse version C of the element. 2. The sequence of sets of wavelet coefficients W of the element. At first, C is received and all coefficients of W are set to zero. Then the two threads are being started. ThreadLoad receives and decodes the compressed bitstream of the wavelet coefficients and reconstructs the coefficients of W progressively bit by bit. At the end of reception, all coefficients have been created. At the same time,
5 Client Server Converter Interaction Wavelet Synthesis Zerotree Decoder Entropy Decoder Persistent Data Adaption Zerotree Encoder Entropy Encoder Wavelet Analysis Web-Access Web-Access Scene Elements Figure 5: Architecture of our system. ThreadDraw visualizes periodically the scene element. It creates a copy CC of C and performes the wavelet synthesis to CC by using the actual coefficients of W. At the beginning of the reception of W, all coefficients are zero, hence wavelet synthesis corresponds to subdivision. If there occures a transmission error while receiving C, the coarse version is not been received well, hence visualization is not sensible. In contrast transmission errors occuring while receiving W are not disastrous, since at least subdivision of C is possible and so an approximation of the scene element is drawable. One out of four states is assigned with each of both threads: Created: Thread is created and ready for action. Started: Thread is working. Aborted: Thread is aborted either by the user or by a network error. The corresponding scene element may be sufficiently detailed, so there is no need to delete it. Halted: ThreadLoad is halted if the bitstream is completely received or the parameter c m restricts further transmission. ThreadDraw is halted if ThreadLoad is halted and the element has been visualized. It implements the parameters p t and p f. A final aspect of our architecture is the separation of the core system from the implementation of the different types of scene elements, so the system is extensible by further geometry types. This separation is done by defining an abstract interface containing functions performing analysis steps, synthesis steps, and further operations depending on the implementation of the architecture (persistent data format, accessing the net etc.). A further interface (table 2) connects the algorithms of the zerotree coder to the type-depending forest structure, so the algorithms are independent of the forest, hence these algorithms are independent of the forest structure. b Q t PSNR b NC b ZC b AC 8 0% % 63.2% 8 20% % 15.9% 8 40% % 7.8% 8 60% % 5.3% 8 100% % 2.1% 24 0% % 66.8% 24 20% % 12.9% 24 40% % 5.6% 24 60% % 3.6% % % 1.3% Table 3: Quality and transmission volume of a B-spline surface with different parameter values. b Q t PSNR b NC b ZC b AC 8 0% % 92.1% 8 20% % 14.8% 8 40% % 3.9% 8 60% % 0.8% 8 100% % 0.4% 24 0% % 102.3% 24 20% % 11.8% 24 40% % 2.8% 24 60% % 0.5% % % 0.3% Table 4: Quality and transmission volume of a Catmull-Clark surface with different parameter values. parameter values (figure 6 and tables 3, 4). Computation time is extremely small compared to transmission time. The number of quantization bits b Q and the threshold of the zerotree coding algorithm t determine the quality of the transmitted and reconstructed model described by the peak signal to noise ratio (PSNR). Using more quantization bits results in a higher PSNR using a zero threshold. As the threshold is increased, the more signal is lost, nearly independent of the number of quantization bits. The length of the uncompressed bitstream b NC is determined by b Q and the number of vertices. The reduction of this length by zerotree coding is denoted as percentage of b NC by b ZT and its further reduction by arithmetic coding is denoted as percentage of b NC by b AC. The presented zerotree coding scheme leads to great compression results if a threshold is used. The bitstream length roughly halves increasing the threshold from 0% to 20% and from 20% to 40%, since many small coefficients contribute to zerotrees (see tables 3, 4). If the thresholds are too large, the reconstructed models are being distorted. Additionally, an optional texture is assigned to a surface, which is compressed and progressively transmitted by applying the wavelet transform used in the JPEG2000 standard [JPE 2000] and Shapiro s original zerotree coding algorithm [Shapiro 1993]. 5 Results To demonstrate the power of our zerotree coding scheme and the performance of our system, we construct a rectangular B-spline surface consisting of vertices and a cube-shaped Catmull-Clark surface consisting of 3064 vertices, 6144 edges and 3072 faces, both with additive noise representing fine-resolution details. These surfaces are analyzed and transmitted using different transmission 6 Conclusion We described a modular client-server architecture for web-based progressive geometry transmission. The system uses multiple threads on the client s side for parallel decoding and visualization of a scene. Our current implementation supports B-spline surfaces with dyadic refinement and Catmull-Clark surfaces, both carrying additional geometric detail at the individual subdivision levels.
6 function purpose Iterator getroots() Returns the roots of the forest. Iterator getchildren(node n) Returns the children of node n. byte getnodestate(node n) Returns or sets the state s of node n. void setnodestate(node n, byte s) (needed to perform coding) byte getnodelist(node n) Returns or sets the list l of node n. void setnodelist(node n, byte l) (needed to perform coding) boolean getbit(node n, int p) Returns the bit at position p of node n. void setbit(node n, int p, boolean v) Sets the bit at position p of node n to value v. boolean getsign(node n) Returns the sign of node n. void setsign(node n, boolean v) Sets the sign of node n to value v. void create(coarse c) Creates the forest using the coarse version c. Table 2: Interface between zerotree algorithms and forest structure. Standard compression methods are used for optional transmission of textures. Additional geometry types, like progressive triangle meshes, can easily be integrated on demand. In addition, we contributed a progressive zerotree coder for Catmull-Clark surfaces. This way, our system combines biorthogonal wavelet compression with surface geometry of arbitrary topology. Compared to triangle-based methods, the advantage of biorthogonal wavelets is regularity of meshes and highly efficient filtering using pre-defined lifting operations. This way, timeconsuming topological operations like edge collapsing and vertex splitting are avoided. Future work will be directed at extensions of the architecture, for example a manipulated thread system mapping parameter values to transmission properties of whole scenes instead of single elements. Transmission parameters could be automatically determined by the system considering network bandwidth and computational ressources. Furthermore the system could be extended to transmit only those coefficients being important due to the viewers position. References ABASOLO, M. J., AND PERALES, F. J Wavelet analysis for a new multiresolution model for large-scale textured terrains. Proceeding of Computer Graphics, Visualization and Computer Vision (WSCG). BERTRAM, M., DUCHAINEAU, M. A., HAMANN, B., AND JOY, K. I Bicubic subdivision-surface wavelets for large-scale isosurface representation and visualization. IEEE Visualization, , 579. BERTRAM, M Multiresolution Modeling for Scientific Visualization. PhD thesis, University of California, Davis. CATMULL, E., AND CLARK, J Recursively generated b- spline surfaces on arbitrary topological meshes. Computer-Aided Design 10, 6, CHEN, Z., BODENHEIMER, B., AND BARNES, J. F Robust transmission of 3d geometry over lossy networks. Proceeding of the eight international conference on 3D Web technology, CYCORE, Cult3d. DEERING, M Geometry compression. Computer Graphics, GRABNER, M Webcame: A light-weight modular client/server multiresolution rendering system. Proceeding of the eight international conference on 3D Web technology, HILTON, M. L., JAWERTH, B. D., AND SENGUPTA, A Compressing still and moving images. Multimedia Systems 2, 5, HOPPE, H Progressive mesh. ACM SIGGRAPH 1996, JPEG JPEG 2000 Part I Final Committee Draft. KHODAKOVSKY, A., SCHROEDER, P., AND SWELDENS, W Progressive geometry compression. ACM SIGGRAPH 2000, LOUNSBERY, J. M Multiresolution Analysis for Surfaces of Arbitrary Topological Type. PhD thesis, University of Washington. MACROMEDIA, Shockwave3d. MOFFAT, A., AND WITTEN, I Arithmetic coding revisited. ACM Transactions on Information Systems 16, 3, MPEG, Mpeg standards. SAID, A., AND PEARLMAN, W A new fast and efficient image codec based on set partitioning in hierarchical trees. IEEE Transactions on Circuits and Systems for Video Technology 6, 3, SHAPIRO, J Embedded image-coding using zerotrees of wavelet coefficients. IEEE Transactions on Signal Processing 41, 12, STOLLNITZ, E. J., DEROSE, T. D., AND SALESIN, D. H Wavelets for Computer Graphics. Morgan Kaufmann. SWELDENS, W The lifting scheme: A custom-design construction of biorthogonal wavelets. Applied and Computational Harmonic Analysis 3, 2, TAO, H., AND MOOREHEAD, R. J Progressive transmission of scientific data using biorthogonal wavelet transform. Proceedings of Visualization, TAUBIN, G., AND ROSSIGNAC, J Geometry compression through topological surgery. ACM Transactions on Graphics 17, 2, TAUBIN, G d geometry compression and progressive transmission. Eurographics State of the Art Report. VIEWPOINT, Vet.
7 WEB3D-CONSORTIUM, The vrml specification. WEB3D-CONSORTIUM, The extensible 3d specification. X3dAbstractSpecification.
8 Figure 6: B-Spline surface with threshold 0%, 20% (first row), 60%, 100% (second row), Catmull-Clark surface with threshold 0%, 20% (third row), 60%, 100% (fourth row).
Progressive Geometry Compression. Andrei Khodakovsky Peter Schröder Wim Sweldens
Progressive Geometry Compression Andrei Khodakovsky Peter Schröder Wim Sweldens Motivation Large (up to billions of vertices), finely detailed, arbitrary topology surfaces Difficult manageability of such
More informationNormal Mesh Compression
Normal Mesh Compression Andrei Khodakovsky Caltech 549B (e:54, p:45db) 1225B (e:20, p:54db) Igor Guskov Caltech 3037B (e:8.1, p:62db) 18111B (e:1.77, p:75db) original Figure 1: Partial reconstructions
More informationSIGNAL COMPRESSION. 9. Lossy image compression: SPIHT and S+P
SIGNAL COMPRESSION 9. Lossy image compression: SPIHT and S+P 9.1 SPIHT embedded coder 9.2 The reversible multiresolution transform S+P 9.3 Error resilience in embedded coding 178 9.1 Embedded Tree-Based
More informationCSEP 521 Applied Algorithms Spring Lossy Image Compression
CSEP 521 Applied Algorithms Spring 2005 Lossy Image Compression Lossy Image Compression Methods Scalar quantization (SQ). Vector quantization (VQ). DCT Compression JPEG Wavelet Compression SPIHT UWIC (University
More informationFAST AND EFFICIENT SPATIAL SCALABLE IMAGE COMPRESSION USING WAVELET LOWER TREES
FAST AND EFFICIENT SPATIAL SCALABLE IMAGE COMPRESSION USING WAVELET LOWER TREES J. Oliver, Student Member, IEEE, M. P. Malumbres, Member, IEEE Department of Computer Engineering (DISCA) Technical University
More informationModified SPIHT Image Coder For Wireless Communication
Modified SPIHT Image Coder For Wireless Communication M. B. I. REAZ, M. AKTER, F. MOHD-YASIN Faculty of Engineering Multimedia University 63100 Cyberjaya, Selangor Malaysia Abstract: - The Set Partitioning
More informationEmbedded Rate Scalable Wavelet-Based Image Coding Algorithm with RPSWS
Embedded Rate Scalable Wavelet-Based Image Coding Algorithm with RPSWS Farag I. Y. Elnagahy Telecommunications Faculty of Electrical Engineering Czech Technical University in Prague 16627, Praha 6, Czech
More informationWavelet Based Image Compression Using ROI SPIHT Coding
International Journal of Information & Computation Technology. ISSN 0974-2255 Volume 1, Number 2 (2011), pp. 69-76 International Research Publications House http://www.irphouse.com Wavelet Based Image
More informationFingerprint Image Compression
Fingerprint Image Compression Ms.Mansi Kambli 1*,Ms.Shalini Bhatia 2 * Student 1*, Professor 2 * Thadomal Shahani Engineering College * 1,2 Abstract Modified Set Partitioning in Hierarchical Tree with
More informationImage Compression for Mobile Devices using Prediction and Direct Coding Approach
Image Compression for Mobile Devices using Prediction and Direct Coding Approach Joshua Rajah Devadason M.E. scholar, CIT Coimbatore, India Mr. T. Ramraj Assistant Professor, CIT Coimbatore, India Abstract
More informationOptimized Progressive Coding of Stereo Images Using Discrete Wavelet Transform
Optimized Progressive Coding of Stereo Images Using Discrete Wavelet Transform Torsten Palfner, Alexander Mali and Erika Müller Institute of Telecommunications and Information Technology, University of
More informationDefense Technical Information Center Compilation Part Notice
UNCLASSIFIED Defense Technical Information Center Compilation Part Notice ADPO1 1334 TITLE: Progressive Representation, Transmission, and Visualization of 3D Objects DISTRIBUTION: Approved for public release,
More informationCompression of RADARSAT Data with Block Adaptive Wavelets Abstract: 1. Introduction
Compression of RADARSAT Data with Block Adaptive Wavelets Ian Cumming and Jing Wang Department of Electrical and Computer Engineering The University of British Columbia 2356 Main Mall, Vancouver, BC, Canada
More informationA Developer s Survey of Polygonal Simplification algorithms. CS 563 Advanced Topics in Computer Graphics Fan Wu Mar. 31, 2005
A Developer s Survey of Polygonal Simplification algorithms CS 563 Advanced Topics in Computer Graphics Fan Wu Mar. 31, 2005 Some questions to ask Why simplification? What are my models like? What matters
More informationCompression of Normal Meshes
Compression of Normal Meshes Andrei Khodakovsky1 and Igor Guskov2 1 2 Caltech akh@cs.caltech.edu University of Michigan guskov@eecs.umich.edu 263B (e:131, p:38db) 790B (e:37, p:49db) 2788B (e:10, p:60db)
More informationGeometry Compression of Normal Meshes Using Rate-Distortion Algorithms
Eurographics Symposium on Geometry Processing (2003) L. Kobbelt, P. Schröder, H. Hoppe (Editors) Geometry Compression of Normal Meshes Using Rate-Distortion Algorithms Sridhar Lavu, Hyeokho Choi and Richard
More informationWavelet Transform (WT) & JPEG-2000
Chapter 8 Wavelet Transform (WT) & JPEG-2000 8.1 A Review of WT 8.1.1 Wave vs. Wavelet [castleman] 1 0-1 -2-3 -4-5 -6-7 -8 0 100 200 300 400 500 600 Figure 8.1 Sinusoidal waves (top two) and wavelets (bottom
More informationNOWADAYS, 3D models are used in a wider and wider
IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, VOL. 10, NO. 2, MARCH/APRIL 2004 1 Wavelet-Based Progressive Compression Scheme for Triangle Meshes: Wavemesh Sébastien Valette and Rémy Prost,
More informationMulti-View Image Coding in 3-D Space Based on 3-D Reconstruction
Multi-View Image Coding in 3-D Space Based on 3-D Reconstruction Yongying Gao and Hayder Radha Department of Electrical and Computer Engineering, Michigan State University, East Lansing, MI 48823 email:
More informationReview and Implementation of DWT based Scalable Video Coding with Scalable Motion Coding.
Project Title: Review and Implementation of DWT based Scalable Video Coding with Scalable Motion Coding. Midterm Report CS 584 Multimedia Communications Submitted by: Syed Jawwad Bukhari 2004-03-0028 About
More informationMultiresolution Meshes. COS 526 Tom Funkhouser, Fall 2016 Slides by Guskov, Praun, Sweldens, etc.
Multiresolution Meshes COS 526 Tom Funkhouser, Fall 2016 Slides by Guskov, Praun, Sweldens, etc. Motivation Huge meshes are difficult to render store transmit edit Multiresolution Meshes! [Guskov et al.]
More informationWavelet Based Image Compression, Pattern Recognition And Data Hiding
IOSR Journal of Electronics and Communication Engineering (IOSR-JECE) e-issn: 2278-2834,p- ISSN: 2278-8735.Volume 9, Issue 2, Ver. V (Mar - Apr. 2014), PP 49-53 Wavelet Based Image Compression, Pattern
More informationAn Embedded Wavelet Video Coder. Using Three-Dimensional Set. Partitioning in Hierarchical Trees. Beong-Jo Kim and William A.
An Embedded Wavelet Video Coder Using Three-Dimensional Set Partitioning in Hierarchical Trees (SPIHT) Beong-Jo Kim and William A. Pearlman Department of Electrical, Computer, and Systems Engineering Rensselaer
More informationReconstruction PSNR [db]
Proc. Vision, Modeling, and Visualization VMV-2000 Saarbrücken, Germany, pp. 199-203, November 2000 Progressive Compression and Rendering of Light Fields Marcus Magnor, Andreas Endmann Telecommunications
More informationReversible Wavelets for Embedded Image Compression. Sri Rama Prasanna Pavani Electrical and Computer Engineering, CU Boulder
Reversible Wavelets for Embedded Image Compression Sri Rama Prasanna Pavani Electrical and Computer Engineering, CU Boulder pavani@colorado.edu APPM 7400 - Wavelets and Imaging Prof. Gregory Beylkin -
More informationA 3-D Virtual SPIHT for Scalable Very Low Bit-Rate Embedded Video Compression
A 3-D Virtual SPIHT for Scalable Very Low Bit-Rate Embedded Video Compression Habibollah Danyali and Alfred Mertins University of Wollongong School of Electrical, Computer and Telecommunications Engineering
More informationOPTIMIZED MULTIPLE DESCRIPTION SCALAR QUANTIZATION BASED 3D MESH CODING
OPTIMIZED MULTIPLE DESCRIPTION SCALAR QUANTIZATION BASED 3D MESH CODING M. Oguz Bici 1, Gozde Bozdagi Akar 1, Andrey Norkin 2 and Atanas Gotchev 2 1 Middle East Technical University, Ankara, Turkey 2 Department
More informationAn Embedded Wavelet Video Coder Using Three-Dimensional Set Partitioning in Hierarchical Trees (SPIHT)
An Embedded Wavelet Video Coder Using Three-Dimensional Set Partitioning in Hierarchical Trees (SPIHT) Beong-Jo Kim and William A. Pearlman Department of Electrical, Computer, and Systems Engineering Rensselaer
More informationA Image Comparative Study using DCT, Fast Fourier, Wavelet Transforms and Huffman Algorithm
International Journal of Engineering Research and General Science Volume 3, Issue 4, July-August, 15 ISSN 91-2730 A Image Comparative Study using DCT, Fast Fourier, Wavelet Transforms and Huffman Algorithm
More informationECE 533 Digital Image Processing- Fall Group Project Embedded Image coding using zero-trees of Wavelet Transform
ECE 533 Digital Image Processing- Fall 2003 Group Project Embedded Image coding using zero-trees of Wavelet Transform Harish Rajagopal Brett Buehl 12/11/03 Contributions Tasks Harish Rajagopal (%) Brett
More informationIMAGE COMPRESSION USING EMBEDDED ZEROTREE WAVELET
IMAGE COMPRESSION USING EMBEDDED ZEROTREE WAVELET A.M.Raid 1, W.M.Khedr 2, M. A. El-dosuky 1 and Wesam Ahmed 1 1 Mansoura University, Faculty of Computer Science and Information System 2 Zagazig University,
More informationHYBRID TRANSFORMATION TECHNIQUE FOR IMAGE COMPRESSION
31 st July 01. Vol. 41 No. 005-01 JATIT & LLS. All rights reserved. ISSN: 199-8645 www.jatit.org E-ISSN: 1817-3195 HYBRID TRANSFORMATION TECHNIQUE FOR IMAGE COMPRESSION 1 SRIRAM.B, THIYAGARAJAN.S 1, Student,
More informationComparison of EBCOT Technique Using HAAR Wavelet and Hadamard Transform
Comparison of EBCOT Technique Using HAAR Wavelet and Hadamard Transform S. Aruna Deepthi, Vibha D. Kulkarni, Dr.K. Jaya Sankar Department of Electronics and Communication Engineering, Vasavi College of
More informationGeorgios Tziritas Computer Science Department
New Video Coding standards MPEG-4, HEVC Georgios Tziritas Computer Science Department http://www.csd.uoc.gr/~tziritas 1 MPEG-4 : introduction Motion Picture Expert Group Publication 1998 (Intern. Standardization
More informationComplexity Reduction of Catmull-Clark/Loop Subdivision Surfaces
EUROGRAPHICS 2001 / Jonathan C. Roberts Short Presentations Complexity Reduction of Catmull-Clark/Loop Subdivision Surfaces Eskil Steenberg The Interactive Institute, P.O. Box 24081, SE 104 50 Stockholm,
More informationAdvanced Computer Graphics
Advanced Computer Graphics Lecture 2: Modeling (1): Polygon Meshes Bernhard Jung TU-BAF, Summer 2007 Overview Computer Graphics Icon: Utah teapot Polygon Meshes Subdivision Polygon Mesh Optimization high-level:
More informationA New Configuration of Adaptive Arithmetic Model for Video Coding with 3D SPIHT
A New Configuration of Adaptive Arithmetic Model for Video Coding with 3D SPIHT Wai Chong Chia, Li-Minn Ang, and Kah Phooi Seng Abstract The 3D Set Partitioning In Hierarchical Trees (SPIHT) is a video
More informationPERFORMANCE ANAYSIS OF EMBEDDED ZERO TREE AND SET PARTITIONING IN HIERARCHICAL TREE
PERFORMANCE ANAYSIS OF EMBEDDED ZERO TREE AND SET PARTITIONING IN HIERARCHICAL TREE Pardeep Singh Nivedita Dinesh Gupta Sugandha Sharma PG Student PG Student Assistant Professor Assistant Professor Indo
More informationMesh Based Interpolative Coding (MBIC)
Mesh Based Interpolative Coding (MBIC) Eckhart Baum, Joachim Speidel Institut für Nachrichtenübertragung, University of Stuttgart An alternative method to H.6 encoding of moving images at bit rates below
More informationProgressive Compression for Lossless Transmission of Triangle Meshes in Network Applications
Progressive Compression for Lossless Transmission of Triangle Meshes in Network Applications Timotej Globačnik * Institute of Computer Graphics Laboratory for Geometric Modelling and Multimedia Algorithms
More informationAn Embedded Wavelet Video. Set Partitioning in Hierarchical. Beong-Jo Kim and William A. Pearlman
An Embedded Wavelet Video Coder Using Three-Dimensional Set Partitioning in Hierarchical Trees (SPIHT) 1 Beong-Jo Kim and William A. Pearlman Department of Electrical, Computer, and Systems Engineering
More informationREGION-BASED SPIHT CODING AND MULTIRESOLUTION DECODING OF IMAGE SEQUENCES
REGION-BASED SPIHT CODING AND MULTIRESOLUTION DECODING OF IMAGE SEQUENCES Sungdae Cho and William A. Pearlman Center for Next Generation Video Department of Electrical, Computer, and Systems Engineering
More informationFPGA IMPLEMENTATION OF BIT PLANE ENTROPY ENCODER FOR 3 D DWT BASED VIDEO COMPRESSION
FPGA IMPLEMENTATION OF BIT PLANE ENTROPY ENCODER FOR 3 D DWT BASED VIDEO COMPRESSION 1 GOPIKA G NAIR, 2 SABI S. 1 M. Tech. Scholar (Embedded Systems), ECE department, SBCE, Pattoor, Kerala, India, Email:
More informationFast Progressive Image Coding without Wavelets
IEEE DATA COMPRESSION CONFERENCE SNOWBIRD, UTAH, MARCH 2000 Fast Progressive Image Coding without Wavelets Henrique S. Malvar Microsoft Research One Microsoft Way, Redmond, WA 98052 malvar@microsoft.com
More informationsignal-to-noise ratio (PSNR), 2
u m " The Integration in Optics, Mechanics, and Electronics of Digital Versatile Disc Systems (1/3) ---(IV) Digital Video and Audio Signal Processing ƒf NSC87-2218-E-009-036 86 8 1 --- 87 7 31 p m o This
More informationMesh Decimation Using VTK
Mesh Decimation Using VTK Michael Knapp knapp@cg.tuwien.ac.at Institute of Computer Graphics and Algorithms Vienna University of Technology Abstract This paper describes general mesh decimation methods
More informationError Protection of Wavelet Coded Images Using Residual Source Redundancy
Error Protection of Wavelet Coded Images Using Residual Source Redundancy P. Greg Sherwood and Kenneth Zeger University of California San Diego 95 Gilman Dr MC 47 La Jolla, CA 9293 sherwood,zeger @code.ucsd.edu
More information3-Dimensional Object Modeling with Mesh Simplification Based Resolution Adjustment
3-Dimensional Object Modeling with Mesh Simplification Based Resolution Adjustment Özgür ULUCAY Sarp ERTÜRK University of Kocaeli Electronics & Communication Engineering Department 41040 Izmit, Kocaeli
More informationA Multiresolutional Approach for Facial Motion Retargetting Using Subdivision Wavelets
A Multiresolutional Approach for Facial Motion Retargetting Using Subdivision Wavelets Kyungha Min and Moon-Ryul Jung Dept. of Media Technology, Graduate School of Media Communications, Sogang Univ., Seoul,
More informationSpectral Coding of Three-Dimensional Mesh Geometry Information Using Dual Graph
Spectral Coding of Three-Dimensional Mesh Geometry Information Using Dual Graph Sung-Yeol Kim, Seung-Uk Yoon, and Yo-Sung Ho Gwangju Institute of Science and Technology (GIST) 1 Oryong-dong, Buk-gu, Gwangju,
More informationJBEAM: Coding Lines and Curves via Digital Beamlets
JBEAM: Coding Lines and Curves via Digital Beamlets Xiaoming Huo, Jihong Chen David L. Donoho School of ISyE, 765 Ferst Dr. Department of Statistics Georgia Institute of Technology Stanford University
More informationNew Perspectives on Image Compression
New Perspectives on Image Compression Michael Thierschmann, Reinhard Köhn, Uwe-Erik Martin LuRaTech GmbH Berlin, Germany Abstract Effective Data compression techniques are necessary to deal with the increasing
More informationSubdivision curves and surfaces. Brian Curless CSE 557 Fall 2015
Subdivision curves and surfaces Brian Curless CSE 557 Fall 2015 1 Reading Recommended: Stollnitz, DeRose, and Salesin. Wavelets for Computer Graphics: Theory and Applications, 1996, section 6.1-6.3, 10.2,
More informationSPIHT-BASED IMAGE ARCHIVING UNDER BIT BUDGET CONSTRAINTS
SPIHT-BASED IMAGE ARCHIVING UNDER BIT BUDGET CONSTRAINTS by Yifeng He A thesis submitted in conformity with the requirements for the degree of Master of Applied Science, Graduate School of Electrical Engineering
More informationGeometry-guided Progressive Lossless 3D Mesh Coding with Octree (OT) Decomposition
Geometry-guided Progressive Lossless 3D Mesh Coding with Octree (OT) Decomposition Jingliang Peng C.-C. Jay Kuo University of Southern California Plant06_s 1.0 bpv, 2% 4.0 bpv, 8% Feline 2.0 bpv, 4% 8.1
More informationEFFICIENTLY representing two-manifold geometries, like
326 IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, VOL. 10, NO. 3, MAY/JUNE 2004 Generalized B-Spline Subdivision-Surface Wavelets for Geometry Compression Martin Bertram, Mark A. Duchaineau,
More informationANALYSIS OF SPIHT ALGORITHM FOR SATELLITE IMAGE COMPRESSION
ANALYSIS OF SPIHT ALGORITHM FOR SATELLITE IMAGE COMPRESSION K Nagamani (1) and AG Ananth (2) (1) Assistant Professor, R V College of Engineering, Bangalore-560059. knmsm_03@yahoo.com (2) Professor, R V
More informationVideo Compression An Introduction
Video Compression An Introduction The increasing demand to incorporate video data into telecommunications services, the corporate environment, the entertainment industry, and even at home has made digital
More informationA COMPRESSION TECHNIQUES IN DIGITAL IMAGE PROCESSING - REVIEW
A COMPRESSION TECHNIQUES IN DIGITAL IMAGE PROCESSING - ABSTRACT: REVIEW M.JEYAPRATHA 1, B.POORNA VENNILA 2 Department of Computer Application, Nadar Saraswathi College of Arts and Science, Theni, Tamil
More information1. Introduction. 2. Parametrization of General CCSSs. 3. One-Piece through Interpolation. 4. One-Piece through Boolean Operations
Subdivision Surface based One-Piece Representation Shuhua Lai Department of Computer Science, University of Kentucky Outline. Introduction. Parametrization of General CCSSs 3. One-Piece through Interpolation
More informationJPEG 2000 compression
14.9 JPEG and MPEG image compression 31 14.9.2 JPEG 2000 compression DCT compression basis for JPEG wavelet compression basis for JPEG 2000 JPEG 2000 new international standard for still image compression
More informationEmbedded Descendent-Only Zerotree Wavelet Coding for Image Compression
Embedded Descendent-Only Zerotree Wavelet Coding for Image Compression Wai Chong Chia, Li-Minn Ang, and Kah Phooi Seng Abstract The Embedded Zerotree Wavelet (EZW) coder which can be considered as a degree-0
More informationVisually Improved Image Compression by using Embedded Zero-tree Wavelet Coding
593 Visually Improved Image Compression by using Embedded Zero-tree Wavelet Coding Janaki. R 1 Dr.Tamilarasi.A 2 1 Assistant Professor & Head, Department of Computer Science, N.K.R. Govt. Arts College
More informationBit-Plane Decomposition Steganography Using Wavelet Compressed Video
Bit-Plane Decomposition Steganography Using Wavelet Compressed Video Tomonori Furuta, Hideki Noda, Michiharu Niimi, Eiji Kawaguchi Kyushu Institute of Technology, Dept. of Electrical, Electronic and Computer
More informationLocal Modification of Subdivision Surfaces Based on Curved Mesh
Local Modification of Subdivision Surfaces Based on Curved Mesh Yoshimasa Tokuyama Tokyo Polytechnic University tokuyama@image.t-kougei.ac.jp Kouichi Konno Iwate University konno@cis.iwate-u.ac.jp Junji
More informationImage Compression Algorithm and JPEG Standard
International Journal of Scientific and Research Publications, Volume 7, Issue 12, December 2017 150 Image Compression Algorithm and JPEG Standard Suman Kunwar sumn2u@gmail.com Summary. The interest in
More informationDIGITAL IMAGE PROCESSING WRITTEN REPORT ADAPTIVE IMAGE COMPRESSION TECHNIQUES FOR WIRELESS MULTIMEDIA APPLICATIONS
DIGITAL IMAGE PROCESSING WRITTEN REPORT ADAPTIVE IMAGE COMPRESSION TECHNIQUES FOR WIRELESS MULTIMEDIA APPLICATIONS SUBMITTED BY: NAVEEN MATHEW FRANCIS #105249595 INTRODUCTION The advent of new technologies
More informationDCT Coefficients Compression Using Embedded Zerotree Algorithm
DCT Coefficients Compression Using Embedded Zerotree Algorithm Dr. Tawfiq A. Abbas and Asa'ad. Hashim Abstract: The goal of compression algorithms is to gain best compression ratio with acceptable visual
More informationInternational Journal of Emerging Technology and Advanced Engineering Website: (ISSN , Volume 2, Issue 4, April 2012)
A Technical Analysis Towards Digital Video Compression Rutika Joshi 1, Rajesh Rai 2, Rajesh Nema 3 1 Student, Electronics and Communication Department, NIIST College, Bhopal, 2,3 Prof., Electronics and
More informationModule 8: Video Coding Basics Lecture 42: Sub-band coding, Second generation coding, 3D coding. The Lecture Contains: Performance Measures
The Lecture Contains: Performance Measures file:///d /...Ganesh%20Rana)/MY%20COURSE_Ganesh%20Rana/Prof.%20Sumana%20Gupta/FINAL%20DVSP/lecture%2042/42_1.htm[12/31/2015 11:57:52 AM] 3) Subband Coding It
More information3D Point Cloud Data and Triangle Face Compression by a Novel Geometry Minimization Algorithm and Comparison with other 3D Formats
3D Point Cloud Data and Triangle Face Compression by a Novel Geometry Minimization Algorithm and Comparison with other 3D Formats SIDDEQ, M.M. and RODRIGUES, Marcos
More informationPostprocessing of Compressed 3D Graphic Data
Journal of Visual Communication and Image Representation 11, 80 92 (2000) doi:10.1006/jvci.1999.0430, available online at http://www.idealibrary.com on Postprocessing of Compressed 3D Graphic Data Ka Man
More informationEXPLORING ON STEGANOGRAPHY FOR LOW BIT RATE WAVELET BASED CODER IN IMAGE RETRIEVAL SYSTEM
TENCON 2000 explore2 Page:1/6 11/08/00 EXPLORING ON STEGANOGRAPHY FOR LOW BIT RATE WAVELET BASED CODER IN IMAGE RETRIEVAL SYSTEM S. Areepongsa, N. Kaewkamnerd, Y. F. Syed, and K. R. Rao The University
More informationCHAPTER 6. 6 Huffman Coding Based Image Compression Using Complex Wavelet Transform. 6.3 Wavelet Transform based compression technique 106
CHAPTER 6 6 Huffman Coding Based Image Compression Using Complex Wavelet Transform Page No 6.1 Introduction 103 6.2 Compression Techniques 104 103 6.2.1 Lossless compression 105 6.2.2 Lossy compression
More informationCompressing Texture Coordinates with Selective Linear Predictions
Compressing Texture Coordinates with Selective Linear Predictions Martin Isenburg Jack Snoeyink University of North Carolina at Chapel Hill Abstract large and detailed models this representation results
More informationGeometric Modeling. Bing-Yu Chen National Taiwan University The University of Tokyo
Geometric Modeling Bing-Yu Chen National Taiwan University The University of Tokyo Surface Simplification Motivation Basic Idea of LOD Discrete LOD Continuous LOD Simplification Problem Characteristics
More informationUsing Semi-Regular 4 8 Meshes for Subdivision Surfaces
Using Semi-Regular 8 Meshes for Subdivision Surfaces Luiz Velho IMPA Instituto de Matemática Pura e Aplicada Abstract. Semi-regular 8 meshes are refinable triangulated quadrangulations. They provide a
More informationLow-complexity video compression based on 3-D DWT and fast entropy coding
Low-complexity video compression based on 3-D DWT and fast entropy coding Evgeny Belyaev Tampere University of Technology Department of Signal Processing, Computational Imaging Group April 8, Evgeny Belyaev
More informationDigital Image Steganography Techniques: Case Study. Karnataka, India.
ISSN: 2320 8791 (Impact Factor: 1.479) Digital Image Steganography Techniques: Case Study Santosh Kumar.S 1, Archana.M 2 1 Department of Electronicsand Communication Engineering, Sri Venkateshwara College
More informationColor Image Compression Using EZW and SPIHT Algorithm
Color Image Compression Using EZW and SPIHT Algorithm Ms. Swati Pawar 1, Mrs. Adita Nimbalkar 2, Mr. Vivek Ugale 3 swati.pawar@sitrc.org 1, adita.nimbalkar@sitrc.org 2, vivek.ugale@sitrc.org 3 Department
More informationImage Segmentation Techniques for Object-Based Coding
Image Techniques for Object-Based Coding Junaid Ahmed, Joseph Bosworth, and Scott T. Acton The Oklahoma Imaging Laboratory School of Electrical and Computer Engineering Oklahoma State University {ajunaid,bosworj,sacton}@okstate.edu
More informationPhysically-Based Modeling and Animation. University of Missouri at Columbia
Overview of Geometric Modeling Overview 3D Shape Primitives: Points Vertices. Curves Lines, polylines, curves. Surfaces Triangle meshes, splines, subdivision surfaces, implicit surfaces, particles. Solids
More informationA Study of Image Compression Based Transmission Algorithm Using SPIHT for Low Bit Rate Application
Buletin Teknik Elektro dan Informatika (Bulletin of Electrical Engineering and Informatics) Vol. 2, No. 2, June 213, pp. 117~122 ISSN: 289-3191 117 A Study of Image Compression Based Transmission Algorithm
More informationA QUAD-TREE DECOMPOSITION APPROACH TO CARTOON IMAGE COMPRESSION. Yi-Chen Tsai, Ming-Sui Lee, Meiyin Shen and C.-C. Jay Kuo
A QUAD-TREE DECOMPOSITION APPROACH TO CARTOON IMAGE COMPRESSION Yi-Chen Tsai, Ming-Sui Lee, Meiyin Shen and C.-C. Jay Kuo Integrated Media Systems Center and Department of Electrical Engineering University
More informationAdaptive Quantization for Video Compression in Frequency Domain
Adaptive Quantization for Video Compression in Frequency Domain *Aree A. Mohammed and **Alan A. Abdulla * Computer Science Department ** Mathematic Department University of Sulaimani P.O.Box: 334 Sulaimani
More informationSpirale Reversi: Reverse decoding of the Edgebreaker encoding
Spirale Reversi: Reverse decoding of the Edgebreaker encoding Martin Isenburg Jack Snoeyink University of North Carolina at Chapel Hill fisenburg j snoeyinkg@cs.unc.edu Abstract We present a simple linear
More informationLossless Compression of Floating-Point Geometry
Preprint UCRL-CONF-204158 Lossless Compression of Floating-Point Geometry M. Isenburg, P. Lindstrom, and J. Snoeyink To appear in CAD 04, Pattaya City, Thailand, May 24 28, 2004 April 30, 2004 U.S. Department
More informationStereo Image Compression
Stereo Image Compression Deepa P. Sundar, Debabrata Sengupta, Divya Elayakumar {deepaps, dsgupta, divyae}@stanford.edu Electrical Engineering, Stanford University, CA. Abstract In this report we describe
More informationIMAGE COMPRESSION USING HYBRID TRANSFORM TECHNIQUE
Volume 4, No. 1, January 2013 Journal of Global Research in Computer Science RESEARCH PAPER Available Online at www.jgrcs.info IMAGE COMPRESSION USING HYBRID TRANSFORM TECHNIQUE Nikita Bansal *1, Sanjay
More informationDynamic Point Cloud Compression for Free Viewpoint Video
MITSUBISHI ELECTRIC RESEARCH LABORATORIES http://www.merl.com Dynamic Point Cloud Compression for Free Viewpoint Video Edouard Lamboray, Michael Waschbusch, Stephan Wurmlin, Hanspeter Pfister, Markus Gross
More informationOpen Access Compression Algorithm of 3D Point Cloud Data Based on Octree
Send Orders for Reprints to reprints@benthamscience.ae The Open Automation and Control Systems Journal, 2015, 7, 879-883 879 Open Access Compression Algorithm of 3D Point Cloud Data Based on Octree Dai
More informationMEDICAL IMAGE COMPRESSION USING REGION GROWING SEGMENATION
MEDICAL IMAGE COMPRESSION USING REGION GROWING SEGMENATION R.Arun, M.E(Ph.D) Research scholar M.S University Abstract: The easy, rapid, and reliable digital transmission and storage of medical and biomedical
More informationScalable Compression and Transmission of Large, Three- Dimensional Materials Microstructures
Scalable Compression and Transmission of Large, Three- Dimensional Materials Microstructures William A. Pearlman Center for Image Processing Research Rensselaer Polytechnic Institute pearlw@ecse.rpi.edu
More informationA combined fractal and wavelet image compression approach
A combined fractal and wavelet image compression approach 1 Bhagyashree Y Chaudhari, 2 ShubhanginiUgale 1 Student, 2 Assistant Professor Electronics and Communication Department, G. H. Raisoni Academy
More informationA Real-time Rendering Method Based on Precomputed Hierarchical Levels of Detail in Huge Dataset
32 A Real-time Rendering Method Based on Precomputed Hierarchical Levels of Detail in Huge Dataset Zhou Kai, and Tian Feng School of Computer and Information Technology, Northeast Petroleum University,
More informationUsing Shift Number Coding with Wavelet Transform for Image Compression
ISSN 1746-7659, England, UK Journal of Information and Computing Science Vol. 4, No. 3, 2009, pp. 311-320 Using Shift Number Coding with Wavelet Transform for Image Compression Mohammed Mustafa Siddeq
More informationWavelet-based Contourlet Coding Using an SPIHT-like Algorithm
Wavelet-based Contourlet Coding Using an SPIHT-like Algorithm Ramin Eslami and Hayder Radha ECE Department, Michigan State University, East Lansing, MI 4884, USA Emails: {eslamira, radha}@egr.msu.edu Abstract
More informationEFFICIENT METHODS FOR ENCODING REGIONS OF INTEREST IN THE UPCOMING JPEG2000 STILL IMAGE CODING STANDARD
EFFICIENT METHODS FOR ENCODING REGIONS OF INTEREST IN THE UPCOMING JPEG2000 STILL IMAGE CODING STANDARD Charilaos Christopoulos, Joel Askelöf and Mathias Larsson Ericsson Research Corporate Unit Ericsson
More informationView-dependent Polygonal Simplification
View-dependent Polygonal Simplification Pekka Kuismanen HUT pkuisman@cc.hut.fi Abstract This paper describes methods for view-dependent simplification of polygonal environments. A description of a refinement
More informationA Low-power, Low-memory System for Wavelet-based Image Compression
A Low-power, Low-memory System for Wavelet-based Image Compression James S. Walker Department of Mathematics University of Wisconsin Eau Claire Truong Q. Nguyen Department of Electrical and Computer Engineering
More information