236 search results - page 36 / 48 » A New Neighborhood Based on Improvement Graph for Robust Gra... |
187
click to vote
SAC
2003
ACM
15 years 10 months ago
2003
ACM
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...
199
click to vote
TSMC
2010
15 years 6 days ago
2010
Feature-based image watermarking schemes, which aim to survive various geometric distortions, have attracted great attention in recent years. Existing schemes have shown robustness...
151
click to vote
ISPASS
2006
IEEE
15 years 11 months ago
2006
IEEE
Fast, accurate, and effective performance analysis is essential for the design of modern processor architectures and improving application performance. Recent trends toward highly...
199
click to vote
PAMI
2010
15 years 8 days ago
2010
We present a new method for blind document bleed through removal based on separate Markov Random Field (MRF) regularization for the recto and for the verso side, where separate pri...
159
click to vote
SIGGRAPH
1995
ACM
15 years 9 months ago
1995
ACM
We present a new, interactive tool called Intelligent Scissors which we use for image segmentation and composition. Fully automated segmentation is an unsolved problem, while manu...