Sciweavers

8 search results - page 2 / 2
» Reconstruction of convex lattice sets from tomographic proje...
Sort
View
COMPGEOM
2005
ACM
13 years 7 months ago
Kinetic sorting and kinetic convex hulls
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...
Mohammad Ali Abam, Mark de Berg
CORR
2010
Springer
148views Education» more  CORR 2010»
13 years 5 months ago
Perturbation Resilience and Superiorization of Iterative Algorithms
Iterative algorithms aimed at solving some problems are discussed. For certain problems, such as finding a common point in the intersection of a finite number of convex sets, there...
Yair Censor, R. Davidi, Gabor T. Herman
SIGGRAPH
1996
ACM
13 years 9 months ago
Combining Frequency and Spatial Domain Information for Fast Interactive Image Noise Removal
Scratches on old films must be removed since these are more noticeable on higher definition and digital televisions. Wires that suspend actors or cars must be carefully erased dur...
Anil N. Hirani, Takashi Totsuka