-
-
Notifications
You must be signed in to change notification settings - Fork 39
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
[REVIEW]: small_gicp: Efficient and parallel algorithms for point cloud registration #6948
Comments
Hello humans, I'm @editorialbot, a robot that can help you with some common editorial tasks. For a list of things I can do to help you, just type:
For example, to regenerate the paper pdf after making changes in the paper's md or bib files, type:
|
|
Software report:
Commit count by author:
|
Paper file info: 📄 Wordcount for ✅ The paper includes a |
License info: ✅ License found: |
Review checklist for @versatran01Conflict of interest
Code of Conduct
General checks
Functionality
Documentation
Software paper
|
@versatran01 @abougouffa |
Review checklist for @abougouffaConflict of interest
Code of Conduct
General checks
Functionality
Documentation
Software paper
|
@editorialbot generate pdf |
Hi @versatran01, @abougouffa how is your review going? |
Hi @diehlpk I've read the paper and taken a look at the code but didn't have the time for now to check the code in deep and try it locally. I will try to finish the review next week! Thanks for your patience! |
I would like to thank you for your patience, and congratulations @koide3 for the excellent implementation. I have finished the review of the paper and the code, the code is well written and documented. The installation and execution went as described in the documentation. The results I got by running the benchmarks on the same dataset used by the author gave results similar to these presented in the repository. The paper might need few modifications:
Besides introducing the "iterative point cloud registration" term and its aliases, this phrase doesn't add any significant information. I would like to have a phrase like:
Also, I think you can add some citations of papers using the iterative point cloud registration to solve these problems:
In the statement of needs:
The "notable" qualification here seems a bit arbitrary! Indeed, there are other known open source libraries like |
I will try to finish my review by next week |
@abougouffa |
I have reviewed the paper and the code and checked all checklist items.
Overall I think this is good work and a valuable contribution to the robotics community. |
@versatran01
It seems some changes in Iridescence introduced cmake errors. This should be fixed quickly.
I agree. I think it is possible to distribute a part of KITTI because it employs CC BY-NC-SA license that allows re-distribution. I'll upload a small part of KITTI so that the user can easily reproduce the evaluation results.
I also agree with this point. I'll enhance documentation to tell the detailed behavior of the implemented algorithms to the user.
Thank you for your suggestion. I'll revise the manuscript with these points along with suggestions given by @abougouffa . @abougouffa @versatran01 |
@editorialbot generate pdf |
Thank you again for taking the time to review small_gicp! I revised the code, doc, and manuscript as follows. I believe the quality of the package and paper are greatly improved thanks to your suggestions. Please let me know if there are areas that need more improvements.
I revised the sentence as follows to clarify what "iterative point cloud registration" means.
I added relevant references as follows.
I agree, the use of "notable" was a bit subjective. I revised the sentence as follows to put emphasis on processing speed and highlight libraries that are frequently used in real-time applications.
==================
I fixed the build error with koide3/small_gicp#81
I uploaded a small subset of KITTI00 sequence and added a link to the benchmark page: https://github.com/koide3/small_gicp/blob/master/BENCHMARK.md#dataset
I updated both C++ and python documentations to tell detailed behaviors of the implemented algorithms. If I'm still missing anything to be noted, please let me know. Updates: koide3/small_gicp#82
I guess it stems from some dependency problems. While I think it is a minor issue (we can at least check the coverage through CI), if you recommend addressing this, I'll try to make
Thank you for your suggestion! Additional neighbor search methods must be beneficial. I think we can easily integrate new neighbor search methods into small_gicp thanks to its design, and I'm planning to add a few implementations including the projective search. I added a future work section in the paper as follows.
|
@editorialbot check references |
|
@editorialbot set 10.5281/zenodo.13283012 as archive |
Done! archive is now 10.5281/zenodo.13283012 |
@editorialbot recommend-accept |
|
|
👋 @openjournals/csism-eics, this paper is ready to be accepted and published. Check final proof 👉📄 Download article If the paper PDF and the deposit XML files look good in openjournals/joss-papers#5741, then you can now move forward with accepting the submission by compiling again with the command |
👋 @koide3 - As track chair, I'll next proofread this and see what else needs to be done, if anything. |
👋 @koide3 - I just see a couple of small things in the cases of characters in the references, which I've suggested in koide3/small_gicp#85. Please merge this, or let me know what you disagree with, then we can continue. |
@danielskatz |
@editorialbot recommend-accept |
|
|
👋 @openjournals/csism-eics, this paper is ready to be accepted and published. Check final proof 👉📄 Download article If the paper PDF and the deposit XML files look good in openjournals/joss-papers#5751, then you can now move forward with accepting the submission by compiling again with the command |
@koide3 - sorry, I missed one fix that I now see: koide3/small_gicp#86 |
I just merged it as well. Thanks a lot! |
@editorialbot recommend-accept |
|
|
👋 @openjournals/csism-eics, this paper is ready to be accepted and published. Check final proof 👉📄 Download article If the paper PDF and the deposit XML files look good in openjournals/joss-papers#5752, then you can now move forward with accepting the submission by compiling again with the command |
@editorialbot accept |
|
Ensure proper citation by uploading a plain text CITATION.cff file to the default branch of your repository. If using GitHub, a Cite this repository menu will appear in the About section, containing both APA and BibTeX formats. When exported to Zotero using a browser plugin, Zotero will automatically create an entry using the information contained in the .cff file. You can copy the contents for your CITATION.cff file here: CITATION.cff
If the repository is not hosted on GitHub, a .cff file can still be uploaded to set your preferred citation. Users will be able to manually copy and paste the citation. |
🐘🐘🐘 👉 Toot for this paper 👈 🐘🐘🐘 |
🚨🚨🚨 THIS IS NOT A DRILL, YOU HAVE JUST ACCEPTED A PAPER INTO JOSS! 🚨🚨🚨 Here's what you must now do:
Any issues? Notify your editorial technical team... |
Congratulations to @koide3 (Kenji Koide) on your publication!! And thanks to @versatran01 and @abougouffa for reviewing, and to @diehlpk for editing! |
🎉🎉🎉 Congratulations on your paper acceptance! 🎉🎉🎉 If you would like to include a link to your paper from your README use the following code snippets:
This is how it will look in your documentation: We need your help! The Journal of Open Source Software is a community-run journal and relies upon volunteer effort. If you'd like to support us please consider doing either one (or both) of the the following:
|
Submitting author: @koide3 (Kenji Koide)
Repository: https://github.com/koide3/small_gicp
Branch with paper.md (empty if default branch): paper
Version: v1.0.0
Editor: @diehlpk
Reviewers: @versatran01, @abougouffa
Archive: 10.5281/zenodo.13283012
Status
Status badge code:
Reviewers and authors:
Please avoid lengthy details of difficulties in the review thread. Instead, please create a new issue in the target repository and link to those issues (especially acceptance-blockers) by leaving comments in the review thread below. (For completists: if the target issue tracker is also on GitHub, linking the review thread in the issue or vice versa will create corresponding breadcrumb trails in the link target.)
Reviewer instructions & questions
@versatran01 & @abougouffa, your review will be checklist based. Each of you will have a separate checklist that you should update when carrying out your review.
First of all you need to run this command in a separate comment to create the checklist:
The reviewer guidelines are available here: https://joss.readthedocs.io/en/latest/reviewer_guidelines.html. Any questions/concerns please let @diehlpk know.
✨ Please start on your review when you are able, and be sure to complete your review in the next six weeks, at the very latest ✨
Checklists
📝 Checklist for @versatran01
📝 Checklist for @abougouffa
The text was updated successfully, but these errors were encountered: