PCL_第13章

一、resamping重采样

参考：https://www.cnblogs.com/longyp/articles/7435547.html

https://blog.csdn.net/DLW__/article/details/102001232

测量较小的对象时产生一些误差,直接重建会使曲面不光滑或者有漏洞,为了建立完整的模型需要对表面进行平滑处理和漏洞修复.可通过数据重建来解决这一问题,重采样算法通过对周围数据点进行高阶多项式插值来重建表面缺少的部分.

由多个扫描配准后得到的数据直接拿来重建可能产生 "双墙"等重影,即拼接的区域出现重叠的两个曲面,重采样算法可以对此问题进行处理.

#include <pcl/point_types.h>
#include <pcl/io/pcd_io.h>
#include <pcl/kdtree/kdtree_flann.h>
#include <pcl/surface/mls.h>   //最小二乘平滑处理类定义int
main (int argc, char** argv)
{// Load input file into a PointCloud<T> with an appropriate typepcl::PointCloud<pcl::PointXYZ>::Ptr cloud (new pcl::PointCloud<pcl::PointXYZ> ());// Load bun0.pcd -- should be available with the PCL archive in test pcl::io::loadPCDFile("davi.pcd", *cloud);// Create a KD-Treepcl::search::KdTree<pcl::PointXYZ>::Ptr tree (new pcl::search::KdTree<pcl::PointXYZ>);// Output has the PointNormal type in order to store the normals calculated by MLSpcl::PointCloud<pcl::PointNormal> mls_points;// Init object (second point type is for the normals, even if unused)pcl::MovingLeastSquares<pcl::PointXYZ, pcl::PointNormal> mls;// 设置在最小二乘计算中需要进行法线估计,不需要可跳过mls.setComputeNormals (true);// Set parametersmls.setInputCloud (cloud);mls.setPolynomialFit (true);  //多项式拟合提高精度,可false 加快速度,或选择其他来控制平滑过程mls.setSearchMethod (tree);mls.setSearchRadius (3);// Reconstructmls.process (mls_points);// Save outputpcl::io::savePCDFile ("davi-mls.pcd", mls_points);
}

二、concave_hull_2d

本教程是为假设您正在寻找凹面而编写的。如果您想要平面模型的凸壳，只需在本教程的每一点用凸壳替换凹壳，包括源文件、文件名和CMakeLists.txt文件。您还需要注释掉setAlpha()，因为这不适用于凸包。

pcl::ConcaveHull<pcl::PointXYZ>类

三、greedy projection 贪婪映射

pcl::GreedyProjectionTriangulation<pcl::PointNormal> 类

程序支持两种文件格式：*.pcd和*.ply。

程序先读取点云文件；然后计算法向量，并将法向量和点云坐标放在一起；接着使用贪婪三角投影算法进行重构，最后显示结果。

#include <pcl/point_types.h>
#include <pcl/io/pcd_io.h>
#include <pcl/kdtree/kdtree_flann.h>
#include <pcl/features/normal_3d.h>
#include <pcl/surface/gp3.h>
#include <pcl/visualization/pcl_visualizer.h>
#include <boost/thread/thread.hpp>int
main (int argc, char** argv)
{// Load input file into a PointCloud<T> with an appropriate typepcl::PointCloud<pcl::PointXYZ>::Ptr cloud (new pcl::PointCloud<pcl::PointXYZ>);pcl::io::loadPCDFile("table_scene_lms400_downsampled.pcd", *cloud);//sensor_msgs::PointCloud2 cloud_blob;//pcl::io::loadPCDFile ("table_scene_lms400_downsampled.pcd", cloud_blob);//pcl::fromROSMsg (cloud_blob, *cloud);//* the data should be available in cloud// Normal estimation*pcl::NormalEstimation<pcl::PointXYZ, pcl::Normal> n;pcl::PointCloud<pcl::Normal>::Ptr normals (new pcl::PointCloud<pcl::Normal>);pcl::search::KdTree<pcl::PointXYZ>::Ptr tree (new pcl::search::KdTree<pcl::PointXYZ>);tree->setInputCloud (cloud);n.setInputCloud (cloud);n.setSearchMethod (tree);n.setKSearch (20);n.compute (*normals);//* normals should not contain the point normals + surface curvatures// Concatenate the XYZ and normal fields*pcl::PointCloud<pcl::PointNormal>::Ptr cloud_with_normals (new pcl::PointCloud<pcl::PointNormal>);pcl::concatenateFields (*cloud, *normals, *cloud_with_normals);//* cloud_with_normals = cloud + normals// Create search tree*pcl::search::KdTree<pcl::PointNormal>::Ptr tree2 (new pcl::search::KdTree<pcl::PointNormal>);tree2->setInputCloud (cloud_with_normals);// Initialize objectspcl::GreedyProjectionTriangulation<pcl::PointNormal> gp3;pcl::PolygonMesh triangles;// Set the maximum distance between connected points (maximum edge length)gp3.setSearchRadius (0.025);// Set typical values for the parametersgp3.setMu (2.5);gp3.setMaximumNearestNeighbors (100);gp3.setMaximumSurfaceAngle(M_PI/4); // 45 degreesgp3.setMinimumAngle(M_PI/18); // 10 degreesgp3.setMaximumAngle(2*M_PI/3); // 120 degreesgp3.setNormalConsistency(false);// Get resultgp3.setInputCloud (cloud_with_normals);gp3.setSearchMethod (tree2);gp3.reconstruct (triangles);// std::cout << triangles;// Additional vertex informationstd::vector<int> parts = gp3.getPartIDs();std::vector<int> states = gp3.getPointStates();boost::shared_ptr<pcl::visualization::PCLVisualizer> viewer (new pcl::visualization::PCLVisualizer ("3D Viewer"));viewer->setBackgroundColor (0, 0, 0);viewer->addPolygonMesh(triangles,"my");viewer->addCoordinateSystem (1.0);viewer->initCameraParameters ();// 主循环while (!viewer->wasStopped ()){viewer->spinOnce (100);boost::this_thread::sleep (boost::posix_time::microseconds (100000));}// Finishreturn (0);
}

四、Fitting trimmed B-splines unordered point clouds 无序点云B样条（B-spines）拟合

b样条曲线经常用于曲线的平滑处理

https://mp.weixin.qq.com/s?src=11&timestamp=1589685829&ver=2343&signature=doeCJXnYVQzAYG1kNp7M2dqEgKlGLNIYx942W4tRE1yVwWD1M46JS9xyDiXOL*AZ-2hXEBZELPh*lIF*m7W486mK03u3S62w9s3-uZYdnxljZKoKNNqGy6-18XkMwuXM&new=1 贝塞尔曲线动图

这个教程讲解了如何在点云上利用b样条拟合算法获得一个平滑的参数化的表示。算法包括以下步骤：

（1）用pca初始化b样条表面，这里假设点云有两个主方向，例如它大致是一个平面。

（2）B样条曲面的细化和拟合。

（3）B样条曲线的循环初始化。这里我们假设点云是紧密的，即没有分离的簇。

（4）b样条曲线的拟合。

（5）修剪后的B样条曲面的三角剖分。

https://blog.csdn.net/shenziheng1/article/details/54411098 b样条相关知识

非均匀有理B样条曲线，缩写NURBS。

#include <pcl/point_cloud.h>
#include <pcl/point_types.h>
#include <pcl/io/pcd_io.h>#include <pcl/visualization/pcl_visualizer.h>
#include <pcl/surface/on_nurbs/fitting_surface_tdm.h>
#include <pcl/surface/on_nurbs/fitting_curve_2d_asdm.h>
#include <pcl/surface/on_nurbs/triangulation.h>
#include <pcl/console/parse.h>
using namespace pcl::console;
typedef pcl::PointXYZ Point;void
PointCloud2Vector3d (pcl::PointCloud<Point>::Ptr cloud, pcl::on_nurbs::vector_vec3d &data);void
visualizeCurve (ON_NurbsCurve &curve,ON_NurbsSurface &surface,pcl::visualization::PCLVisualizer &viewer);int
main (int argc, char *argv[])
{std::string pcd_file, file_3dm;if (argc < 2){printf ("\nUsage: pcl_example_nurbs_fitting_surface pcd<PointXYZ>-in-file -o 3 -rn 4 -in 10 -mr 128 -td 1\n\n");exit (0);}pcd_file = argv[1];//file_3dm = argv[2];pcl::visualization::PCLVisualizer viewer ("点云库PCL学习教程第二版-B样条曲面拟合点云数据");viewer.setBackgroundColor(255,255,255);viewer.setSize (800, 600);// ############################################################################// load point cloudprintf ("  loading %s\n", pcd_file.c_str ());pcl::PointCloud<Point>::Ptr cloud (new pcl::PointCloud<Point>);pcl::PCLPointCloud2 cloud2;pcl::on_nurbs::NurbsDataSurface data;if (pcl::io::loadPCDFile (pcd_file, cloud2) == -1)throw std::runtime_error ("  PCD file not found.");fromPCLPointCloud2 (cloud2, *cloud);PointCloud2Vector3d (cloud, data.interior);pcl::visualization::PointCloudColorHandlerCustom<Point> handler (cloud, 0, 255, 0);viewer.addPointCloud<Point> (cloud, handler, "cloud_cylinder");printf ("  %lu points in data set\n", cloud->size ());// ############################################################################// fit B-spline surface// parametersunsigned order (3);unsigned refinement (4);unsigned iterations (10);unsigned mesh_resolution (128);bool two_dim=true;parse_argument (argc, argv, "-o", order);parse_argument (argc, argv, "-rn", refinement);parse_argument (argc, argv, "-in", iterations);parse_argument (argc, argv, "-mr", mesh_resolution);parse_argument (argc, argv, "-td", two_dim);pcl::on_nurbs::FittingSurface::Parameter params;params.interior_smoothness = 0.2;params.interior_weight = 1.0;params.boundary_smoothness = 0.2;params.boundary_weight = 0.0;// initializeprintf ("  surface fitting ...\n");ON_NurbsSurface nurbs = pcl::on_nurbs::FittingSurface::initNurbsPCABoundingBox (order, &data);pcl::on_nurbs::FittingSurface fit (&data, nurbs);//  fit.setQuiet (false); // enable/disable debug output// mesh for visualizationpcl::PolygonMesh mesh;pcl::PointCloud<pcl::PointXYZ>::Ptr mesh_cloud (new pcl::PointCloud<pcl::PointXYZ>);std::vector<pcl::Vertices> mesh_vertices;std::string mesh_id = "mesh_nurbs";pcl::on_nurbs::Triangulation::convertSurface2PolygonMesh (fit.m_nurbs, mesh, mesh_resolution);viewer.addPolygonMesh (mesh, mesh_id);std::cout<<"Before refine"<<endl;viewer.spinOnce (3000);// surface refinementfor (unsigned i = 0; i < refinement; i++){fit.refine (0);if(two_dim)fit.refine (1);fit.assemble (params);fit.solve ();pcl::on_nurbs::Triangulation::convertSurface2Vertices (fit.m_nurbs, mesh_cloud, mesh_vertices, mesh_resolution);viewer.updatePolygonMesh<pcl::PointXYZ> (mesh_cloud, mesh_vertices, mesh_id);viewer.spinOnce (3000);std::cout<<"refine: "<<i<<endl;}// surface fitting with final refinement levelfor (unsigned i = 0; i < iterations; i++){fit.assemble (params);fit.solve ();pcl::on_nurbs::Triangulation::convertSurface2Vertices (fit.m_nurbs, mesh_cloud, mesh_vertices, mesh_resolution);viewer.updatePolygonMesh<pcl::PointXYZ> (mesh_cloud, mesh_vertices, mesh_id);viewer.spinOnce (3000);std::cout<<"iterations: "<<i<<endl;}// ############################################################################// fit B-spline curve// parameterspcl::on_nurbs::FittingCurve2dAPDM::FitParameter curve_params;curve_params.addCPsAccuracy = 5e-2;curve_params.addCPsIteration = 3;curve_params.maxCPs = 200;curve_params.accuracy = 1;curve_params.iterations = 100;curve_params.param.closest_point_resolution = 0;curve_params.param.closest_point_weight = 1.0;curve_params.param.closest_point_sigma2 = 0.1;curve_params.param.interior_sigma2 = 0.00001;curve_params.param.smooth_concavity = 1.0;curve_params.param.smoothness = 1.0;// initialisation (circular)printf ("  curve fitting ...\n");pcl::on_nurbs::NurbsDataCurve2d curve_data;curve_data.interior = data.interior_param;curve_data.interior_weight_function.push_back (true);ON_NurbsCurve curve_nurbs = pcl::on_nurbs::FittingCurve2dAPDM::initNurbsCurve2D (order, curve_data.interior);// curve fittingpcl::on_nurbs::FittingCurve2dASDM curve_fit (&curve_data, curve_nurbs);// curve_fit.setQuiet (false); // enable/disable debug outputcurve_fit.fitting (curve_params);visualizeCurve (curve_fit.m_nurbs, fit.m_nurbs, viewer);// ############################################################################// triangulation of trimmed surfaceprintf ("  triangulate trimmed surface ...\n");viewer.removePolygonMesh (mesh_id);pcl::on_nurbs::Triangulation::convertTrimmedSurface2PolygonMesh (fit.m_nurbs, curve_fit.m_nurbs, mesh,mesh_resolution);viewer.addPolygonMesh (mesh, mesh_id);// save trimmed B-spline surface/*if ( fit.m_nurbs.IsValid() ){ONX_Model model;ONX_Model_Object& surf = model.m_object_table.AppendNew();surf.m_object = new ON_NurbsSurface(fit.m_nurbs);surf.m_bDeleteObject = true;surf.m_attributes.m_layer_index = 1;surf.m_attributes.m_name = "surface";ONX_Model_Object& curv = model.m_object_table.AppendNew();curv.m_object = new ON_NurbsCurve(curve_fit.m_nurbs);curv.m_bDeleteObject = true;curv.m_attributes.m_layer_index = 2;curv.m_attributes.m_name = "trimming curve";model.Write(file_3dm.c_str());printf("  model saved: %s\n", file_3dm.c_str());}*/printf ("  ... done.\n");viewer.spin ();return 0;
}void
PointCloud2Vector3d (pcl::PointCloud<Point>::Ptr cloud, pcl::on_nurbs::vector_vec3d &data)
{for (unsigned i = 0; i < cloud->size (); i++){Point &p = cloud->at (i);if (!pcl_isnan (p.x) && !pcl_isnan (p.y) && !pcl_isnan (p.z))data.push_back (Eigen::Vector3d (p.x, p.y, p.z));}
}void
visualizeCurve (ON_NurbsCurve &curve, ON_NurbsSurface &surface, pcl::visualization::PCLVisualizer &viewer)
{pcl::PointCloud<pcl::PointXYZRGB>::Ptr curve_cloud (new pcl::PointCloud<pcl::PointXYZRGB>);pcl::on_nurbs::Triangulation::convertCurve2PointCloud (curve, surface, curve_cloud, 4);for (std::size_t i = 0; i < curve_cloud->size () - 1; i++){pcl::PointXYZRGB &p1 = curve_cloud->at (i);pcl::PointXYZRGB &p2 = curve_cloud->at (i + 1);std::ostringstream os;os << "line" << i;viewer.removeShape (os.str ());viewer.addLine<pcl::PointXYZRGB> (p1, p2, 1.0, 0.0, 0.0, os.str ());}pcl::PointCloud<pcl::PointXYZRGB>::Ptr curve_cps (new pcl::PointCloud<pcl::PointXYZRGB>);for (int i = 0; i < curve.CVCount (); i++){ON_3dPoint p1;curve.GetCV (i, p1);double pnt[3];surface.Evaluate (p1.x, p1.y, 0, 3, pnt);pcl::PointXYZRGB p2;p2.x = float (pnt[0]);p2.y = float (pnt[1]);p2.z = float (pnt[2]);p2.r = 255;p2.g = 0;p2.b = 0;curve_cps->push_back (p2);}viewer.removePointCloud ("cloud_cps");viewer.addPointCloud (curve_cps, "cloud_cps");
}

error：“Expression：vector subscript out of range”

解决：https://blog.csdn.net/zfjBIT/article/details/95348002

https://blog.csdn.net/zhang010206/article/details/39642827

将curve_param.accuracy改成一

实验结果：https://blog.csdn.net/zfjBIT/article/details/95354801

五、2Dfitting 2D拟合

PCL_第13章_重建相关推荐

c语言程序设计实验13文件,第13章_文件---《C语言程序设计》实验指导.ppt
第13章_文件---<C语言程序设计>实验指导第十三章主要内容 13.1 C文件概述 13.2 文件类型指针 13.3 文件的打开与关闭 13.4 文件的读写 13.5 文件的定位 1 ...
MySQL_第13章_约束
第13章_约束 1. 约束(constraint)概述 1.1 为什么需要约束数据完整性(Data Integrity)是指数据的精确性(Accuracy)和可靠性(Reliability).它是防 ...
Mysql 约束练习【第13章_约束】
#第13章_约束 /* 基础知识 1.1 为什么需要约束? 为了保证数据的完整性! 1.2 什么叫约束?对表中字段的限制. 1.3 约束的分类: 角度1:约束的字段的个数单列约束 vs 多列约束角 ...
明解C语言入门篇_第13章_文件处理
前言本文为业余学习<明解C语言入门篇>的记录,包含代码清单和练习题. 开始学习时间:2022年8月21日 +++++++++++++++++++++++++++++++ 第1章初识C语 ...
PCL_第12章_分割【2】
上面是上图像处理课程大湘老师PPT中的一个图,其实,我觉得点云中的很多技术都是从较为成熟的图像处理中借鉴过来的.就譬如之前关键点检测用到的Hough变换,以及上一篇分割笔记中有关区域生长的分割,还有这 ...
【山外笔记-计算机网络·第7版】第13章：计算机网络名词缩写汇总
本文下载链接: [学习笔记]第13章_计算机网络名词缩写汇总.pdf ACK:ACKnowledgement,确认 ADSL:Asymmetric Digital Subscriber Line,非对 ...
第09章_性能分析工具的使用
第09章_性能分析工具的使用文章目录 1. 数据库服务器的优化步骤 2. 查看系统性能参数 3. 统计SQL的查询成本:last_query_cost 4.定位执行慢的 SQL:慢查询日志 4.1 ...
Squid第13章日志文件
原贴: 第13章日志文件 13.1 cache.log 13.1.1 debug级别 13.1.2 转发cache.log消息到系统日志 13.1.3 dump cache.log消息到终端 13. ...
c语言是非结构化程序设计语言,第章_结构化程序设计基础和C语言的控制结构(fb).ppt...
第章_结构化程序设计基础和C语言的控制结构(fb).ppt 2.4.2 continue语句例2-24 编程序实现功能:检测从键盘上输入的以换行符结束的字符流,统计非字母字符的个数. 分析:通过循环 ...

PCL_第13章_重建