High Accuracy Algorithms for Approximation of Discontinuity Lines of a Noisy Function View Full Text


Ontology type: schema:ScholarlyArticle     


Article Info

DATE

2018-12

AUTHORS

A. L. Ageev, T. V. Antonova

ABSTRACT

We consider the problem of localizing (finding the position of) discontinuity lines of a noisy function of two variables. Such problems arise in image processing, because the boundaries of objects are often discontinuity lines. It is assumed that the function of two variables is smooth in a neighborhood of discontinuity lines and has discontinuity of the first kind at each point of these lines. Instead of the exact function, its approximation in the space L2 and the measurement error level δ are known. In this case, the problem belongs to the class of nonlinear ill-posed problems, and regularization algorithms should be constructed for its solution. We construct and study regularizing discrete algorithms of averaging “with a turn.” New rules are proposed for choosing regularization parameters, and the methods of deriving localization error bounds are improved. Error bounds are found for the localization of singularities of order O(δ4/3) under stricter separability conditions: the separability threshold in the present paper has order O(δ2/3), whereas in the authors’ previous papers devoted to this problem the bounds for the localization error and separability threshold have order O(δ). In addition, the discretization of the algorithms of averaging “with a turn” is investigated theoretically for the first time (conditions for the discretization step are specified). More... »

PAGES

1-11

References to SciGraph publications

Identifiers

URI

http://scigraph.springernature.com/pub.10.1134/s0081543818090018

DOI

http://dx.doi.org/10.1134/s0081543818090018

DIMENSIONS

https://app.dimensions.ai/details/publication/pub.1112591674


Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
Incoming Citations Browse incoming citations for this publication using opencitations.net

JSON-LD is the canonical representation for SciGraph data.

TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

[
  {
    "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
    "about": [
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0801", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Artificial Intelligence and Image Processing", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/08", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Information and Computing Sciences", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Ural Federal University", 
          "id": "https://www.grid.ac/institutes/grid.412761.7", 
          "name": [
            "Krasovskii Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences, 620990, Yekaterinburg, Russia", 
            "Ural Federal University, 620000, Yekaterinburg, Russia"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Ageev", 
        "givenName": "A. L.", 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Ural Branch of the Russian Academy of Sciences", 
          "id": "https://www.grid.ac/institutes/grid.426536.0", 
          "name": [
            "Krasovskii Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences, 620990, Yekaterinburg, Russia"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Antonova", 
        "givenName": "T. V.", 
        "type": "Person"
      }
    ], 
    "citation": [
      {
        "id": "https://doi.org/10.1515/jip-2012-0039", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1003746027"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1134/s1990478915030011", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1044327855", 
          "https://doi.org/10.1134/s1990478915030011"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1134/s1995423912040015", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1047715165", 
          "https://doi.org/10.1134/s1995423912040015"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1515/9783110944822", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1048256969"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1134/s1990478912030015", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1052572107", 
          "https://doi.org/10.1134/s1990478912030015"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1515/9783110900118", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1096911628"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1134/s0081543817090024", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1101040597", 
          "https://doi.org/10.1134/s0081543817090024"
        ], 
        "type": "CreativeWork"
      }
    ], 
    "datePublished": "2018-12", 
    "datePublishedReg": "2018-12-01", 
    "description": "We consider the problem of localizing (finding the position of) discontinuity lines of a noisy function of two variables. Such problems arise in image processing, because the boundaries of objects are often discontinuity lines. It is assumed that the function of two variables is smooth in a neighborhood of discontinuity lines and has discontinuity of the first kind at each point of these lines. Instead of the exact function, its approximation in the space L2 and the measurement error level \u03b4 are known. In this case, the problem belongs to the class of nonlinear ill-posed problems, and regularization algorithms should be constructed for its solution. We construct and study regularizing discrete algorithms of averaging \u201cwith a turn.\u201d New rules are proposed for choosing regularization parameters, and the methods of deriving localization error bounds are improved. Error bounds are found for the localization of singularities of order O(\u03b44/3) under stricter separability conditions: the separability threshold in the present paper has order O(\u03b42/3), whereas in the authors\u2019 previous papers devoted to this problem the bounds for the localization error and separability threshold have order O(\u03b4). In addition, the discretization of the algorithms of averaging \u201cwith a turn\u201d is investigated theoretically for the first time (conditions for the discretization step are specified).", 
    "genre": "research_article", 
    "id": "sg:pub.10.1134/s0081543818090018", 
    "inLanguage": [
      "en"
    ], 
    "isAccessibleForFree": false, 
    "isPartOf": [
      {
        "id": "sg:journal.1136804", 
        "issn": [
          "0081-5438", 
          "1531-8605"
        ], 
        "name": "Proceedings of the Steklov Institute of Mathematics", 
        "type": "Periodical"
      }, 
      {
        "issueNumber": "Suppl 1", 
        "type": "PublicationIssue"
      }, 
      {
        "type": "PublicationVolume", 
        "volumeNumber": "303"
      }
    ], 
    "name": "High Accuracy Algorithms for Approximation of Discontinuity Lines of a Noisy Function", 
    "pagination": "1-11", 
    "productId": [
      {
        "name": "readcube_id", 
        "type": "PropertyValue", 
        "value": [
          "610c06cf2acfb0db2290e70d4be110d50c784df63309945442e9c903c11ee5ad"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1134/s0081543818090018"
        ]
      }, 
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1112591674"
        ]
      }
    ], 
    "sameAs": [
      "https://doi.org/10.1134/s0081543818090018", 
      "https://app.dimensions.ai/details/publication/pub.1112591674"
    ], 
    "sdDataset": "articles", 
    "sdDatePublished": "2019-04-11T11:13", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-uberresearch-data-dimensions-target-20181106-alternative/cleanup/v134/2549eaecd7973599484d7c17b260dba0a4ecb94b/merge/v9/a6c9fde33151104705d4d7ff012ea9563521a3ce/jats-lookup/v90/0000000353_0000000353/records_45366_00000002.jsonl", 
    "type": "ScholarlyArticle", 
    "url": "https://link.springer.com/10.1134%2FS0081543818090018"
  }
]
 

Download the RDF metadata as:  json-ld nt turtle xml License info

HOW TO GET THIS DATA PROGRAMMATICALLY:

JSON-LD is a popular format for linked data which is fully compatible with JSON.

curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1134/s0081543818090018'

N-Triples is a line-based linked data format ideal for batch operations.

curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1134/s0081543818090018'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1134/s0081543818090018'

RDF/XML is a standard XML format for linked data.

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1134/s0081543818090018'


 

This table displays all metadata directly associated to this object as RDF triples.

95 TRIPLES      21 PREDICATES      34 URIs      19 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1134/s0081543818090018 schema:about anzsrc-for:08
2 anzsrc-for:0801
3 schema:author Neebd671042b649b8934b095297344131
4 schema:citation sg:pub.10.1134/s0081543817090024
5 sg:pub.10.1134/s1990478912030015
6 sg:pub.10.1134/s1990478915030011
7 sg:pub.10.1134/s1995423912040015
8 https://doi.org/10.1515/9783110900118
9 https://doi.org/10.1515/9783110944822
10 https://doi.org/10.1515/jip-2012-0039
11 schema:datePublished 2018-12
12 schema:datePublishedReg 2018-12-01
13 schema:description We consider the problem of localizing (finding the position of) discontinuity lines of a noisy function of two variables. Such problems arise in image processing, because the boundaries of objects are often discontinuity lines. It is assumed that the function of two variables is smooth in a neighborhood of discontinuity lines and has discontinuity of the first kind at each point of these lines. Instead of the exact function, its approximation in the space L2 and the measurement error level δ are known. In this case, the problem belongs to the class of nonlinear ill-posed problems, and regularization algorithms should be constructed for its solution. We construct and study regularizing discrete algorithms of averaging “with a turn.” New rules are proposed for choosing regularization parameters, and the methods of deriving localization error bounds are improved. Error bounds are found for the localization of singularities of order O(δ4/3) under stricter separability conditions: the separability threshold in the present paper has order O(δ2/3), whereas in the authors’ previous papers devoted to this problem the bounds for the localization error and separability threshold have order O(δ). In addition, the discretization of the algorithms of averaging “with a turn” is investigated theoretically for the first time (conditions for the discretization step are specified).
14 schema:genre research_article
15 schema:inLanguage en
16 schema:isAccessibleForFree false
17 schema:isPartOf N450312a353de4144ad41013130b62188
18 N759fcf16f87c43f3bd053d1f0877f95b
19 sg:journal.1136804
20 schema:name High Accuracy Algorithms for Approximation of Discontinuity Lines of a Noisy Function
21 schema:pagination 1-11
22 schema:productId N5ed17df23bd741fd83970c1da52811dd
23 Nbc4f26e4fcc04b63ae2a58574a665320
24 Nde9efcd7ed434f7b8a07848fe6c02080
25 schema:sameAs https://app.dimensions.ai/details/publication/pub.1112591674
26 https://doi.org/10.1134/s0081543818090018
27 schema:sdDatePublished 2019-04-11T11:13
28 schema:sdLicense https://scigraph.springernature.com/explorer/license/
29 schema:sdPublisher N0619b0a75cb24aedb58c8bdd4e13e120
30 schema:url https://link.springer.com/10.1134%2FS0081543818090018
31 sgo:license sg:explorer/license/
32 sgo:sdDataset articles
33 rdf:type schema:ScholarlyArticle
34 N0619b0a75cb24aedb58c8bdd4e13e120 schema:name Springer Nature - SN SciGraph project
35 rdf:type schema:Organization
36 N0e4d7d85a8724624b98d14a6bfea1059 schema:affiliation https://www.grid.ac/institutes/grid.426536.0
37 schema:familyName Antonova
38 schema:givenName T. V.
39 rdf:type schema:Person
40 N226dc2af779a45fd91ddbec44d2d8567 rdf:first N0e4d7d85a8724624b98d14a6bfea1059
41 rdf:rest rdf:nil
42 N450312a353de4144ad41013130b62188 schema:volumeNumber 303
43 rdf:type schema:PublicationVolume
44 N5ed17df23bd741fd83970c1da52811dd schema:name doi
45 schema:value 10.1134/s0081543818090018
46 rdf:type schema:PropertyValue
47 N759fcf16f87c43f3bd053d1f0877f95b schema:issueNumber Suppl 1
48 rdf:type schema:PublicationIssue
49 Nbc4f26e4fcc04b63ae2a58574a665320 schema:name readcube_id
50 schema:value 610c06cf2acfb0db2290e70d4be110d50c784df63309945442e9c903c11ee5ad
51 rdf:type schema:PropertyValue
52 Nde9efcd7ed434f7b8a07848fe6c02080 schema:name dimensions_id
53 schema:value pub.1112591674
54 rdf:type schema:PropertyValue
55 Nee7ab82deb4d46b280156f993ea036e4 schema:affiliation https://www.grid.ac/institutes/grid.412761.7
56 schema:familyName Ageev
57 schema:givenName A. L.
58 rdf:type schema:Person
59 Neebd671042b649b8934b095297344131 rdf:first Nee7ab82deb4d46b280156f993ea036e4
60 rdf:rest N226dc2af779a45fd91ddbec44d2d8567
61 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
62 schema:name Information and Computing Sciences
63 rdf:type schema:DefinedTerm
64 anzsrc-for:0801 schema:inDefinedTermSet anzsrc-for:
65 schema:name Artificial Intelligence and Image Processing
66 rdf:type schema:DefinedTerm
67 sg:journal.1136804 schema:issn 0081-5438
68 1531-8605
69 schema:name Proceedings of the Steklov Institute of Mathematics
70 rdf:type schema:Periodical
71 sg:pub.10.1134/s0081543817090024 schema:sameAs https://app.dimensions.ai/details/publication/pub.1101040597
72 https://doi.org/10.1134/s0081543817090024
73 rdf:type schema:CreativeWork
74 sg:pub.10.1134/s1990478912030015 schema:sameAs https://app.dimensions.ai/details/publication/pub.1052572107
75 https://doi.org/10.1134/s1990478912030015
76 rdf:type schema:CreativeWork
77 sg:pub.10.1134/s1990478915030011 schema:sameAs https://app.dimensions.ai/details/publication/pub.1044327855
78 https://doi.org/10.1134/s1990478915030011
79 rdf:type schema:CreativeWork
80 sg:pub.10.1134/s1995423912040015 schema:sameAs https://app.dimensions.ai/details/publication/pub.1047715165
81 https://doi.org/10.1134/s1995423912040015
82 rdf:type schema:CreativeWork
83 https://doi.org/10.1515/9783110900118 schema:sameAs https://app.dimensions.ai/details/publication/pub.1096911628
84 rdf:type schema:CreativeWork
85 https://doi.org/10.1515/9783110944822 schema:sameAs https://app.dimensions.ai/details/publication/pub.1048256969
86 rdf:type schema:CreativeWork
87 https://doi.org/10.1515/jip-2012-0039 schema:sameAs https://app.dimensions.ai/details/publication/pub.1003746027
88 rdf:type schema:CreativeWork
89 https://www.grid.ac/institutes/grid.412761.7 schema:alternateName Ural Federal University
90 schema:name Krasovskii Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences, 620990, Yekaterinburg, Russia
91 Ural Federal University, 620000, Yekaterinburg, Russia
92 rdf:type schema:Organization
93 https://www.grid.ac/institutes/grid.426536.0 schema:alternateName Ural Branch of the Russian Academy of Sciences
94 schema:name Krasovskii Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences, 620990, Yekaterinburg, Russia
95 rdf:type schema:Organization
 




Preview window. Press ESC to close (or click here)


...