cMinMax: A Fast Algorithm to Find the Corners of an N-dimensional Convex Polytope

• URL: http://arxiv.org/abs/2011.14035v3
• Date: Fri, 13 May 2022 19:33:33 GMT
• Title: cMinMax: A Fast Algorithm to Find the Corners of an N-dimensional Convex Polytope
• Authors: Dimitrios Chamzas, Constantinos Chamzas and Konstantinos Moustakas
• Abstract summary: Corners are used in image registration andrecognition, tracking, SLAM, robot path finding and 2D or 3D object detection and retrieval. The proposed algorithm is faster, approximately by a factor of 5 compared to the widely used Harris Corner Detection algorithm. The algorithm can also be extended to N-dimensional polyhedrons.
• Score: 4.157415305926584
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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.

Related papers

• EDCSSM: Edge Detection with Convolutional State Space Model [3.649463841174485]
  Edge detection in images is the foundation of many complex tasks in computer graphics. Due to the feature loss caused by multi-layer convolution and pooling architectures, learning-based edge detection models often produce thick edges. This paper presents an edge detection algorithm which effectively addresses the aforementioned issues.
  arXiv  Detail & Related papers  (2024-09-03T05:13:25Z)
• Learning to Make Keypoints Sub-Pixel Accurate [80.55676599677824]
  This work addresses the challenge of sub-pixel accuracy in detecting 2D local features. We propose a novel network that enhances any detector with sub-pixel precision by learning an offset vector for detected features.
  arXiv  Detail & Related papers  (2024-07-16T12:39:56Z)
• Edge Detection Quantumized: A Novel Quantum Algorithm For Image Processing [0.0]
  This paper presents a novel protocol by combining the Flexible Representation of Quantum Images (FRQI) encoding and a modified QHED algorithm. An improved edge outline method has been proposed in this work resulting in a better object outline output and more accurate edge detection than the traditional QHED algorithm.
  arXiv  Detail & Related papers  (2024-04-10T10:29:08Z)
• Fully Sparse Fusion for 3D Object Detection [69.32694845027927]
  Currently prevalent multimodal 3D detection methods are built upon LiDAR-based detectors that usually use dense Bird's-Eye-View feature maps. Fully sparse architecture is gaining attention as they are highly efficient in long-range perception. In this paper, we study how to effectively leverage image modality in the emerging fully sparse architecture.
  arXiv  Detail & Related papers  (2023-04-24T17:57:43Z)
• Batch-efficient EigenDecomposition for Small and Medium Matrices [65.67315418971688]
  EigenDecomposition (ED) is at the heart of many computer vision algorithms and applications. We propose a QR-based ED method dedicated to the application scenarios of computer vision.
  arXiv  Detail & Related papers  (2022-07-09T09:14:12Z)
• Accelerated Quality-Diversity for Robotics through Massive Parallelism [4.260312058817663]
  Policy evaluations are already commonly performed in parallel to speed up QD algorithms but have limited capabilities on a single machine. With recent advances in simulators that run on accelerators, thousands of evaluations can performed in parallel on single GPU/TPU. We show that QD algorithms are ideal candidates and can scale with massive parallelism to be run at interactive timescales.
  arXiv  Detail & Related papers  (2022-02-02T19:44:17Z)
• luvHarris: A Practical Corner Detector for Event-cameras [3.5097082077065]
  Event-driven computer vision has become more accessible. Current state-of-the-art have either unsatisfactory accuracy or real-time performance when considered for practical use. We present yet another method to perform corner detection, dubbed look-up event-Harris (luvHarris)
  arXiv  Detail & Related papers  (2021-05-24T17:54:06Z)
• Towards Optimally Efficient Tree Search with Deep Learning [76.64632985696237]
  This paper investigates the classical integer least-squares problem which estimates signals integer from linear models. The problem is NP-hard and often arises in diverse applications such as signal processing, bioinformatics, communications and machine learning. We propose a general hyper-accelerated tree search (HATS) algorithm by employing a deep neural network to estimate the optimal estimation for the underlying simplified memory-bounded A* algorithm.
  arXiv  Detail & Related papers  (2021-01-07T08:00:02Z)
• Dynamic Resource-aware Corner Detection for Bio-inspired Vision Sensors [0.9988653233188148]
  We present an algorithm to detect asynchronous corners from a stream of events in real-time on embedded systems. The proposed algorithm is capable of selecting the best corner candidate among neighbors and achieves an average execution time savings of 59 %.
  arXiv  Detail & Related papers  (2020-10-29T12:01:33Z)
• Learning to Accelerate Heuristic Searching for Large-Scale Maximum Weighted b-Matching Problems in Online Advertising [51.97494906131859]
  Bipartite b-matching is fundamental in algorithm design, and has been widely applied into economic markets, labor markets, etc. Existing exact and approximate algorithms usually fail in such settings due to either requiring intolerable running time or too much computation resource. We propose textttNeuSearcher which leverages the knowledge learned from previously instances to solve new problem instances.
  arXiv  Detail & Related papers  (2020-05-09T02:48:23Z)
• MPLP++: Fast, Parallel Dual Block-Coordinate Ascent for Dense Graphical Models [96.1052289276254]
  This work introduces a new MAP-solver, based on the popular Dual Block-Coordinate Ascent principle. Surprisingly, by making a small change to the low-performing solver, we derive the new solver MPLP++ that significantly outperforms all existing solvers by a large margin.
  arXiv  Detail & Related papers  (2020-04-16T16:20:53Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.