Multiple mobile robots, or robot collectives have been proposed as solutions to various tasks in which distributed sensing and action are required. Here we consider applying a collective of robots to the paparazzi problem { the problem of providing sensor coverage of a target robot. We demonstrate how the computational task of the collective can be formulated as a global energy minimization tas...

A new probabilistic image segmentation model based on hypothesis testing and Gibbs Random Fields is introduced. First, a probabilistic difference measure derived from a set of hypothesis tests is introduced. Next, a GibbsMarkov Random Field model endowed with the new measure is then applied to the image segmentation problem to determine the segmented image directly through energy minimization. ...

Compacting orthogonal drawings is a challenging task. Usually algorithms try to compute drawings with small area or edge length while preserving the underlying orthogonal shape. We present a onedimensional compaction algorithm that alters the orthogonal shape of edges for better geometric results. An experimental evaluation shows that we were able to reduce the total edge length and the drawing...

by minimizing the total potential energy function and deploying the virtual work principle, a higher-order stiffness matrix is achieved. this new tangent stiffness matrix is used to solve the frame with geometric nonlinear behavior. since authors’ formulation takes into account the higher-order terms of the strain vector, the convergence speed of the solution process will increase. in fact, bot...

Both sparse coding and rank minimization have led to great successes in various image processing tasks. Though the underlying principles of these two approaches are similar, no theory is available to demonstrate the correspondence. In this paper, starting by designing an adaptive dictionary for each group of image patches, we analyze the sparsity of image patches in each group using the rank mi...

‎the aim of this paper is to study the convergence of solutions of the‎ ‎following second order difference inclusion‎ ‎begin{equation*}begin{cases}exp^{-1}_{u_i}u_{i+1}+theta_i exp^{-1}_{u_i}u_{i-1} in c_ia(u_i),quad igeqslant 1 u_0=xin m‎, ‎quad‎ ‎underset{igeqslant 0}{sup} d(u_i,x)

according to a class of constrained‎ ‎minimization problems‎, ‎the schwartz symmetrization process and the‎ ‎compactness lemma of strauss‎, ‎we prove that there is a‎ ‎nontrivial ground state solution for a class of $p$-laplace‎ ‎equations without the ambrosetti-rabinowitz condition‎.