Abstract
A good saliency map captures the locally sharp features effectively. So a number of tasks in graphics can benefit from a computational model of mesh saliency. Motivated by the conception of Lee’s mesh saliency [12] and its successful application to mesh simplification and viewpoint selection, we modified Laplacian smoothing operator with mesh saliency. Unlike the classical Laplacian smoothing, where every new vertex of the mesh is moved to the barycenter of its neighbors, we set every new vertex position to be the linear interpolation between its primary position and the barycenter of its neighbors. We have shown how incorporating mesh saliency with Laplacian operator can effectively preserve most sharp features while denoising the noisy model. Details of our modified Laplacian smoothing algorithm are discussed along with the test results in this paper.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
