Owing to the nonlinear nature of the problem, the transform orders in fractional Fourier-domain filtering configurations have usually not been optimized but chosen uniformly. We discuss the optimization of these orders for multi-channel-filtering configurations by first finding the optimal filter coefficients for a larger number of uniformly chosen orders, and then maintaining the most importan...

In this paper we describe sample elimination for generating Poisson disk sample sets with a desired size. We introduce a greedy sample elimination algorithm that assigns a weight to each sample in a given set and eliminates the ones with greater weights in order to pick a subset of a desired size with Poisson disk property without having to specify a Poisson disk radius. This new algorithm is s...

Finding ones way to an unknown destination, navigating complex routes, finding desired inanimate objects; these are all tasks that can be challenging for the visually impaired. The project NAVIG (Navigation Assisted by artificial VIsion and GNSS) is directed towards increasing the autonomy of visually impaired users in known and unknown environments, exterior and interior, large scale and small...

The question of interest in the present study is: " Given a body subject to mechanical loads, how to define the initial geometry so that the deformed one matches precisely a prescribed shape? " This question is particularly relevant in forming processes where the tolerated mismatch between the deformed and desired geometries may be lower than a Micron. The method proposed here uses as a first "...

In multi-cast scenario, all desired users are divided into K groups. Each group receives its own individual confidential message stream. Eavesdropper group aims to intercept K confidential-message streams. To achieve a secure transmission, two secure schemes are proposed: maximum group receive power plus null-space (NS) projection (Max-GRP plus NSP) and leakage. The former obtains its precoding...

In this paper, we analyze different first-order methods of smooth convex optimization employing inexact first-order information. We introduce the notion of an approximate first-order oracle. The list of examples of such an oracle includes smoothing technique, Moreau-Yosida regularization, Modified Lagrangians, and many others. For different methods, we derive complexity estimates and study the ...

Usually, when we use the probabilistic method, the desired event holds with very high probability. On the other hand, suppose we have n mutually independent events, each of which holds with probability p, then the conjunction of all of them holds with probability p. This is exponentially small but strictly positive. In most applications, the desired event cannot be decomposed into n mutually in...

Swarm coordination and formation control designs focus on multi-agent dynamic system behavior and aim to achieve desired coordinated behavior or predefined geometric shape. They utilize techniques from the control theory and graph theory literature. On the other hand, adaptive control theory is concerned with uncertainties in the system dynamics, and has structured frameworks for various types ...