Paper
13 March 2013 Research of pore structure with large area using improved octree algorithm
Junxia Zhao, Shouhua Luo, Siyuan He
Author Affiliations +
Abstract
This paper presents a development of the algorithm for combination of block-merge algorithm and octree algorithm. The memory insufficiency problem, which is caused by heaps of temporary variables when researching pore structure by octree algorithm, has been effectively solved. The pore structure information of cellular metallic material with large area has been extracted, which provides an important method for the study on the relationship between the structure of porous metal material and function. By applying this method to store more data with less memory, an effective and accurate result is achieved. This work would represent a significant advance for research of pore structure using improved octree algorithm.
© (2013) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Junxia Zhao, Shouhua Luo, and Siyuan He "Research of pore structure with large area using improved octree algorithm", Proc. SPIE 8784, Fifth International Conference on Machine Vision (ICMV 2012): Algorithms, Pattern Recognition, and Basic Technologies, 87841A (13 March 2013); https://doi.org/10.1117/12.2014022
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Foam

Algorithm development

Metals

Aluminum

Data modeling

Binary data

Detection and tracking algorithms

RELATED CONTENT

A new support vector machine model for outlier detection
Proceedings of SPIE (March 14 2013)
Built-in test engine and fault simulation for memory
Proceedings of SPIE (June 30 2005)
Application of target costing in machining
Proceedings of SPIE (November 11 2004)
Novel method of predicting lot polish time for high volume...
Proceedings of SPIE (September 03 1999)
Real-time intelligent decision making with data mining
Proceedings of SPIE (March 04 2004)

Back to Top