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

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

2009
Glenn Easley Kanghui Guo Demetrio Labate

The continuous curvelet and shearlet transforms have recently been shown to be much more effective than the traditional wavelet transform in dealing with the set of discontinuities of functions and distributions. In particular, the continuous shearlet transform has the ability to provide a very precise geometrical characterization of general discontinuity curves occurring in images. In this pap...

2004
EITAN TADMOR

We introduce a new class of exponentially accurate filters for processing piecewise smooth spectral data. Our study is based on careful error decompositions, focusing on a rather precise balance between physical space localization and the usual moments condition. Exponential convergence is recovered by optimizing the order of the filter as an adaptive function of both the projection order, and ...

2006
Max W. K. Law Albert C. S. Chung

Performing segmentation of narrow, elongated structures with low contrast boundaries is a challenging problem. Boundaries of these structures are difficult to be located when noise exists or intensity of objects and background is varying. Using the active contour methods, this paper proposes a new vector field for detection of such structures. In this paper, unlike other work, object boundaries...

2016
Xuegang Hu Jiamin Zheng X. G. Hu J. M. Zheng

Aiming at the problems that the classical Gaussian mixture model is unable to detect the complete moving object, and is sensitive to the light mutation scenes and so on, an improved algorithm is proposed for moving object detection based on Gaussian mixture model and three-frame difference method. In the process of extracting the moving region, the improved three-frame difference method uses th...

1993
A. I. Katsevich A. G. Ramm

Algorithms are given for finding discontinuity surfaces of a signal specified with random errors at a regular grid in Rp, p ≥ 1. For each position of a sliding window one arranges points from it in ascending order of the measured values of the signal and divides them into two groups. One group contains points with larger values than the other. The division is made according to the nature of the...

2013
Saurabh Singh Ashutosh Datar

Image processing is an area characterized by the need for extensive experimental wok to establish the viability of proposed solution. Interpretation of image contents is one of the objectives in computer vision specifically in image processing. In this era it has received much awareness of researchers. This paper we present different edge detection technique’s using Hough transform, because edg...

Journal: :Neurocomputing 2016
Theju Jacob Wesley E. Snyder Jing Feng Heesun Choi

Building a computational model for how the visual cortex identifies objects is a problem that has attracted much attention over the years. Generally, the interest has been in creating models that are translation, rotation, and luminance invariant. In this paper, we utilize the philosophy of Hough Transform to create a model for detecting straight lines under conditions of discontinuity and nois...

Journal: :J. Sci. Comput. 2009
Scott A. Sarra

Pseudospectral Methods based on global polynomial approximation yield exponential accuracy when the underlying function is analytic. The presence of discontinuities destroys the extreme accuracy of the methods and the well-known Gibbs phenomenon appears. Several types of postprocessing methods have been developed to lessen the effects of the Gibbs phenomenon or even to restore spectral accuracy...

Journal: :journal of algorithms and computation 0
p. jeyanthi research centre, department of mathematics, govindammal aditanar college for women tiruchendur, tamil nadu, india. t. saratha devi department of mathematics, g. venkataswamy naidu college, kovilpatti, tamil nadu, india.

an injective map f : e(g) → {±1, ±2, · · · , ±q} is said to be an edge pair sum labeling of a graph g(p, q) if the induced vertex function f*: v (g) → z − {0} defined by f*(v) = (sigma e∈ev) f (e) is one-one, where ev denotes the set of edges in g that are incident with a vetex v and f*(v (g)) is either of the form {±k1, ±k2, · · · , ±kp/2} or {±k1, ±k2, · · · , ±k(p−1)/2} u {k(p+1)/2} accordin...

Journal: :IEEE transactions on image processing : a publication of the IEEE Signal Processing Society 2003
Ying Luo Rabab Kreidieh Ward

One of the major drawbacks of the block-based DCT compression methods is that they may result in visible artifacts at block boundaries due to coarse quantization of the coefficients. We propose an adaptive approach which performs blockiness reduction in both the DCT and spatial domains to reduce the block-to-block discontinuities. For smooth regions, our method takes advantage of the fact that ...

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

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