We propose a single region shadow classifier based on a multikernel SVM. Our multikernel model is a linear combination of χ2 and Earth Mover’s Distance(EMD)[5] kernels that operate on texture and color histograms disjointly. This single region classifier already outperforms the more complex state of art methods, without performing MRF/CRF optimization. The local appearance of a single region is...

We design an algorithm based on illuminant invariance theory to find shadow regions in a colour image. Shadows are caused by a local change in both the colour and the intensity of illumination. Using both chromaticity and intensity cues, an illuminant discontinuity measure is derived by which shadow edges can be locally identified. We model the problem of finding shadows by a Markov Random Fiel...

We present a new algorithm for detecting foreground and moving shadows in surveillance videos. For each pixel, we use the Gaussian Mixture Model (GMM) to learn the behavior of cast shadows on background surfaces. The pixelbased model has the advantages over regional or global model for their adaptability to local lighting conditions, particularly for scenes under complex illumination conditions...

Let G = (V,E) be a graph. A set S ⊂ V (G) is a hop dominating set of G if for every v ∈ V − S, there exists u ∈ S such that d(u, v) = 2. The minimum cardinality of a hop dominating set of G is called a hop domination number of G and is denoted by γh(G). In this paper we characterize the family of trees and unicyclic graphs for which γh(G) = γt(G) and γh(G) = γc(G) where γt(G) and γc(G) are the ...

In this article, we continue our very recent work by extending it to the complex case. Having been inspired real Hopfield neural network (HNN) results, investigations here yield various novel some of which are as follows. First, “biased pseudo-cut” concept HNN (CHNN) case, introduce a “shadow-cut” that is defined sum intercluster phased edges. Second, while discrete-time strictly minimizes in e...

A set system is called t-intersecting if every two members meet each other in at least t elements. Katona determined the minimum ratio of the shadow and the size of such families and showed that the Erdős– Ko–Rado theorem immediately follows from this result. The aim of this note is to reproduce the proof to obtain a slight improvement in the Kneser graph. We also give a brief overview of corre...

A set system is called t-intersecting if every two members meet each other in at least t elements. Katona determined the minimum ratio of the shadow and the size of such families and showed that the Erdős–Ko–Rado theorem immediately follows from this result. The aim of this note is to reproduce the proof to obtain a slight improvement in the Kneser graph. We also give a brief overview of corres...