A New FPGA Architecture of FAST and BRIEF Algorithm for On-Board Corner Detection and Matching

Jingjin Huang1, Guoqing Zhou2,3, Xiang Zhou4

  • 1School of Precision Instrument & Opto-Electronics Engineering, Tianjin University, Tianjin 300072, China. jingjin_huang@tju.edu.cn.

Related Concept Videos

Sign Test for Matched Pairs01:17

Sign Test for Matched Pairs

The sign test for matched pairs offers a robust method for comparing two paired samples, often for the effects of an intervention in one of them. This method is very useful in situations where the underlying distribution of the data is unknown. The test compares two related samples—often pre- and post-treatment measurements on the same subjects—to determine if there are significant differences in their median values.
To conduct the sign test, we first calculate the differences in...
427
Trial and Error and Algorithm01:12

Trial and Error and Algorithm

A problem-solving strategy is a plan of action used to find a solution. Different strategies have distinct action plans. Trial and error involves trying different solutions until one works. For instance, to fix a broken printer, you might check ink levels, ensure the paper tray isn't jammed, and verify the printer's connection to your laptop. This method can be time-consuming but is commonly used. Thomas Edison, for example, used trial and error to find a suitable filament for the light...
429
Polymer Classification: Architecture01:14

Polymer Classification: Architecture

Polymers are classified as linear or branched on the basis of their chain architecture. The polymer chains in linear polymers have a long chain-like structure with minimal to no branching at all. Even if a polymer features large substituent groups on the monomer, which appear as branches to the skeleton, it is not considered a branched polymer. A branched polymer contains secondary polymer chains that arise from the main polymer chain. The branching occurs when the polymer growth shifts from...
3.9K
Wilcoxon Signed-Ranks Test for Matched Pairs01:09

Wilcoxon Signed-Ranks Test for Matched Pairs

The Wilcoxon signed-rank test for matched pairs evaluates the null hypothesis by combining the ranks of differences with their signs. It essentially tests whether the median of the differences in a population of matched pairs is zero. Since the test incorporates more information than the sign test, it generally yields more trustable conclusions. This test also does not require the data to follow a normal distribution, but two conditions must be met for it to be applicable: (1) the data must...
506
Fast Fourier Transform01:10

Fast Fourier Transform

The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log⁡2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
972
Fast Decoupled and DC Powerflow01:24

Fast Decoupled and DC Powerflow

The fast decoupled power flow method addresses contingencies in power system operations, such as generator outages or transmission line failures. This method provides quick power flow solutions, essential for real-time system adjustments. Fast decoupled power flow algorithms simplify the Jacobian matrix by neglecting certain elements, leading to two sets of decoupled equations:
766