کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
442063 692041 2011 11 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
A comparative evaluation of foreground/background sketch-based mesh segmentation algorithms
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر گرافیک کامپیوتری و طراحی به کمک کامپیوتر
پیش نمایش صفحه اول مقاله
A comparative evaluation of foreground/background sketch-based mesh segmentation algorithms
چکیده انگلیسی

This paper presents an extensive comparative evaluation of five popular foreground/background sketch-based interactive mesh segmentation algorithms, addressing the quantitative assessment of the accuracy, efficiency, and stability of each algorithm. To facilitate the comparison, we have developed a complete framework with an intuitive and simple sketch-based interface to enable interactive mesh segmentation by marking strokes to specify the foreground and background with the mouse buttons, allowing us to quantify the algorithms in a unified manner. The evaluation has been performed via extensive user experiments in which each participant was assigned to segment models with the evaluated algorithms and the corresponding update of each segmentation was recorded as a new refinement when additional interactions were added. We then collected the segmentations from participants and evaluated them against the ground-truth corpus constructed from the Princeton segmentation database. To investigate how well the interactive segmentations match the ground-truth, five metrics were used to measure the boundary and region accuracy of segmentations. By studying the experimental results, we have analyzed the performance of the evaluated algorithms and provided valuable insights into their characteristics.

Figure optionsDownload high-quality image (53 K)Download as PowerPoint slideHighlights
► We make an extensive comparison of five interactive mesh cutting algorithms.
► We create a ground-truth dataset to evaluate the algorithms.
► Extensive analysis and comparisons of the experimental results are demonstrated.
► Valuable insights into the performance of the algorithms are provided.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Graphics - Volume 35, Issue 3, June 2011, Pages 650–660
نویسندگان
, , ,