نتایج جستجو برای: closest target

تعداد نتایج: 413502  

1998
Ikuko Shimizu Zhengyou Zhang Shigeru Akamatsu Koichiro Deguchi

We present a new method for determining the pose of a human head from its 2D image. It does not use any artificial markers put on a face. The basic idea is to use a generic model of a human head, which accounts for variation in shape and facial expression. Particularly, a set of 3D curves are used to model the contours of eyes, lips, and eyebrows. A technique called Iterative Closest Curve matc...

2011
Haruya Kyutoku Tomokazu Takahashi Yoshito Mekada Ichiro Ide Hiroshi Murase

We propose a method for detecting general obstacles on a road by subtracting present and past in-vehicle camera images. Compared to the existing learningbased methods that could detect only specific obstacles, the proposed method based on image-subtraction could detect any kind of obstacles. To achieve this, the proposed method first realizes a frame-by-frame correspondence between the present ...

Journal: :journal of dental biomaterials 0
vahid moshkelgosha orthodontics research center and department of orthodontics, school of dentistry, shiraz university of medical sciences, shiraz, iran razieh zare department of oral and maxillofacial pathology, school of dentistry, shiraz university of medical sciences, shiraz, iran anahita safari department of prosthodontics, school of dentistry, shiraz university of medical sciences, shiraz, iran

statement of problem: recognition and determination of facial and dental midline is important in dentistry. currently, there are no verifiable guidelines that direct the choice of specific anatomic landmarks to determine the midline of the face or mouth. objectives: the purpose of this study was to determine which of facial anatomic landmarks is closest to the midline of the face as well as tha...

Journal: :CoRR 2011
Johannes Blömer Stefanie Naewe

We present deterministic polynomially space bounded algorithms for the closest vector problem for all lp-norms, 1 < p < ∞, and all polyhedral norms, in particular for the l1norm and the l∞-norm. For all lp-norms with 1 < p < ∞ the running time of the algorithm is p · log2(r)n, where r is an upper bound on the size of the coefficients of the target vector and the lattice basis and n is the dimen...

Journal: :ACM transactions on quantum computing 2022

We study the problem of finding best approximate circuit that is closest (in some pertinent metric) to a target circuit, and which satisfies number hardware constraints, like gate alphabet connectivity. look at in CNOT+rotation set from mathematical programming standpoint, offering contributions both terms understanding mathematics its efficient solution. Among results we present, are able deri...

2010
RAFAEL CABALLERO Rafael Caballero Mónica Hernández

This work deals with the resolution of the goal programming problem with linear fractional criteria. The main difficulty of these problems is the non-linear constraints of the mathematical programming models that have to be solved. When there exist solutions satisfying all target values, the problem is easy to solve by solving a linear problem. So, in this paper we deal with those instances whe...

2010
Dorota Głowacka Alan Medlar John Shawe-Taylor

This paper presents the theory, design principles, implementation and performance results of a content-based image retrieval system based on multinomial relevance feedback. The system relies on an interactive search paradigm in which at each round a user is presented with a set of k images and is required to select one that is closest to their target. Performance is measured by the number of ro...

Journal: :International Journal of Applied Mathematics and Computer Science 2018

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید