نتایج جستجو برای: distance sketch
تعداد نتایج: 248591 فیلتر نتایج به سال:
We give algorithms for the M-estimators minx ‖Ax− b‖G, where A ∈ Rn×d and b ∈ R, and ‖y‖G for y ∈ R n is specified by a cost function G : R 7→ R≥0, with ‖y‖G ≡ ∑ iG(yi). The M -estimators generalize `p regression, for which G(x) = |x|. We first show that the Huber measure can be computed up to relative error in O(nnz(A) logn + poly(d(log n)/ε)) time, where nnz(A) denotes the number of non-zero ...
In this study Jaccard Distance was performed by measuring the asymmetric information on binary variable and the comparison between vectors component. It compared two objects and notified the degree of similarity of these objects. After thorough preprocessing tasks; like translation, rotation, invariance scale content and noise resistance done onto the hand sketch object, Jaccard distance still ...
The problem of matching a forensic sketch to a gallery of mugshot images is addressed in this paper. Previous research in sketch matching offered solutions to matching highly accurate sketches that were drawn while looking at the subject. We refer to these as viewed sketches. Forensic sketches differ from viewed sketches in that they are drawn by a police sketch artist using the description pro...
Military course-of-action (COA) diagrams are used to depict battle scenarios and include thousands of unique symbols, complete with additional textual and designator modifiers. We have created a real-time sketch recognition interface that recognizes 485 freely-drawn military course-of-action symbols. When the variations (not allowable by other systems) are factored in, our system is several ord...
In this paper a novel multi-stroke sketch recognition method is presented. This method integrates the stroke segmentation and sketch recognition into a single approach, in which both stroke segmentation and sketch recognition are uniformed as a problem of “fitting to a template” with a minimal fitting error, and a nesting Dynamic Programming algorithm is designed to accelerate the optimizing ap...
This study examines whether Mapping Principles, which govern how concrete concepts in a source domain are mapped to abstract concepts in a target domain, are realized in large-scale corpus data. In particular, we propose a frequency-based collocational approach to determine mapping principles based on the most productive mapping. In addition, in contrast to the target-domain-oriented method use...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید