Sparse optical flow algorithms, such as the Lucas-Kanade approach, provide more robustness to noise than dense optical flow algorithms and are the preferred approach in many scenarios. Sparse optical flow algorithms estimate the displacement for a selected number of pixels in the image. These pixels can be chosen randomly. However, pixels in regions with more variance between the neighbors will...

An object-based analog very large-scale integration (VLSI) model of selective attentional processing has been implemented using a standard 2.0m CMOS process. This chip extends previous work on modeling a saliency-map-based selection and scanning mechanism to incorporate the ability to group pixels into objects. This grouping, or segmentation, couples the circuitry of the object’s pixels to act ...

This work adopts background subtraction to develop automatic extraction of moving objects in video surveillance. Pixels at a specific position of continuous image frames are manipulated by the modified iterative threshold selection technique to determine the background gray-level value. Pixels at all positions employ such an iterative technique to establish the background that is then analyzed ...

in this paper, a novel decision based median (dbm) filter for enhancing mr images has been proposed. the method is based on eliminating impulse noise from mr images. a median-based method to remove impulse noise from digital mr images has been developed. each pixel is leveled from black to white like gray-level. the method is adjusted in order to decide whether the median operation can be appli...

as the information carried in a high spatial resolution image is not represented by single pixels but by meaningful image objects, which include the association of multiple pixels and their mutual relations, the object based method has become one of the most commonly used strategies for the processing of high resolution imagery. this processing comprises two fundamental and critical steps towar...

The center of a connected graph G is the set of nodes of G for which the maximum distance to any other node of G is as small as possible. If G is a simply connected set of lattice points (\pixels") with graph structure deened by 4-neighbor adjacency, we show that the center of G is either a 2-by-2 square block, a diagonal staircase, or a (dotted) diagonal line with no gaps. The authors thank Fr...

In stereo matching, computing matching cost or similarity between pixels across different images is one of the main steps to get reliable results. More accurate and robust matching cost can be obtained by aggregating per-pixel raw matching cost within the predefined support area. Here, it is very important to aggregate only valid supports from neighbouring pixels. However, unfortunately, it is ...

Several researchers are concentrated on cancellation of salt and pepper noise from the two-dimensional signals like digital images and uses several filters like mean filter, median filter, trimmed median filter etc. , for removal of noise. A novel approach has been implemented using a filter so called Additive White Median Filter (AWMF) for filtering the two-dimensional signal which uses a sche...

Several researchers are concentrated on cancellation of salt and pepper noise from the two-dimensional signals like digital images and uses several filters like mean filter, median filter, trimmed median filter etc. , for removal of noise. A novel approach has been implemented using a filter so called Additive White Median Filter (AWMF) for filtering the two-dimensional signal which uses a sche...