PointCloudLibrary / PointCloudLibrary/pcl
Much faster registration has been developed to avoid the use of SVD
Nobody has claimed this yet.
- Dominant language
- C++
- Stars
- 11.1k
- Forks
- 4.7k
- Avg merge
- 4d 10h
- Merged PRs (30d)
- 6
Description
Hi all
Recently I have developed a fast algorithm which does not have loss of accuracy and robustness but consumes much less execution time on both PC and embedded processors. The article has been posted on pdf. Can we replace the SVD with the new algorithm in PCL library? That would be of benefit for time-consuming applications.
Thanks
Contributor guide
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
Start by reading the proposed algorithm in the linked arXiv paper and identifying which SVD use in PCL it is intended to replace. Compare its accuracy, robustness, and execution time on PC and embedded processors against the existing approach. Done means a concrete integration point and convincing evidence that the replacement preserves accuracy and robustness while improving runtime.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- cpp
- Domain
- computer-vision, performance
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100