Robustness verification of semantic segmentation neural networks using relaxed reachability (Q832180): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Improved geometric path enumeration for verifying ReLU neural networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal Verification of Piece-Wise Linear Feed-Forward Neural Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Safety Verification and Robustness Analysis of Neural Networks via Quadratic Constraints and Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: DeepSafe: a data-driven approach for assessing robustness of neural networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Safety verification of deep neural networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verisig / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reluplex: an efficient SMT solver for verifying deep neural networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal specification for deep neural networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer vision. Algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification of deep convolutional neural networks using ImageStars / rank
 
Normal rank
Property / cites work
 
Property / cites work: A game-based approximate verification of deep neural networks with provable guarantees / rank
 
Normal rank

Latest revision as of 10:48, 28 July 2024

scientific article
Language Label Description Also known as
English
Robustness verification of semantic segmentation neural networks using relaxed reachability
scientific article

    Statements

    Robustness verification of semantic segmentation neural networks using relaxed reachability (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    25 March 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers