Viewpoint adaptation, or 'look-around' capability, is likely to be vital to the success of future immersive multimedia services such as 3D video-conferencing, virtual reality and 3DTV. This paper proposes a low complexity and efficient compression system for multiview images using quadtree disparity estimation and multiview synthesis. Previous approaches to the problem have generally involved t...

An adaptive algorithm is presented for converting the quadtree representation of a binary image to its chain code representation. Our algorithm has the advantage of constructing the chain codes of the resulting quadtree of the Boolean operation of two quadtrees by re-using the original chain codes. This algorithm is adaptive because it can adjust the total number of internal nodes to be stored ...

In the social media age, content creation and distribution of all sorts of digital media is of growing importance. The variety of media types, devices, and user groups results in the generated media items being stored in a very heterogeneous landscape which can be seen as a large distributed database consisting of personal computers, mobile devices, or web servers of social media sites, demandi...

The quadtree and the bintree data structures are two variants on the principle of hierarchical regular decomposition applied to image representation. A comparison of the storage requirements for images represented by these two methods is presented. The relative storage efficiency of quadand bintrees is determined by two factors: the relative node sizes for the two representations as determined ...

In this paper, data model and structure of the 3D road model, which is constructed by Constrained Delaunay Triangles (CDT) and integrated with terrain model, are proposed first, and the method of judging the maximum angle was used to build the triangle net. Considering the characters of strip-distributed and data volume of highway, the following two methods are developed to enhance the 3D roami...

This paper addresses the problem of efficient image retrieval from a compressed image database, using information derived from the compression process. Images in the database are compressed applying two approaches: Vector Quantization (VQ) and Quadtree image decomposition. Both are based on Konohen’s Self-Organizing Feature Maps (SOFM) for creating vector quantization codebooks. However, while ...

Images are full of information and most often, little information is desired for subsequent processing. Hence, region of interest has key importance in image processing. Quadtree image segmentation has been widely used in many image processing applications to locate the region of interest for further processing. There are also variable block-size image coding techniques to effectively reduce th...

Region Quadtrees and Bintrees are two structures used in GIS and spatial databases. The expected space performances of these two trees are presented and compared. Analysis is based on the general assumption that the storage requirements of internal and external nodes differ, as well as on a parametric model of binarv random images. Initiallv. formulae that exnress the averaee total storage perf...

The status of an ongoing research effort to develop a geographic information system based on a variant of the linear quadtree is presented. This system uses quadtree encodings for storing area, point and line features. Recent enhancements to the system are presented in detail. This includes a new hierarchical data structure for storing linear features that represents straight lines exactly and ...

Terrain LOD algorithm is a dynamic and local dough sheet subduction algorithm. On the basis of the research on traditional quadtree algorithm, this paper proposed a new terrain LOD algorithm using quadtree. On deviation computing standard, besides static deviation and view distance, motion vector and observation vector are introduced, which made the result of deviation computing close to the ac...