Sciweavers

513 search results - page 80 / 103
» Soft Edge Coloring
Sort
View
108
Voted
MICCAI
2008
Springer
16 years 1 months ago
Automatic Image Analysis of Histopathology Specimens Using Concave Vertex Graph
Automatic image analysis of histopathology specimens would help the early detection of blood cancer. The first step for automatic image analysis is segmentation. However, touching ...
Lin Yang, Oncel Tuzel, Peter Meer, David J. For...
70
Voted
ICIP
2009
IEEE
16 years 1 months ago
Saliency Detection For Content-aware Image Resizing
Content aware image re-targeting methods aim to arbitrarily change image aspect ratios while preserving visually prominent features. To determine visual importance of pixels, exis...
99
Voted
ICPR
2008
IEEE
15 years 7 months ago
Lennard-Jones force field for Geometric Active Contour
This paper presents a new Geometric Active Contour (GAC) model based on Lennard-Jones (L-J) force field, which is inspired by the theory of intermolecular interaction. It is diff...
Zhenglong Li, Qingshan Liu, Hanqing Lu, Dimitris N...
101
Voted
ICTAI
2006
IEEE
15 years 6 months ago
Minimum Spanning Tree Based Clustering Algorithms
We propose two Euclidean minimum spanning tree based clustering algorithms — one a k-constrained, and the other an unconstrained algorithm. Our k-constrained clustering algorith...
Oleksandr Grygorash, Yan Zhou, Zach Jorgensen
96
Voted
MFCS
1995
Springer
15 years 4 months ago
Graph Inference from a Walk for TRees of Bounded Degree 3 is NP-Complete
The graph inference from a walk for a class C of undirected edge-colored graphs is, given a string x of colors, nding the smallest graph G in C that allows a traverse of all edge...
Osamu Maruyama, Satoru Miyano