Marcin Detyniecki
Marcin Detyniecki has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
Alexander Hauptmann
1 shared publication- Ali Fakeri-Tabrizi1 shared publication
- Andreas Nürnberger
Otto von Guericke University Magdeburg
1 shared publication - Anni Cai
Beijing University of Posts and Telecommunications
1 shared publication - Benjamin Moubêche
ENS Cachan, Département de Mathématiques
1 shared publication - Bernadette Bouchon-Meunier
CNRS-UPMC
1 shared publication
Latest Publications
- 15 June 2022
- Published by Wolfram Research, Inc. in Complex Systems
- Vol. 31 (2) , 219-246
Graph Matching with Distance-Preserving Crossover
Graph models are fundamental to any kind of application on structured real-world problems. Any comparison between graphs by a graph distance measure requires the solution of the inexact graph matching problem, which constitutes a hard combinatorial optimization problem. An inexact matching problem includes in its formulation robustness to any type of perturbation, such as, for instance, noise, inherently present in real-world environments. In this paper, we introduce the concept of distance-preserving crossover operators for genetic algorithms for this task. For large graphs, our algorithm outperforms any state-of-the-art approximate algorithm—in particular, genetic algorithms with alternative crossover operators, which are to the best of our knowledge currently limited to no more than 50 nodes. We use a two-level local search heuristic to further enhance the results, pushing the limits to up to 300 nodes: a first local search step is directly integrated into the crossover operator; another one is applied independently during offspring generation.
- 15 June 2022
- Published by Wolfram Research, Inc. in Complex Systems
- Vol. 31 (2) , 219-246
Graph Matching with Distance-Preserving Crossover
Graph models are fundamental to any kind of application on structured real-world problems. Any comparison between graphs by a graph distance measure requires the solution of the inexact graph matching problem, which constitutes a hard combinatorial optimization problem. An inexact matching problem includes in its formulation robustness to any type of perturbation, such as, for instance, noise, inherently present in real-world environments. In this paper, we introduce the concept of distance-preserving crossover operators for genetic algorithms for this task. For large graphs, our algorithm outperforms any state-of-the-art approximate algorithm—in particular, genetic algorithms with alternative crossover operators, which are to the best of our knowledge currently limited to no more than 50 nodes. We use a two-level local search heuristic to further enhance the results, pushing the limits to up to 300 nodes: a first local search step is directly integrated into the crossover operator; another one is applied independently during offspring generation.
- 1 March 2017
- Published by Elsevier in International Journal of Approximate Reasoning
- Vol. 82, 193-209
Interpretation of approximate numerical expressions: Computational model and empirical study
- 1 March 2017
- Published by Elsevier in International Journal of Approximate Reasoning
- Vol. 82, 193-209
Interpretation of approximate numerical expressions: Computational model and empirical study
- 10 January 2012
- Published by Springer Nature
- p. 259-270
On the Paradoxical Success of Mamdani’s Minimum-Based Inference
- 10 January 2012
- Published by Springer Nature
- p. 259-270
On the Paradoxical Success of Mamdani’s Minimum-Based Inference
- 31 October 2010
- Published by AICIT in International Journal of Digital Content Technology and its Applications
- Vol. 4 (7) , 69-78
The Application of Spatio-temporal Feature and Multi-Sensor in Home Medical Devices
International audienceMedical devices, such as infusion pumps that deliver life-critical medication, are frequently used at home by patient's themselves as a cost saving measure. As individuals age, many are impacted by cognitive decline such that the proper sequencing of steps of a task is forgotten. Since the danger of making an error can be quite high. So, to detect errors when patients operate a home medical device, we observe them with multiple cameras and record pump sensor information. We then use a robust approach to recognize actions based on explicitly encoding motion information using MoSIFT, Which detects interest points and encodes not only their local appearance but also explicitly models local motion. Our goal is to see if the patient has correctly performed the required actions in the prescribed sequence for the device. Thus, firstly, we will evaluate how to group the requiring 22 operation steps. Secondly, we will analysis the duration of actions, and consider the user adaption. Thirdly, the order of actions is introduced, and HMM is used in our algorithm. Fourthly, as some actions are very difficult to recognize by computer vision, so the physical sensor information is borrowed in our system. Subsequently, we also consider how to fuse the results from different cameras. Finally, we also evaluate the performances when we add different numbers of videos from test subjects. From the experiments, we can see that the improvement of our system performance changes from 49% to over 80%. And if we can obtain 6-7 videos from the patients, and add them into the training dataset, the performance of our system with our simplest way can be 83.7%
- 31 October 2010
- Published by AICIT in International Journal of Digital Content Technology and its Applications
- Vol. 4 (7) , 69-78
The Application of Spatio-temporal Feature and Multi-Sensor in Home Medical Devices
International audienceMedical devices, such as infusion pumps that deliver life-critical medication, are frequently used at home by patient's themselves as a cost saving measure. As individuals age, many are impacted by cognitive decline such that the proper sequencing of steps of a task is forgotten. Since the danger of making an error can be quite high. So, to detect errors when patients operate a home medical device, we observe them with multiple cameras and record pump sensor information. We then use a robust approach to recognize actions based on explicitly encoding motion information using MoSIFT, Which detects interest points and encodes not only their local appearance but also explicitly models local motion. Our goal is to see if the patient has correctly performed the required actions in the prescribed sequence for the device. Thus, firstly, we will evaluate how to group the requiring 22 operation steps. Secondly, we will analysis the duration of actions, and consider the user adaption. Thirdly, the order of actions is introduced, and HMM is used in our algorithm. Fourthly, as some actions are very difficult to recognize by computer vision, so the physical sensor information is borrowed in our system. Subsequently, we also consider how to fuse the results from different cameras. Finally, we also evaluate the performances when we add different numbers of videos from test subjects. From the experiments, we can see that the improvement of our system performance changes from 49% to over 80%. And if we can obtain 6-7 videos from the patients, and add them into the training dataset, the performance of our system with our simplest way can be 83.7%
- Open Access
- 30 April 2010
- Published by Lavoisier in Document numérique
- Vol. 13 (1) , 187-209
Exploitation du contenu visuel pour améliorer la recherche textuelle d'images en ligne
Exploitation du contenu visuel pour améliorer la recherche textuelle d'images en ligne Exploiting visual content to improve on-line text-based image retrieval
- 30 April 2010
- Published by Lavoisier in Document numérique
- Vol. 13 (1) , 187-209
Open AccessExploitation du contenu visuel pour améliorer la recherche textuelle d'images en ligne
Exploitation du contenu visuel pour améliorer la recherche textuelle d'images en ligne Exploiting visual content to improve on-line text-based image retrieval
- 1 July 2006
- Published by Wiley in International Journal of Intelligent Systems
- Vol. 21 (7) , 711-723
Fast gradual matching measure for image retrieval based on visual similarity and spatial relations
- 1 July 2006
- Published by Wiley in International Journal of Intelligent Systems
- Vol. 21 (7) , 711-723
Fast gradual matching measure for image retrieval based on visual similarity and spatial relations
- 1 January 2005
- Published by Springer Nature
- p. 341-370
Adaptive Multimedia Retrieval: From Data to User Interaction
- 1 January 2005
- Published by Springer Nature
- p. 341-370
Adaptive Multimedia Retrieval: From Data to User Interaction
- 1 January 2001
- Published by Springer Nature
- p. 282-288
Browsing a Video with Simple Constrained Queries over Fuzzy Annotations
- 1 January 2001
- Published by Springer Nature
- p. 282-288
Browsing a Video with Simple Constrained Queries over Fuzzy Annotations