Error analysis for creating 3D face templates based on cylindrical quad-tree structure

For sparse overlay network built by static sensor nodes, this paper proposes the introduction of heterogeneous mobile sensor nodes, and designs a mobile coverage strategy to optimize the coverage performance of sensor network. At first, the monitoring area is divided into several sub-regions by iterative quartering and the sub-regions are represented by a quad-tree structure. Secondly, the mobile coverage strategy is planned based on the idea of divide and conquers and combing the overall regional strategy with local regional strategy. The overall regional mobile strategy is planned by go through all sub-regions according to breadth-first traversal of the quad-tree. The local regional mobile strategy in each sub-region is designed based on the distribution of static nodes after the sub-region meshing. The results show that the mobile coverage strategy can achieve good network coverage, and it is very suitable for multiple mobile nodes.

Download Full-text

A Multi-Dimensional Data Storage Using Quad-Tree and Z-Ordering

Applied Mechanics and Materials ◽

10.4028/www.scientific.net/amm.347-350.2436 ◽

2013 ◽

Vol 347-350 ◽

pp. 2436-2441

Author(s):

Fang Hou ◽

Cheng Hui Huang ◽

Ji Yuan Lu

Keyword(s):

Data Storage ◽

Performance Test ◽

Tree Structure ◽

File Format ◽

Test Results ◽

Space Filling ◽

Space Filling Curves ◽

Quad Tree

Multi-dimensional applications use tree structure to store data and space filling curves to traverse data. Most frequently used Quad-tree and Z-ordering curve are analyzed. By importing these to a HDF5 file format, a multi-dimensional data storage subsystem is constructed. Performance test results show in a sequential reading application environment, this method is feasible and efficient.

Download Full-text

Shape Codification Indexing and Retrieval Using the Quad-Tree Structure

International Journal of Computer Vision and Image Processing ◽

10.4018/ijcvip.2013010101 ◽

2013 ◽

Vol 3 (1) ◽

pp. 1-21

Author(s):

Saliha Aouat

Keyword(s):

Processing Time ◽

Similarity Measures ◽

Tree Structure ◽

Retrieval Process ◽

New Approach ◽

3D Objects ◽

Quad Tree ◽

Indexing And Retrieval ◽

Different Shapes ◽

Different Levels

The author presents in this paper a new approach for indexing and Content-based image retrieval based on the Quad-tree structure. The 3D objects are represented by their silhouettes and codified following the filling rate of each quadrant at different levels of the quad-tree subdivision. The author proposes a modified linear codification for silhouettes, this method improves the processing time because, in opposite to the traditional algorithms, the author’s algorithm has not a processing time that is proportional to the number of pixels in the image. As the same descriptor may characterize a set of different shapes, the author proposes also, efficient similarity measures to distinguish different objects having the same index in order to apply the approach to the retrieval process.

Download Full-text

Modified Fast Directional Multilevel Algorithm for Analysis of Scattering of Microstrip Patch

Advanced Materials Research ◽

10.4028/www.scientific.net/amr.981.486 ◽

2014 ◽

Vol 981 ◽

pp. 486-489 ◽

Cited By ~ 2

Author(s):

Hua Chen ◽

Fan Yong Jie

Keyword(s):

Group Size ◽

Free Space ◽

Fast Multipole Method ◽

Tree Structure ◽

Memory Requirement ◽

Cpu Time ◽

Microstrip Patch ◽

Quad Tree ◽

Multilevel Algorithm ◽

Level Group

In this paper, the modified fast directional multilevel algorithm (FDMA) is presented for analyzing microstrip patch. The FDMA has been successfully applied to analyze scattering in free space and then it was extended to solve mircrostrip problems. The quad-tree structure is used in this method, which is the same as that in fast multipole method. In our method, the finest level group size can be set smaller than 0.2λ without suffering from subwavelength breakdown. The resulting algorithm has the memory requirement and the CPU time per iteration proportional to O (NLogN), where N refers to the number of unknowns. Numerical results of microstrip structures are presented to show the efficiency of this method

Download Full-text