: Many image features are proved to be good candidates for recognition. Among them are edges, lines, corners, junctions or interest points in general. Importance of corner detection in digital images is increasing with increasing work in computer vision in imagery. One of the most promising techniques is the one based on Harris corner detection method. This work describes different approaches t...

A novel approach to geometric shape preservation of remote sensing SAR sea ice images is presented in this paper. This approach will complement the existing edge detection schemes. The final edge is evolved by iterations. During each iteration all existing edges are checked for missing link and missing links are found by checking the orientation of the existing edges and by searching for best g...

To improve the spatial error concealment (SEC) for consecutive block loss, an edge-aware spatial-frequency extrapolation (ESFE) algorithm and its edge-guided parametric model are proposed by selectively incorporating the Hough-based edge synthesis into the frequency-based extrapolation architecture. The dominant edges that cross the missing blocks are firstly identified by the Canny detector, a...

This paper presents a fuzzy edge guided image sharpening technique. Sharpened image is obtained by subtracting the smoothed image of an input image from itself. Image smoothening is carried out with median filtering technique. Median filtering technique is a process of replacing the concerned pixel by the median value of pixels within a block as the concerned pixel is at center. Smoothening is ...

Introduction edge detection labels each pixel as edge or no edge additional properties of edge direction gradient magnitude contrast edge grouping edge pixels in same region boundary grouped together edge detector typically produces short linear disjointed edge segments each edge segment has an orientation and a position edge segments of little use until aggregated into extended edges global ed...

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...