Saliency computation and simplification of point cloud data

According to human visual sensitivity, in this paper, we present a new simplification of point cloud based on point saliency. In order to find the nearest K points, we need to divide the space of Point cloud firstly. Secondly, we compute the normal vector and saliency of every point. At last, we combine octree structure and saliency to simplify point cloud data. Experiments show that our method can well preserve the point cloud in visual sensitivity area.