AI Chat AI Image Generator AI Video Text to Speech

Fitting a Simplicial Complex using a Variation of k-means

07/13/2016

∙

by Piotr Beben, et al.

∙

∙

We give a simple and effective two stage algorithm for approximating a point cloud S⊂R^m by a simplicial complex K. The first stage is an iterative fitting procedure that generalizes k-means clustering, while the second stage involves deleting redundant simplices. A form of dimension reduction of S is obtained as a consequence.

page 1

page 2

page 3

page 4

research

∙ 04/20/2023

Ellipsoid fitting with the Cayley transform

We introduce an algorithm, Cayley transform ellipsoid fitting (CTEF), th...

0 Omar Melikechi, et al. ∙

research

∙ 11/02/2019

Anthropometric clothing measurements from 3D body scans

We propose a full processing pipeline to acquire anthropometric measurem...

0 Song Yan, et al. ∙

research

∙ 07/24/2019

One-stage Shape Instantiation from a Single 2D Image to 3D Point Cloud

Shape instantiation which predicts the 3D shape of a dynamic target from...

0 Xiao-Yun Zhou, et al. ∙

research

∙ 06/02/2021

Matrix factorisation and the interpretation of geodesic distance

Given a graph or similarity matrix, we consider the problem of recoverin...

0 Nick Whiteley, et al. ∙

research

∙ 01/19/2023

Parallel two-stage reduction to Hessenberg-triangular form

We present a two-stage algorithm for the parallel reduction of a pencil ...

0 Thijs Steel, et al. ∙

research

∙ 04/16/2017

Learn-Memorize-Recall-Reduce A Robotic Cloud Computing Paradigm

The rise of robotic applications has led to the generation of a huge vol...

0 Shaoshan Liu, et al. ∙