Sciweavers

3889 search results - page 15 / 778
» A Framework for Optimizing Paper Matching
Sort
View
TIP
2002
92views more  TIP 2002»
13 years 8 months ago
Gradient match and side match fractal vector quantizers for images
In this paper we propose the gradient match fractal vector quantizers (GMFVQs) and the side match fractal vector quantizers (SMFVQs), which are two classes of finite state fractal...
Hsuan T. Chang
ASAP
1997
IEEE
139views Hardware» more  ASAP 1997»
14 years 29 days ago
Buffer size optimization for full-search block matching algorithms
This paper presents how to find optimized buffer size for VLSI architectures of full-search block matching algorithms. Starting from the DG (dependency graph) analysis, we focus i...
Yuan-Hau Yeh, Chen-Yi Lee
ICPR
2002
IEEE
14 years 9 months ago
A New Algorithm for Inexact Graph Matching
The graph is an essential data structure for representing relational information. When graphs are used to represent objects, comparing objects amounts to graph matching. Inexact g...
Adel Hlaoui, Shengrui Wang
3DPVT
2006
IEEE
213views Visualization» more  3DPVT 2006»
14 years 2 months ago
Generalized RANSAC Framework for Relaxed Correspondence Problems
Finding correspondences between two (widely) separated views is essential for several computer vision tasks, such as structure and motion estimation and object recognition. In the...
Wei Zhang, Jana Kosecka
ICIAP
2005
ACM
14 years 8 months ago
Optimal Parameter Estimation for MRF Stereo Matching
Abstract. This paper presents an optimisation technique to select automatically a set of control parameters for a Markov Random Field applied to stereo matching. The method is base...
Riccardo Gherardi, Umberto Castellani, Andrea Fusi...