Skip to Main content Skip to Navigation

Cellular matrix for parallel k-means and local search to Euclidean grid matching

Abstract : In this thesis, we propose a parallel computing model, called cellular matrix, to provide answers to problematic issues of parallel computation when applied to Euclidean graph matching problems. These NP-hard optimization problems involve data distributed in the plane and elastic structures represented by graphs that must match the data. They include problems known under various names, such as geometric k-means, elastic net, topographic mapping, and elastic image matching. The Euclidean traveling salesman problem (TSP), the median cycle problem, and the image matching problem are also examples that can be modeled by graph matching. The contribution presented is divided into three parts. In the first part, we present the cellular matrix model that partitions data and defines the level of granularity of parallel computation. We present a generic loop for parallel computations, and this loop models the projection between graphs and their matching. In the second part, we apply the parallel computing model to k-means algorithms in the plane extended with topology. The proposed algorithms are applied to the TSP, structured mesh generation, and image segmentation following the concept of superpixel. The approach is called superpixel adaptive segmentation map (SPASM). In the third part, we propose a parallel local search algorithm, called distributed local search (DLS). The solution results from the many local operations, including local evaluation, neighborhood search, and structured move, performed on the distributed data in the plane. The algorithm is applied to Euclidean graph matching problems including stereo matching and optical flow.
Document type :
Complete list of metadatas

Cited literature [109 references]  Display  Hide  Download
Contributor : Abes Star :  Contact
Submitted on : Monday, September 17, 2018 - 4:48:51 PM
Last modification on : Tuesday, October 1, 2019 - 4:40:16 PM
Long-term archiving on: : Tuesday, December 18, 2018 - 2:51:12 PM


Version validated by the jury (STAR)


  • HAL Id : tel-01875732, version 1



Hongjian Wang. Cellular matrix for parallel k-means and local search to Euclidean grid matching. Other [cs.OH]. Université de Technologie de Belfort-Montbeliard, 2015. English. ⟨NNT : 2015BELF0280⟩. ⟨tel-01875732⟩



Record views


Files downloads