A Local Refinement Algorithm for Data Partitioning

Author(s):  
Jarmo Rantakokko
2014 ◽  
Vol 41 (8) ◽  
pp. 3915-3921 ◽  
Author(s):  
Aizeng Wang ◽  
Gang Zhao ◽  
Yong-Dong Li

2004 ◽  
Vol 201 (1) ◽  
pp. 34-60 ◽  
Author(s):  
Peter McCorquodale ◽  
Phillip Colella ◽  
David P. Grote ◽  
Jean-Luc Vay

2011 ◽  
Vol 1 ◽  
pp. 257-261
Author(s):  
Lu Yao ◽  
Zheng Hua Wang ◽  
Wei Cao ◽  
Zong Zhe Li

Graph partitioning is a fundamental problem in several scientific and engineering applications. In this paper, we propose a heuristic local refinement algorithm for graph partitioning, which seeks to improve the quality of separators by reducing the width of the level structure. The experiments reported in this paper show that the use of our local refinement algorithm results in a considerable improvement in the quality of partitions over conventional graph partitioning scheme based on level structure.


2013 ◽  
Vol 690-693 ◽  
pp. 3199-3202
Author(s):  
Jia Yu Han ◽  
Yi Du Yang

In this paper, the spectral element methods are adopted to solve the eigenvalue problem of hydrogen atoms electronic structure. A local refinement algorithm based on spectral element approximation is constructed to solve the problem on different domains. Numerical experiments indicate this algorithm is highly efficient.


2012 ◽  
Vol 82 (12) ◽  
pp. 2971-2981 ◽  
Author(s):  
Ángel Plaza ◽  
Sergio Falcón ◽  
José P. Suárez ◽  
Pilar Abad

2021 ◽  
Vol 13 (10) ◽  
pp. 1903
Author(s):  
Zhihui Li ◽  
Jiaxin Liu ◽  
Yang Yang ◽  
Jing Zhang

Objects in satellite remote sensing image sequences often have large deformations, and the stereo matching of this kind of image is so difficult that the matching rate generally drops. A disparity refinement method is needed to correct and fill the disparity. A method for disparity refinement based on the results of plane segmentation is proposed in this paper. The plane segmentation algorithm includes two steps: Initial segmentation based on mean-shift and alpha-expansion-based energy minimization. According to the results of plane segmentation and fitting, the disparity is refined by filling missed matching regions and removing outliers. The experimental results showed that the proposed plane segmentation method could not only accurately fit the plane in the presence of noise but also approximate the surface by plane combination. After the proposed plane segmentation method was applied to the disparity refinement of remote sensing images, many missed matches were filled, and the elevation errors were reduced. This proved that the proposed algorithm was effective. For difficult evaluations resulting from significant variations in remote sensing images of different satellites, the edge matching rate and the edge matching map are proposed as new stereo matching evaluation and analysis tools. Experiment results showed that they were easy to use, intuitive, and effective.


2021 ◽  
Vol 13 (13) ◽  
pp. 2494
Author(s):  
Gaël Kermarrec ◽  
Niklas Schild ◽  
Jan Hartmann

T-splines have recently been introduced to represent objects of arbitrary shapes using a smaller number of control points than the conventional non-uniform rational B-splines (NURBS) or B-spline representatizons in computer-aided design, computer graphics and reverse engineering. They are flexible in representing complex surface shapes and economic in terms of parameters as they enable local refinement. This property is a great advantage when dense, scattered and noisy point clouds are approximated using least squares fitting, such as those from a terrestrial laser scanner (TLS). Unfortunately, when it comes to assessing the goodness of fit of the surface approximation with a real dataset, only a noisy point cloud can be approximated: (i) a low root mean squared error (RMSE) can be linked with an overfitting, i.e., a fitting of the noise, and should be correspondingly avoided, and (ii) a high RMSE is synonymous with a lack of details. To address the challenge of judging the approximation, the reference surface should be entirely known: this can be solved by printing a mathematically defined T-splines reference surface in three dimensions (3D) and modeling the artefacts induced by the 3D printing. Once scanned under different configurations, it is possible to assess the goodness of fit of the approximation for a noisy and potentially gappy point cloud and compare it with the traditional but less flexible NURBS. The advantages of T-splines local refinement open the door for further applications within a geodetic context such as rigorous statistical testing of deformation. Two different scans from a slightly deformed object were approximated; we found that more than 40% of the computational time could be saved without affecting the goodness of fit of the surface approximation by using the same mesh for the two epochs.


Sign in / Sign up

Export Citation Format

Share Document