Motivated by phylogenetics, our aim is to obtain a system of low degree equations that define a phylogenetic variety on an open set containing the biologically meaningful points. In this paper we consider phylogenetic varieties defined via group-based models. For any finite abelian group G, we provide an explicit construction of codimX polynomial equations (phylogenetic invariants) of degree at...

AbstractOpen Set Video Anomaly Detection (OpenVAD) aims to identify abnormal events from video data where both known anomalies and novel ones exist in testing. Unsupervised models learned solely normal videos are applicable any testing but suffer a high false positive rate. In contrast, weakly supervised methods effective detecting could fail an open world. We develop method for the OpenVAD pro...

In open set recognition (OSR), almost all existing methods are designed specially for recognizing individual instances, even these instances collectively coming in batch. Recognizers decision either reject or categorize them to some known class using empirically-set threshold. Thus the threshold plays a key role. However, selection it usually depends on knowledge of classes, inevitably incurrin...

Many existing conditional Generative Adversarial Networks (cGANs) are limited to conditioning on pre-defined and fixed class-level semantic labels or attributes. We propose an open set GAN architecture (OpenGAN) that is conditioned per-input sample with a feature embedding drawn from metric space. Using state-of-the-art learning model encodes both fine-grained information, we able generate samp...

Incremental learning aims to learn new classes if they emerge while maintaining the performance for previously known classes. It acquires useful information from incoming data update existing models. Open-set recognition, however, requires ability recognize examples and reject new/unknown There are two main challenges in this matter. First, class discovery: algorithm needs not only but it must ...

The degree qj’a graph H is the maximum among the degrees of its nodes. A set of graphs L is of bounded degree if there exists a positive integer n such that the degree of each graph in L does not exceed n. We demonstrate that it is decidable whether or not the (graph) language of an arbitrary node label controlled (NLC) grammar is of bounded degree. Moreover, it is shown that, given an arbitrar...

Let f be a nonnegative integer valued function on the vertex set of graph. A graph is strictly f-degenerate if each nonempty subgraph ? has v such that deg?(v)<f(v). In this paper, we define new concept, transversal, which generalizes list coloring, signed DP-coloring, L-forested-coloring, and (f1,f2,…,fs)-partition. cover G H with V(H)=?v?V(G)Xv, where Xv={(v,1),(v,2),…,(v,s)}; edge M=?uv?E(G)...