Results 281 to 290 of about 732,728 (308)
Some of the next articles are maybe not open access.
Healing-block-assisted quasi-phase matching
Optics Letters, 2013A quasi-phase matching (QPM) structure based on phase correction by inserting a "healing block" (HB) of length d(HB) into M regular domains of constant length d is proposed to enhance the nonlinear conversion efficiency when the first-order QPM domain length d1 is too short to be reliably fabricated.
Jui-Yu, Lai +5 more
openaire +2 more sources
Mean Predictive Block Matching (MPBM) for fast block-matching motion estimation
3rd European Workshop on Visual Information Processing, 2011In this paper, a new technique called Mean Predictive Block Matching (MPBM) is proposed. This technique is based on adaptive rood pattern search algorithm, in which the size is dynamically determined for each macroblock, based on the mean of two motion vectors of the neighboring macroblocks instead of one as is the case with adaptive rood patter search.
Zaynab Ahmed +2 more
openaire +1 more source
IECON 2013 - 39th Annual Conference of the IEEE Industrial Electronics Society, 2013
Detection of moving objects in a video sequence is a growing field, used in various domains. There are, in the literature, several approaches to detect such movements. In this paper, we will focus on one of these approaches namely block matching. We propose to speed the performances of the block matching algorithm using the Bees' Algorithm which is ...
Daoud Boumazouza +4 more
openaire +1 more source
Detection of moving objects in a video sequence is a growing field, used in various domains. There are, in the literature, several approaches to detect such movements. In this paper, we will focus on one of these approaches namely block matching. We propose to speed the performances of the block matching algorithm using the Bees' Algorithm which is ...
Daoud Boumazouza +4 more
openaire +1 more source
VLSI Architectures For Block Matching Algorithms
SPIE Proceedings, 1988Architectures for the realization of block matching algorithms are discussed, with emphasis on highly concurrent systolic array processors. A mapping methodology for systolic arrays known from the literature is applied to block matching algorithms. Examples of two-dimensional and one-dimensional systolic arrays are presented.
T. Komarek, P. Pirsch
openaire +1 more source
Reconstruction of the block matching profiles
Human Immunology, 1999Block matching is a valuable tool for selecting donors for bone marrow transplantation. Identical, electrophoretic profiles of unrelated bone marrow donor-recipient pairs have been shown to be associated with long-term survival and a reduction of graft versus host disease (GVHD).
N, Ketheesan +6 more
openaire +2 more sources
Video tracking using block matching
Proceedings 2003 International Conference on Image Processing (Cat. No.03CH37429), 2004A tracking algorithm that predicts the object contour using motion vector information is proposed in this paper. Tracking is achieved by predicting the object boundary using motion vectors, followed by contour update, using occlusions/disocclusion detection. An adaptive block-based approach has been used for estimating motion between frames.
K. Hariharakrishnan +3 more
openaire +1 more source
Fast full-search block matching
IEEE Transactions on Circuits and Systems for Video Technology, 2001A fast full-search block-matching algorithm is developed. The matching criterion is the sum of absolute differences or the mean-square error. The algorithm evaluates lower bounds for the matching criteria for subdivided blocks in order to reduce the number of search positions.
Brunig, M, Niehsen, W
openaire +2 more sources
Block-Matching Based Image Compression
2009 Ninth IEEE International Conference on Computer and Information Technology, 2009In this paper, the motion estimation technique used in video compression is extended to still image compression, for which we called it the Block-Matching based imagecompression. Using a small amount of sampled data in thespatial domain, an approximate image of the original image is reconstructed.
Yun-Xia Liu, Yang Yang, Xin-Yan Xu
openaire +1 more source
2018 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference (APSIPA ASC), 2018
There are two main streams in up-to-date image denoising algorithms: non-local self similarity (NSS) prior based methods and convolutional neural network (CNN) based methods. The NSS based methods are favorable on images with regular and repetitive patterns while the CNN based methods perform better on irregular structures.
Byeongyong Ahn +3 more
openaire +1 more source
There are two main streams in up-to-date image denoising algorithms: non-local self similarity (NSS) prior based methods and convolutional neural network (CNN) based methods. The NSS based methods are favorable on images with regular and repetitive patterns while the CNN based methods perform better on irregular structures.
Byeongyong Ahn +3 more
openaire +1 more source
Probabilistic Block-Matching based 6D camera localization
2012 IEEE International Conference on Robotics and Biomimetics (ROBIO), 2012This paper describes a full 6D localization algorithm based on probabilistic motion field. The motion field is obtained by an adaptation of the video compression algorithm known as Block-Matching which provides a sparse optical flow. Such a technique is very fast and allows real time applications.
Vivet, Damien +3 more
openaire +2 more sources