نتایج جستجو برای: over bounding
تعداد نتایج: 1144096 فیلتر نتایج به سال:
An object detector based on convolutional neural network (CNN) has been widely used in the field of computer vision because its simplicity and efficiency. The average accuracy CNN model detection results is greatly affected by loss function. precision localization algorithm function main factor affecting result. Based complete intersection over union (CIoU) function, an improved penalty propose...
This paper proposes a novel sampling-based adaptive bounding evolutionary algorithm termed SABEA that is capable of dynamically updating the search space during the evolution process for continuous optimization problems. The proposed SABEA adopts two bounding strategies, namely fitness-based bounding and probabilistic sampling-based bounding, to select a set of individuals over multiple generat...
Face book is virtual and cybernetic network which causes an effective force and among the youth. It shows that if the usage of the face book network increases at home the rate of the interaction and the bounding social capital decreases as well. It also indicates that the effect of face book usage among the young people has increased already. Through a questionnaire by a survey method, more tha...
A motion planning algorithm is described for bounding over rough terrain with the LittleDog robot. Unlike walking gaits, bounding is highly dynamic and cannot be planned with quasi-steady approximations. LittleDog is modeled as a planar five-link system, with a 16-dimensional state space; computing a plan over rough terrain in this high-dimensional state space that respects the kinodynamic cons...
This paper presents evidence on Mesozoic inversion of basin bounding faults within the Taleqan-Gajereh-Lar Paleograben (TGLP) in Central Alborz Range. For this purpose, well documented stratigraphy data across the TGLP together with the new acquired structural data on the geometry and kinematics of the paleograben basin bounding faults are utilized. The TGLP has evolved through the Early and Mi...
In this paper we consider the novel idea of Closest Feature Maps (CFMs) applied to refinable collision response in order to address the potential issues and problems associated with over approximation of contact information for time-critical collision detection schemes that utilise sphere-tree bounding volume hierarchies. Existing solutions to time-critical collision handling can at times suffe...
A key step in robust H 2 control synthesis for uncertain systems is the development of an upper bound on the H 2 cost function over a given uncertainty set. This paper considers the development of an upper bound on a nite-horizon H 2 cost functional over an assumed uncertainty set using a parameter-dependent bounding function approach. First, a generic upper bound is developed by bounding the u...
Let E be an elliptic curve over a number field K. Let h be the logarithmic (or Weil) height on E and ĥ be the canonical height on E. Bounds for the difference h − ĥ are of tremendous theoretical and practical importance. It is possible to decompose h − ĥ as a weighted sum of continuous bounded functions Ψυ : E(Kυ) → R over the set of places υ of K. A standard method for bounding h− ĥ, (due to L...
Object detection is one of the oldest problems in computer vision which have eluded a ’grand unified theory’ till date. Occlusion of objects is a major concern for many object detection algorithms, and indeed all algorithms that output a simple bounding box. The first part of this thesis explores existing research in segmentation-aware object detection, which depends on pixel level binary objec...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید