点云滤波——extract_indices滤波

基于某一分割算法提取点云中的一个子集。

pcl::ModelCoefficients::Ptr coefficients(new pcl::ModelCoefficients());
pcl::PointIndices::Ptr inliers(new pcl::PointIndices());
pcl::SACSegmentation<pcl::PointXYZ> seg;  //创建分割对象
seg.setOptimizeCoefficients(true);        //设置对估计的模型参数进行优化处理
seg.setModelType(pcl::SACMODEL_PLANE);    //设置分割模型类别
seg.setMethodType(pcl::SAC_RANSAC);       //设置用哪个随机参数估计方法
seg.setMaxIterations(1000);                //设置最大迭代次数
seg.setDistanceThreshold(0.01);            //设置判断是否为模型内点的距离阈值
pcl::ExtractIndices<pcl::PointXYZ> extract;
extract.setInputCloud(pointCloud_raw);
extract.setIndices(inliers);//设置分割后的内点为需要提取的点集
extract.setNegative(false);  //设置提取内点而非外点
extract.filter(*pointCloud_filter);
  • 1
    点赞
  • 6
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
以下是代码示例,供参考: ```cpp #include <iostream> #include <pcl/point_types.h> #include <pcl/io/ply_io.h> #include <pcl/filters/passthrough.h> #include <pcl/filters/voxel_grid.h> #include <pcl/segmentation/extract_clusters.h> #include <pcl/kdtree/kdtree_flann.h> #include <pcl/surface/gp3.h> #include <pcl/surface/mls.h> #include <pcl/surface/poisson.h> #include <pcl/surface/marching_cubes_greedy.h> #include <pcl/visualization/pcl_visualizer.h> #include <pcl/visualization/cloud_viewer.h> #include <pcl/common/transforms.h> #include <pcl/common/common.h> #include <pcl/search/search.h> #include <pcl/search/kdtree.h> #include <pcl/features/normal_3d.h> #include <pcl/features/normal_3d_omp.h> #include <pcl/features/fpfh_omp.h> #include <pcl/filters/extract_indices.h> #include <pcl/filters/statistical_outlier_removal.h> #include <pcl/registration/icp.h> #include <pcl/registration/icp_nl.h> #include <pcl/registration/transforms.h> #include <pcl/console/time.h> #include <boost/thread/thread.hpp> using namespace std; typedef pcl::PointXYZRGB PointT; typedef pcl::PointCloud<PointT> PointCloud; int main(int argc, char **argv) { // Load input file PointCloud::Ptr cloud_in(new PointCloud); pcl::io::loadPLYFile(argv[1], *cloud_in); // Remove NaN points std::vector<int> indices; pcl::removeNaNFromPointCloud(*cloud_in, *cloud_in, indices); // Voxel grid filtering pcl::VoxelGrid<PointT> voxel_filter; voxel_filter.setLeafSize(0.01f, 0.01f, 0.01f); PointCloud::Ptr cloud_filtered(new PointCloud); voxel_filter.setInputCloud(cloud_in); voxel_filter.filter(*cloud_filtered); // Pass through filtering pcl::PassThrough<PointT> pass_filter; pass_filter.setFilterFieldName("z"); pass_filter.setFilterLimits(0.0, 1.0); pass_filter.setInputCloud(cloud_filtered); PointCloud::Ptr cloud_passthrough(new PointCloud); pass_filter.filter(*cloud_passthrough); // Greedy projection triangulation pcl::search::KdTree<PointT>::Ptr tree(new pcl::search::KdTree<PointT>); tree->setInputCloud(cloud_passthrough); pcl::GreedyProjectionTriangulation<PointT> gp3; pcl::PolygonMesh triangles; gp3.setSearchRadius(0.025); gp3.setMu(2.5); gp3.setMaximumNearestNeighbors(100); gp3.setMaximumSurfaceAngle(M_PI / 2); gp3.setMinimumAngle(M_PI / 18); gp3.setMaximumAngle(2 * M_PI / 3); gp3.setNormalConsistency(false); gp3.setInputCloud(cloud_passthrough); gp3.setSearchMethod(tree); gp3.reconstruct(triangles); // Extract stem and leaf points pcl::PointXYZ stem_top; float max_distance = 0.0f; for (int i = 0; i < cloud_passthrough->size(); ++i) { if (cloud_passthrough->at(i).z > max_distance) { max_distance = cloud_passthrough->at(i).z; stem_top = cloud_passthrough->at(i); } } float leaf_threshold = max_distance - 0.1f; PointCloud::Ptr stem_points(new PointCloud); PointCloud::Ptr leaf_points(new PointCloud); for (int i = 0; i < cloud_passthrough->size(); ++i) { if (cloud_passthrough->at(i).z < leaf_threshold) { stem_points->push_back(cloud_passthrough->at(i)); } else { leaf_points->push_back(cloud_passthrough->at(i)); } } // Extract stem skeleton // ... // Extract stem parts // ... // Extract leaf parts // ... // Save output file pcl::io::savePLYFileASCII(argv[2], *cloud_filtered); return 0; } ``` 以上代码只是提供了一个基本的框架,具体的点云分割、骨架提取、部分分割等功能需要根据具体需求进行实现。
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值