This paper presents a Rate-Distortion analysis for a simple horizon edge image model. A quadtree with anisotropy and rotation is performed on this kind of image, giving a toy model for a non-linear adaptive coding technique, and its Rate-Distortion behavior is studied. The effect of refining the quadtree decomposition is also analyzed.

We present an efficient algorithm called the Quadtree Heuristic for identifying a list of similar terms for each unique term in a large document collection. Term similarity is defined using the Expected Mutual Information Measure (EMIM). Since our aim for defining the similarity lists is to improve information retrieval (IR), we present the outcome of an experiment comparing the performance of ...

In this paper, a fast path planning method by optimization of a path graph for both efficiency and accuracy is proposed. A conventional quadtree-based path planning approach is simple, robust, and efficient. However, it has two limitations. The first limitation is that many small cells are required to represent obstacles because the positions and shapes of the cells are not object-dependent and...

WU, W.; SANCHEZ, A., and ZHANG, M., 2011. An Implicit 2-D Shallow Water Flow Model on Unstructured Quadtree Rectangular Mesh. In: Roberts, T.M., Rosati, J.D., and Wang, P. (eds.), Proceedings, Symposium to Honor Dr. Nicholas C. Kraus, Journal of Coastal Research, Special Issue, No. 59, pp. 15-26. West Palm Beach (Florida), ISSN 0749-0208. An implicit finite volume scheme is developed to solve t...

Extended Abstract Wavelet packets 14] represent a generalization of the method of multires-olution decomposition and comprise the entire family of subband coded (tree) decompositions 11, 15]. Whereas in the wavelet case the decomposition is applied recursively to the coarse scale approximations (leading to the well known (pyramidal) wavelet decomposition tree), in the wavelet packet decompositi...

This paper presents an efficient simplification method for regular meshes obtained with a binary subdivision scheme. Our mesh connectivity is constrained with a quadtree data structure. We propose a quadtree built especially for this class of meshes having a constant-time traversal property. We introduce a rate-distortion (RD) framework to decimate the mesh and build a progressive representatio...

Ralph Neininger University of Freiburg November 22, 1999 [summary by Elchanan Mossel] 1. Basic Algorithms We consider records which belong to a k dimensional region D = D1 Dk Rk. A le is a nite subset F of D. Given a query q 2 (D1 [ f g) (Dk [ f g), the objective is to nd all the records r 2 F such that ri = qi when qi 6= . The probabilistic assumption is that all the coordinates of the records...