• Title/Summary/Keyword: convolution method

Search Result 592, Processing Time 0.03 seconds

Accuracy Analysis and Comparison in Limited CNN using RGB-csb (RGB-csb를 활용한 제한된 CNN에서의 정확도 분석 및 비교)

  • Kong, Jun-Bea;Jang, Min-Seok;Nam, Kwang-Woo;Lee, Yon-Sik
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.15 no.1
    • /
    • pp.133-138
    • /
    • 2020
  • This paper introduces a method for improving accuracy using the first convolution layer, which is not used in most modified CNN(: Convolution Neural Networks). In CNN, such as GoogLeNet and DenseNet, the first convolution layer uses only the traditional methods(3×3 convolutional computation, batch normalization, and activation functions), replacing this with RGB-csb. In addition to the results of preceding studies that can improve accuracy by applying RGB values to feature maps, the accuracy is compared with existing CNN using a limited number of images. The method proposed in this paper shows that the smaller the number of images, the greater the learning accuracy deviation, the more unstable, but the higher the accuracy on average compared to the existing CNN. As the number of images increases, the difference in accuracy between the existing CNN and the proposed method decreases, and the proposed method does not seem to have a significant effect.

A New Overlap Save Algorithm for Fast Convolution (고속 컨벌루션을 위한 새로운 중첩보류기법)

  • Kuk, Jung-Gap;Cho, Nam-Ik
    • Journal of Broadcast Engineering
    • /
    • v.14 no.5
    • /
    • pp.543-550
    • /
    • 2009
  • The most widely used block convolution method is the overlap save algorithm (OSA), where a block of M data to be convolved with a filter is concatenated with the previous block and 2M-point FFT and multiplications are performed for this overlapped block. By discarding half of the results, we obtain linear convolution results from the circular convolution. This paper proposes a new transform which reduces the block size to only M for the block convolution. The proposed transform can be implemented as the M multiplications followed by M-point FFT Hence, existing efficient FFT libraries and hardware can be exploited for the implementation of proposed method. Since the required transform size is half that of the conventional method, the overall computational complexity is reduced. Also the reduced transform size results in the reduction of data access time and cash miss-hit ratio, and thus the overall CPU time is reduced. Experiments show that the proposed method requires less computation time than the conventional OSA.

Vehicle Detection Method Using Convolution Matching Based on 8 Oriented Color Expression (8 방향 색상 표현 기반 컨벌류션 정합(Convolution Matching)을 이용한 차량 검출기법)

  • Han, Sung-Ji;Han, Young-Joon;Hahn, Hern-Soo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.12
    • /
    • pp.63-73
    • /
    • 2009
  • This paper presents a vehicle detection method that uses convolution matching method based on a simple color information. An input image is expressed as 8 oriented color expression(Red, Green, Blue, White, Black, Cyan, Yellow, Magenta) considering an orientation of a pixel color vector. It makes the image very reliable and strong against changes of illumination condition or environment. This paper divides the vehicle detection into a hypothesis generation step and a hypothesis verification step. In the hypothesis generation step, the vehicle candidate region is found by vertical edge and shadow. In the hypothesis verification step, the convolution matching and the complexity of image edge are used to detect real vehicles. It is proved that the proposed method has the fast and high detection rate on various experiments where the illumination source and environment are changed.

Visualization of Internal Electric Field on Plasma (플라즈마 내부 전기장 가시화)

  • Shin, Han Sol;Yu, Tae Jun;Lee, Kun
    • Journal of Korea Multimedia Society
    • /
    • v.19 no.1
    • /
    • pp.80-85
    • /
    • 2016
  • It costs high in both memory usage and time consuming to sample the space to compute charge density and calculate electric field on that with large size of plasma data. In real-time and interactive application, accelerating the compute time is critical problem. In this paper, we suggest new method to visualize electric field by using convolution theorem, and the parallel computing to accelerate computing time by using GPGPU. We conduct a simulation that compare running time between the methods with convolution and without convolution. We discussed the method of visualization of multivariate data in three dimensional space using colored volume rendering and surface construction.

Free vibration analysis of composite conical shells using the discrete singular convolution algorithm

  • Civalek, Omer
    • Steel and Composite Structures
    • /
    • v.6 no.4
    • /
    • pp.353-366
    • /
    • 2006
  • The discrete singular convolution (DSC) algorithm for determining the frequencies of the free vibration of single isotropic and orthotropic laminated conical shells is developed by using a numerical solution of the governing differential equations of motion based on Love's first approximation thin shell theory. By applying the discrete singular convolution method, the free vibration equations of motion of the composite laminated conical shell are transformed to a set of algebraic equations. Convergence and comparison studies are carried out to check the validity and accuracy of the DSC method. The obtained results are in excellent agreement with those in the literature.

A Reconsideration of the Causality Requirement in Proving the z-Transform of a Discrete Convolution Sum (이산 Convolution 적산의 z변환의 증명을 위한 인과성의 필요에 대한 재고)

  • Chung Tae-Sang;Lee Jae Seok
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.52 no.1
    • /
    • pp.51-54
    • /
    • 2003
  • The z-transform method is a basic mathematical tool in analyzing and designing digital signal processing systems for discrete input and output signals. There are may cases where the output signal is in the form of a discrete convolution sum of an input function and a designed digital processing algorithm function. It is well known that the z-transform of the convolution sum becomes the product of the two z-transforms of the input function and the digital processing function, whose proofs require the causality of the digital signal processing function in the almost all the available references. However, not all of the convolution sum functions are based on the causality. Many digital signal processing systems such as image processing system may depend not on the time information but on the spatial information, which has nothing to do with causality requirement. Thus, the application of the causality-based z-transform theorem on the convolution sum cannot be used without difficulty in this case. This paper proves the z-transform theorem on the discrete convolution sum without causality requirement, and make it possible for the theorem to be used in analysis and desing for any cases.

Development of a dose estimation code for BNCT with GPU accelerated Monte Carlo and collapsed cone Convolution method

  • Lee, Chang-Min;Lee Hee-Seock
    • Nuclear Engineering and Technology
    • /
    • v.54 no.5
    • /
    • pp.1769-1780
    • /
    • 2022
  • A new method of dose calculation algorithm, called GPU-accelerated Monte Carlo and collapsed cone Convolution (GMCC) was developed to improve the calculation speed of BNCT treatment planning system. The GPU-accelerated Monte Carlo routine in GMCC is used to simulate the neutron transport over whole energy range and the Collapsed Cone Convolution method is to calculate the gamma dose. Other dose components due to alpha particles and protons, are calculated using the calculated neutron flux and reaction data. The mathematical principle and the algorithm architecture are introduced. The accuracy and performance of the GMCC were verified by comparing with the FLUKA results. A water phantom and a head CT voxel model were simulated. The neutron flux and the absorbed dose obtained by the GMCC were consistent well with the FLUKA results. In the case of head CT voxel model, the mean absolute percentage error for the neutron flux and the absorbed dose were 3.98% and 3.91%, respectively. The calculation speed of the absorbed dose by the GMCC was 56 times faster than the FLUKA code. It was verified that the GMCC could be a good candidate tool instead of the Monte Carlo method in the BNCT dose calculations.

An Adaptive Cubic Interpolation considering Neighbor Pixel Values (이웃 픽셀 값을 고려한 적응적 3차 보간법)

  • Lee, A-Yeong;Kim, Hee-Chang;Jeong, Je-Chang
    • Journal of Broadcast Engineering
    • /
    • v.15 no.3
    • /
    • pp.362-367
    • /
    • 2010
  • As the resolution of the image display devices has been diversified, the image interpolation methods has played a more important role. The cubic convolution interpolation method has been widely used because it is simple but it has no limitation of using and a good performance. This paper suggests an adaptive method to the cubic convolution interpolation. Considering the difference of the neighbored pixels values to a prediction pixel, a parameter value in the cubic convolution interpolation kernel is chosen.

Fingertip Detection through Atrous Convolution and Grad-CAM (Atrous Convolution과 Grad-CAM을 통한 손 끝 탐지)

  • Noh, Dae-Cheol;Kim, Tae-Young
    • Journal of the Korea Computer Graphics Society
    • /
    • v.25 no.5
    • /
    • pp.11-20
    • /
    • 2019
  • With the development of deep learning technology, research is being actively carried out on user-friendly interfaces that are suitable for use in virtual reality or augmented reality applications. To support the interface using the user's hands, this paper proposes a deep learning-based fingertip detection method to enable the tracking of fingertip coordinates to select virtual objects, or to write or draw in the air. After cutting the approximate part of the corresponding fingertip object from the input image with the Grad-CAM, and perform the convolution neural network with Atrous Convolution for the cut image to detect fingertip location. This method is simpler and easier to implement than existing object detection algorithms without requiring a pre-processing for annotating objects. To verify this method we implemented an air writing application and showed that the recognition rate of 81% and the speed of 76 ms were able to write smoothly without delay in the air, making it possible to utilize the application in real time.

Application of a Convolution Method for the Fast Prediction of Wind-Induced Surface Current in the Yellow Sea and the East China Sea (표층해류 신속예측을 위한 회선적분법의 적용)

  • 강관수;정경태
    • Journal of Korean Society of Coastal and Ocean Engineers
    • /
    • v.7 no.3
    • /
    • pp.265-276
    • /
    • 1995
  • In this Paper, the Performance of the convolution method has been investigated as an effort to develop a simple system of predicting wind-driven surface current on a real time basis. In this approach wind stress is assumed to be spatially uniform and the effect of atmospheric pressure is neglected. The discrete convolution weights are determined in advance at each point using a linear three-dimensional Galerkin model with linear shape functions(Galerkin-FEM model). Four directions of wind stress(e.g. NE, SW, NW, SE) with unit magnitude are imposed in the model calculation for the construction of data base for convolution weights. Given the time history of wind stress, it is then possible to predict with-driven currents promptly using the convolution product of finite length. An unsteady wind stress of arbitrary form can be approximated by a series of wind pulses with magnitude of 6 hour averaged value. A total of 12 pulses are involved in the convolution product To examine the accuracy of the convolution method a series of numerical experiments has been carried out in the idealized basin representing the scale of the Yellow Sea and the East China Sea. The wind stress imposed varies sinusoidally in time. It was found that the predicted surface currents and elevation fields were in good agreement with the results computed by the direct integration of the Galerkin model. A model with grid 1/8$^{\circ}$ in latitude, l/6$^{\circ}$ in longitude was established which covers the entire region of the Yellow Sea and the East China Sea. The numerical prediction in terms of the convolution product has been carried out with particular attention on the formation of upwind flow in the middle of the Yellow Sea by northerly wind.

  • PDF