A Novel Approach for the Analysis and Synthesis of High Order Directional Modulation

Describing the dynamic textures has attracted growing attention in the field of computer vision and pattern recognition. In this paper, a novel approach for recognizing dynamic textures, namely, high order volumetric directional pattern (HOVDP), is proposed. It is an extension of the volumetric directional pattern (VDP) which extracts and fuses the temporal information (dynamic features) from three consecutive frames. HOVDP combines the movement and appearance features together considering the nth order volumetric directional variation patterns of all neighboring pixels from three consecutive frames. In experiments with two challenging video face databases, YouTube Celebrities and Honda/UCSD, HOVDP clearly outperformed a set of state-of-the-art approaches.

Download Full-text

A novel approach to the analysis and synthesis of controllers for parametrically uncertain systems

[1992] Proceedings of the 31st IEEE Conference on Decision and Control ◽

10.1109/cdc.1992.371723 ◽

2005 ◽

Cited By ~ 10

Author(s):

R.D. Kaminsky ◽

T.E. Djaferis

Keyword(s):

Uncertain Systems ◽

Novel Approach ◽

Analysis And Synthesis

Download Full-text

Directed Reachability for Infinite-State Systems

Tools and Algorithms for the Construction and Analysis of Systems - Lecture Notes in Computer Science ◽

10.1007/978-3-030-72013-1_1 ◽

2021 ◽

pp. 3-23

Author(s):

Michael Blondin ◽

Christoph Haase ◽

Philip Offtermatt

Keyword(s):

Petri Nets ◽

Program Analysis ◽

Infinite Graphs ◽

Reachability Problem ◽

Graph Exploration ◽

Concurrent Program ◽

Domain Specific ◽

Novel Approach ◽

Distance Oracles ◽

Analysis And Synthesis

AbstractNumerous tasks in program analysis and synthesis reduce to deciding reachability in possibly infinite graphs such as those induced by Petri nets. However, the Petri net reachability problem has recently been shown to require non-elementary time, which raises questions about the practical applicability of Petri nets as target models. In this paper, we introduce a novel approach for efficiently semi-deciding the reachability problem for Petri nets in practice. Our key insight is that computationally lightweight over-approximations of Petri nets can be used as distance oracles in classical graph exploration algorithms such as $$\mathsf {A}^{*}$$ A ∗ and greedy best-first search. We provide and evaluate a prototype implementation of our approach that outperforms existing state-of-the-art tools, sometimes by orders of magnitude, and which is also competitive with domain-specific tools on benchmarks coming from program synthesis and concurrent program analysis.

Download Full-text

A NOVEL APPROACH FOR CONSTRUCTING HIGH-ORDER CHUA'S CIRCUIT WITH MULTI-DIRECTIONAL MULTI-SCROLL CHAOTIC ATTRACTORS

International Journal of Bifurcation and Chaos ◽

10.1142/s0218127413500223 ◽

2013 ◽

Vol 23 (02) ◽

pp. 1350022 ◽

Cited By ~ 19

Author(s):

CHUN HUA WANG ◽

HAO XU ◽

FEI YU

Keyword(s):

High Order ◽

Chaotic Attractors ◽

Chua’S Circuit ◽

Nonlinear Functions ◽

Third Order ◽

Chua's Circuit ◽

Controlled Source ◽

The Third ◽

Novel Approach ◽

Rc Structure

A novel approach for constructing a high-order Chua's circuit is proposed. Based on a dual-port RCL network, a high-order Chua's circuit which can generate multi-directional multi-scroll (MDMS) chaotic attractors can be realized by introducing a RC structure and suitable nonlinear functions. First, a fourth-order Chua's circuit is achieved by adding a capacitor, a resistance and a controlled-source constituted by stair functions in the third-order Chua's circuit. And then, this recursive method can be adopted in higher-order Chua's circuit which can generate multi-scroll chaotic attractors in more directions. Finally, a sixth-order Chua's circuit is designed and its experimental results demonstrate the feasibility of this method.

Download Full-text