<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[hbbdafamingjia的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/hbbdafamingjia</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; hbbdafamingjia]]></copyright><item><title><![CDATA[面试算法-哈希表|利用python实现哈希表的解法的讲解]]></title><link>https://blog.youkuaiyun.com/hbbdafamingjia/article/details/126705858</link><guid>https://blog.youkuaiyun.com/hbbdafamingjia/article/details/126705858</guid><author>hbbdafamingjia</author><pubDate>Mon, 05 Sep 2022 17:22:02 +0800</pubDate><description><![CDATA[利用python解决哈希表的算法题，提供解题思路。]]></description><category></category></item><item><title><![CDATA[读论文|利用GAN生成三维点云WarpingGAN: Warping Multiple Uniform Priors for Adversarial 3D Point Cloud Generation]]></title><link>https://blog.youkuaiyun.com/hbbdafamingjia/article/details/126695350</link><guid>https://blog.youkuaiyun.com/hbbdafamingjia/article/details/126695350</guid><author>hbbdafamingjia</author><pubDate>Sun, 04 Sep 2022 22:42:37 +0800</pubDate><description><![CDATA[【代码】读论文|利用GAN生成三维点云WarpingGAN: Warping Multiple Uniform Priors for Adversarial 3D Point Cloud Generation。]]></description><category></category></item><item><title><![CDATA[复现PU-Net利用深度学习对点云做上采样，可以补一些小孔洞]]></title><link>https://blog.youkuaiyun.com/hbbdafamingjia/article/details/123757152</link><guid>https://blog.youkuaiyun.com/hbbdafamingjia/article/details/123757152</guid><author>hbbdafamingjia</author><pubDate>Sun, 27 Mar 2022 13:02:12 +0800</pubDate><description><![CDATA[利用深度学习，对点云做上采样


]]></description><category></category></item><item><title><![CDATA[Open3d估计法向量并指定其方向]]></title><link>https://blog.youkuaiyun.com/hbbdafamingjia/article/details/123742260</link><guid>https://blog.youkuaiyun.com/hbbdafamingjia/article/details/123742260</guid><author>hbbdafamingjia</author><pubDate>Fri, 25 Mar 2022 18:20:51 +0800</pubDate><description><![CDATA[法相量估计，并指定方向]]></description><category></category></item><item><title><![CDATA[代码：利用python+open3D实现FPS(farthest_point_sample)采样并可视化]]></title><link>https://blog.youkuaiyun.com/hbbdafamingjia/article/details/118359051</link><guid>https://blog.youkuaiyun.com/hbbdafamingjia/article/details/118359051</guid><author>hbbdafamingjia</author><pubDate>Wed, 30 Jun 2021 13:37:02 +0800</pubDate><description><![CDATA[本代码采用python+open3D实现，注意open3d可能会出现以下问题，建议在python3.6的情况下，则可以解决这个问题。

或者自己找一些其他博客解决。



以下是完整代码，关于FPS采样：


import open3d as o3d
import numpy as np
olderr = np.seterr(all='ignore')
def farthest_point_sample(point, npoint):
    N, D = point.shape
    xyz = poi]]></description><category></category></item><item><title><![CDATA[图解点云深度学习中FPS(Farthest Point Sampling)--最远点采样算法]]></title><link>https://blog.youkuaiyun.com/hbbdafamingjia/article/details/118243904</link><guid>https://blog.youkuaiyun.com/hbbdafamingjia/article/details/118243904</guid><author>hbbdafamingjia</author><pubDate>Sat, 26 Jun 2021 13:00:06 +0800</pubDate><description><![CDATA[一、回忆Farthest Point Sampling算法过程（建议详细看完）

我们选取一个点云，我们假设整个点集为一共有n个点，来进行算法的讲解。

随机在整个点集中选取一个点作为起始点，并且放入集合中，其中集合B为我们采样后的点集。
	计算剩余n-1个点到的距离，并且选择距离最大的点，假设为，并将这个点写入集合。
	计算剩余n-2个点距离集合B中的点的距离，并选取最小的距离值假设为，其中假设点为，再计算n-2个点距离集合B中点的距离，并选取最小的距离值假设为，其中假设点为,随后选取和中比较大的值，假设]]></description><category></category></item><item><title><![CDATA[Windows10下在python3.7中配置Python-pcl0.3.0的艰难历程]]></title><link>https://blog.youkuaiyun.com/hbbdafamingjia/article/details/117749296</link><guid>https://blog.youkuaiyun.com/hbbdafamingjia/article/details/117749296</guid><author>hbbdafamingjia</author><pubDate>Wed, 09 Jun 2021 17:41:08 +0800</pubDate><description><![CDATA[注意！注意！注意！如果没有安装vs+pcl，请出门右拐，找一些vs配置pcl的教程。（加油，配置过程中时刻告诉自己，我可以的）
]]></description><category></category></item></channel></rss>