نتایج جستجو برای: edge preserved algorithm
تعداد نتایج: 891337 فیلتر نتایج به سال:
This work deals with noise removal by the use of an edge preserving method called Perona–Malik diffusion or anisotropic diffusion[2][3]. This technique is used for image restoration without removing significant parts of the image content, typically edges or other details. In this scheme anisotropic diffusion is performed on DWT domain[1][7] which is more stationary than noisy image domain. In D...
This paper considers a time dependent(the travel time is not constant throughout the day) pollution routing problem (TDPRP), which aids the decision makers in minimizing travel time, toll cost and emitted pollution cost. In complexity of urban areas most of the time one point is accessible from another with more than one edge. In contrast to previous TDPRP models, which are designed with only ...
The wavelet-domain Hidden Markov Tree Model can properly describe the dependence and correlation of fundus angiographic images' wavelet coefficients among scales. Based on the construction of the fundus angiographic images Hidden Markov Tree Models and Gaussian Mixture Models, this paper applied expectation-maximum algorithm to estimate the wavelet coefficients of original fundus angiographic i...
It is a consequence of the theorem of Stallings on groups with many ends that splittings over finite groups are preserved by quasi-isometries. In this paper we use asymptotic topology to show that group splittings are preserved by quasi-isometries in many cases. Roughly speaking we show that splittings are preserved under quasi-isometries when the vertex groups are fundamental groups of aspheri...
this paper is dedicated to propose an algorithm in order to generate the certain isomers of some well-known fullerene bases. furthermore, we enlist the bipartite edge frustration correlated with some of symmetrically distinct innite families of fullerenes generated by the oered process.
This paper introduces the de Bruijn graph edge minimization problem, which is related to compression of graphs: find order-k with minimum count among all orders. We describe an efficient algorithm that solves this problem. Since problem connected BWT technique called “tunneling”, also describes a way minimize length tunneled in such useful properties for sequence analysis are preserved. Thus, i...
Corresponding Author: Thayammal, S. Department of ECE Dhanalakshmi College of Engineering, Chennai-601 301, Tamil Nadu, India Email: [email protected] Abstract: The motivation of the proposed compression method is to reduce the bit rate for image transmission or memory requirement for image storage while maintaining image quality. The edges are one of the prominent features in an image a...
Orbits of graphs under local complementation (LC) and edge local complementation (ELC) have been studied in several different contexts. For instance, there are connections between orbits of graphs and errorcorrecting codes. We define a new graph class, ELC-preserved graphs, comprising all graphs that have an ELC orbit of size one. Through an exhaustive search, we find all ELC-preserved graphs o...
A matching pursuit technique composed with an imaging method is used to obtain quantitative information on geological records from seismic data. The technique is based on a greedy non-linear search algorithm decomposing data into atoms. These atoms are drawn from a redundant dictionary of seismic waveforms. Fractional splines are used to define this dictionary, whose elements are not only desig...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید