• Title/Summary/Keyword: 경계구

Search Result 654, Processing Time 0.032 seconds

A Mixed Variational Principle of Fully Anisotropic Linear Elasticity (이방성탄성문제의 혼합형변분원리)

  • 홍순조
    • Computational Structural Engineering
    • /
    • v.4 no.2
    • /
    • pp.87-94
    • /
    • 1991
  • In this paper, a mixed variational principle applicable to the linear elasticity of inhomogeneous anisotropic materials is presented. For derivation of the general variational principle, a systematic procedure for the variational formulation of linear coupled boundary value problems developed by Sandhu et al. is employed. Consistency condition of the field operators with the boundary operators results in explicit inclusion of boundary conditions in the governing functional. Extensions of admissible state function spaces and specialization to a certain relation in the general governing functional lead to the desired mixed variational principle. In the physical sense, the present variational principle is analogous to the Reissner's recent formulation obtained by applying Lagrange multiplier technique followed by partial Legendre transform to the classical minimum potential energy principle. However, the present one is more advantageous for the application to the general anisotropic materials since Reissner's principle contains an implicit function which is not easily converted to an explicit form.

  • PDF

A blocking artifacts reduction algorithm using block boundary pixel difference characteristics (블록 경계 화소차값의 특성을 이용한 블록화 현상 제거 알고리즘)

  • 채병조;손채봉;오승준
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.23 no.5
    • /
    • pp.1299-1309
    • /
    • 1998
  • In this paper, we propose a new approach for reducing the blocking artifact that is one of drawbacks of the block-based Discrete Cosine Transform (DCT) without introducing additional information or significant blurring. We modify the inter-block discontinuity minimization technique to preserve edges within a block as well as to reduce visible block boundaries. The homogeneity of each block is decided by the threshold value reated to Q-factor, which is included in a JPEG as well as MPEG streams. The quantization error is estimated by minimizing the discontinuity, which is weighted in proportion to block discontinuity and added to each pixel in the block to compensate block artifacts. The proposed algorithm reconstructs images which have less noticeable block boundaries from a subjective viewpoit without anyconstraints.

  • PDF

Study on the estimation and representation of disparity map for stereo-based video compression/transmission systems (스테레오 기반 비디오 압축/전송 시스템을 위한 시차영상 추정 및 표현에 관한 연구)

  • Bak Sungchul;Namkung Jae-Chan
    • Journal of Broadcast Engineering
    • /
    • v.10 no.4 s.29
    • /
    • pp.576-586
    • /
    • 2005
  • This paper presents a new estimation and representation of a disparity map for stereo-based video communication systems. Several pixel-based and block-based algorithms have been proposed to estimate the disparity map. While the pixel-based algorithms can achieve high accuracy in computing the disparity map, they require a lost of bits to represent the disparity information. The bit rate can be reduced by the block-based algorithm, sacrificing the representation accuracy. In this paper, the block enclosing a distinct edge is divided into two regions and the disparity of each region is set to that of a neighboring block. The proposed algorithm employs accumulated histograms and a neural network to classify a type of a block. In this paper, we proved that the proposed algorithm is more effective than the conventional algorithms in estimating and representing disparity maps through several experiments.

FLIR and CCD Image Fusion Algorithm Based on Adaptive Weight for Target Extraction (표적 추출을 위한 적응적 가중치 기반 FLIR 및 CCD 센서 영상 융합 알고리즘)

  • Gu, Eun-Hye;Lee, Eun-Young;Kim, Se-Yun;Cho, Woon-Ho;Kim, Hee-Soo;Park, Kil-Houm
    • Journal of Korea Multimedia Society
    • /
    • v.15 no.3
    • /
    • pp.291-298
    • /
    • 2012
  • In automatic target recognition(ATR) systems, target extraction techniques are very important because ATR performance depends on segmentation result. So, this paper proposes a multi-sensor image fusion method based on adaptive weights. To incorporate the FLIR image and CCD image, we used information such as the bi-modality, distance and texture. A weight of the FLIR image is derived from the bi-modality and distance measure. For the weight of CCD image, the information that the target's texture is more uniform than the background region is used. The proposed algorithm is applied to many images and its performance is compared with the segmentation result using the single image. Experimental results show that the proposed method has the accurate extraction performance.

Dynamical Electrical Impedance Tomography Based on the Regularized Extended Kalman Filter (조정 확장 칼만 필터를 이용한 동적 전기 임피던스 단층촬영법)

  • Kim, Kyung-Youn;Kim, Bong-Seok;Kang, Suk-In;Kim, Min-Chan;Lee, Jung-Hoon;Lee, Yoon-Joon
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.38 no.5
    • /
    • pp.23-32
    • /
    • 2001
  • Electrical impedance tomography (EIT) is a relatively new imaging modality in which the resistivity (conductivity) distribution of the unknown object is estimated based on the known sets of injected currents and measured voltages on the surface of the object. In this paper, we propose a dynamical EIT reconstruction algorithm based on the regularized extended Kalman filter(EKF). The EIT inverse problem is formulated as dynamic equation which consists of the slate equation and the observation equation, and the unknown state(resistivity) is estimated recursively with the aid of the EKF. In doing so, the generalized Tikhonov regularization technique is employed in the cost functional to mitigate the ill-posedness characteristics of the inverse problem. Computer simulations for the 16-channel synthetic data are provided to illustrate the reconstruction performance of the proposed algorithm.

  • PDF

Parallel Design and Implementation of Shot Boundary Detection Algorithm (샷 경계 탐지 알고리즘의 병렬 설계와 구현)

  • Lee, Joon-Goo;Kim, SeungHyun;You, Byoung-Moon;Hwang, DooSung
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.2
    • /
    • pp.76-84
    • /
    • 2014
  • As the number of high-density videos increase, parallel processing approaches are necessary to process a large-scale of video data. When a processing method of video data requires thousands of simple operations, GPU-based parallel processing is preferred to CPU-based parallel processing by way of reducing the time and space complexities of a given computation problem. This paper studies the parallel design and implementation of a shot-boundary detection algorithm. The proposed shot-boundary detection algorithm uses pixel brightness comparisons and global histogram data among the blocks of frames, and the computation of these data is characterized with the high parallelism for the related operations. In order to maximize these operations in parallel, the computations of the pixel brightness and histogram are designed in parallel and implemented in NVIDIA GPU. The GPU-based shot detection method is tested with 10 videos from the set of videos in National Archive of Korea. In experiments, the detection rate is similar but the computation time is about 10 time faster to that of the CPU-based algorithm.

Robust Computation of Polyhedral Minkowski Sum Boundary (다면체간의 강건한 민코스키합 경계면 계산)

  • Kyung, Min-Ho;Sacks, Elisha
    • Journal of the Korea Computer Graphics Society
    • /
    • v.16 no.2
    • /
    • pp.9-17
    • /
    • 2010
  • Minkowski sum of two polyedra is an operation to compute the sum of all pairs of points contained in the polyhedra. It has been a very useful tool to solve many geometric problems arising in the areas of robotics, NC machining, solid modeling, and so on. However, very few algorithms have been proposed to compute Minkowski sum of polyhedra, because computing Minkowski sum boundaries is susceptible to roundoff errors. We propose an algorithm to robustly compute the Minkowski sum boundaries by employing the controlled linear perturbation scheme to prevent numerically ambiguous and degenerate cases from occurring. According to our experiments, our algorithm computes the Minkowski sum boundaries with the precision of $10^{-14}$ by perturbing the vertices of the input polyhedra up to $10^{-10}$.

A Numerical Analysis on the solution of Poisson Equation by Direct Method (직접법을 이용한 Poisson 방정식 수치해법에 관하여)

  • Y.S. Shin;K.P. Rhee
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.32 no.3
    • /
    • pp.62-71
    • /
    • 1995
  • In the numerical analysis of incompressible unsteady Navier-stokes equation, large time is required for solving the pressure Poisson equation of the elliptic type at each time step. In this paper, a numerical analysis by the direct method is carried out to solve the pressure Poisson equation and the computing time is analyzed as mesh size increases. The pressure Poisson equation can be transformed to the boundary value problem by the Green theorem. The computing time for the convolution type of the domain integral can be reduced by using F.F.T. and the computing time in the direct method depends entirely on obtaining the solution of the boundary value problem. The numerical analysis on the known solutions is carried out and compared for the verification of the direct method. And the numerical analysis on the body boundary and domain decomposition problem are carried out with the computing time less than O($n^{3}$) in the (n.n) mesh.

  • PDF

Characteristics of Harbor Resonance in Donghae Harbor (Part 2. Numerical Calculation) (동해항(東海港)의 부진동(副振動) 특성(特性)(2. 수치계산(數値計算)))

  • Jeong, Weon Mu;Jung, Kyung Tae;Chae, Jang Won
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.13 no.3
    • /
    • pp.185-192
    • /
    • 1993
  • A numerical model has been used for the prediction of wave agitations in a harbor which are induced by the intrusion and transformation of incident waves. Based on linear wave theory a mild-slope equation has been used. A partial absorbing boundary condition has been used on solid boundary. Functional has been derived following Chen and Mei(l974)'s technique based on Hybrid Element Method which uses finite discretisation in the inner region and analytical solution of Helmholtz equation in the outer region. Final simultaneous equation has been solved using the Gaussian Elimination Method. Helmholtz natural period and second peak period of seiche in Donghae Harbor coincide very well with the results from numerical calculation. Computed amplification factors show good agreement, especially when the reflection coefficient on solid boundary is 0.99, with those of measurements.

  • PDF

Curvature Linear Equation of a Coma Corrected Two-Mirror System with Finite Object Distance (유한 물체거리를 갖는 코마수차가 보정된 2 반사경계의 곡률선형방정식)

  • Hwang, Seok-Ju;Rim, Cheon-Seog;Jo, Jae-Heung
    • Korean Journal of Optics and Photonics
    • /
    • v.18 no.1
    • /
    • pp.19-23
    • /
    • 2007
  • We derived analytically the generalized curvature linear equation useful in the initial optical design of a two-mirror system with finite object distance, including an infinite object distance from paraxial ray tracing and Seidel third order aberration theory for coma coefficient. These aberration coefficients for finite object distance were described by the curvature, the inter-mirror distance, and the effective focal length. The analytical equations were solved by using a computer with a numerical analysis method. Two useful linear relationships, determined by the generalized curvature linear equations relating the curvatures of the two mirrors, for the cancellation of each aberration were shown in the numerical solutions satisfying the nearly zero condition ($<10^{-10}$) for each aberration coefficient. These equations can be utilized easily and efficiently at the step of initial optical design of a two-mirror system with finite object distance.