4 resultados para Level Set Approximation

em Bulgarian Digital Mathematics Library at IMI-BAS


Relevância:

90.00% 90.00%

Publicador:

Resumo:

2000 Mathematics Subject Classification: 60F05, 60B10.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

2000 Mathematics Subject Classification: 26E25, 41A35, 41A36, 47H04, 54C65.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Image content interpretation is much dependent on segmentations efficiency. Requirements for the image recognition applications lead to a nessesity to create models of new type, which will provide some adaptation between law-level image processing, when images are segmented into disjoint regions and features are extracted from each region, and high-level analysis, using obtained set of all features for making decisions. Such analysis requires some a priori information, measurable region properties, heuristics, and plausibility of computational inference. Sometimes to produce reliable true conclusion simultaneous processing of several partitions is desired. In this paper a set of operations with obtained image segmentation and a nested partitions metric are introduced.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Various combinatorial problems are effectively modelled in terms of (0,1) matrices. Origins are coming from n-cube geometry, hypergraph theory, inverse tomography problems, or directly from different models of application problems. Basically these problems are NP-complete. The paper considers a set of such problems and introduces approximation algorithms for their solutions applying Lagragean relaxation and related set of techniques.