Sciweavers

11562 search results - page 459 / 2313
» Parallel Imaging Problem
Sort
View
TIP
2002
116views more  TIP 2002»
15 years 7 months ago
Adaptive approximate nearest neighbor search for fractal image compression
Fractal image encoding is a computationally intensive method of compression due to its need to find the best match between image sub-blocks by repeatedly searching a large virtual...
Chong Sze Tong, Man Wong

Publication
433views
16 years 4 months ago
Optimal Feature Selection for Subspace Image Matching
Image matching has been a central research topic in computer vision over the last decades. Typical approaches for correspondence involve matching features between images. In this p...
Gemma Roig, Xavier Boix, Fernando De la Torre
TIP
2010
163views more  TIP 2010»
15 years 2 months ago
Fast Image Recovery Using Variable Splitting and Constrained Optimization
We propose a new fast algorithm for solving one of the standard formulations of image restoration and reconstruction which consists of an unconstrained optimization problem where t...
Manya V. Afonso, José M. Bioucas-Dias, M&aa...
ICPR
2008
IEEE
16 years 2 months ago
Tree-serial dynamic programming for image processing
A lot of image analysis problems lend themselves to a unified mathematical formulation as optimization problems. Tree-serial dynamic programming is a particular case of the so-cal...
Andrey Kopylov
ICMCS
2005
IEEE
221views Multimedia» more  ICMCS 2005»
16 years 1 months ago
A Multiple Instance Learning Approach for Content Based Image Retrieval Using One-Class Support Vector Machine
Multiple Instance Learning (MIL) is a special kind of supervised learning problem that has been studied actively in recent years. In this paper, we propose an approach based on On...
Chengcui Zhang, Xin Chen, Min Chen, Shu-Ching Chen...