-
Shai authored
An extremely rare case where, for numeric reasons bestM finds more inliers than ninliersMax. This RARE case causes memory corruption and a nasty seg fault.
91201b22
An extremely rare case where, for numeric reasons bestM finds more inliers than ninliersMax. This RARE case causes memory corruption and a nasty seg fault.
Name |
Last commit
|
Last update |
---|---|---|
.. | ||
clp.hpp | Loading commit data... | |
deblurring.cpp | Loading commit data... | |
fast_marching.cpp | Loading commit data... | |
frame_source.cpp | Loading commit data... | |
global_motion.cpp | Loading commit data... | |
inpainting.cpp | Loading commit data... | |
log.cpp | Loading commit data... | |
motion_stabilizing.cpp | Loading commit data... | |
optical_flow.cpp | Loading commit data... | |
outlier_rejection.cpp | Loading commit data... | |
precomp.hpp | Loading commit data... | |
stabilizer.cpp | Loading commit data... | |
wobble_suppression.cpp | Loading commit data... |