Techniques based on minimal graph cuts have become a standard tool for solving combinatorial optimization problems arising in image processing and computer vision applications. These techniques can be used to minimize objective functions written as the sum of a set of unary and pairwise terms, provided that the objective function is submodular. This can be interpreted as minimizing the $l_1$-no...

In this work, we evaluate quantum coherence using the $$l_{1}$$ -norm and convex-roof obtain several new results. First, provide some general triangle-like inequalities of coherence, with results better than existing ones. Second, for special three-dimensional states, a method calculating is presented. Lastly, offer distinct upper bounds in measure based on state itself.

The problem of finding \emph{distance} between \emph{pattern} of length $m$ and \emph{text} of length $n$ is a typical way of generalizing pattern matching to incorporate dissimilarity score. For both Hamming and $L_1$ distances only a super linear upper bound $\widetilde{O}(n\sqrt{m})$ are known, which prompts the question of relaxing the problem: either by asking for $1 \pm \varepsilon$ appro...

Chen's biharmonic conjecture is well-known and stays open: The only biharmonic submanifolds of Euclidean spaces are the minimal ones. In this paper, we consider an advanced version of the conjecture, replacing $Delta$ by its extension, $L_1$-operator ($L_1$-conjecture). The $L_1$-conjecture states that any $L_1$-biharmonic Euclidean hypersurface is 1-minimal. We prove that the $L_1$-conje...

We prove that for any even algebraic polynomial $p$ one can find a cosine with an arbitrary small $l_1$-norm of coefficients such the first its representation as in $\cos x$ coincide those $p$.

In this paper we present a robust method for simultaneous registration of multiple 3D scans. Rigid registration is an important task in many applications such as surface reconstruction, navigation and computer aided design. The goal of 3-D (rigid) registration is to align surfaces through a (rigid) transformation. A large number of existing registration algorithms are dependent on finding match...