loading
Papers Papers/2020

Research.Publish.Connect.

Paper

Authors: Dimitrios Chamzas 1 ; 2 ; Constantinos Chamzas 3 and Konstantinos Moustakas 1

Affiliations: 1 Department of Electrical and Computer Engineering, University of Patras, Rio Campus, Patras 26504, Greece ; 2 McCormick School of Engineering, Northwestern University, 2145 Sheridan Road, Evanston, IL 60208, U.S.A. ; 3 Department of Computer Science, Rice University, Houston, TX 77251, U.S.A.

ISBN: 978-989-758-488-6

ISSN: 2184-4321

Keyword(s): Augmented Reality Environments, Image Registration, Convex Polygon Corner Detection Algorithm, N-dimensional Convex Polyhedrons.

Abstract: During the last years, the emerging field of Augmented & Virtual Reality (AR-VR) has seen tremendous growth. At the same time there is a trend to develop low cost high-quality AR systems where computing power is in demand. Feature points are extensively used in these real-time frame-rate and 3D applications, therefore efficient high-speed feature detectors are necessary. Corners are such special features and often are used as the first step in the marker alignment in Augmented Reality (AR). Corners are also used in image registration and recognition, tracking, SLAM, robot path finding and 2D or 3D object detection and retrieval. Therefore there is a large number of corner detection algorithms but most of them are too computationally intensive for use in real-time applications of any complexity. Many times the border of the image is a convex polygon. For this special, but quite common case, we have developed a specific algorithm, cMinMax. The proposed algorithm is faster, approximately by a factor of 5 compared to the widely used Harris Corner Detection algorithm. In addition is highly parallelizable. The algorithm is suitable for the fast registration of markers in augmented reality systems and in applications where a computationally efficient real time feature detector is necessary. The algorithm can also be extended to N-dimensional polyhedrons. (More)

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.235.184.215

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Chamzas, D.; Chamzas, C. and Moustakas, K. (2021). cMinMax: A Fast Algorithm to Find the Corners of an N-dimensional Convex Polytope. In Proceedings of the 16th International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications - GRAPP, ISBN 978-989-758-488-6; ISSN 2184-4321, pages 229-236. DOI: 10.5220/0010259002290236

@conference{grapp21,
author={Dimitrios Chamzas. and Constantinos Chamzas. and Konstantinos Moustakas.},
title={cMinMax: A Fast Algorithm to Find the Corners of an N-dimensional Convex Polytope},
booktitle={Proceedings of the 16th International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications - GRAPP,},
year={2021},
pages={229-236},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0010259002290236},
isbn={978-989-758-488-6},
issn={2184-4321},
}

TY - CONF

JO - Proceedings of the 16th International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications - GRAPP,
TI - cMinMax: A Fast Algorithm to Find the Corners of an N-dimensional Convex Polytope
SN - 978-989-758-488-6
IS - 2184-4321
AU - Chamzas, D.
AU - Chamzas, C.
AU - Moustakas, K.
PY - 2021
SP - 229
EP - 236
DO - 10.5220/0010259002290236

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.
0123movie.net