scholarly journals ChromaTag: A Colored Marker and Fast Detection Algorithm

2017 ◽  
Author(s):  
Joseph DeGol ◽  
Timothy Bretl ◽  
Derek Hoiem
Keyword(s):  
Detection Algorithm ◽  
Fast Detection

scholarly journals A Fast Detection Algorithm for the X-Ray Pulsar Signal

2017 ◽  
Vol 2017 ◽  
pp. 1-5 ◽  
Author(s):  
Hao Liang ◽  
Yafeng Zhan
Keyword(s):  
False Alarm ◽  
Navigation System ◽  
Detection Probability ◽  
Autonomous Navigation ◽  
Detection Algorithm ◽  
Observation Time ◽  
X Ray ◽  
Fast Detection ◽  
Simulation Results ◽  
Short Observation Time

The detection of the X-ray pulsar signal is important for the autonomous navigation system using X-ray pulsars. In the condition of short observation time and limited number of photons for detection, the noise does not obey the Gaussian distribution. This fact has been little considered extant. In this paper, the model of the X-ray pulsar signal is rebuilt as the nonhomogeneous Poisson distribution and, in the condition of a fixed false alarm rate, a fast detection algorithm based on maximizing the detection probability is proposed. Simulation results show the effectiveness of the proposed detection algorithm.

Fast Detection of Degenerate Predicates in Free Space Construction

2019 ◽  
Vol 29 (03) ◽  
pp. 219-237
Author(s):  
Victor Milenkovic ◽  
Elisha Sacks ◽  
Nabeel Butt
Keyword(s):  
Free Space ◽  
Common Factor ◽  
Detection Algorithm ◽  
Algebraic Expression ◽  
Fast Detection ◽  
Space Construction ◽  
Univariate Polynomials ◽  
Univariate Polynomial ◽  
Polynomial Formula ◽  
Degeneracy Detection

An implementation of a computational geometry algorithm is robust if the combinatorial output is correct for every input. Robustness is achieved by ensuring that the predicates in the algorithm are evaluated correctly. A predicate is the sign of an algebraic expression whose variables are input parameters. The hardest case is detecting degenerate predicates where the value of the expression equals zero. We encounter this case in constructing the free space of a polyhedron that rotates around a fixed axis and translates freely relative to a stationary polyhedron. Each predicate involved in the construction is expressible as the sign of a univariate polynomial [Formula: see text] evaluated at a zero [Formula: see text] of a univariate polynomial [Formula: see text], where the coefficients of [Formula: see text] and [Formula: see text] are polynomials in the coordinates of the polyhedron vertices. A predicate is degenerate when [Formula: see text] is a zero of a common factor of [Formula: see text] and [Formula: see text]. We present an efficient degeneracy detection algorithm based on a one-time factoring of all the univariate polynomials over the ring of multivariate polynomials in the vertex coordinates. Our algorithm is 3500 times faster than the standard algorithm based on greatest common divisor computation. It reduces the share of degeneracy detection in our free space computations from 90% to 0.5% of the running time.

Overlap Detection Using Minkowski Sum in Two-Dimensional Layout

1999 ◽  
Author(s):  
Chan Yu ◽  
Souran Manoochehri
Keyword(s):  
Search Algorithm ◽  
Detection Algorithm ◽  
Minkowski Sum ◽  
Two Dimensional ◽  
Optimal Layout ◽  
Point Sets ◽  
Layout Problem ◽  
Fast Detection ◽  
Computer Based ◽  
Mathematical Relations

Abstract In optimal layout problems, which are often demanded by many industries, it is desired to have new computer-based approaches that are fast and effective. To determine the overall speed of layout procedure, one has to consider not only the search algorithm but also the performance of overlap detection algorithm. In this paper, a new methodology of detecting an overlap in two-dimensional layout problem is presented. This method introduces the concept of Minkowski sum, which is defined as an algebraic sum of two point sets, to the overlap detection. Using mathematical relations, the algorithm can rapidly detect if two convex objects are overlapping, fully contained or separated. Fast detection of overlaps eventually allows user to accelerate the overall speed of layout algorithms. In addition, to obtain the robustness of this method it is being extended to the cases involving irregular-shaped non-convex objects.

Sign in / Sign up

Export Citation Format

Share Document