Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Accelerated KAZE-SIFT feature extraction algorithm for oblique images
BO Dan, LI Zongchun, WANG Xiaonan, QIAO Hanwen
Journal of Computer Applications    2019, 39 (7): 2093-2097.   DOI: 10.11772/j.issn.1001-9081.2018122564
Abstract486)      PDF (840KB)(361)       Save

Concerning that traditional vertical image feature extraction algorithms have poor effect on oblique image matching, a feature extraction algorithm, based on Accelerated KAZE (AKAZE) and Scale Invariant Feature Transform (SIFT) algorithm called AKAZE-SIFT was proposed. Firstly, in order to guarantee the accuracy and distinctiveness of image feature detection, AKAZE operator, which fully preserves the contour information of image, was utilized for feature detection. Secondly, the robust SIFT operator was used to improve the stability of feature description. Thirdly, the rough matching point pairs were determined by the Euclidean distance between object feature point vector and candidate feature point vectors. Finally, the homography constraint was applied to improve the matching purity by random sample consensus algorithm. To evaluate the performance of the feature extraction algorithm, the blur, rotation, brightness, viewpoint and scale changes under the condition of oblique photography were simulated. The experimental results show that compared with SIFT algorithm and AKAZE algorithm, the recall of AKAZE-SIFT is improved by 12.8% and 5.3% respectively, the precision of AKAZE-SIFT is increased by 6.5% and 6.1% respectively, the F1 measure of AKAZE-SIFT is elevated by 13.8% and 5.6% respectively and the efficiency of the proposed algorithm is higher than that of SIFT and slightly worse than that of AKAZE. For the excellent detection and description performance, AKAZE-SIFT algorithm is more suitable for oblique image feature extraction.

Reference | Related Articles | Metrics
Surface reconstruction for scattered point clouds with adaptive α-shape
HE Hua, LI Zongchun, LI Guojun, RUAN Huanli, LONG Changyu
Journal of Computer Applications    2016, 36 (12): 3394-3397.   DOI: 10.11772/j.issn.1001-9081.2016.12.3394
Abstract629)      PDF (734KB)(402)       Save
The α-shape algorithm is not suitable for surface reconstruction of scattered and non-uniformly sampled points. In order to solve the problem, an improved surface reconstruction algorithm with adaptive α-shape based on Local Feature Size (LFS) of point cloud data was proposed. Firstly, Medial Axis (MA) of the surface was approximated by the negative poles computed by k-nearest neighbors of sampled points. Secondly, the LFS of sampled points was calculated by the approximated MA, and the original point clouds were unequally simplified based on LFS. Finally, the surface was adaptively reconstructed based on the radius of circumscribed ball of triangles and the corresponding α value. In the comparison experiments with α-shape algorithm, the proposed algorithm could effectively and reasonably reduce the number of point clouds, and the simplification rate of point clouds achieved about 70%. Simultaneously, the reconstruction result were obtained with less redundant triangles and few holes. The experimental results show that the proposed algorithm can adaptively reconstruct the surface of non-uniformly sampled point clouds.
Reference | Related Articles | Metrics
Delaunay-based Non-uniform sampling for noisy point cloud
LI Guojun LI Zongchun HOU Dongxing
Journal of Computer Applications    2014, 34 (10): 2922-2924.   DOI: 10.11772/j.issn.1001-9081.2014.10.2922
Abstract347)      PDF (581KB)(486)       Save

To satisfy ε-sample condition for Delaunay-based triangulation surface reconstruction algorithm, a Delaunay-based non-uniform sampling algorithm for noisy point clouds was proposed. Firstly, the surface Medial Axis (MA) was approximated by the negative poles computed by k-nearest neighbors Voronoi vertices. Secondly, the Local Feature Size (LFS) of surface was estimated with the approximated medial axis. Finally, combined with the Bound Cocone algorithm, the unwanted interior points were removed. Experiments show that the new algorithm can simplify noisy point clouds accurately and robustly while keeping the boundary features well. The simplified point clouds are suitable for Delaunay-based triangulation surface reconstruction algorithm.

Reference | Related Articles | Metrics