نتایج جستجو برای: block matching algorithm
تعداد نتایج: 968409 فیلتر نتایج به سال:
ELECT The joint sparsity of uplink channels in massive multi-input– multi-output (MIMO) systems is explored and a block sparse model is proposed for joint channel estimation. The block coherence of this model is analysed. It is indicated that as the number of antennas at the base station grows to be infinity, the block coherence will be zero. Then a block optimised orthogonal matching pursuit (...
Orthogonal matching pursuit (OMP) is a canonical greedy algorithm for sparse signal reconstruction. When the signal of interest is block sparse, i.e., it has nonzero coefficients occurring in clusters, the block version of OMP algorithm (i.e., Block OMP) outperforms the conventional OMP. In this paper, we demonstrate that a new notion of block restricted isometry property (Block RIP), which is ...
A motion field generation algorithm using block matching of edge-flag histograms has been developed aiming at its application to motion recognition systems. Use of edge flags instead of pixel intensities has made the algorithm robust against illumination changes. In order to detect local motions of interest effectively, a new adaptive frame interval adjustment scheme has been introduced in whic...
An improved three-step search (ITSS) block-matching algorithm for motion estimation is described in this paper, spec lfically aiming towards low bit-rate videocoding applications. The method is based on the realworld image sequence’s characteristic of centre-biased motion vector distribution, and uses centre-biased checking point patterns and a relatively small number of search locations to per...
In this paper we consider to embed a tree T with N vertices on a set of N points inside a simple polygon on n vertices and the goal is to minimize the number of bends. The main idea of our algorithm is modeling the problem into graph matching problem and uses the graph matching algorithms. We apply the concept of error-correction transformation and find the appropriate cost function then we per...
Based on the study of motion vector distribution from several commonly used test image sequences, a new diamond search (DS) algorithm for fast block-matching motion estimation (BMME) is proposed in this paper. Simulation results demonstrate that the proposed DS algorithm greatly outperforms the well-known three-step search (TSS) algorithm. Compared with the new three-step search (NTSS) algorith...
In this paper, a novel frame rate up conversion (FRUC) using modified adaptive bilateral motion estimation (MAEBME) is proposed. Traditionally, extended bilateral motion estimation (EBME) carries out bilateral motion estimation (BME) twice on the same region, therefore has high complexity. Adaptive extended bilateral motion estimation (AEBME) is proposed to reduce complexity and increase visual...
We propose a new algorithm for multispectral image denoising. The algorithm is based on the state-of-the-art Block Matching 3-D lter. For each reference 3-D block of multispectral data (sub-array of pixels from spatial and spectral locations) we nd similar 3-D blocks using block matching and group them together to form a set of 4-D groups of pixels in spatial (2-D), spectral (1-D) and tempor...
Bristol '67. Bristol '87. Bristol '07? How will the BMA change before the next Annual Representative Meeting jn Bristol, if the 20 year interval between hosting meetings is repeated? How many of us will be there? Will seasoned representatives looking back on '87 sigh as nostalgically as we now do about '67? How many of us could have foreseen in '67 that the BMA would now be a statutory Trade Un...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید