نتایج جستجو برای: 2 quadtree

تعداد نتایج: 2526286  

2001
J. R. Ordóñez G. Cazuguel J. Puentes B. Solaiman J. M. Cauvin C. Roux

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 ...

2014
Z. F. Muhsin A. Rehman A. Altameem T. Saba M. Uddin

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...

Journal: :Inf. Syst. 1994
Michael Vassilakopoulos Yannis Manolopoulos

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...

Journal: :Image Vision Comput. 1987
Hanan Samet C. A. Shatter Randal C. Nelson Y.-G. Huang Kikuo Fujimura A. Rosenteld

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 ...

2003
Xingsong Hou Guizhong Liu

In this paper, we present a wavelet packet image coding algorithm based on quadtree classification and UTCQ. It is composed of four parts: (1) wavelet packet decomposition and best basis selection based on a new cost function, (2) a quadtree classification procedure, used to classify the wavelet packet coefficients into two sets: a significant one and an insignificant one, (3) the universal tre...

Journal: :JSW 2010
Jian Wu Yuanfeng Yang Shengrong Gong Zhiming Cui

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...

2002
Xu Qing Zhang Baoming Tan

In the field of terrain visualization, the most efficient tool for real time rendering of complex landscape is level of detail (LOD) technique. In this paper, an optimization quadtree-based algorithm for dynamic generation continuous levels of a given complex landscape in real time is developed. In this algorithm, the conception of view-dependent is introduced, the fast searching algorithm for ...

1997
Sanjeev Mehrotra

In this paper we present algorithms for performing adaptive vector quantization with memory. By using memory between adjacent blocks which are encoded, we can take advantage of the correlation between adjacent blocks of pixels to reduce redundancy. We use either nite state vector quantization or predictive vector quantization to provide the memory. To further improve performance by exploiting n...

Journal: :J. Inf. Sci. Eng. 2010
Chi-Yen Huang Yu-Wei Chen

The paper presents a novel method for encoding the linear quadtree of a given image. In this method, the pixels of the image are scanned in row major order. In each encountered pixel, the result codes in the linear quadtree are updated simultaneously in real time. The linear quadtree is thus obtained after all pixels are processed. This method is quite different from those in previous studies, ...

1999
MICHAEL VASSILAKOPOULOS YANNIS MANOLOPOULOS

The External Balanced Regular (x-BR) Trees constitute a family of new secondary memory structures which are suitable for storing and indexing multi-dimensional points and line segments. In 2 dimensions, the resulting structure is an External Balanced Quadtree, in 3 dimensions an External Balances Octtree, and in higher dimensions an External Balanced Hyper-quadtree. The main characteristic of a...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید