Feature extraction for margin lines using region growing with a dynamic weight function in a one-point bidirectional path search
نویسندگان
چکیده
Abstract A margin line, defined as the boundary curve of contact area between a prepared tooth and dental restoration, considerably influences end shape restoration design. Most studies that have extracted lines from mesh models representing teeth faced convergence problems in path search therefore pose inconvenience specifying multiple input points intermediate goal points. To overcome these problems, this study, we propose bidirectional path-search algorithm using single point. First, classifies all nodes model into or fuzzy region to increase efficiency. Then, starts one point proceeds on two paths opposite directions, current node temporary currently searched path. During search, dynamic evaluation function varies weights according type is employed improve convergence. Finally, practicality algorithm, jagged initial line converted smooth spline an energy-minimization specialized for lines. evaluate proposed various types are demonstrated compared with those created some relevant previous works commercial computer-aided design (CAD) system. The comparison verified accurate could be calculated only algorithm. Moreover, showed better performance crown inlay/only experimental CAD system under same conditions.
منابع مشابه
Feature extraction based on Laplacian bidirectional maximum margin criterion
Article history: Received 28 July 2008 Received in revised form 2 March 2009 Accepted 9 March 2009
متن کاملFeature extraction using maximum nonparametric margin projection
Dimensionality reduction is often recommended to handle high dimensional data before performing the tasks of visualization and classification. So far, large families of dimensionality reduction methods besides the supervised or the unsupervised, the linear or the nonlinear, the global or the local have been developed. In this paper, a maximum nonparametric margin projection (MNMP) method is put...
متن کاملA path following interior-point algorithm for semidefinite optimization problem based on new kernel function
In this paper, we deal to obtain some new complexity results for solving semidefinite optimization (SDO) problem by interior-point methods (IPMs). We define a new proximity function for the SDO by a new kernel function. Furthermore we formulate an algorithm for a primal dual interior-point method (IPM) for the SDO by using the proximity function and give its complexity analysis, and then we sho...
متن کاملCorrector-predictor arc-search interior-point algorithm for $P_*(kappa)$-LCP acting in a wide neighborhood of the central path
In this paper, we propose an arc-search corrector-predictor interior-point method for solving $P_*(kappa)$-linear complementarity problems. The proposed algorithm searches the optimizers along an ellipse that is an approximation of the central path. The algorithm generates a sequence of iterates in the wide neighborhood of central path introduced by Ai and Zhang. The algorithm does not de...
متن کاملA region-growing approach for automatic outcrop fracture extraction from a three-dimensional point cloud
Conventional manual surveys of rock mass fractures usually require large amounts of time and labor; yet, they provide a relatively small set of data that cannot be considered representative of the study region. Terrestrial laser scanners are increasingly used for fracture surveys because they can efficiently acquire large area, high-resolution, three-dimensional (3D) point clouds from outcrops....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational Design and Engineering
سال: 2022
ISSN: ['2288-5048', '2288-4300']
DOI: https://doi.org/10.1093/jcde/qwac108