A Multiscale Metric for 3D Mesh Visual Quality Assessment
نویسندگان
چکیده
منابع مشابه
A Multiscale Metric for 3D Mesh Visual Quality Assessment
Many processing operations are nowadays applied on 3D meshes like compression, watermarking, remeshing and so forth; these processes are mostly driven and/or evaluated using simple distortion measures like the Hausdorff distance and the root mean square error, however these measures do not correlate with the human visual perception while the visual quality of the processed meshes is a crucial i...
متن کاملA Curvature Tensor Distance for Mesh Visual Quality Assessment
This paper presents a new objective metric for assessing the visual difference between a reference or ‘perfect’ mesh and its distorted version. The proposed metric is based on the measurement of a distance between curvature tensors of the two triangle meshes under comparison. Unlike existing methods, our algorithm uses not only eigenvalues but also eigenvectors of the curvature tensor to derive...
متن کاملA fast roughness-based approach to the assessment of 3D mesh visual quality
We propose in this paper a new objective metric for the visual quality assessment of 3D meshes. The metric can predict the extent of the visual difference between a reference mesh, which is considered to be of perfect quality, and a distorted version. The proposed metric is based on a mesh local roughness measure derived from Gaussian curvature. The perceptual distance between two meshes is com...
متن کاملSharpness metric for no-reference image visual quality assessment
This paper presents a novel sharpness metric for color images. The proposed metric can be used for no-reference assessment of image visual quality. The metric basically relies on local power of wavelet transform high-frequency coefficients. It also takes into account a possibility of the presence of macrophotography and portrait photography effects in an image where the image part (usually cent...
متن کاملWatermarking 3D Triangular Mesh with High Visual Quality
Two common problems are usually encountered in 3D watermarking, the causality problem and the convergence problem. In order to avoid the causality problem, we have proposed an efficient technique for traversing the polygonal meshes. Our procedure also solved the convergence problem by reducing the update of the vertices in the smooth areas and increasing it in the rough areas. The roughness of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Graphics Forum
سال: 2011
ISSN: 0167-7055
DOI: 10.1111/j.1467-8659.2011.02017.x