Sciweavers

759 search results - page 33 / 152
» Optimal Graph Search with Iterated Graph Cuts
Sort
View
ICC
2007
IEEE
15 years 4 months ago
Determination of Optimal Distortion-Based Protection in Progressive Image Transmission: a Heuristic Approach
— In this paper a method for the fast determination of distortion-based optimal unequal error protection (UEP) of bitstreams generated by embedded image coders is described. The ...
Alessio Torquati, Maria Fresia, Fabio Lavagetto
AGTIVE
2007
Springer
15 years 3 months ago
A First Experimental Evaluation of Search Plan Driven Graph Pattern Matching
Abstract. With graph pattern matching the field of graph transformation (GT) includes an NP-complete subtask. But for real-life applications it is essential that graph pattern mat...
Gernot Veit Batz, Moritz Kroll, Rubino Geiß
ISCAS
1999
IEEE
95views Hardware» more  ISCAS 1999»
15 years 1 months ago
Evaluating iterative improvement heuristics for bigraph crossing minimization
The bigraph crossing problem, embedding the two node sets of a bipartite graph G = V0;V1;E along two parallel lines so that edge crossings are minimized, has application to placeme...
Matthias F. M. Stallmann, Franc Brglez, Debabrata ...
77
Voted
MICCAI
2007
Springer
15 years 10 months ago
De-enhancing the Dynamic Contrast-Enhanced Breast MRI for Robust Registration
Abstract. Dynamic enhancement causes serious problems for registration of contrast enhanced breast MRI, due to variable uptakes of agent on different tissues or even same tissues i...
Yuanjie Zheng, Jingyi Yu, Chandra Kambhamettu, Sar...
CVPR
2006
IEEE
15 years 11 months ago
Graph Partitioning by Spectral Rounding: Applications in Image Segmentation and Clustering
ct We introduce a new family of spectral partitioning methods. Edge separators of a graph are produced by iteratively reweighting the edges until the graph disconnects into the pre...
David Tolliver, Gary L. Miller