近年来无人机遥感发展迅速,其高机动性、高分辨率和低成本等特点,已经被证明为低空遥感探测的重要手段。通过配准序列图像,最优化迭代得到内外方位元素,基于核线约束,利用改进的密集匹配方法,直接生成整个区域的数字地表模型。在密集匹...近年来无人机遥感发展迅速,其高机动性、高分辨率和低成本等特点,已经被证明为低空遥感探测的重要手段。通过配准序列图像,最优化迭代得到内外方位元素,基于核线约束,利用改进的密集匹配方法,直接生成整个区域的数字地表模型。在密集匹配中,添加所有图像的FAST(Features from Accelerated Segment Test)角点,扩展投影点集,用于构建初始点云的格网平面。基于影像相关和核线约束,在相关的子区域内搜索最优投影点,然后通过最小二乘迭代各投影点,定位最优地面点。通过高斯函数的加权平均方法,引入各投影点的辐射比例因子,生成归一化的图像像素值,获得彩色点云。实验表明,该方法生成的真实彩色三维模型,有效地表现出建筑、道路和树木等基础地物类型。展开更多
This paper proposes and applies a method to sort two-dimensional control points of triangular Bezier surfaces in a row vector. Using the property of bivariate Jacobi basis functions, it further presents two algorithms...This paper proposes and applies a method to sort two-dimensional control points of triangular Bezier surfaces in a row vector. Using the property of bivariate Jacobi basis functions, it further presents two algorithms for multi-degree reduction of triangular Bezier surfaces with constraints, providing explicit degree-reduced surfaces. The first algorithm can obtain the explicit representation of the optimal degree-reduced surfaces and the approximating error in both boundary curve constraints and corner constraints. But it has to solve the inversion of a matrix whose degree is related with the original surface. The second algorithm entails no matrix inversion to bring about computational instability, gives stable degree-reduced surfaces quickly, and presents the error bound. In the end, the paper proves the efficiency of the two algorithms through examples and error analysis.展开更多
文摘近年来无人机遥感发展迅速,其高机动性、高分辨率和低成本等特点,已经被证明为低空遥感探测的重要手段。通过配准序列图像,最优化迭代得到内外方位元素,基于核线约束,利用改进的密集匹配方法,直接生成整个区域的数字地表模型。在密集匹配中,添加所有图像的FAST(Features from Accelerated Segment Test)角点,扩展投影点集,用于构建初始点云的格网平面。基于影像相关和核线约束,在相关的子区域内搜索最优投影点,然后通过最小二乘迭代各投影点,定位最优地面点。通过高斯函数的加权平均方法,引入各投影点的辐射比例因子,生成归一化的图像像素值,获得彩色点云。实验表明,该方法生成的真实彩色三维模型,有效地表现出建筑、道路和树木等基础地物类型。
基金Supported by the National Natural Science Foundation of China (6087311160933007)
文摘This paper proposes and applies a method to sort two-dimensional control points of triangular Bezier surfaces in a row vector. Using the property of bivariate Jacobi basis functions, it further presents two algorithms for multi-degree reduction of triangular Bezier surfaces with constraints, providing explicit degree-reduced surfaces. The first algorithm can obtain the explicit representation of the optimal degree-reduced surfaces and the approximating error in both boundary curve constraints and corner constraints. But it has to solve the inversion of a matrix whose degree is related with the original surface. The second algorithm entails no matrix inversion to bring about computational instability, gives stable degree-reduced surfaces quickly, and presents the error bound. In the end, the paper proves the efficiency of the two algorithms through examples and error analysis.
