Sciweavers

1616 search results - page 39 / 324
» On Edge Detection on Surfaces
Sort
View
CVPR
2005
IEEE
15 years 4 days ago
Finding Glass
Abstract. This paper addresses the problem of finding glass objects in images. Visual cues obtained by combining the systematic distortions in background texture occurring at the b...
Kenton McHenry, Jean Ponce, David A. Forsyth
MICCAI
2006
Springer
14 years 11 months ago
Detection of Protrusions in Curved Folded Surfaces Applied to Automated Polyp Detection in CT Colonography
Over the past years many computer aided diagnosis (CAD) schemes have been presented for the detection of colonic polyps in CT Colonography. The vast majority of these methods (impl...
Cees van Wijk, Vincent Frans van Ravesteijn, Frans...
CVPR
2001
IEEE
15 years 4 days ago
Efficient Computation of Adaptive Threshold Surfaces for Image Binarization
The problem of binarization of gray level images acquired under nonuniform illumination is reconsidered. Yanowitz and Bruckstein proposed to use for image binarization an adaptive...
Ilya Blayvas, Alfred M. Bruckstein, Ron Kimmel
WADS
2009
Springer
317views Algorithms» more  WADS 2009»
14 years 4 months ago
Shortest Path Problems on a Polyhedral Surface
We develop algorithms to compute edge sequences, Voronoi diagrams, shortest path maps, the Fréchet distance, and the diameter for a polyhedral surface. Distances on the surface a...
Atlas F. Cook, Carola Wenk
ENDM
2002
91views more  ENDM 2002»
13 years 10 months ago
On minimally 3-connected graphs on a surface
It is well-known that the maximal size of minimally 3-connected graphs of order 7n is 93 -n . In this paper, we shall prove that if G is a minimally 3-connected graph of order n, ...
Katsuhiro Ota