160 resultados para graph matching algorithms
Resumo:
The paper describes the development of a software design aid for use at the conceptual stage of engineering design. It is intended for use in the design of mechatronic products but has wider potential uses. Early approaches were based on function structures and tables of options and the system that evolved allows the assembly of schemes linked by matching their input and output ports. A database of components is provided which can be accessed via different indexes and the designer can easily create and compare alternative schemes at the concept stage. A bond graph approach is used to define the interconnections between components. This allows correct port matching but also provides for future development such as constraint propagation through the design and links to simulation tools. © 1993 Springer-Verlag New York Inc.
Resumo:
In this paper, we describe a video tracking application using the dual-tree polar matching algorithm. The models are specified in a probabilistic setting, and a particle ilter is used to perform the sequential inference. Computer simulations demonstrate the ability of the algorithm to track a simulated video moving target in an urban environment with complete and partial occlusions. © The Institution of Engineering and Technology.
Resumo:
Algorithms are presented for detection and tracking of multiple clusters of co-ordinated targets. Based on a Markov chain Monte Carlo sampling mechanization, the new algorithms maintain a discrete approximation of the filtering density of the clusters' state. The filters' tracking efficiency is enhanced by incorporating various sampling improvement strategies into the basic Metropolis-Hastings scheme. Thus, an evolutionary stage consisting of two primary steps is introduced: 1) producing a population of different chain realizations, and 2) exchanging genetic material between samples in this population. The performance of the resulting evolutionary filtering algorithms is demonstrated in two different settings. In the first, both group and target properties are estimated whereas in the second, which consists of a very large number of targets, only the clustering structure is maintained. © 2009 IFAC.
Resumo:
Detailed investigations of the effectiveness of three widely adopted optical orthogonal frequency division multiplexing (OOFDM) adaptive loading algorithms, including power loading (PL), bit loading (BL), and bit-and-power loading (BPL), are undertaken, over < 100km single-mode fibre (SMF) system without incorporating inline optical amplification and chromatic dispersion (CD) compensation. It is shown that the BPL (PL) algorithm always offers the best (worst) transmission performance. The absolute transmission capacity differences between these algorithms are independent of transmission distance and launched optical power. Moreover, it is shown that in comparison with the most sophisticated BPL algorithm, the simplest PL algorithm is effective in escalating the OOFDM SMF links performance to its maximum potential. On the other hand, when employing a large number of subcarriers and a high digital-to-analogue DAC)/analogue-to-digital (ADC) sampling rate, the sophisticated BPL algorithm has to be adopted. © 2011 IEEE.