Open AccessProceedings Article
k-Prototype Learning for 3D Rigid Structures
Hu Ding,Ronald Berezney,Jinhui Xu +2 more
- 05 Dec 2013
- Vol. 26, pp 2589-2597
TL;DR: The first algorithm for learning multiple prototypes from 3D rigid structures is presented, based on a number of new insights to rigid structures alignment, clustering, and prototype reconstruction, and is practically efficient with quality guarantee.
read more
Abstract: In this paper, we study the following new variant of prototype learning, called k-prototype learning problem for 3D rigid structures: Given a set of 3D rigid structures, find a set of k rigid structures so that each of them is a prototype for a cluster of the given rigid structures and the total cost (or dissimilarity) is minimized. Prototype learning is a core problem in machine learning and has a wide range of applications in many areas. Existing results on this problem have mainly focused on the graph domain. In this paper, we present the first algorithm for learning multiple prototypes from 3D rigid structures. Our result is based on a number of new insights to rigid structures alignment, clustering, and prototype reconstruction, and is practically efficient with quality guarantee. We validate our approach using two type of data sets, random data and biological data of chromosome territories. Experiments suggest that our approach can effectively learn prototypes in both types of data.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Proceedings Article
Random gradient descent tree: a combinatorial approach for SVM with outliers
TL;DR: This paper proposed a new combinatorial approach, called Random Gradient Descent Tree (or RGD-tree), to explicitly deal with outliers; this results in a new algorithm called RGD -SVM.
17
•Proceedings Article
Finding median point-set using earth mover's distance
TL;DR: This paper studies a prototype learning problem, called Median Point-Set, whose objective is to construct a prototype for a set of given point- sets so as to minimize the total Earth Mover's Distances between the prototype and the point-sets, and presents the first purely geometric approach.
14
•Journal Article
Random gradient descent tree: A combinatorial approach for SVM with outliers
TL;DR: This paper presents a new combinatorial approach, called Random Gradient Descent Tree (or RGD-tree), to explicitly deal with outliers; this results in a new algorithm calledRGD-SVM, which considerably outperforms several popular techniques in most of the cases.
12
Distance-Preserving Vector Space Embedding for Consensus Learning
Andreas Nienkötter,Xiaoyi Jiang +1 more
TL;DR: An extensive empirical study is presented that provides strong evidence of significantly improved quality of generalized median computation using distance-preserving embedding (DPE) methods and it is shown that this framework can be used to effectively compute other consensus objects like the closest string.
5
Increasing Interpretation of Web Topic Detection via Prototype Learning From Sparse Poisson Deconvolution
TL;DR: This paper addresses the problem from a viewpoint interpreting a topic by its prototypes, and presents a two-step approach to achieve this goal, using a sparse Poisson deconvolution to learn the intratopic similarities between webpages.
4
References
A method for registration of 3-D shapes
Paul J. Besl,H.D. McKay +1 more
TL;DR: In this paper, the authors describe a general-purpose representation-independent method for the accurate and computationally efficient registration of 3D shapes including free-form curves and surfaces, based on the iterative closest point (ICP) algorithm, which requires only a procedure to find the closest point on a geometric entity to a given point.
20.6K
Shape matching and object recognition using shape contexts
TL;DR: This paper presents work on computing shape models that are computationally fast and invariant basic transformations like translation, scaling and rotation, and proposes shape detection using a feature called shape context, which is descriptive of the shape of the object.
7.3K
Introduction to graph theory
Abstract: In graph theory, the term graph refers to a set of vertices and a set of edges. A vertex can be used to represent any object. Graphs may contain undirected or directed edges. An undirected edge is a set of two vertices. A directed edge is an ordered pair of two vertices where the edge goes from the first vertex to the second vertex. Graphs that contain directed edges are called directed graphs or digraphs.
5K
Least-Squares Fitting of Two 3-D Point Sets
TL;DR: An algorithm for finding the least-squares solution of R and T, which is based on the singular value decomposition (SVD) of a 3 × 3 matrix, is presented.
Generalized procrustes analysis
TL;DR: In this article, the authors investigated the problem of translating, rotating, reflecting and scaling configurations to minimize the goodness-of-fit criterion, where Gi is the centroid of the points in p-dimensional space.
3.3K