The search functionality is under construction.
The search functionality is under construction.

Keyword Search Result

[Keyword] symmetric convolution(2hit)

1-2hit
  • Asymmetric Learning for Stereo Matching Cost Computation

    Zhongjian MA  Dongzhen HUANG  Baoqing LI  Xiaobing YUAN  

     
    PAPER-Artificial Intelligence, Data Mining

      Pubricized:
    2020/07/13
      Vol:
    E103-D No:10
      Page(s):
    2162-2167

    Current stereo matching methods benefit a lot from the precise stereo estimation with Convolutional Neural Networks (CNNs). Nevertheless, patch-based siamese networks rely on the implicit assumption of constant depth within a window, which does not hold for slanted surfaces. Existing methods for handling slanted patches focus on post-processing. In contrast, we propose a novel module for matching cost networks to overcome this bias. Slanted objects appear horizontally stretched between stereo pairs, suggesting that the feature extraction in the horizontal direction should be different from that in the vertical direction. To tackle this distortion, we utilize asymmetric convolutions in our proposed module. Experimental results show that the proposed module in matching cost networks can achieve higher accuracy with fewer parameters compared to conventional methods.

  • A Computing Method for Linear Convolution and Linear Correlation in the DCT Domain

    Izumi ITO   

     
    PAPER-Digital Signal Processing

      Vol:
    E96-A No:7
      Page(s):
    1518-1525

    We propose a computing method for linear convolution and linear correlation between sequences using discrete cosine transform (DCT). Zero-padding is considered as well as linear convolution using discrete Fourier transform (DFT). Analyzing the circular convolution between symmetrically extended sequences, we derive the condition for zero-padding before and after the sequences. The proposed method can calculate linear convolution for any filter and also calculate linear correlation without reversing one of the input sequences. The computational complexity of the proposed method is lower than that of linear convolution using DFT.