Identifying Connectome Module Patterns via New Balanced Multi-graph Normalized Cut

نویسندگان

  • Hongchang Gao
  • Chengtao Cai
  • Jingwen Yan
  • Lin Yan
  • Joaquín Goñi
  • Yang Wang
  • Feiping Nie
  • John D. West
  • Andrew J. Saykin
  • Li Shen
  • Heng Huang
چکیده

Computational tools for the analysis of complex biological networks are lacking in human connectome research. Especially, how to discover the brain network patterns shared by a group of subjects is a challenging computational neuroscience problem. Although some single graph clustering methods can be extended to solve the multi-graph cases, the discovered network patterns are often imbalanced, e.g. isolated points. To address these problems, we propose a novel indicator constrained and balanced multi-graph normalized cut method to identify the connectome module patterns from the connectivity brain networks of the targeted subject group. We evaluated our method by analyzing the weighted fiber connectivity networks.

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

ثبت نام

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

منابع مشابه

Human Connectome Module Pattern Detection Using a New Multi-graph MinMax Cut Model

Many recent scientific efforts have been devoted to constructing the human connectome using Diffusion Tensor Imaging (DTI) data for understanding the large-scale brain networks that underlie higher-level cognition in human. However, suitable computational network analysis tools are still lacking in human connectome research. To address this problem, we propose a novel multi-graph min-max cut mo...

متن کامل

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...

متن کامل

An Evolutionary Multi-objective Discretization based on Normalized Cut

Learning models and related results depend on the quality of the input data. If raw data is not properly cleaned and structured, the results are tending to be incorrect. Therefore, discretization as one of the preprocessing techniques plays an important role in learning processes. The most important challenge in the discretization process is to reduce the number of features’ values. This operat...

متن کامل

Tight Continuous Relaxation of the Balanced k-Cut Problem

Spectral Clustering as a relaxation of the normalized/ratio cut has become one of the standard graph-based clustering methods. Existing methods for the computation of multiple clusters, corresponding to a balanced k-cut of the graph, are either based on greedy techniques or heuristics which have weak connection to the original motivation of minimizing the normalized cut. In this paper we propos...

متن کامل

Spectral Algorithms for Temporal Graph Cuts

The sparsest cut problem consists of identifying a small set of edges that breaks the graph into balanced sets of vertices. The normalized cut problem balances the total degree, instead of the size, of the resulting sets. Applications of graph cuts include community detection and computer vision. However, cut problems were originally proposed for static graphs, an assumption that does not hold ...

متن کامل

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


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

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

ثبت نام

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

عنوان ژورنال:
  • Medical image computing and computer-assisted intervention : MICCAI ... International Conference on Medical Image Computing and Computer-Assisted Intervention

دوره 9350  شماره 

صفحات  -

تاریخ انتشار 2015