We present an image retrieval system for the interactive search of photo collections using free-hand sketches depicting shape. We describe Gradient Field HOG (GF-HOG); an adapted form of the HOG descriptor suitable for sketch based image retrieval (SBIR). We incorporate GF-HOG into a Bag of Visual Words (BoVW) retrieval framework, and demonstrate how this combination may be harnessed both for r...

Sharing feature-based computer-aided design (CAD) models is a challenging problem that is frequently encountered among heterogeneous CAD systems. In this work, a new asymmetric strategy is presented to enrich the theory of feature-based interoperability, particularly when addressing a singular feature or singular sketch. This paper analyzes the semantic asymmetry singular feature interoperabili...

-NN classifier for better to much harder than normal face recognition based on photo images. To recognize a face sketch through photo database, it is necessary to reduce the modality difference between face photo and face sketch images. Every face recognition system need to perform mainly three subtasks: face detection, feature extraction and classification. But face sketch recognition system t...

kripke bas proposed a number of counteretxamples to the classic thesis, which ays that the class of necmary fropositions roincidn with the cla1ss of a priori ones. these counteretxamples involve some necessary a posten'ori trutbs as well as contingent a priori ones. om cfbis exmnplu far the loller is the 1ta11dard metre example. in thi1 paper, after presenting a brief sketch of kripke&apos...

We exploit sketch techniques, especially the Count-Min sketch, a memory, and time efficient framework which approximates the frequency of a word pair in the corpus without explicitly storing the word pair itself. These methods use hashing to deal with massive amounts of streaming text. We apply CountMin sketch to approximate word pair counts and exhibit their effectiveness on three important NL...

Benefiting from advances in online sketchy shape recognition system could not be expected before the problem of its adaptability is well solved. In this paper, three methods of machine learning are compared for adaptive sketch recognition with some experiments based on various feature representations of sketches and collected samples of multi-users. The experimental results reveal elementally s...

We consider the problem of one-dimensional topological com-paction with jog insertions. Combining both geometric and graph the-oretic approaches we present a faster and simpler algorithm, improving over previous results. The compaction algorithm takes as input a sketch consisting of a set F of features and a set W of wires, and minimizes the horizontal width of the sketch while maintaining its ...

Quantum repeaters are a promising platform for realizing long-distance quantum communication and thus could form the backbone of secure internet, scalable network, or distributed computer. Repeater protocols that encode information in single- multi-photon states limited by transmission losses cost implementing entangling gates Bell measurements. In this work, we consider repeater protocol using...