Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 12 of 12 for “"bounding rectangle"”.
-
Analysis of craquelure patterns for content-based retrieval
… conservative approximations based on the minimum bounding rectangle (MBR) and rotated minimum bounding rectangle (RMBR). Meaningful features based on orientation histograms and structural statistics are extracted to distinguish between craquelure patterns. The resultant features are used as inputs …
-
Improving Sinkhole Mapping Using LiDAR Data and Locating Sinkhole Hotspots in Johnson City, TN
… index, ratio of length to width of the Minimum Bounding Rectangle (MBR) and percent coverage of the MBR by the depression, and 3,634 new sinkholes were identified. Newly developed hotspots were identified in north Johnson City and other areas in the south near the Johnson City Medical Center. …
-
Image segmentation and pre-processing for electronic waste identification - Using OpenCV to compare different techniques for object extraction and rotation
… and that encapsulating the object in a minimum bounding rectangle and rotating it with the angle of the bounding box can work well for the rotation task. It is also shown that using these algorithms combined as a pre-processing stage to an object classifier may be a way of making the …
-
Evaluation of photographic properties for area estimation
… above the midpoint of the respective tract's bounding rectangle. The topographic relief of the tracts ranged from 19 feet in the Coastal Plain to 105 feet in the Piedmont. It was found that lens focal length did not have an independent effect on the acreage estimates. Relief error, the lowest, …
-
Hierarchical and Adaptive Filter and Refinement Algorithms for Geometric Intersection Computations on GPU
… Compared to existing Common Minimum Bounding Rectangle (CMBR) filter that is applied on each cross-layer candidate pair, the workload after using PolySketch-based CMBR filter is on average 98% smaller. The execution time of our HiFiRe system on two shapefiles, namely USA Water Bodies …
-
An efficient analytical placement algorithm using cell shifting, iterative local refinement and a hybrid net model
… the wirelength according to the half-perimeter bounding rectangle measure. This technique is very effective as it makes use of the wirelength and cell distribution information provided by a coarse global placement. (3) A Hybrid Net Model is proposed which is a combination of the traditional …
-
Indexing for moving objects
… moving objects depend on the use of a minimum bounding rectangle (MBR) in a multi-dimensional index structure such as the R-tree. The association of moving speeds with its MBR often causes large overlaps among MBRs. This problem becomes more severe as the number of concurrent operations …
-
A contour tree based spatio-temporal data model for oceanographic applications
… is applied as the main algorithm and the Minimum Bounding Rectangle (MBR) is used to enhance the spatial interpolation performance. The temporal interpolation calculates the data that are not recorded, which fall between neighboring contour trees for adjacent time steps. The “linear interpolation” …
-
Automatic 3D Building Model Generation by Integrating LiDAR and Aerial Images Using a Hybrid Approach
… which can be described with a collection of rectangles (e.g., L-shape, T-shape, U-shape, gable roofs, and more complex building shapes which are combinations of the aforementioned shapes), under the assumption that the majority of the buildings in urban areas belong to this category. …
-
Distributed spatial query processing and optimization
… spatial query. A Global Encompassing Minimum Bounding Rectangle (GEMBR) is utilized, which is partitioned, mapped and applied in two different ways to approximate the objects in a spatial joining attribute. The first is partition indices, while the second is a bit array representation. Then …
-
Searching nearest neighbor in high dimensional space
Searching nearest neighbor in high dimensional space is an interesting and complex problem in computer science. As the dimension increases, the complexity to find the nearest neighbor also increases. In one dimension we can find the nearest point very efficiently. But when the dimension increases, …
-
A Non-Intersecting R-Tree
… in-memory, multidimensional index that uses bounding polygons to provide twice as efficient point queries, and equivalent range query performance while indexing data up to an order of magnitude faster. The NIR-Tree leverages non-intersecting bounding polygons to reduce the number of nodes …