This paper proposes a method for detecting copy-move forgery over images tampered by copying some regions and pasting them onto other regions. To detect those forgeries, we divide the given image into overlapping blocks, extract feature for each blocks, and sort the extracted feature vectors by radix sort. The difference (shift vector) of the coordinates of every pair of adjacent vectors in the...

We consider high-order connectivity in k-uniform hypergraphs defined as follows: Two j-sets are j-connected if there is a walk of edges between them such that two consecutive edges intersect in at least j vertices. We describe the evolution of jconnected components in the k-uniform binomial random hypergraph H(n, p). In particular, we determine the asymptotic size of the giant component shortly...

Figures play an important role within biomedical publications. A typical and essential first step toward using images is the detection of compound figures and their separation into panels. In ImageCLEF’16 our team has participated in the compound figure detection and separation tasks, where we utilized a method based on connected component analysis (CCA) to detect and to separate compound figur...

This paper presents a new technique that greatly increases the speed of the connected component labeling algorithm. We propose a system to extract the text from the PDF images. This paper describes the system design based on text extraction method concentrating on text extraction from PDF images by enhancing the traditional connected component labeling as modified connected component labeling t...

This paper presents a runand label-equivalence-based one-and-a-half-scan algorithm for labeling connected components in a binary image. Major di®erences between our algorithm and conventional label-equivalence-based algorithms are: (1) all conventional label-equivalencebased algorithms scan all pixels in the given image at least twice, whereas our algorithm scans background pixels once and obje...

Connected component labeling is an important but computationally expensive operation required in many fields of research. The goal in the present work is to label connected components on a 2D binary map. Two different iterative algorithms for doing this task are presented. The first algorithm (Row–Col Unify) is based upon the directional propagation labeling, whereas the second algorithm uses t...

In argumentation theory, Dung’s abstract framework provides a unifying view of several alternative semantics based on the notion of extension. Recently, a new semantics has been introduced to solve the problems related to counterintuitive results produced by literature proposals. In this semantics, extensions can be decomposed and constructed along the strongly connected components of the defea...

Rival and Zaguia showed that the antichain cutsets of a finite Boolean lattice are exactly the level sets. We show that a similar characterization of antichain cutsets holds for any strongly connected poset of locally finite height. As a corollary, we characterize the antichain cutsets in semimodular lattices, supersolvable lattices, Bruhat orders, locally shellable lattices, and many more. We ...