نتایج جستجو برای: edge preserved algorithm

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

Journal: :IEEE Technology and Society Magazine 2018

Journal: :رادار 0
رضا ملکی مهدی مختارزاده علی اکبر آبکار محمدجواد ولدان زوج علی غفوری

lineaments are the most important phenomena of geological exploration of hydrocarbon reservoirs . concepts in order to map the contours of land need so much time and money. one of the most famous methods in lineaments extraction is satellite image processing. in this paper, an overview of lineament extraction methods and a new method based on canny edge detection algorithm is raised. the result...

Journal: :Eur. J. Comb. 2015
Rafal Kalinowski Monika Pilsniak

We investigate the distinguishing index D′(G) of a graph G as the least number d such that G has an edge-colouring with d colours that is only preserved by the trivial automorphism. This is an analog to the notion of the distinguishing number D(G) of a graph G, which is defined for colourings of vertices. We obtain a general upper bound D′(G) ≤ ∆(G) unless G is a small cycle C3, C4 or C5. We al...

Journal: :Theoretical Computer Science 2009

2011
A.Benjamin Joseph R. Baskaran

This paper presents a new approach of edge preserving and edge based segmentation for compression of images using Modified Fast Haar wavelet transform (MFHW) and Bit Plane Encoder to elevate the compression ratio with high picture quality. The edges of an image are preserved to increase the PSNR, and then the detected edges are used to segment the foreground and background images. The Foregroun...

2009
Yas Abbas K. Alsultanny

Digital image have been expanding in usage. The importance of image compression algorithms have been increased, to produce smaller file size with a lower computational requirement. The wavelet transform offers a natural decomposition of images at multiple resolutions, since the wavelet transform can decompose images into various multiresolution subbands, where the correlation exists. A novel te...

K. Eshgee and M. Kazemi,

In this paper, a new algorithm for solving the single loop routing problem is presented. The purpose of the single loop routing problem(SLRP) is to find the shortest loop for an automated guided vehicle covering at least one edge of each department of a block layout. First it shown that this problem can be represented as a graph model. Then a meta-heuristic algorithm based on and colony system ...

Journal: :CoRR 2018
Victor Lagerkvist Magnus Wahlström

We study the complexity of SAT(Γ) problems for potentially infinite languages Γ closed under variable negation, which we refer to as sign-symmetric languages Γ. Via an algebraic connection, this reduces to the study of restricted partial polymorphisms we refer to as pSDI-operations (for partial, self-dual and idempotent), under which the language Γ is invariant. First, we focus on the language ...

2017
Rui Tao Yanjing Sun Weidong Liu

Preliminary communication In this paper we study watermarking algorithm for compressed images in the application of antiforgery in financial bills. First, the basic watermarking algorithm based on image edge information is studied. The encrypted watermark is converted into binary values and embedded into the edges, meanwhile the original edge shape is preserved from noticeable destruction. Seco...

2016
Harshdeep Trehan

Existing details enhancement algorithms offer edge-preserving decomposition algorithms. A resource image is usually very first decomposed into a base layer that may be established via homogeneous regions together with sharp sides as well as a details level which consists of fine details or textures by way of the edge-preserving decomposition criteria, then a detail-enhanced image is definitely ...

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

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