نتایج جستجو برای: revised sign distance method
تعداد نتایج: 1915449 فیلتر نتایج به سال:
A 55-year-old man with chronic hypertension presented with acute headache and dizziness. Physical examination showed severe hypertension (210/140 mm Hg) without any neurologic sign. Brain MRI showed diffuse brain edema over the brainstem, bilateral thalami, and cerebellar hemispheres with multiple microbleeds at bilateral basal ganglia (figure 1). His symptoms improved dramatically after antihy...
The Szeged index of a graph G is defined as S z(G) = ∑ uv = e ∈ E(G) nu(e)nv(e), where nu(e) is number of vertices of G whose distance to the vertex u is less than the distance to the vertex v in G. Similarly, the revised Szeged index of G is defined as S z∗(G) = ∑ uv = e ∈ E(G) ( nu(e) + nG(e) 2 ) ( nv(e) + nG(e) 2 ) , where nG(e) is the number of equidistant vertices of e in G. In this paper,...
This paper presents an enhanced human identification method based on matching both the contours of teeth and the shapes of dental works (DWs) using bitewing radiographs. To reduce teeth matching error due to unsatisfactory alignment of two incomplete tooth contours, we propose an enhanced contour alignment by pruning the outliers from both contours after they are aligned with the original conto...
--Traffic sign recognition usually consists of two parts : detection and classification. In this paper we describe the classification stage using ring partitioned method. In this method, first the RGB image is converted into gray scale image using color thresholding and histogram specification technique. This gray scale image, called as specified gray scale image is invariant to the illuminatio...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید