Robust video fingerprinting based on hierarchical symmetric difference feature

Author(s):  
Jungho Lee ◽  
Seungjae Lee ◽  
Yongseok Seo ◽  
Wonyoung Yoo
1974 ◽  
Vol 18 (4) ◽  
pp. 450-452 ◽  
Author(s):  
Charles H. C. Little

In this paper, we consider factor covered graphs, which are defined basically as connected graphs in which every edge belongs to a 1-factor. The main theorem is that for any two edges e and e′ of a factor covered graph, there is a cycle C passing through e and e′ such that the edge set of C is the symmetric difference of two 1-factors.


Author(s):  
Ozgun Cirakman ◽  
Bilge Gunsel ◽  
N.Serap Sengor ◽  
Ozan Gursoy

2021 ◽  
Vol 10 (4) ◽  
pp. 2045-2052
Author(s):  
S. Menaka ◽  
R.S. Manikandan ◽  
R. Muruganandam

1992 ◽  
Vol 34 (1) ◽  
pp. 1-9 ◽  
Author(s):  
Werner J. Ricker

Let Σ be a σ-algebra of subsets of some set Ω and let μ:Σ→[0,∞] be a σ-additive measure. If Σ(μ) denotes the set of all elements of Σ with finite μ-measure (where sets equal μ-a.e. are identified in the usual way), then a metric d can be defined in Σ(μ) by the formulahere E ΔF = (E\F) ∪ (F\E) denotes the symmetric difference of E and F. The measure μ is called separable whenever the metric space (Σ(μ), d) is separable. It is a classical result that μ is separable if and only if the Banach space L1(μ), is separable [8, p.137]. To exhibit non-separable measures is not a problem; see [8, p. 70], for example. If Σ happens to be the σ-algebra of μ-measurable sets constructed (via outer-measure μ*) by extending μ defined originally on merely a semi-ring of sets Γ ⊆ Σ, then it is also classical that the countability of Γ guarantees the separability of μ and hence, also of L1(μ), [8, p. 69].


2018 ◽  
Vol 23 (3) ◽  
pp. 42 ◽  
Author(s):  
Muhammad Akram ◽  
Amna Habib ◽  
Farwa Ilyas ◽  
Jawaria Dar

The purpose of this research study is to present some new operations, including rejection, symmetric difference, residue product, and maximal product of Pythagorean fuzzy graphs (PFGs), and to explore some of their properties. This research article introduces certain notions, including intuitionistic fuzzy graphs of 3-type (IFGs3T), intuitionistic fuzzy graphs of 4-type (IFGs4T), and intuitionistic fuzzy graphs of n-type (IFGsnT), and proves that every IFG(n−1)T is an IFGnT (for n ≥ 2). Moreover, this study discusses the application of Pythagorean fuzzy graphs in decision making.


Sign in / Sign up

Export Citation Format

Share Document