3993 search results - page 324 / 799 » Matchmaking for Structured Objects |
128
click to vote
CVGIP
2004
15 years 4 months ago
2004
In this paper, we propose the utilization of a kd-tree based hierarchy as an implicit object representation. Compared to an octree, the kd-tree based hierarchy is superior in term...
154
click to vote
NC
2010
15 years 2 months ago
2010
My main objective is to point out a fundamental weakness in the conventional conception of computation and suggest a promising way out. This weakness is directly related to a gross...
155
click to vote
CVPR
2011
IEEE
14 years 8 months ago
2011
IEEE
We propose a new objective function for superpixel segmentation. This objective function consists of two components: entropy rate of a random walk on a graph and a balancing term....
174
click to vote
SOFTVIS
2010
ACM
15 years 4 months ago
2010
ACM
Understanding the data structures in a program is crucial to understanding how the program works, or why it doesn't work. Inspecting the code that implements the data structu...
170
click to vote
MICCAI
1998
Springer
15 years 8 months ago
1998
Springer
This paper describes a method for creating object surfaces from binary-segmented data that are free from aliasing and terracing artifacts. In this method, a net of linked surface n...