کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
527168 869299 2009 8 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Directly computing the generators of image homology using graph pyramids
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر چشم انداز کامپیوتر و تشخیص الگو
پیش نمایش صفحه اول مقاله
Directly computing the generators of image homology using graph pyramids
چکیده انگلیسی

We introduce a method for computing homology groups and their generators of a 2D image, using a hierarchical structure, i.e. irregular graph pyramid. Starting from an image, a hierarchy of the image is built by two operations that preserve homology of each region. Instead of computing homology generators in the base where the number of entities (cells) is large, we first reduce the number of cells by a graph pyramid. Then homology generators are computed efficiently on the top level of the pyramid, since the number of cells is small. A top down process is then used to deduce homology generators in any level of the pyramid, including the base level, i.e. the initial image. The produced generators fit on the object boundaries. A unique set of generators called the minimal set, is defined and its computation is discussed. We show that the new method produces valid homology generators and present some experimental results.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Image and Vision Computing - Volume 27, Issue 7, 4 June 2009, Pages 846–853
نویسندگان
, , , , ,