نتایج جستجو برای: quadtree
تعداد نتایج: 1236 فیلتر نتایج به سال:
Panoramic X-Ray images are very popular as a first tool for diagnosis in odontological protocols. Automating the process of analysis of such images is important in order to help dentist procedures. In this process, teeth segmentation from the radiographic images and feature extraction are essential steps. In this paper, we propose a segmentation approach based on mathematical morphology, quadtr...
The latest Geographic Information System (GIS) technology makes it possible to administer the spatial components of daily “business object,” in the corporate database, and apply suitable geographic analysis efficiently in a desktop-focused application. We can use wireless internet technology for transfer process in spatial data from server to client or vice versa. However, the problem in wirele...
We give a closed-form expression for the average number of n-dimensional quadtree nodes (`pieces' or`blocks') required by an n-dimensional hyper-rectangle aligned with the axes. Our formula includes as special cases the formulae of previous eeorts for 2-dimensional spaces 8]. It also agrees with theoretical and empirical results that the number of blocks depends on the hyper-surface of the hype...
Rendering of textured terrain models has become a widely used technique in the field of GIS applications and virtual reality. In this paper, we propose a framework based on tile-pyramid model and linear quadtree tile-index, which enable the real-time rendering of out-of-core terrain data sets while guaranteeing geometric and texture accuracy. The digital elevation model tile pyramid and the ort...
A rate-distortion framework is used to de ne a very low bit rate coding scheme based on quadtree segmentation and optimized selection of motion estimators. This technique achieves maximum reconstructed image quality under the constraint of a target bitrate for the coding of the vector eld and segmentation information . First, a complete scheme is proposed for hybrid 2D and 3D motion estimation ...
A data structure is said to be self-adjusting if it dynamically reorganizes itself to adapt to the pattern of accesses. Efficiency is typically measured in terms of amortized complexity, that is, the average running time of an access over an arbitrary sequence of accesses. The best known example of such a data structure is Sleator and Tarjan’s splay tree. In this paper, we introduce a self-adju...
......................................................................................................................... 2 ACKNOWLEDGEMENTS ....................................................................................................... 2 TABLE OF CONTENTS ......................................................................................................... 3 INTRODUCTION...............
The Oriented FAST and Rotated BRIEF (ORB) algorithm has the problem that extracted feature points are overconcentrated or even overlapped, leading to information loss of local image features. A homogenized ORB using dynamic thresholds improved quadtree method is proposed in this paper, named Quadtree (QTORB). In point extraction stage, a new threshold calculation enhance algorithm’s ability ext...
We describe a new parallel sparse matrix-matrix multiplication algorithm in shared memory using a quadtree decomposition. Our implementation is nearly as fast as the best sequential method on one core, and scales quite well to multiple cores.
What does a typical road network look like? Existing generative models tend to focus on one aspect to the exclusion of others. We introduce the general-purpose quadtree model and analyze its shortest paths and maximum flow.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید