Reduced model of discrete-time dynamic image segmentation system and its bifurcation analysis

2009 ◽  
Vol 19 (4) ◽  
pp. 283-289 ◽  
Author(s):  
Ken'ichi Fujimoto ◽  
Mio Musashi ◽  
Tetsuya Yoshinaga
Keyword(s):  
Image Segmentation ◽  
Discrete Time ◽  
Bifurcation Analysis ◽  
Reduced Model ◽  
Time Dynamic ◽  
Dynamic Image

scholarly journals Discrete-Time Dynamic Image-Segmentation System

10.5772/14281 ◽  
2011 ◽  
Author(s):  
Kenichi Fujimoto ◽  
Mio Kobayashi ◽  
Tetsuya Yoshinag
Keyword(s):  
Image Segmentation ◽  
Discrete Time ◽  
Time Dynamic ◽  
Dynamic Image

Discrete-time dynamic image segmentation system

2008 ◽  
Vol 44 (12) ◽  
pp. 727 ◽  
Author(s):  
K. Fujimoto ◽  
M. Musashi ◽  
T. Yoshinaga
Keyword(s):  
Image Segmentation ◽  
Discrete Time ◽  
Time Dynamic ◽  
Dynamic Image

Discrete-time dynamic image segmentation based on oscillations by destabilizing a fixed point

2011 ◽  
Vol 6 (5) ◽  
pp. 468-473 ◽  
Author(s):  
Ken'ichi Fujimoto ◽  
Mio Kobayashi ◽  
Tetsuya Yoshinaga
Keyword(s):  
Fixed Point ◽  
Image Segmentation ◽  
Discrete Time ◽  
Time Dynamic ◽  
Dynamic Image

scholarly journals Bifurcation analysis and chaos control in discrete-time modified Leslie–Gower prey harvesting model

2020 ◽  
Vol 2020 (1) ◽  
Author(s):  
Muhammad Bilal Ajaz ◽  
Umer Saeed ◽  
Qamar Din ◽  
Irfan Ali ◽  
Muhammad Israr Siddiqui
Keyword(s):  
Discrete Time ◽  
Bifurcation Analysis ◽  
Chaos Control

scholarly journals Search for a moving target in a competitive environment

2021 ◽  
Author(s):  
Benoit Duvocelle ◽  
János Flesch ◽  
Hui Min Shi ◽  
Dries Vermeulen
Keyword(s):  
Markov Chain ◽  
Discrete Time ◽  
Competitive Environment ◽  
Moving Target ◽  
Time Varying ◽  
Greedy Strategy ◽  
Time Dynamic ◽  
Dynamic Search ◽  
Subgame Perfect Equilibria ◽  
Perfect Equilibria

AbstractWe consider a discrete-time dynamic search game in which a number of players compete to find an invisible object that is moving according to a time-varying Markov chain. We examine the subgame perfect equilibria of these games. The main result of the paper is that the set of subgame perfect equilibria is exactly the set of greedy strategy profiles, i.e. those strategy profiles in which the players always choose an action that maximizes their probability of immediately finding the object. We discuss various variations and extensions of the model.

Sign in / Sign up

Export Citation Format

Share Document