Appariement de formes, recherche par forme clef

Abstract : This thesis concerns shape matching and shape retrieval. It describes four contributions to thisdomain. The first is an improvement of the k-means method, in order to find the best partition ofvoxels inside a given shape ; these best partitions permit to match shapes using an optimal matchingin a bipartite graph. The second contribution is the fusion of two descriptors, one local, the otherglobal, with the product rule. The third contribution considers the complete graph, the vertices ofwhich are the shapes in the database and the query. Edges are labelled with several distances,one per descriptor. Then the method computes, with linear programming, the convex combinationof distances which maximizes either the sum of the lengths of all shortest paths from the query toall shapes of the database, or the length of the shortest path in the graph from query to the currentshape compared to query. The fourth contribution consists in perturbing the shape query, to make itcloser to shapes in the database, for any given descriptors. This method is massively parallel and amulti-agent architecture is proposed. These methods are compared to classical methods in the field,they achieve better retrieval performances.
Complete list of metadatas

Cited literature [10 references]  Display  Hide  Download

https://tel.archives-ouvertes.fr/tel-01803411
Contributor : Abes Star <>
Submitted on : Wednesday, May 30, 2018 - 12:22:05 PM
Last modification on : Wednesday, September 12, 2018 - 1:28:01 AM
Long-term archiving on : Friday, August 31, 2018 - 4:27:56 PM

File

these_A_MOKHTARI_Bilal_2016.pd...
Version validated by the jury (STAR)

Identifiers

  • HAL Id : tel-01803411, version 1

Collections

Citation

Bilal Mokhtari. Appariement de formes, recherche par forme clef. Vision par ordinateur et reconnaissance de formes [cs.CV]. Université de Bourgogne, 2016. Français. ⟨NNT : 2016DIJOS067⟩. ⟨tel-01803411⟩

Share

Metrics

Record views

114

Files downloads

23