نتایج جستجو برای: روش ncut

تعداد نتایج: 369615  

2010
Frank Lin William W. Cohen

We present a simple and scalable graph clustering method called power iteration clustering (PIC). PIC finds a very low-dimensional embedding of a dataset using truncated power iteration on a normalized pair-wise similarity matrix of the data. This embedding turns out to be an effective cluster indicator, consistently outperforming widely used spectral methods such as NCut on real datasets. PIC ...

2016
Simon Koppers Christoph Hebisch Dorit Merhof

Due to its ability to automatically identify spatially and functionally related white matter fiber bundles, fiber clustering has the potential to improve our understanding of white matter anatomy. The normalized cuts (NCut) criterion has proven to be a suitable method for clustering fiber tracts. In this work, we show that the NCut value can be used for unsupervised feature selection as a measu...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه صنعتی (نوشیروانی) بابل - دانشکده برق و کامپیوتر 1392

قطعه بندی تصویر، یک مساله پایه در بینایی ماشین است. در روش مبتنی بر برش نرمالیزه گراف (ncut)، حل این مساله به انتخاب بردار ویژه متناظر با دومین کوچکترین مقدار ویژه یک ماتریس خاص می انجامد. در این پایان نامه، ضمن بیان هم ارزی رابطه ریاضی حاکم بر مساله ی بدون مربیِ ncut با معیار fisher-rao در طبقه بندیِ با مربی، از نگاهی نو به مساله ی انتخاب بردار ویژه پرداخته شده است. در این پژوهش با پیشنهاد معیار...

2008
Markus Maier Ulrike von Luxburg Matthias Hein

Graph clustering methods such as spectral clustering are defined for general weighted graphs. In machine learning, however, data often is not given in form of a graph, but in terms of similarity (or distance) values between points. In this case, first a neighborhood graph is constructed using the similarities between the points and then a graph clustering algorithm is applied to this graph. In ...

2002
Serge Belongie Charless Fowlkes Fan Chung Jitendra Malik

Fowlkes et al recently introduced an approximation to the Normalized Cut NCut grouping algorithm based on random subsampling and the Nystr om extension As presented their method is restricted to the case where W the weighted adjacency matrix is positive de nite Although many common measures of image similarity i e kernels are positive de nite a popular example being Gaussian weighted distance t...

2002
Serge J. Belongie Charless C. Fowlkes Fan Chung Graham Jitendra Malik

Fowlkes et al. [7] recently introduced an approximation to the Normalized Cut (NCut) grouping algorithm [18] based on random subsampling and the Nyström extension. As presented, their method is restricted to the case where W , the weighted adjacency matrix, is positive definite. Although many common measures of image similarity (i.e. kernels) are positive definite, a popular example being Gauss...

Journal: :DEStech Transactions on Engineering and Technology Research 2019

2015
Ruriko Yoshida Kenji Fukumizu Chrysafis Vogiatzis

Summary: Both theory and empirical evidence indicate that phylogenies (trees) of different genes (loci) do not display precisely matched topologies. This phylogenetic incongruence is attributed to the reticulated evolutionary history of most species due to meiotic sexual recombination in eukaryotes, or horizontal transfers of genetic materials in prokaryotes. Nonetheless, most genes do display ...

Journal: :IOP Conference Series: Earth and Environmental Science 2020

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید