• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 177,509
Next 10 →

The quadtree and related hierarchical data structures

by Hanan Samet - ACM Computing Surveys , 1984
"... A tutorial survey is presented of the quadtree and related hierarchical data structures. They are based on the principle of recursive decomposition. The emphasis is on the representation of data used in applications in image processing, computer graphics, geographic information systems, and robotics ..."
Abstract - Cited by 541 (12 self) - Add to MetaCart
A tutorial survey is presented of the quadtree and related hierarchical data structures. They are based on the principle of recursive decomposition. The emphasis is on the representation of data used in applications in image processing, computer graphics, geographic information systems

Hierarchical Data Structures...................................................................................................3

by Cross Classifications
"... ..."
Abstract - Add to MetaCart
Abstract not found

HIERARCHICAL DATA STRUCTURE FOR REAL-TIME BACKGROUND SUBTRACTION

by Johnny Park, Amy Tabb, Avinash C. Kak
"... This paper seeks to increase the efficiency of background subtraction algorithms for motion detection. Our method uses a quadtree-base hierarchical framework that samples a small portion of the pixels in each image and yet produces motion detection results that are very similar compared to the conve ..."
Abstract - Cited by 6 (1 self) - Add to MetaCart
to the conventional methods that raster scan entire images. The hierarchical data structure presented in this paper can be used with any background subtraction algorithm that employs background modeling and motion detection on a per-pixel basis. We have tested our method using two common background subtraction

Hierarchical data structures for interactive volume visualization

by David M. Weinstein, Christopher R. Johnson - IEEE Visualization , 1995
"... In order to interactively investigate large-scale 3D data sets, we propose an improved hierarchical data structure for structured grids and an original hierarchical data structure for unstructured grids. These multi-tiered implementations allow the user to interactively control both the local and gl ..."
Abstract - Cited by 4 (4 self) - Add to MetaCart
In order to interactively investigate large-scale 3D data sets, we propose an improved hierarchical data structure for structured grids and an original hierarchical data structure for unstructured grids. These multi-tiered implementations allow the user to interactively control both the local

Data Structures I Hierarchical Data Structures

by Hanan Samet, Robert E. Webber
"... This is the first part of a two-part overview of the use of hierarchical data structures and algorithms in com-puter graphics. In Part I, the focus is on fundamentals. Part II focuses on more advanced applications. Methods based on hierarchical data structures and algorithms have found many uses in ..."
Abstract - Add to MetaCart
This is the first part of a two-part overview of the use of hierarchical data structures and algorithms in com-puter graphics. In Part I, the focus is on fundamentals. Part II focuses on more advanced applications. Methods based on hierarchical data structures and algorithms have found many uses

An Overview of Quadtrees, Octrees, and Related Hierarchical Data Structures

by Hanan Samet - NATO ASI Series , 1988
"... An overview of hierarchical data structures for representing images, such as the quadtree and octree, is presented. They are based on the principle of recursive decomposition. The emphasis is on the representation of data used in applications in computer graphics, computer-aided design, robotics, co ..."
Abstract - Cited by 22 (2 self) - Add to MetaCart
An overview of hierarchical data structures for representing images, such as the quadtree and octree, is presented. They are based on the principle of recursive decomposition. The emphasis is on the representation of data used in applications in computer graphics, computer-aided design, robotics

HIERARCHICAL DATA STRUCTURES FOR MOBILE NETWORKS

by Leonidas J. Guibas, Balaji Prabhakar , 2004
"... ii ..."
Abstract - Add to MetaCart
Abstract not found

A Population Analysis for Hierarchical Data Structures

by Randal C Nelson, Hanan Samet - In Proceedings of the SIGMOD Conference , 1987
"... A new method termed population analysis 1s presented for approxlmatmg the dlstrlbutlon of node occupancies m hierarchical data structures which store a variable number of geometric data items per node The basic idea 1s to describe a dynamic data structure as a set of populations which are per-mitted ..."
Abstract - Cited by 35 (19 self) - Add to MetaCart
A new method termed population analysis 1s presented for approxlmatmg the dlstrlbutlon of node occupancies m hierarchical data structures which store a variable number of geometric data items per node The basic idea 1s to describe a dynamic data structure as a set of populations which are per

The NESTOR Framework: How to Handle Hierarchical Data Structures

by Nicola Ferro, Gianmaria Silvello - in Proc. 13th European Conference on Research and Advanced Technology for Digital Libraries (ECDL 2009 , 2009
"... Abstract. In this paper we study the problem of representing, manag-ing and exchanging hierarchically structured data in the context of a Dig-ital Library (DL). We present the NEsted SeTs for Object hieRarchies (NESTOR) framework defining two set data models that we call: the “Nested Set Model (NS-M ..."
Abstract - Cited by 11 (10 self) - Add to MetaCart
Abstract. In this paper we study the problem of representing, manag-ing and exchanging hierarchically structured data in the context of a Dig-ital Library (DL). We present the NEsted SeTs for Object hieRarchies (NESTOR) framework defining two set data models that we call: the “Nested Set Model (NS

Efficient Edit Propagation Using Hierarchical Data Structure

by Chunxia Xiao, Yongwei Nie, Feng Tang
"... Abstract—This paper presents a novel unified hierarchical structure for scalable edit propagation. Our method is based on the key observation that in edit propagation, appearance varies very smoothly in those regions where the appearance is different from the user-specified pixels. Uniformly samplin ..."
Abstract - Cited by 3 (1 self) - Add to MetaCart
and memory, while achieving visually same results. Experimental results demonstrate the efficiency and effectiveness of our approach on high resolution photographs and videos. Index Terms—Tone adjustment, Gaussian mixture model, hierarchical Data Structure, high dynamic range imaging, tone mapping. F 1
Next 10 →
Results 1 - 10 of 177,509
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University