• 제목/요약/키워드: Computation reduction

검색결과 443건 처리시간 0.025초

Fast Super-Resolution Algorithm Based on Dictionary Size Reduction Using k-Means Clustering

  • Jeong, Shin-Cheol;Song, Byung-Cheol
    • ETRI Journal
    • /
    • 제32권4호
    • /
    • pp.596-602
    • /
    • 2010
  • This paper proposes a computationally efficient learning-based super-resolution algorithm using k-means clustering. Conventional learning-based super-resolution requires a huge dictionary for reliable performance, which brings about a tremendous memory cost as well as a burdensome matching computation. In order to overcome this problem, the proposed algorithm significantly reduces the size of the trained dictionary by properly clustering similar patches at the learning phase. Experimental results show that the proposed algorithm provides superior visual quality to the conventional algorithms, while needing much less computational complexity.

3차원 지형정보를 이용한 지형영상의 정합기법 (Terrain Matching Technique Using 3-D Terrain Maps)

  • 김준식;강민석;박래홍;이쾌희
    • 대한원격탐사학회지
    • /
    • 제7권1호
    • /
    • pp.13-27
    • /
    • 1991
  • DEM(digital elevation map) is a very useful information in various applications. In this paper, we have studied on the terrain matching algorithm using the DEM, which was proposed by Rodriguez and Aggarwal(1990) for an aircraft navigation system. We evaluated its performance using syntactic images. Cliff maps and critical points are used for the reduction of computation time and information size to be processed. The computer simulation shows that though the computational complexity is high, the technique is efficient even to noisy images.

Parallel Synthesis Algorithm for Layer-based Computer-generated Holograms Using Sparse-field Localization

  • Park, Jongha;Hahn, Joonku;Kim, Hwi
    • Current Optics and Photonics
    • /
    • 제5권6호
    • /
    • pp.672-679
    • /
    • 2021
  • We propose a high-speed layer-based algorithm for synthesizing computer-generated holograms (CGHs), featuring sparsity-based image segmentation and computational parallelism. The sparsity-based image segmentation of layer-based three-dimensional scenes leads to considerable improvement in the efficiency of CGH computation. The efficiency enhancement of the proposed algorithm is ascribed to the field localization of the fast Fourier transform (FFT), and the consequent reduction of FFT computational complexity.

Characterization of Spherical Particles by Light Scattering

  • Sangwook Park;Jungmoon Sung;Taihyun Chang
    • Bulletin of the Korean Chemical Society
    • /
    • 제12권3호
    • /
    • pp.322-328
    • /
    • 1991
  • We have studied a characterization method of accurate size of spherical particles by fitting experimental light scattering profile to the rigorous theoretical scattering function. An efficient software has been developed for computation of the theoretical scattering function and regression analysis. A light scattering instrument has been built and the necessary data acquisition and analysis are carried out by use of a personal computer with an emphasis on the reduction of analysis and time aiming that this study will be extended toward a development of a practical particle sizing apparatus. The performance of the instrument and the software has been evaluated with latex spheres and found to be satisfactory.

전자기력을 이용한 유동제어에 관한 수치해석적 연구 (Numerical Investigation of Cross- Flow of a Circular Cylinder Under an Electromagnetic Force)

  • 김성재;이정묵
    • 대한기계학회:학술대회논문집
    • /
    • 대한기계학회 2001년도 춘계학술대회논문집E
    • /
    • pp.148-153
    • /
    • 2001
  • A computational investigation of the effect of the electromagnetic force(or Lorentz force) on the flow behavior around a circular cylinder, a typical model of bluff bodies, is conducted. Two-dimensional unsteady flow computation for $Re=10^2$ is carried out using a numerical method of finite difference approximation in a curvilinear body-fitted coordinate system by solving the momentum equations including the Lorentz force as a body force. The effect of the spatial variations of the Lorentz forcing region and forcing direction along the cylinder circumference is investigated. The numerical results show that the Lorentz force can effectively suppress the flow separation and oscillation of the lift force of the circular cylinder cross-flow, leading to the reduction of the drag.

  • PDF

면적우량환산계수의 산정과 그 지역적 변화 (Computation of Areal Reduction Factor and Its Regional Variability)

  • 김원;윤강훈
    • 물과 미래
    • /
    • 제25권3호
    • /
    • pp.79-86
    • /
    • 1992
  • ARF(Areal Reduction Factor) have been developed and used to convert point I-D-F to areal I-D-F in many countries. In Korea, through ARF was calculated in Han river basin by several researchers, it has limit to apply to other regions \ulcorner 새 low density of rainfall gauge station and shortage of data. In this study ARF has developed in areas of high density of rainfall gauge station, Pyungchang river(han river), Wi stream(nakdong river), and Bochung stream(Guem river) basin by fixed-area method. And coefficient of variation of annual mean precipitation was presented to use ARF in othere areas and its applicability was analyzed.

  • PDF

항공기 형상 최적설계 프로세스를 위한 표면 격자 자동 생성 프로그램의 개발 (DEVELOPMENT OF AUTOMATIC PANEL GENERATION PROGRAM FOR AIRCRAFT SHAPE OPTIMIZATION PROCESS)

  • 김경남;김병수
    • 한국전산유체공학회지
    • /
    • 제20권3호
    • /
    • pp.41-46
    • /
    • 2015
  • This paper describes study results on the development of an automatic program for generating surface-panel grid for the aircraft optimal design. The aerodynamic analysis is combined into a PIDO tool in conjunction with a number of programs in order to integrate processes for the optimal design. Due to design optimization's iterative feature, it may require lots of time and cost. To relieve this problem, cost-reduction of computation time for aerodynamic analysis is pursued by using the Panel-method, and reduction of grid generation time by automating surface panelling.

Resistant Singular Value Decomposition and Its Statistical Applications

  • Park, Yong-Seok;Huh, Myung-Hoe
    • Journal of the Korean Statistical Society
    • /
    • 제25권1호
    • /
    • pp.49-66
    • /
    • 1996
  • The singular value decomposition is one of the most useful methods in the area of matrix computation. It gives dimension reduction which is the centeral idea in many multivariate analyses. But this method is not resistant, i.e., it is very sensitive to small changes in the input data. In this article, we derive the resistant version of singular value decomposition for principal component analysis. And we give its statistical applications to biplot which is similar to principal component analysis in aspects of the dimension reduction of an n x p data matrix. Therefore, we derive the resistant principal component analysis and biplot based on the resistant singular value decomposition. They provide graphical multivariate data analyses relatively little influenced by outlying observations.

  • PDF

Computation of Areal Reduction Factor and its Regional Variability

  • Kim, Won;Yoon, Kang-Hoon
    • Korean Journal of Hydrosciences
    • /
    • 제4권
    • /
    • pp.105-116
    • /
    • 1993
  • Areal Reduction Factor(ARF) has been developed and used to convert point Rainfall intensity-Duration-Frequency(I-D-F) to areal I-D-F in many countries. In Korea, though ARF was estimated in Han river basin by several researchers, it has some limitations to apply to other regions due to low denisity of rainfall gauging station and shortage of data. In this study ARF has been developed in area of relatively high density of rainfall gauging station, i.e., Pyungchang river(Han river), Wi stream(Nakdong river), and Bochung stream(Guem river) basin by geographically fixed-area method. And coefficient of variation of mean annual precipitation was presented to use ARE in other areas and its applicability was analyzed.

  • PDF

An improved algorithm for the exchange heuristic for solving multi-project multi-resource constrained scheduling with variable-intensity activities

  • Yu, Jai-Keon;Kim, Won-Kyung
    • 한국경영과학회:학술대회논문집
    • /
    • 대한산업공학회/한국경영과학회 1993년도 춘계공동학술대회 발표논문 및 초록집; 계명대학교, 대구; 30 Apr.-1 May 1993
    • /
    • pp.343-352
    • /
    • 1993
  • In this study, a modified algorithm for the exchange heuristic is developed and applied to a resource-constrained scheduling problem. The problem involves multiple projects and multiple resource categories and allows flexible resource allocation to each activity. The objective is to minimize the maximum completion time. The exchange heuristkc is a multiple pass algorithm which makes improvements upon a given initial feasible schedule. Four different modified algorithms are proposed. The original algorithm and the new algorithms were compared through an experimental investigation. All the proposed algorithms reduce the maximum completion time much more effectively than the original algorithm. Especially, one of four proposed algorithms obviously outperforms the other three algorithms. The algorithm of the best performance produces significantly shorter schedules than the original algorithm, though it requires up to three times more computation time. However, in most situations, a reduction in schedule length means a significant reduction in the total cost.

  • PDF