[PCL self-study: Filtering] Introduction and use of various filters in PCL (continuous update)

1. PassThrough filter: for threshold filtering 1. Introduction of Straight-pass Filter PassThrough filters, as the name implies, use a threshold to directly filter out filters that do not meet the threshold. For example, if there are 100,000 numbers with values ranging from 1 to 100,000 and the pass filter has a threshold value of <50, ...

Posted by teebo on Mon, 14 Feb 2022 18:16:34 +0100

Install PCL and VTK under the background of ROS installation, and solve VTK and PCL_ROS conflict

Previously on: I also need PCL_ ROS and PCL, in which PCL is installed_ ROS is to supplement two packages after installing ROS: PCL conversions PCL_ ROS, and then install PCL separately. If you use the classical method Ubuntu18.04 installing PCL (detailed tutorial) If PCL is installed, it will lead to the conflict of VTK package, that is, PCL ...

Posted by jkmcgrath on Mon, 14 Feb 2022 03:37:10 +0100

[PCL self study: Feature8] introduction and use of ROPS (rotating projection statistics) feature recognition object (continuously updated)

1, Introduction to the characteristic principle of ROPS (rotational projection statistics)   in this article, we continue to learn how to use the PCL:: ropestimate class to extract the features of points. The feature extraction method implemented in this class is written by Yulan Guo, ferdous sohel, Mohammed bennamon, min Lu and Jianwei w ...

Posted by wilzy1 on Sat, 12 Feb 2022 02:00:32 +0100

Spatial change detection of pcl unordered point cloud data

principle Octree is a tree structure for managing sparse 3D data. Octree is used to detect the spatial change between multiple disordered point clouds, which may be in size. There are differences in resolution, density, and point order. By recursively comparing the tree structure of octree, the spatial changes represented by the difference ...

Posted by behrk2 on Thu, 20 Jan 2022 19:53:18 +0100

Find the overlap of two point clouds

Most of the search for overlapping areas on the Internet is to establish a kdtree for one point cloud, and then search the points of another point cloud within the r radius. This method is suitable for two point clouds, which are exactly the same. The general point cloud data are not exactly the same. For example, the point clouds of two fl ...

Posted by patrick99e99 on Sun, 16 Jan 2022 18:13:52 +0100

Implementation of Kd tree in PCL

  KD tree has been described in detail before, with C + + implementation code attached. Detailed explanation of KD tree principle   the KD Tree Library in PCL also provides the data structure of KD tree, which performs fast nearest neighbor search based on FLANN. Nearest neighbor search is a very core operation in matching, featu ...

Posted by pleigh on Mon, 22 Nov 2021 12:27:36 +0100

V-LOAM source code analysis

For reprint, please indicate the source: This article is from zhch Pan's blog http://www.cnblogs.com/zhchp-blog/   This blog is the source code reading work I did before when I did the project. po went to the Internet to help others better understand the V-LOAM project implementation. Some local codes have been modified, which may be differen ...

Posted by designrandom on Tue, 05 May 2020 23:35:31 +0200

PCL Official Tutorial Translation (11): Add Custom PointT Type - Adding your own custom PointT type

Original Link: http://www.pointclouds.org/documentation/tutorials/adding_custom_ptype.php#id1 English original web page view. Add a custom PointT type This document explains not only how to add your own PointT point types, but also what poi ...

Posted by vividona on Sun, 25 Aug 2019 08:26:43 +0200

Use of kinect2 in VS

Use of kinect2 in VS 1. Download and debug the kinectV2 software development kit 1.1 Installation 1.2 Debugging 2. Download and installation of VS2013 2.1 Download 2.2 Installation 3. Installation configuration of opencv 3.1 Configuring environment variables 3.2 opencv Configuration in VS 3.3 New vs Project Test Configur ...

Posted by siri_suresh on Sat, 11 May 2019 03:01:58 +0200