15,720 Hits in 8.9 sec

True-motion estimation with 3-D recursive search block matching

G. de Haan, P.W.A.C. Biezen, H. Huijgen, O.A. Ojo
1993 IEEE transactions on circuits and systems for video technology (Print)  
A new recursive block-matching motion estimation algorithm with only eight candidate vectors per block is presented.  ...  A new search strategy, asynchronous cyclic search, which allows a highly efficient implementation, is presented.  ...  Biemond in particular, for their valuable help with the preparation of the text of this paper.  ... 
doi:10.1109/76.246088 fatcat:ldyjubr2dra7vo3wsbmazzdhyy

Stereo Analysis by Hybrid Recursive Matching for Real-Time Immersive Video Conferencing

N. Atzpadin, P. Kauff, O. Schreer
2004 IEEE transactions on circuits and systems for video technology (Print)  
Therefore, we propose in this paper a new fast algorithm for stereo analysis, which circumvents the window search by using a hybrid recursive matching strategy based on the effective selection of a small  ...  Considering computational costs, a full search or even a local search restricted to a small window of a few pixels, as it is implemented in many real-time algorithms, is not suitable for our application  ...  A new fast disparity estimator will be presented in the following sections, which circumvents the local search by using a hybrid recursive matching strategy based on a small number of candidate vectors  ... 
doi:10.1109/tcsvt.2004.823391 fatcat:hq3sti2wxbehdj2dx2bc6naqa4

Video Scanning Format Conversion and Motion Estimation [chapter]

Gerard de Haan, Ralph Braspenning
2009 Video, Speech, and Audio Signal Processing and Associated Standards  
Various formats have been designed and standardized, to strike a particular balance between quality, cost, transmission capacity and compatibility with other standards.  ...  This is because the conditions of the sampling theorem are generally not met in video signals.  ...  V.3 Search strategies V.3.1 Sub-sampled full search In the most straightforward search strategy for all candidate vectors C in the search area, the matching error for a block B(X) of pixel positions is  ... 
doi:10.1201/9781420046090-c16 fatcat:xvs2xgj7jbbpjff3vwkf6ay2l4

Smoothness Constraints in Recursive Search Motion Estimation for Picture Rate Conversion

Chris Bartels, Gerard de Haan
2010 IEEE transactions on circuits and systems for video technology (Print)  
The quality of the block correlation depends on the validity of the brightness constancy assumption and the assumption of fixed translational motion within a block.  ...  In this paper, we show an intuitive and computationally efficient way to implement them within the framework of (realtime) recursive search, targeting consumer-market embedded devices with limited resources  ...  The above example shows this for one dimension, e.g., the v x vector component. Fig. 3 . 3 (a) "Smooth" transition in a VF. (b) Estimated result with update steps visualized.  ... 
doi:10.1109/tcsvt.2010.2058474 fatcat:7ggcxncxxfd3nm452iam5duvg4

Rectangle blocking matrices based unitary multistage Wiener reduced-rank joint detection algorithm for multiple input multiple output systems

PinYi Ren, Rui Wang, ShiJiao Zhang
2010 Science China Information Sciences  
The new scheme adopts rectangle submatrix as blocking matrix, which is chosen from the square blocking matrix for UMSWF.  ...  Traditional equalization algorithms for multiple input multiple output (MIMO) systems suffer from high complexity and low convergence rate.  ...  In this new algorithm, we do not need to make a separate solution for blocking matrix and the size of the observation vector x i (k) is decreased step by step with the forward recursion.  ... 
doi:10.1007/s11432-010-4063-0 fatcat:3r7ptboypjde7dn6mnsatvqaza

Temporal symmetry constraints in block matching

C. Bartels, G. de Haan
2009 2009 IEEE 13th International Symposium on Consumer Electronics  
This paper describes a simple implementation of symmetry constraints in a real-time block matching motion estimation algorithm and shows the effect on related occlusion detection methods that are based  ...  Most motion estimation and optical flow algorithms use some form of spatial regularization to improve consistency, but few perform a temporal regularization based on the symmetry between successive vector  ...  CONCLUSION We have shown that symmetry constraints can be applied in a recursive search block matching scheme at relative low-cost.  ... 
doi:10.1109/isce.2009.5156968 fatcat:on7kred6hfg77l4seitnrw3oai

A 3D Spatio-Temporal Motion Estimation Algorithm for Video Coding

Gwo Lee, Ming-jiun Wang, He-yuan Lin, Drew Su, Bo-yun Lin
2006 2006 IEEE International Conference on Multimedia and Expo  
This paper presents a new spatio-temporal motion estimation algorithm for video coding.  ...  The algorithm is based on optimization theory and consists of the strategies including 3D spatio-temporal motion vector prediction, modified one-at-a-time search scheme, and multiple update paths.  ...  ME for a block completes as soon as all of the update paths are evaluated or the MNSP is run out. The final MV is chosen among {MV(P i )|i=1,2, …, n} (3) with the smallest SAD.  ... 
doi:10.1109/icme.2006.262405 dblp:conf/icmcs/LeeWLSL06 fatcat:tca5uielfzhfphai2iv635skmm

Cyclic overlapping block coordinate search for optimizing building design

Gian Luca Brunetti
2016 Automation in Construction  
of a small building in a plot.  ...  programs are used to reason about a building design process at micro-urban scale and strategies are defined to make the search more efficient.  ...  Fig. 3 . 3 Fig. 3. Schemes of the search structures (overlapping block decompositions and sweep patterns) tested in the mono-cycle, non-recursive searches that are shown in Fig. 6.  ... 
doi:10.1016/j.autcon.2016.08.014 fatcat:g2f2yvkpbfbcxfjmxvoeta7owq

Self-adaptive exploration in evolutionary search [article]

Marc Toussaint
2001 arXiv   pre-print
Finally, we present examples of these concepts: For a specific grammar-type encoding, we observe a large variability of exploration strategies for a fixed phenotype, and a self-adaptive drift towards short  ...  representations with highly structured exploration strategy that matches the "problem's structure".  ...  For example, at first sight it is hard to see what a CMA evolutionary strategy has in common with the codon bias in HIV sequences.  ... 
arXiv:physics/0102009v1 fatcat:5k7jils3vjdwhhhtfhroqnoiym

GM-PHD Filter for Searching and Tracking an Unknown Number of Targets with a Mobile Sensor with Limited FOV [article]

Yoonchang Sung, Pratap Tokekar
2021 arXiv   pre-print
We study the problem of searching for and tracking a collection of moving targets using a robot with a limited Field-Of-View (FOV) sensor.  ...  Specifically, we generalize the Gaussian Mixture Probability Hypothesis Density (GM-PHD) filter which was previously applied for tracking problems to allow for simultaneous search and tracking with a limited  ...  We create a new component for every measurement (in addition to updating existing components with this measurement as described in the RBE block).  ... 
arXiv:1812.09636v2 fatcat:jl7mlr6ez5flrpup5d5o6izoie

Adaptive fractal image compression using PSO

A. Muruganandham, R.S.D. Wahida Banu
2010 Procedia Computer Science  
At low bitrate and with acceptable quality in Fractal Image Compression (FIC) of the coded image, the encoding time is very large for most existing algorithms.  ...  In this paper, a fast fractal encoding system is proposed using particle swarm optimization (PSO) to reduce the encoding time.  ...  For each range block v in R, one search in the (N -2L + 1) 2 overlapping domain blocks of size 2L x 2L which forms the domain pool D to find the best match.  ... 
doi:10.1016/j.procs.2010.11.044 fatcat:e4h3kzwucvelzdebby7wxiroeq

Fast recursive portfolio optimization

Laurence Irlicht
2014 Algorithmic Finance  
We demonstrate the efficacy of our approach by selecting a prediction strategy in a fraction of the time taken by standard methods.  ...  In this paper, we introduce a recursive algorithm which significantly lowers the computational cost of calculating the covariance matrix and its inverse as well as an iterative heuristic which provides  ...  Acknowlegements The author wishes to express his appreciation to IFM Investors, and in particular the Indexed Equities Team for supporting this research.  ... 
doi:10.3233/af-140038 fatcat:z7wfpv445vfy7pj6yx6sx46aiu

Learning Graph Convolutional Network for Skeleton-based Human Action Recognition by Neural Searching [article]

Wei Peng, Xiaopeng Hong, Haoyu Chen, Guoying Zhao
2019 arXiv   pre-print
Moreover, a sampling- and memory-efficient evolution strategy is proposed to search an optimal architecture for this task.  ...  However, many existing GCN methods provide a pre-defined graph and fix it through the entire network, which can loss implicit joint correlations.  ...  So we search for an entire GCN network instead of a single block. To improve the efficiency, a high computation-and memory-efficient search strategy will be provided.  ... 
arXiv:1911.04131v1 fatcat:ml6fl66sgnbipdkugnyrxtinqe

Adaptive-Resolution Field Mapping Using Gaussian Process Fusion with Integral Kernels [article]

Liren Jin, Julius Rückin, Stefan H. Kiss, Teresa Vidal-Calleja, Marija Popović
2022 arXiv   pre-print
A key aspect of our approach is an integral kernel encoding spatial correlation over the areas of grid cells, which enables modifying map resolution while maintaining correlations in a theoretically sound  ...  Finally, we integrate our mapping strategy into an adaptive path planning framework to show that it facilitates information gathering efficiency in online settings.  ...  Jordan Bates from Forschungszentrum Jülich for providing the temperature data.  ... 
arXiv:2109.14257v2 fatcat:kuqykip6q5b4vg5lkjvbwi7tji

Stronger Virtual Connections in Hex

Jakub Pawlewicz, Ryan Hayward, Philip Henderson, Broderick Arneson
2015 IEEE Transactions on Computational Intelligence and AI in Games  
We present FastVC Search, a new algorithm for finding such connections.  ...  For connection games such as Hex or Y or Havannah, finding guaranteed cell-to-cell connection strategies can be a computational bottleneck.  ...  ACKNOWLEDGEMENTS We thank Martin Mueller for the use of his machines for some of our experiments.  ... 
doi:10.1109/tciaig.2014.2345398 fatcat:txrrd66k5bctdkpgwagfnfjowy
« Previous Showing results 1 — 15 out of 15,720 results