653 search results - page 63 / 131 » Efficient reconstruction from non-uniform point sets |
109
click to vote
PR
2008
14 years 11 months ago
2008
We present an efficient and robust method of locating a set of feature points in an object of interest. From a training set we construct a joint model of the appearance of each fe...
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
This paper presents a method for triangulation of 3D points given their projections in two images. Recent results show that the triangulation mapping can be represented as a linea...
107
Voted
IPMI
2007
Springer
16 years 22 days ago
2007
Springer
In this paper we propose a novel non-rigid volume registration based on discrete labeling and linear programming. The proposed framework reformulates registration as a minimal path...
120
click to vote
COCOON
1998
Springer
15 years 4 months ago
1998
Springer
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
KDD
2004
ACM
16 years 8 days ago
2004
ACM
Extensive studies have shown that mining microarray data sets is important in bioinformatics research and biomedical applications. In this paper, we explore a novel type of genesa...