• Title/Summary/Keyword: 근사화

Search Result 1,196, Processing Time 0.029 seconds

A New Hierarchical Representation Method for Planar Shape (평면 형상에 대한 새로운 계층적 표현 방법)

  • 허봉식;김민환
    • Proceedings of the Korea Multimedia Society Conference
    • /
    • 2001.06a
    • /
    • pp.212-215
    • /
    • 2001
  • 본 논문에서는 평면 형상에 대한 새로운 계층적 표현 방법을 소개하였다. 제안한 방법에서는 근사화 과정의 근사화 오차(approximation error)를 근사화 순서와 정도를 결정하는 중요한 척도로 활용하였으며, 제안한 오차 조절 알고리즘을 통해 보다 자연스러운 근사화 표현이 가능하도록 하였다. 그리고 최소 경계 사각형(MBR: Minimum Bounding Rectangle)을 단순 확장한 최소 경계 팔각형(MBO: Minimum Bounding Octangle)을 지역화에 응용하였으며, 이는 다른 지역화 방법들과 비교하였을 때 상대적으로 더 효율적인 방법임을 확인할 수 있었다.

  • PDF

Design Optimization of an Offshore Structure based on Approximation Techniques (근사화 기법 기반 해양구조물의 설계 최적화)

  • Shim, Chun-Sik;Song, Chang-Yong
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 2011.04a
    • /
    • pp.689-692
    • /
    • 2011
  • 본 논문에서는 해양작업 상태의 하중조건을 고려한 부유식 원유생산 저장 하역 장치에 설치된 라이져 보강구조의 강도설계에 관련하여 다양한 근사화 기법 기반 설계 최적화 및 그 성능을 비교하고자 한다. 설계 최적화 문제는 하중조건별 구조강도의 제한조건 하에서 중량을 최소화하여 설계변수인 구조 부재치수가 결정되도록 정식화 된다. 비교 연구를 위해 사용된 근사화 기법은 반응표면법 기반 순차적 근사최적화(RBSAO), 크리깅 기반 순차적 근사최적화(KBSAO), 그리고 개선된 이동최소자승법(MLSM) 기반 근사최적화 기법인 CF-MLSM와 Post-MLSM이다. 본 연구에 적용한 MLSM 기반 근사최적화 기법들은 제한조건의 가용성을 보장할 수 있도록 새롭게 개발되었다. 다양한 근사화 모델 기반 설계 최적화 기법에 의한 결과는 설계 해의 개선 및 수렴속도 등의 수치적 성능을 기준으로 실제 비근사 설계최적화 결과와 비교검토 하였다.

  • PDF

Interpolation-based Precoding Approximation Algorithm for Low Complexity in Multiuser MIMO-OFDM Systems (다중 사용자 MIMO-OFDM 시스템에서 계산양 감소를 위한 선형 보간법 기반 프리코딩 근사화 기법)

  • Lim, Dong-Ho;Kim, Bong-Seok;Choi, Kwon-Hue
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.11A
    • /
    • pp.1027-1037
    • /
    • 2010
  • In this paper, we propose the linear interpolation-based BD (Block Diagonalization) precoding approximation algorithm for low complexity in downlink multiuser MIMO-OFDM (Multiple-input Multiple-output Orthogonal Frequency Division Multiplexing) systems. In the case of applying the general BD precoding algorithm to multiuser MIMO-OFDM systems, the computational complexity increases in proportional to the number of subcarriers. The proposed interpolation-based BD precoding approximation algorithm can be achieved similar SER performance with general BD algorithm and can decrease the computational complexity. It is proved that proposed algorithm can achieve the significantly decreased computational complexity by computer simulation.

Circle Detection and Its Approximation for Fiber Optic Interconnecting Devices (광 섬유 연결 장치 응용을 위한 원 검출 및 근사화 방법)

  • Lee, Beom-Yong;Kim, Jin-Soo
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2014.06a
    • /
    • pp.36-37
    • /
    • 2014
  • 기존에 영상 내에 원형 검출 방법으로 가장 널리 사용되는 방법은 허프 변환에 기초한다. 허프 변환은 해석적 곡선의 각 점을 원의 중심 좌표와 반지름으로 매핑 시키는 과정을 포함한다. 이러한 과정은 실행시간을 매우 많이 필요로 하고 또한 응용에 따라서 최적인 원 근사화 방법을 찾는데 문제점을 야기하기도 한다. 본 논문에서는 원형 모양인 광 연결 소자 장치로 제한된 응용환경에 대해 원 검출을 빠른 속도로 탐색하는 방법과 최적인 원 근사화 방법을 제안한다. 제안한 방법은 에지 검출과 검출된 에지를 이용한 중심좌표 및 반지름 탐색 그리고 최적화된 원 근사화 방법으로 구성된다. 모의실험을 통하여 제안한 방법은 기존의 오픈라이브러리로 제공되는 OpenCV의 허프 변환에 의한 방법에 비해 원 검출 및 근사화 방법에 있어 성능을 개선할 수 있음을 보인다.

  • PDF

Function Approximation Using an Enhanced Two-Point Diagonal Quadratic Approximation (개선된 이점 대각 이차 근사화를 이용한 함수 근사화)

  • Kim, Jong-Rip;Kang, Woo-Jin;Choi, Dong-Hoon
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.28 no.4
    • /
    • pp.475-480
    • /
    • 2004
  • Function approximation is one of the most important and active research fields in design optimization. Accurate function approximations can reduce the repetitive computational effort fur system analysis. So this study presents an enhanced two-point diagonal quadratic approximation method. The proposed method is based on the Two-point Diagonal Quadratic Approximation method. But unlike TDQA, the suggested method has two quadratic terms, the diagonal term and the correction term. Therefore this method overcomes the disadvantage of TDQA when the derivatives of two design points are same signed values. And in the proposed method, both the approximate function and derivative values at two design points are equal to the exact counterparts whether the signs of derivatives at two design points are the same or not. Several numerical examples are presented to show the merits of the proposed method compared to the other forms used in the literature.

High Compression Image Coding with BTC Parameters (BTC 파라메타를 이용한 고압축 영상부호화)

  • Shim, Young-Serk;Lee, Hark-Jun
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.26 no.2
    • /
    • pp.140-146
    • /
    • 1989
  • An efficient quantization and encoding of BTC (Block Truncation Coding) parameters {($Y_{\alpha},\;Y_{\beta}),\;P_{{\beta}/{\beta}}$} are investigated, In our algorithm 4${\times}$4 blocks are classified into flat or edge block. While edge block is represented by two approximation level $Y_{\alpha},\;Y_{\beta}$ with label plane $P_{{\beta}/{\beta}}$, flat block is represented by single approximation level Y. The approximation levels Y, $Y_{\alpha}$ and $Y_{\beta}$ are encoded by predictive quatization specially designed, and the label plane $P_{{\beta}/{\beta}}$ is tried to be encoded using stored 32 reference plantes. The performance of the proposed scheme has appeared comparable to much more complex transform coding in terms of SNR, although it requires more study on the representation of small slope in background.

  • PDF

MBO-Tree: A Hierarchical Representation Scheme for Shapes with Natural Approximation and Effective Localization (MBO-Tree: 형상의 자연스러운 근사화와 효과적인 지역화를 지원하는 계층적 표현 방법)

  • 허봉식;김동규;김민환
    • Journal of Korea Multimedia Society
    • /
    • v.5 no.1
    • /
    • pp.18-27
    • /
    • 2002
  • A hierarchical representation scheme for planar curves, MBO-tree, is proposed in this paper, which provides natural approximation and efficient localization. MBO-tree is based on the Douglas-Peucker algorithm (iterative end-point fit algorithm), but approximation errors that are stored with corresponding points in MBO-tree nodes and are used for abstraction measures are adjusted by force to eliminate unnatural approximation. The error adjusting is just making the approximation error of a node in a MBO-tree to be less than or equal to that of its parent. In point of localization, the bounding area of a curve is represented with a minimum bounding octangle (MBO), which can enclose the curve more compactly compared with those of other hierarchical schemes, such as the strip tree, the arc tree and the HAL tree. The MBO satisfies the hierarchical inclusion property that is useful for hierarchical geometrical operations, such as the point-inclusion test and the polygon intersection test. Through several experiments, we found that the proposed scheme was able to approximate more naturally and to localize more effectively.

  • PDF

The 3-D Surface Segmentation Algorithm using Curvature Approximation (곡률 근사화를 이용한 3차원 표면 분할 알고리즘)

  • 이재출;남기곤;주재흠
    • Proceedings of the Korea Institute of Convergence Signal Processing
    • /
    • 2000.12a
    • /
    • pp.101-104
    • /
    • 2000
  • 본 논문에서는 곡률 근사화를 이용한 3차원 영상의 표면 분할 알고리즘을 제안한다. 제안한 알고리즘은 기하학적인 접근방법으로 곡률 근사화 이용한 간략화 된 처리 과정의 적용과 곡률의 불연속 정도를 결정하는데 보다 용이한 방법을 제시한다. 이러한 효율적인 에지 검출을 기반으로 여러 가지 3차원 영상의 표면 분할 실험을 통하여 제안한 방법의 성능이 기존의 방법보다 우수함을 확인하였다.

  • PDF

Distribution Approximation of the Two Dimensional Discrete Cosine Transform Coefficients of Image (영상신호 2차원 코사인 변환계수의 분포근사화)

  • 심영석
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.10 no.3
    • /
    • pp.130-134
    • /
    • 1985
  • In two-dimensional discrete cosine transform(DCT) coding, the measurements of the distributions of the transform coefficients are important because a better approximation yields a smaller mean square distorition. This paper presents the results of distribution tests which indicate that the statistics of the AC coefficients are well approximated to a generalized Gaussian distribution whose shape parameter is 0.6. Furthermore, from a simulation of the DCT coding, it was shown that the above approximation yields a higher experimental SNR and a better agreement between theory and simulation than the Gaussian or Laplacian assumptions.

  • PDF

A Study of Approximation Method of Spatial Objects (공간 객체의 근사화 방법 연구)

  • Kim, Yong-Hyeon;Lee, Hyeong-Su;Lee, Seong-Su;Kim, Eung-Mo
    • The Transactions of the Korea Information Processing Society
    • /
    • v.3 no.7
    • /
    • pp.1753-1762
    • /
    • 1996
  • Since the number of spatial objects go easily into millions, they are stored on a secondary storage. In order to speed up accessing the geometric objects, we investigate spatial database system. The spatial objects are organized and accessed by spatial access methods(SAMs). But, SAMs are not able to organize polygons directly The most popular approach for handing polygon in SAMs is to use MBR apporximaotion as a geometric key. MBR provides a fast but inaccurate answers to approximation-based query processing. The performance of approximation-based spatial query processing depends on which type of approximation is chosen for the spatial objects. A suitable approximation is crucial for reducing the size of the candidate set. The better the approxmation quality, the fewer accesses to the exact object are necessary. In this paper, I proposed a new multicontainer approximation named Slice decomposition. The performance of proposed method is compared with other method.

  • PDF