[go: up one dir, main page]

Salehian et al., 2018 - Google Patents

Dynamic programming-based dense stereo matching improvement using an efficient search space reduction technique

Salehian et al., 2018

Document ID
10984564865557812845
Author
Salehian B
Fotouhi A
Raie A
Publication year
Publication venue
Optik

External Links

Snippet

Two most important evaluation parameters of any stereo matching algorithm are the execution speed and the accuracy of generated results. Commonly, reported real-time works provide fast depth calculation based on highly specialized hardware. Thus, algorithmic …
Continue reading at www.sciencedirect.com (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T2207/00—Indexing scheme for image analysis or image enhancement
    • G06T2207/20—Special algorithmic details
    • G06T2207/20112—Image segmentation details
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T2207/00—Indexing scheme for image analysis or image enhancement
    • G06T2207/10—Image acquisition modality
    • G06T2207/10024—Color image
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T7/00—Image analysis
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T2207/00—Indexing scheme for image analysis or image enhancement
    • G06T2207/30—Subject of image; Context of image processing
    • G06T2207/30004—Biomedical image processing
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T17/00—Three dimensional [3D] modelling, e.g. data description of 3D objects
    • G06T17/05—Geographic models
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T11/00—2D [Two Dimensional] image generation
    • G06T11/40—Filling a planar surface by adding surface attributes, e.g. colour or texture
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06K—RECOGNITION OF DATA; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
    • G06K9/00—Methods or arrangements for reading or recognising printed or written characters or for recognising patterns, e.g. fingerprints
    • G06K9/36—Image preprocessing, i.e. processing the image information without deciding about the identity of the image
    • G06K9/46—Extraction of features or characteristics of the image
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06K—RECOGNITION OF DATA; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
    • G06K9/00—Methods or arrangements for reading or recognising printed or written characters or for recognising patterns, e.g. fingerprints
    • G06K9/20—Image acquisition
    • G06K9/34—Segmentation of touching or overlapping patterns in the image field
    • G06K9/342—Cutting or merging image elements, e.g. region growing, watershed, clustering-based techniques
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T15/00—3D [Three Dimensional] image rendering
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T5/00—Image enhancement or restoration, e.g. from bit-mapped to bit-mapped creating a similar image

Similar Documents

Publication Publication Date Title
Yang Fast stereo matching using reliability-based dynamic programming and consistency constraints
Zou et al. Manhattan room layout reconstruction from a single 360∘ image: a comparative study of state-of-the-art methods
Salehian et al. Dynamic programming-based dense stereo matching improvement using an efficient search space reduction technique
Mei et al. On building an accurate stereo matching system on graphics hardware
US7724256B2 (en) Fast graph cuts: a weak shape assumption provides a fast exact method for graph cuts segmentation
Shi et al. High-accuracy stereo matching based on adaptive ground control points
Mascaro et al. Diffuser: Multi-view 2d-to-3d label diffusion for semantic scene segmentation
WO2013178725A1 (en) Segmentation of a foreground object in a 3d scene
Agrawal et al. Window-based, discontinuity preserving stereo
Holzmann et al. Semantically aware urban 3d reconstruction with plane-based regularization
Gupta et al. Window‐based approach for fast stereo correspondence
Bebeselea-Sterp et al. A comparative study of stereovision algorithms
Xu et al. Learning inverse depth regression for pixelwise visibility-aware multi-view stereo networks
Yang Local smoothness enforced cost volume regularization for fast stereo correspondence
Wang et al. Effective stereo matching using reliable points based graph cut
Ye et al. Order-based disparity refinement including occlusion handling for stereo matching
Ling et al. Flowacc: Real-time high-accuracy dnn-based optical flow accelerator in fpga
Gong et al. Near-real-time stereo matching with slanted surface modeling and sub-pixel accuracy
Li et al. Using temporal correlation to optimize stereo matching in video sequences
Li et al. Texture category-based matching cost and adaptive support window for local stereo matching
Hu et al. Binary adaptive semi-global matching based on image edges
Frisky et al. Investigation of single image depth prediction under different lighting conditions: A case study of ancient roman coins
CN114913472B (en) Infrared video pedestrian significance detection method combining graph learning and probability propagation
Gupta et al. Stereo correspondence using efficient hierarchical belief propagation
Helala et al. Accelerating cost volume filtering using salient subvolumes and robust occlusion handling