نتایج جستجو برای: edge artifact

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

2010
Young-Chul Kim

© 2010 ETRI Journal, Volume 32, Number 3, June 2010 This paper presents a new edge-protection algorithm and its very large scale integration (VLSI) architecture for block artifact reduction. Unlike previous approaches using block classification, our algorithm utilizes pixel classification to categorize each pixel into one of two classes, namely smooth region and edge region, which are described...

Journal: :Archives of ophthalmology 2007
Giacomo Savini Piero Barboni Michele Carbonelli Maurizio Zanini

OBJECTIVE To study how customizing the peripapillary scan diameter on the basis of optic nerve head (ONH) diameter affects retinal nerve fiber layer (RNFL) thickness measurements using Stratus optical coherence tomography (OCT). METHODS Retinal nerve fiber layer was examined using 1 fixed-diameter circular scan (3.4 mm) and 2 customized-diameter scans (at 0.5 mm and 1 mm from the ONH edge) in...

Journal: :transactions on combinatorics 0
wai chee shiu hong kong baptist university

‎‎let $g=(v,e)$ be a simple graph‎. ‎an edge labeling $f:eto {0,1}$ induces a vertex labeling $f^+:vtoz_2$ defined by $f^+(v)equiv sumlimits_{uvin e} f(uv)pmod{2}$ for each $v in v$‎, ‎where $z_2={0,1}$ is the additive group of order 2‎. ‎for $iin{0,1}$‎, ‎let‎ ‎$e_f(i)=|f^{-1}(i)|$ and $v_f(i)=|(f^+)^{-1}(i)|$‎. ‎a labeling $f$ is called edge-friendly if‎ ‎$|e_f(1)-e_f(0)|le 1$‎. ‎$i_f(g)=v_f(...

Clustering techniques are used to extract the structure of software for understanding, maintaining, and refactoring. In the literature, most of the proposed approaches for software clustering are divided into hierarchical algorithms and search-based techniques. In the former, clustering is a process of merging (splitting) similar (non-similar) clusters. These techniques suffered from the drawba...

Journal: :journal of algebraic system 0
a. alhevaz department of mathematics, shahrood university of technology, p.o. box: 316- 3619995161, shahrood, iran. m. baghipur department of mathematics, shahrood university of technology, p.o. box: 316- 3619995161, shahrood, iran.

‎let $g=(v(g),e(g))$ be a simple connected graph with vertex set $v(g)$ and edge‎ ‎set $e(g)$‎. ‎the (first) edge-hyper wiener index of the graph $g$ is defined as‎: ‎$$ww_{e}(g)=sum_{{f,g}subseteq e(g)}(d_{e}(f,g|g)+d_{e}^{2}(f,g|g))=frac{1}{2}sum_{fin e(g)}(d_{e}(f|g)+d^{2}_{e}(f|g)),$$‎ ‎where $d_{e}(f,g|g)$ denotes the distance between the edges $f=xy$ and $g=uv$ in $e(g)$ and $d_{e}(f|g)=s...

2013
Allen S. Lee Manoj A. Thomas Richard Baskerville

Playing a central role in the information-systems research community’s discourse on design science has been the concept of the “IT artifact.” We pose the alternative concept of the “IS artifact.” We “unpack” what has been called the “IT artifact” into a separate “information artifact” and “technology artifact” that, together with a “social artifact,” interact to form the “IS artifact.” We illus...

Journal: :journal of biomedical physics and engineering 0
s. abbaspour a. fallah

background: the electrocardiogram artifact is a major contamination in the electromyogram signals when electromyogram signal is recorded from upper trunk muscles and because of that the contaminated electromyogram is not useful. objective: removing electrocardiogram contamination from electromyogram signals. methods: in this paper, the clean electromyogram signal, electrocardiogram artifact and...

Journal: :Collection of scientific works "Visnyk of Zaporizhzhya National University. Philological Sciences" 2020

Journal: :American Journal of Clinical Pathology 1998

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

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