Classical edge detection techniques use various ways of matrix representation of binary images. For large images, time and space requirements of these techniques make them non suitable for any practical applications like remote sensing or processing of fingerprints for commercial transactions. Quadtrees offer an excellent way to store and process an image, with lower space-time requirements. In...

A quadtree-based fully Eulerian finite volume approach for the simulation of fluid-structure interaction problems is presented. Both fluid and structure phases, which are assumed to be incompressible viscous, solved monolithically on whole computational domain. The discretization stencils limited first layer neighbors thus enhancing efficiency parallel computations while limiting numerical orde...

Fractal image coding is a novel technique for still ima ge c ompression. I n t his paper, a low b it rate r egion-based fractal image compression algorithm i s pr oposed, sev eral techniques ar e i ncluded as follows. First, we improve the performance of quadtree segmentation by adaptive threshold. T hen, a me rging s cheme is e mployed t o t he r esulting quadtree segm entation t hat co mbines...

This report presents an implementation of a stable height-field fluid solver on non-uniform quadtree grids. It build upon the well known techniques of height field representation of the fluid volume, semi-Lagrangian advection, upwind differencing in the discretized representation and adaptive quadtree grids for faster calculations. A novel contribution is the applications of certain concepts an...

Progressive, adaptive and hierarchical modes are desirable image coding features. This paper presents a quadtree-pruning pyramid coding scheme satisfying all these objectives. Pyramid coding is an approach suitable for progressive image tramsmission, where the original image is divided into different levels that correspond to successive approximants of the original one. Starting from the origin...

Title of dissertation: DYNAMIC DATA STRUCTURES FOR GEOMETRIC SEARCH AND RETRIEVAL Eunhui Park, 2013 Dissertation directed by: Professor David M. Mount Department of Computer Science Data structures for geometric search and retrieval are of significant interest in areas such as computational geometry, computer graphics, and computer vision. The focus of this dissertation is on the design of effi...