Sciweavers

76 search results - page 2 / 16
» Adjacency stable connected operators and set levelings
Sort
View
ICPR
2008
IEEE
14 years 8 months ago
Nonlocal morphological levelings by partial difference equations over weighted graphs
In this paper, a novel approach to Mathematical Morphology operations is proposed. Morphological operators based on partial differential equations (PDEs) are extended to weighted ...
Vinh-Thong Ta, Abderrahim Elmoataz, Olivier Lezora...
BILDMED
2006
112views Algorithms» more  BILDMED 2006»
13 years 8 months ago
Extracting Consistent and Manifold Interfaces from Multi-valued Volume Data Sets
We propose an algorithm to construct a set of interfaces that separate the connected components of a multi-valued volume dataset. While each single interface is a manifold triangle...
Stephan Bischoff, Leif Kobbelt
CVPR
2010
IEEE
14 years 3 months ago
Linked Edges as Stable Region Boundaries
Many of the recently popular shape based category recognition methods require stable, connected and labeled edges as input. This paper introduces a novel method to find the most st...
Michael Donoser, Hayko Riemenschneider and Horst B...
TIT
2010
103views Education» more  TIT 2010»
13 years 2 months ago
Analysis of absorbing sets and fully absorbing sets of array-based LDPC codes
The class of low-density parity-check (LDPC) codes is attractive, since such codes can be decoded using practical message-passing algorithms, and their performance is known to app...
Lara Dolecek, Zhengya Zhang, Venkat Anantharam, Ma...
GPEM
2002
95views more  GPEM 2002»
13 years 7 months ago
On Appropriate Adaptation Levels for the Learning of Gene Linkage
A number of algorithms have been proposed aimed at tackling the problem of learning "Gene Linkage" within the context of genetic optimisation, that is to say, the problem...
James Smith