We introduce a nonlocal discrete regularization framework on weighted graphs of the arbitrary topologies for image and manifold processing. The approach considers the problem as a...
Abstract. Graph cut minimization formulates the segmentation problem as the liner combination of data and smoothness terms. The smoothness term is included in the energy formulatio...
Given a large graph, like a computer network, which k nodes should we immunize (or monitor, or remove), to make it as robust as possible against a computer virus attack? We need (...
Hanghang Tong, B. Aditya Prakash, Charalampos E. T...
Abstract. Given a graph with billions of nodes and edges, how can we find patterns and anomalies? Are there nodes that participate in too many or too few triangles? Are there clos...
Systematic content screening of cell phenotypes in microscopic images has been shown promising in gene function understanding and drug design. However, manual annotation of cells ...
Jun Wang, Shih-Fu Chang, Xiaobo Zhou, Stephen T. C...