Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  addresses the general 3-D rigid motion problem, where the point correspondences and the motion parameters beten two sets of 3-D points are to be recovered. The existence of missing points in the two sets is the most difficult problem.  first show a mathematical symmetry in the solutions of rotation parameters and point correspondences. A closed-form solution based on the correlation matrix eigenstructure decomposition is proposed for correspondence recovery with no missing points. Using a heuristic measure of point pair affinity derived from the eigenstructure, a ighted bipartite matching algorithm is developed to determine the correspondences in general cases where missing points occur. The use of the affinity heuristic also leads to a fast outlier removal algorithm, which can be run iteratively to refine the correspondence recovery. Simulation results and experiments on real images are shown in both ideal and general cases.
['Xiaoguang Wang', 'Yong-Qing Cheng', 'Robert T. Collins', 'Allen R. Hanson']
I am writing a research paper on a idea Determining correspondences and rigid motion of 3-D point sets with missing data
[{"from": "human", "value": "I am writing a research paper on a idea Determining correspondences and rigid motion of 3-D point sets with missing data"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  addresses the general 3-D rigid motion problem, where the point correspondences and the motion parameters beten two sets of 3-D points are to be recovered. The existence of missing points in the two sets is the most difficult problem.  first show a mathematical symmetry in the solutions of rotation parameters and point correspondences. A closed-form solution based on the correlation matrix eigenstructure decomposition is proposed for correspondence recovery with no missing points. Using a heuristic measure of point pair affinity derived from the eigenstructure, a ighted bipartite matching algorithm is developed to determine the correspondences in general cases where missing points occur. The use of the affinity heuristic also leads to a fast outlier removal algorithm, which can be run iteratively to refine the correspondence recovery. Simulation results and experiments on real images are shown in both ideal and general cases."}]