Complexity results for reconstructing binary images with disjoint components from horizontal and vertical projections (Q387855): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: DISCRETE TOMOGRAPHIC RECONSTRUCTION OF BINARY IMAGES WITH DISJOINT COMPONENTS USING SHAPE INFORMATION / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstruction of Canonical hv-Convex Discrete Sets from Horizontal and Vertical Projections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstruction of 8-connected but not 4-connected \(hv\)-convex discrete sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison of algorithms for reconstructing \(hv\)-convex discrete sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstructing convex polyominoes from horizontal and vertical projections / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the reconstruction of binary and permutation matrices under (binary) tomographic constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstruction of 4- and 8-connected convex discrete sets from row and column projections / rank
 
Normal rank
Property / cites work
 
Property / cites work: The reconstruction of binary patterns from their projections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstructing \(hv\)-convex polyominoes from orthogonal projections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyominoes defined by two vectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Checker Boards and Polyominoes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete tomography. Foundations, algorithms, and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in discrete tomography and its applications. Some papers based on the presentations at the workshop on discrete tomography and its applications, New York, NY, USA, June 13--15, 2005. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstruction of convex 2D discrete sets in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: The reconstruction of polyominoes from their orthogonal projections / rank
 
Normal rank

Latest revision as of 03:41, 7 July 2024

scientific article
Language Label Description Also known as
English
Complexity results for reconstructing binary images with disjoint components from horizontal and vertical projections
scientific article

    Statements

    Complexity results for reconstructing binary images with disjoint components from horizontal and vertical projections (English)
    0 references
    0 references
    17 December 2013
    0 references
    discrete tomography
    0 references
    disjoint components
    0 references
    hv-convexity
    0 references
    permutation matrix
    0 references
    polynomial-time reconstruction
    0 references
    parameterized complexity
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references