Sciweavers

3154 search results - page 125 / 631
» Computing Closed Skycubes
Sort
View
ICIP
2000
IEEE
14 years 11 months ago
Maximum Entropy Image Restoration Revisited
This paper presents a new non-iterative, closed-form approximation to the maximum entropy (M.E.) image restoration method. A fast frequency domain implementation of this closed fo...
Matthew Willis, Brian D. Jeffs, David G. Long
ICIP
2009
IEEE
14 years 11 months ago
Fast Pseudo-enhancement Correction In Ct Colonography Using Linear Shift-invariant Filters
This paper presents a novel method to approximate shiftvariant Gaussian filtering of an image using a set of shiftinvariant Gaussian filters. This approximation affords filtering ...
VLSID
2007
IEEE
94views VLSI» more  VLSID 2007»
14 years 10 months ago
A Reduced Complexity Algorithm for Minimizing N-Detect Tests
? We give a new recursive rounding linear programming (LP) solution to the problem of N-detect test minimzation. This is a polynomialtime solution that closely approximates the exa...
Kalyana R. Kantipudi, Vishwani D. Agrawal
STOC
2006
ACM
125views Algorithms» more  STOC 2006»
14 years 10 months ago
On earthmover distance, metric labeling, and 0-extension
We study the fundamental classification problems 0-Extension and Metric Labeling. A generalization of Multiway Cut, 0-Extension is closely related to partitioning problems in grap...
Howard J. Karloff, Subhash Khot, Aranyak Mehta, Yu...
LATIN
2010
Springer
14 years 5 months ago
Tilings Robust to Errors
We study the error robustness of tilings of the plane. The fundamental question is the following: given a tileset, what happens if we allow a small probability of errors? Are the o...
Alexis Ballier, Bruno Durand, Emmanuel Jeandel