Sciweavers

1651 search results - page 247 / 331
» Measuring the Complexity of Classification Problems
Sort
View
ICIP
2009
IEEE
14 years 7 months ago
Selecting representative and distinctive descriptors for efficient landmark recognition
To have a robust and informative image content representation for image categorization, we often need to extract as many as possible visual features at various locations, scales a...
Sheng Gao, Joo-Hwee Lim
TIP
2010
205views more  TIP 2010»
14 years 4 months ago
Variational Region-Based Segmentation Using Multiple Texture Statistics
This paper addresses variational supervised texture segmentation. The main contributions are twofold. First, the proposed method circumvents a major problem related to classical t...
Imen Karoui, Ronan Fablet, Jean-Marc Boucher, Jean...
CORR
2010
Springer
82views Education» more  CORR 2010»
14 years 10 months ago
Expansion and Search in Networks
Borrowing from concepts in expander graphs, we study the expansion properties of real-world, complex networks (e.g. social networks, unstructured peer-to-peer or P2P networks) and...
Arun S. Maiya, Tanya Y. Berger-Wolf
CORR
2010
Springer
82views Education» more  CORR 2010»
14 years 7 months ago
Computing (or not) Quasi-Periodicity Functions of Tilings
Abstract. We know that tilesets that can tile the plane always admit a quasiperiodic tiling [4, 8], yet they hold many uncomputable properties [3, 11, 21, 25]. The quasi-periodicit...
Alexis Ballier, Emmanuel Jeandel
ICIP
2008
IEEE
15 years 11 months ago
Robust snake convergence based on dynamic programming
The extraction of contours using deformable models, such as snakes, is a problem of great interest in computer vision, particular in areas of medical imaging and tracking. Snakes ...
Akshaya Kumar Mishra, Paul W. Fieguth, David A. Cl...