This Motion Estimation (ME) has been widely used in most of the video standards. It is the most computationally intensive part of video compression. Speed up this process will open new real time applications. A novel Fast Diamond Search (FDS) algorithm is proposed in this journal. The proposed algorithm is a modified version of the conventional Diamond Search (DS) algorithm. Two main steps are ...

In the {Claw, Diamond}-Free Edge Deletion problem, we are given a graph G and an integer k > 0, the question is whether there are at most k edges whose deletion results in a graph without claws and diamonds as induced graphs. Based on some refined observations, we propose a kernel of O(k3) vertices and O(k4) edges, significantly improving the previous kernel of O(k12) vertices and O(k24) edges....

In digital image processing digital distances are useful; distances based on neighborhood sequences are widely used. In this paper the diamond grid is considered, that is the three-dimensional grid of Carbon atoms in the diamond crystal. This grid can be described by four coordinate values using axes of the directions of atomic bonds. In this way the sum of the coordinate values can be either z...

We consider a diamond-shaped dual-hop communication system consisting a source, two parallel half-duplex relays and a destination. In a single antenna configuration, it has been previously shown that a two-phase node-scheduling algorithm, along with the decode and forward strategy can achieve the capacity of the diamond channel for a certain symmetric channel gains [1]. In this paper, we obtain...

By applying a hexagon-diamond search (HDS) method to an ultrasound image, the path of an object is able to be monitored by extracting images into macro-blocks, thereby achieving image redundancy is reduced from one frame to another, and also ascertaining the motion vector within the parameters searched. The HDS algorithm uses six search points to form the six sides of the hexagon pattern, a cen...

In this paper we introduce a variation on the multidimensional segment tree, formed by unifying different interpretations of the dimensionalities of the levels within the tree. Nodes in the resulting d-dimensional structure can have up to d parents and 2d children. In order to better visualize these relationships we introduce a diamond representation of the data structure. We show how the relat...

the price of single point diamond tools with a sharp tip is very high due to complex machining process and highly expensive machining equipments. yet, the performance is not quite satisfactory. in this paper, we have presented a very simple and cost effective machining process for the sharpening and polishing of diamond stylus using low energy reactive ion beam machining (ribm). in our method, ...

Motion Estimation (ME) algorithm plays a vital role in video compression. This is used to find the motion information of the video sequence represented by Motion Vector (MV). The motion estimation is the primary reason for computational complexity of video compression. Some of the motion estimation algorithms such as Block matching Algorithm, Diamond Search, Adaptive Rood Pattern Searches, Redu...

In this work we study tilings of regions in the square lattice with L-shaped trominoes. Deciding the existence of a tiling with L-trominoes for an arbitrary region in general is NP-complete, nonetheless, we indentify restrictions to the problem where either it remains NP-complete or it has a polynomial time algorithm. First we show that an aztec diamond of order n always has an L-tromino tiling...