论文标题
CMINMAX:快速算法以找到n维凸多属的角落
cMinMax: A Fast Algorithm to Find the Corners of an N-dimensional Convex Polytope
论文作者
论文摘要
在过去的几年中,增强和虚拟现实(AR-VR)的新兴领域已经看到了巨大的生长。同时,有一种趋势是开发低成本高质量的AR系统,其中计算需求中的电源。特征点在这些实时帧速率和3D应用中广泛使用,因此有效的高速特征探测器是必要的。角落是如此特殊的特征,通常被用作增强现实(AR)标记对齐的第一个步骤。角落还用于图像注册且识别,跟踪,猛击,机器人路径查找以及2D或3D对象检测和检索。因此,有大量的角检测算法,但其中大多数在计算上太密集了,无法使用任何复杂性的Inreal时间应用。很多时候,图像的边界是凸多边形。对于本规范但很常见的情况,我们已经开发了一种特定的算法Cminmax。与广泛使用的哈里斯角检测算法相比,提出的算法更快,大约为5倍。陷入困境是高度可行的。该算法适用于增强系统系统中标记的快速注册,以及在具有计算有效的实时特征检测器的应用中。该算法也可以扩展到n二维多面体。
During the last years, the emerging field of Augmented & Virtual Reality (AR-VR) has seen tremendousgrowth. At the same time there is a trend to develop low cost high-quality AR systems where computing poweris in demand. Feature points are extensively used in these real-time frame-rate and 3D applications, thereforeefficient high-speed feature detectors are necessary. Corners are such special features and often are used as thefirst step in the marker alignment in Augmented Reality (AR). Corners are also used in image registration andrecognition, tracking, SLAM, robot path finding and 2D or 3D object detection and retrieval. Therefore thereis a large number of corner detection algorithms but most of them are too computationally intensive for use inreal-time applications of any complexity. Many times the border of the image is a convex polygon. For thisspecial, but quite common case, we have developed a specific algorithm, cMinMax. The proposed algorithmis faster, approximately by a factor of 5 compared to the widely used Harris Corner Detection algorithm. Inaddition is highly parallelizable. The algorithm is suitable for the fast registration of markers in augmentedreality systems and in applications where a computationally efficient real time feature detector is necessary.The algorithm can also be extended to N-dimensional polyhedrons.