This forum is disabled, please visit https://forum.opencv.org

2019-09-16 03:06:42 -0600 | received badge | ● Notable Question (source) |

2019-01-17 14:47:55 -0600 | received badge | ● Popular Question (source) |

2018-06-07 10:03:59 -0600 | received badge | ● Nice Question (source) |

2017-05-09 08:01:22 -0600 | received badge | ● Enthusiast |

2017-05-09 03:23:54 -0600 | received badge | ● Student (source) |

2017-05-08 15:44:38 -0600 | asked a question | Error in gauss-newton implementation for pose optimization Hello. I’m using a modified version of a gauss-newton method to refine a pose estimate using OpenCV. The unmodified code can be found here: http://people.rennes.inria.fr/Eric.Marchand/pose-estimation/tutorial-pose-gauss-newton-opencv.html The details of this approach are outlined in the corresponding paper:
A PDF can be found here: https://hal.inria.fr/hal-01246370/document The part that is relevant (Pages 4 and 5) are screencapped below: Here is what I have done. First, I’ve (hopefully) “corrected” some errors: (a) Here is the relevant code I am using, in its entirety (control starts at optimizePose3()): (more) |

2017-01-05 12:54:55 -0600 | received badge | ● Critic (source) |

2016-10-28 11:09:10 -0600 | commented answer | How to use cv::flann (radiusSearch) to find all neighbouring points within radius r in 2D using Euclidean distance OK. Thanks again for your help. |

2016-10-28 09:23:21 -0600 | commented answer | How to use cv::flann (radiusSearch) to find all neighbouring points within radius r in 2D using Euclidean distance Thank you so much for your response. Is there any way to avoid specifying the number of neighbours to find? The trailing zeros take up memory, and it won't be clear if the indices indicate the first element or no-more-elements. |

2016-10-28 09:07:16 -0600 | received badge | ● Scholar (source) |

2016-10-28 09:07:14 -0600 | received badge | ● Supporter (source) |

2016-10-27 21:59:01 -0600 | asked a question | How to use cv::flann (radiusSearch) to find all neighbouring points within radius r in 2D using Euclidean distance I have a std::vector of a couple million points (cv::Point2d) and I'd like to find, for every point, all other points within a 2 pixel radius. Since my project already requires OpenCV, I thought it would be useful to use the cv::flann module. However, I haven't made much progress with my attempts so far. In particular, I'm not sure how to present my data to the index constructor. Here is my best attempt: The code compiles, but I receive a runtime error: Can anyone please help me figure out how to use radiusSearch? And how can I configure the radiusSearch to find all neighbours, instead of just max_neighbours? Thanks in advance. |

Copyright OpenCV foundation, 2012-2018. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.