Point Cloud Classification Using Content-Based Transformer via Clustering in Feature Space

Recently, there have been some attempts of Transformer in 3D point cloud classification. In order to reduce computations, most existing methods focus on local spatial attention,but ignore their content and fail to establish relationships between distant but relevant points. To overcome the limitation of local spatial attention, we propose a point content-based Transformer architecture, called PointConT for short. It exploits the locality of points in the feature space(content-based), which clusters the sampled points with similar features into the same class and computes the self-attention within each class, thus enabling an effective trade-off between capturing long-range dependencies and computational complexity. We further introduce an inception feature aggregator for point cloud classification, which uses parallel structures to aggregate high-frequency and low-frequency information in each branch separately. Extensive experiments show that our PointConT model achieves a remarkable performance on point cloud shape classification. Especially, our method exhibits 90.3% Top-1 accuracy on the hardest setting of ScanObjectN N. Source code of this paper is available at https://github.com/yahuiliu99/PointC onT.

Automatic Extraction Method of 3D Feature Guidelines for Complex Cultural Relic Surfaces Based on Point Cloud

Cultural relics line graphic serves as a crucial form of traditional artifact information documentation,which is a simple and intuitive product with low cost of displaying compared with 3D models.Dimensionality reduction is undoubtedly necessary for line drawings.However,most existing methods for artifact drawing rely on the principles of orthographic projection that always cannot avoid angle occlusion and data overlapping while the surface of cultural relics is complex.Therefore,conformal mapping was introduced as a dimensionality reduction way to compensate for the limitation of orthographic projection.Based on the given criteria for assessing surface complexity,this paper proposed a three-dimensional feature guideline extraction method for complex cultural relic surfaces.A 2D and 3D combined factor that measured the importance of points on describing surface features,vertex weight,was designed.Then the selection threshold for feature guideline extraction was determined based on the differences between vertex weight and shape index distributions.The feasibility and stability were verified through experiments conducted on real cultural relic surface data.Results demonstrated the ability of the method to address the challenges associated with the automatic generation of line drawings for complex surfaces.The extraction method and the obtained results will be useful for line graphic drawing,displaying and propaganda of cultural relics.

Building Facade Point Clouds Segmentation Based on Optimal Dual-Scale Feature Descriptors

To address the current issues of inaccurate segmentation and the limited applicability of segmentation methods for building facades in point clouds, we propose a facade segmentation algorithm based on optimal dual-scale feature descriptors. First, we select the optimal dual-scale descriptors from a range of feature descriptors. Next, we segment the facade according to the threshold value of the chosen optimal dual-scale descriptors. Finally, we use RANSAC (Random Sample Consensus) to fit the segmented surface and optimize the fitting result. Experimental results show that, compared to commonly used facade segmentation algorithms, the proposed method yields more accurate segmentation results, providing a robust data foundation for subsequent 3D model reconstruction of buildings.

Image Relaxation Matching Based on Feature Points for DSM Generation

In photogrammetry and remote sensing, image matching is a basic and crucial process for automatic DEM generation. In this paper we presented a image relaxation matching method based on feature points. This method can be considered as an extention of regular grid point based matching. It avoids the shortcome of grid point based matching. For example, with this method, we can avoid low or even no texture area where errors frequently appear in cross correlaton matching. In the mean while, it makes full use of some mature techniques such as probability relaxation, image pyramid and the like which have already been successfully used in grid point matching process. Application of the technique to DEM generaton in different regions proved that it is more reasonable and reliable.

Effective Self-calibration for Camera Parameters and Hand-eye Geometry Based on Two Feature Points Motions

A novel and effective self-calibration approach for robot vision is presented, which can effectively estimate both the camera intrinsic parameters and the hand-eye transformation at the same time. The proposed calibration procedure is based on two arbitrary feature points of the environment, and three pure translational motions and two rotational motions of robot endeffector are needed. New linear solution equations are deduced, and the calibration parameters are finally solved accurately and effectively. The proposed algorithm has been verified by simulated data with different noise and disturbance. Because of the need of fewer feature points and robot motions, the proposed method greatly improves the efficiency and practicality of the calibration procedure. © 2017 Chinese Association of Automation.

STATISTICAL PROBABILITY BASED ALGORITHM FOR EXTRACTING FEATURE POINTS IN 2-DIMENSIONAL IMAGE

An algorithm for automatically extracting feature points is developed after the area of feature points in 2-dimensional (2D) imagebeing located by probability theory, correlated methods and criterion for abnormity. Feature points in 2D image can be extracted only by calculating standard deviation of gray within sampled pixels area in our approach statically. While extracting feature points, the limitation to confirm threshold by tentative method according to some a priori information on processing image can be avoided. It is proved that the proposed algorithm is valid and reliable by extracting feature points on actual natural images with abundant and weak texture, including multi-object with complex background, respectively. It can meet the demand of extracting feature points of 2D image automatically in machine vision system.

Arm-Root Curve Fitting Based on Body Surface Feature Points for Young Male

This paper is aiming to obtain an arm-root curve function performing the human arm-root size and shape realistically. A gypsum replica of upper arm for young male was made and scanned for extracting the 3D coordinates of 4 feature points of shoulder point, the anterior/posterior armpit point and the axillary point describing the real arm-root shape under the normalized definitions, and the 5 landmarks were confirmed additionally for improving the fitting precision. Then, the wholly and piecewise fitting of arm-root curve with 9 feature points and mark points in total were generated respectively based on least square polynomial fitting method. Comparing to the wholly fitting, the piecewise fitted function segmented by the line between anterior and posterior axillary points showed a high fitting degree of arm-root morphology with R-square of 1, the length difference between fitted curve and gypsum curve is 0.003 cm within error range. And it provided a basic curve model with standard feature points to simulate arm-root morphology realistically by curve fitting for accurate body measurement extraction.

Automatic Feature Point Detection and Tracking of Human Actions in Time-of-flight Videos

Detecting feature points on the human body in video frames is a key step for tracking human movements. There have been methods developed that leverage models of human pose and classification of pixels of the body image. Yet, occlusion and robustness are still open challenges. In this paper, we present an automatic, model-free feature point detection and action tracking method using a time-of-flight camera. Our method automatically detects feature points for movement abstraction. To overcome errors caused by miss-detection and occlusion, a refinement method is devised that uses the trajectory of the feature points to correct the erroneous detections. Experiments were conducted using videos acquired with a Microsoft Kinect camera and a publicly available video set and comparisons were conducted with the state-of-the-art methods. The results demonstrated that our proposed method delivered improved and reliable performance with an average accuracy in the range of 90 %.The trajectorybased refinement also demonstrated satisfactory effectiveness that recovers the detection with a success rate of 93.7 %. Our method processed a frame in an average time of 71.1 ms.

Point Reg Net: Invariant Features for Point Cloud Registration Using in Image-Guided Radiation Therapy

In image-guided radiation therapy, extracting features from medical point cloud is the key technique for multimodality registration. This novel framework, denoted Control Point Net (CPN), provides an alternative to the common applications of manually designed keypoint descriptors for coarse point cloud registration. The CPN directly consumes a point cloud, divides it into equally spaced 3D voxels and transforms the points within each voxel into a unified feature representation through voxel feature encoding (VFE) layer. Then all volumetric representations are aggregated by Weighted Extraction Layer which selectively extracts features and synthesize into global descriptors and coordinates of control points. Utilizing global descriptors instead of local features allows the available geometrical data to be better exploited to improve the robustness and precision. Specifically, CPN unifies feature extraction and clustering into a single network, omitting time-consuming feature matching procedure. The algorithm is tested on point cloud datasets generated from CT images. Experiments and comparisons with the state-of-the-art descriptors demonstrate that CPN is highly discriminative, efficient, and robust to noise and density changes.

Research on color image matching method based on feature point compensation in dark light environment

Image matching refers to the process of matching two or more images obtained at different time,different sensors or different conditions through a large number of feature points in the image.At present,image matching is widely used in target recognition and tracking,indoor positioning and navigation.Local features missing,however,often occurs in color images taken in dark light,making the extracted feature points greatly reduced in number,so as to affect image matching and even fail the target recognition.An unsharp masking(USM)based denoising model is established and a local adaptive enhancement algorithm is proposed to achieve feature point compensation by strengthening local features of the dark image in order to increase amount of image information effectively.Fast library for approximate nearest neighbors(FLANN)and random sample consensus(RANSAC)are image matching algorithms.Experimental results show that the number of effective feature points obtained by the proposed algorithm from images in dark light environment is increased,and the accuracy of image matching can be improved obviously.

A Novel Airborne 3D Laser Point Cloud Hole Repair Algorithm Considering Topographic Features

Hole repair processing is an important part of point cloud data processing in airborne 3-dimensional(3D)laser scanning technology.Due to the fragmentation and irregularity of the surface morphology,when applying the 3D laser scanning technology to mountain mapping,the conventional mathematical cloud-based point cloud hole repair method is not ideal in practical applications.In order to solve this problem,we propose to repair the valley and ridge line first,and then repair the point cloud hole.The main technical steps of the method include the following points:First,the valley and ridge feature lines are extracted by the GIS slope analysis method;Then,the valley and ridge line missing from the hole are repaired by the mathematical interpolation method,and the repaired results are edited and inserted to the original point cloud;Finally,the traditional repair method is used to repair the point cloud hole whose valley line and ridge line have been repaired.Three experiments were designed and implemented in the east bank of the Xiaobaini River to test the performance of the proposed method.The results showed that compared with the direct point cloud hole repair method in Geomagic Studio software,the average repair accuracy of the proposed method,in the 16 m buffer zone of valley line and ridge line,is increased from 56.31 cm to 31.49 cm.The repair performance is significantly improved.

Feature detection on point clouds via Gabriel Triangles creation and l1 normal reconstruction

In this paper, we present a robust subneighborhoods selection technique for feature detection on point clouds scattered over a piecewise smooth surface. The proposed method first identifies all potential features using covariance analysis of the local- neighborhoods. To further extract the accurate features from potential features, Gabriel triangles are created in local neighborhoods of each potential feature vertex. These triangles tightly attach to underlying surface and effectively reflect the local geometry struc- ture. Applying a shared nearest neighbor clustering algorithm on ~ 1 reconstructed normals of created triangle set, we classify the lo- cal neighborhoods of the potential feature vertex into multiple subneighborhoods. Each subneighborhood indicates a piecewise smooth surface. The final feature vertex is identified by checking whether it is locating on the intersection of the multiple surfaces. An advantage of this framework is that it is not only robust to noise, but also insensitive to the size of selected neighborhoods. Ex- perimental results on a variety of models are used to illustrate the effectiveness and robustness of our method.

Loop Closure Detection of Visual SLAM Based on Point and Line Features

For traditional loop closure detection algorithm,only using the vectorization of point features to build visual dictionary is likely to cause perceptual ambiguity.In addition,when scene lacks texture information,the number of point features extracted from it will be small and cannot describe the image effectively.Therefore,this paper proposes a loop closure detection algorithm which combines point and line features.To better recognize scenes with hybrid features,the building process of traditional dictionary tree is improved in the paper.The features with different flag bits were clustered separately to construct a mixed dictionary tree and word vectors that can represent the hybrid features,which can better describe structure and texture information of scene.To ensure that the similarity score between images is more reasonable,different similarity coefficients were set in different scenes,and the candidate frame with the highest similarity score was selected as the candidate closed loop.Experiments show that the point line comprehensive feature was superior to the single feature in the structured scene and the strong texture scene,the recall rate of the proposed algorithm was higher than the state of the art methods when the accuracy is 100%,and the algorithm can be applied to more diverse environments.

GRADIENT OF REFERENCE DIFFERENCE BASED MATCHING ALGORITHM FOR IMAGE FEATURE POINT

During matching on feature point, gray correlation matching technology is utilized to extract multi-peaks as a coarse matching set. A pair of given corresponding reference points within the left and right images is used to calculate gradients of reference difference between the reference points and each feature point within the multi-peaks set. The unique correspondence is determined by criterion of minimal gradients of reference difference. The obtained correspondence is taken as a new pair of reference points to update the reference points continuously until all feature points in the left (or right) image being matched with the right (or left) image. The gradients of reference difference can be calculated easily by means of pre-setting a pair of obvious feature points in the left and right images as a pair of corresponding reference points. Besides, the efficiency of matching can be improved greatly by taking the obtained matching point as a new pair of reference points, and by updating the reference point continuously. It is proved that the proposed algorithm is valid and reliable by 3D reconstruction on two pairs of actual natural images with abundant and weak texture, respectively.

A calculation method for low dynamic vehicle velocity based on fusion of optical flow and feature point matching

Aming at the problem of the low accuracy of low dynamic vehicle velocity under the environment of uneven distribution of light intensity,an improved adaptive Kalman filter method for the velocity error estimate by the fusion of optical flow tracking and scale mvaiant feature transform(SIFT)is proposed.The algorithm introduces anonlinear fuzzy membership function and the filter residual for the noise covariance matrix in the adaptive adjustment process.In the process of calculating the velocity of the vehicle,the tracking and matching of the inter-frame displacement a d the vehicle velocity calculation a e carried out by using the optical fow tracing and the SIF'T methods,respectively.Meanwhile,the velocity difference between theoutputs of thesetwo methods is used as the observation of the improved adaptive Kalman filter.Finally,the velocity calculated by the optical fow method is corrected by using the velocity error estimate of the output of the modified adaptive Kalman filter.The results of semi-physical experiments show that the maximum velocityeror of the fusion algorithm is decreased by29%than that of the optical fow method,and the computation time is reduced by80%compared with the SIFT method.

Coherent Point Drift Registration Combined with Image Feature and its Application

A key step of constructing active appearance model is requiring a set of appropriate training shapes with well-defined correspondences.In this paper,we introduce a novel point correspondence method(FB-CPD),which can improve the accuracy of coherent point drift(CPD) by using the information of image feature.The objective function of the proposed method is defined by both of geometric spatial information and image feature information,and the origin Gaussian mixture model in CPD is modified according to the image feature of points.FB-CPD is tested on the 3D prostate and liver point sets through the simulation experiments.The registration error can be reduced efficiently by FB-CPD.Moreover,the active appearance model constructed by FB-CPD can obtain fine segmentation in 3D CT prostate image.Compared with the original CPD,the overlap ratio of voxels was improved from 88.7% to 90.2% by FB-CPD.

基于PointNet++的邻域特征增强点云语义分割方法

随着智能驾驶、机器人导航等以点云为基础的应用蓬勃发展,点云语义分割逐渐成为研究热点。然而,现有的点云语义分割方法存在局部特征提取不充分、特征融合不完整的缺陷。针对这些不足,提出了对应的解决方案。对于局部特征提取不充分的现象,通过嵌入邻域点的坐标、方向、距离等相关信息去关联邻域点的显式特征。对于特征融合不完整的现象,提出了一种最大池化与自注意力池化相结合的混合池化方法。网络架构基于PointNet++,并结合提出的局部特征提取和融合方法,在S3DIS数据集上的实验结果表明,与基线方法PointNet++相比,各评价指标都有不同程度的提高,证实了新方法的有效性和优越性。

Spectral matching algorithm based on nonsubsampled contourlet transform and scale-invariant feature transform

A new spectral matching algorithm is proposed by us- ing nonsubsampled contourlet transform and scale-invariant fea- ture transform. The nonsubsampled contourlet transform is used to decompose an image into a low frequency image and several high frequency images, and the scale-invariant feature transform is employed to extract feature points from the low frequency im- age. A proximity matrix is constructed for the feature points of two related images. By singular value decomposition of the proximity matrix, a matching matrix （or matching result） reflecting the match- ing degree among feature points is obtained. Experimental results indicate that the proposed algorithm can reduce time complexity and possess a higher accuracy.

Method for Detecting Weld Feature Size Based on Line Structured Light

With the rapid development of the machining and manufacturing industry,welding has been widely used in forming connections of structural parts.At present,manual methods are often used for welding and quality inspection,with low efficiency and unstable product quality.Due to the requirements of visual inspection of weld feature size,a visual inspection system for weld feature size based on line structured light(LSL)is designed and built in this paper.An adaptive light stripe sub-pixel center extraction algorithm and a feature point extraction algorithm for welding light stripe are proposed.The experiment results show that the detection error of the weld width is 0.216 mm,the detection error of the remaining height is 0.035 mm,the single measurement costs 109 ms,and the inspection stability and repeatability of the system is 1%.Our approach can meet the online detection requirements of practical applications.