Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The depth of a scene is very important in computer vision. One way to get the depth map is by stereo vision. But because of the noise, textureless area of the scene and the occlusion area, stereo matching becomes rather challenging. Some very good algorithms have been proposed. , the mainstream semi-global stereo matching algorithm (SGM) is studied, and a disparity refinement algorithm is proposed. By using SGM, an initial disparity map is computed. Then a better disparity map can be obtained by applying the disparity refinement algorithm. The proposed refinement algorithm is based on a segment-tree and a fast ighted median filter (WMF). Some experiments are done based on the ll-known Middlebury dataset. The results show that the proposed algorithm can improve the quality of the disparity map effectively in most cases.
['Wenxuan Wu', 'Li Li', 'Weiqi Jin']
I am writing a research paper on a idea Disparity refinement based on segment-tree and fast weighted median filter
[{"from": "human", "value": "I am writing a research paper on a idea Disparity refinement based on segment-tree and fast weighted median filter"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The depth of a scene is very important in computer vision. One way to get the depth map is by stereo vision. But because of the noise, textureless area of the scene and the occlusion area, stereo matching becomes rather challenging. Some very good algorithms have been proposed. , the mainstream semi-global stereo matching algorithm (SGM) is studied, and a disparity refinement algorithm is proposed. By using SGM, an initial disparity map is computed. Then a better disparity map can be obtained by applying the disparity refinement algorithm. The proposed refinement algorithm is based on a segment-tree and a fast ighted median filter (WMF). Some experiments are done based on the ll-known Middlebury dataset. The results show that the proposed algorithm can improve the quality of the disparity map effectively in most cases."}]