2362 search results - page 68 / 473 » A new approach to edge detection |
RSA
2010
14 years 11 months ago
2010
We establish central and local limit theorems for the number of vertices in the largest component of a random d-uniform hypergraph Hd(n, p) with edge probability p = c/ n−1 d−1...
119
click to vote
VISSYM
2004
15 years 2 months ago
2004
This paper presents a novel framework for illustrating surfaces in a volume. Surfaces are illustrated by drawing only feature lines, such as silhouettes, valleys, ridges, and surf...
105
click to vote
ER
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. We present a new technique for discovering and representing structural changes between two versions of a directed acyclic graph (DAG). Motivated by the necessity of chang...
108
click to vote
WSCG
2004
15 years 2 months ago
2004
The quality of a 3D volume visualization heavily depends on a representative transfer function which is responsible for mapping the original density values to color and opacity. F...
115
click to vote
CVPR
2012
IEEE
13 years 3 months ago
2012
IEEE
In this paper, we propose an approach to accurately localize detected objects. The goal is to predict which features pertain to the object and define the object extent with segme...