Normalized-cut algorithm for hierarchical vector field data segmentation

نویسندگان

  • Jiann-Liang Chen
  • Zhaojun Bai
  • Bernd Hamann
  • Terry J. Ligocki
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A comparative performance of gray level image thresholding using normalized graph cut based standard S membership function

In this research paper, we use a normalized graph cut measure as a thresholding principle to separate an object from the background based on the standard S membership function. The implementation of the proposed algorithm known as fuzzy normalized graph cut method. This proposed algorithm compared with the fuzzy entropy method [25], Kittler [11], Rosin [21], Sauvola [23] and Wolf [33] method. M...

متن کامل

Top-Down Evolutionary Image Segmentation Using a Hierarchical Social Metaheuristic

This paper presents an application of a hierarchical social (HS) metaheuristic to region-based segmentation. The original image is modelled as a simplified image graph, which is successively partitioned into two regions, corresponding to the most significant components of the actual image, until a termination condition is met. The graph-partitioning task is solved as a variant of the min-cut pr...

متن کامل

Spectral-spatial classification of hyperspectral images by combining hierarchical and marker-based Minimum Spanning Forest algorithms

Many researches have demonstrated that the spatial information can play an important role in the classification of hyperspectral imagery. This study proposes a modified spectral–spatial classification approach for improving the spectral–spatial classification of hyperspectral images. In the proposed method ten spatial/texture features, using mean, standard deviation, contrast, homogeneity, corr...

متن کامل

W-Net: A Deep Model for Fully Unsupervised Image Segmentation

While significant attention has been recently focused on designing supervised deep semantic segmentation algorithms for vision tasks, there are many domains in which sufficient supervised pixel-level labels are difficult to obtain. In this paper, we revisit the problem of purely unsupervised image segmentation and propose a novel deep architecture for this problem. We borrow recent ideas from s...

متن کامل

A Graph-Based Image Segmentation Algorithm Using a Hierarchical Social Metaheuristic

This chapter proposes a new evolutionary graph-based image segmentation method to improve quality result. Our approach is quite general and can be considered as a pixel or region based segmentation technique. What is more important is that they (pixels or regions) are not necessarily adjacent. It starts from an image described by a simplified undirected weighted graph where nodes represent eith...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003