• Title/Summary/Keyword: discrete projection

Search Result 54, Processing Time 0.025 seconds

Correction of Rotated Frames in Video Sequences Using Modified Mojette Transform (변형된 모젯 변환을 이용한 동영상에서의 회전 프레임 보정)

  • Kim, Ji-Hong
    • Journal of Korea Multimedia Society
    • /
    • v.16 no.1
    • /
    • pp.42-49
    • /
    • 2013
  • The camera motion is accompanied with the translation and/or the rotation of objects in frames of a video sequence. An unnecessary rotation of objects declines the quality of the moving pictures and in addition is a primary cause of the viewers' fatigue. In this paper, a novel method for correcting rotated frames in video sequences is presented, where the modified Mojette transform is applied to the motion-compensated area in each frame. The Mojette transform is one of discrete Radon transforms, and is modified for correcting the rotated frames as follows. First, the bin values in the Mojette transform are determined by using pixels on the projection line and the interpolation of pixels adjacent to the line. Second, the bin values are calculated only at some area determined by the motion estimation between current and reference frames. Finally, only one bin at each projection is computed for reducing the amount of the calculation in the Mojette transform. Through the simulation carried out on various test video sequences, it is shown that the proposed scheme has good performance for correcting the rotation of frames in moving pictures.

Fracture Network Analysis of Groundwater Folw in the Vicinity of a Large Cavern (분리열극개념을 이용한 지하공동주변의 지하수유동해석)

  • 강병무
    • The Journal of Engineering Geology
    • /
    • v.3 no.2
    • /
    • pp.125-148
    • /
    • 1993
  • Groundwater flow in fractured rock masses is controlled by combined effects of fracture networks, state of geostafic stresses and crossflow between fractures and rock matrix. Furthermore the scaie dependent, anisotropic properties of hydraulic parameters results mainly from irregular paftems of fracture system, which can not be evaluated properly with the methods available at present. The basic assumpfion of discrete fracture network model is that groundwater flows only along discrete fractures and the flow paths in rock mass are determined by geometric paftems of interconnected fractures. The characteristics of fracture distribution in space and fracture hydraulic parameters are represented as the probability density functions by stochastic simulation. The discrete fracture network modelling was aftempted to characterize the groundwater flow in the vicinity of existing large cavems located in Wonjeong-ri, Poseung-myon, Pyeungtaek-kun. The fracture data of $1\textrm{km}^2$ area were analysed. The result indicates that the fracture sets evaluated from an equal area projection can be grouped into 6 sets and the fracture sizes are distributed in longnormal. The conductive fracture density of set 1 shows the highest density of 0.37. The groundwater inflow into a carvem was calculated as 29ton/day with the fracture transmissivity of $10^{-8}\textrm{m}^2/s$. When the fracture transmissivity increases in an order, the inflow amount estimated increases dramatically as much as fold, i.e 651 ton/day. One of the great advantages of this model is a forward modelling which can provide a thinking tool for site characterization and allow to handle the quantitative data as well as qualitative data.

  • PDF

Implicit Numerical Integration of Two-surface Plasticity Model for Coarse-grained Soils (Implicit 수치적분 방법을 이용한 조립토에 관한 구성방정식의 수행)

  • Choi, Chang-Ho
    • Journal of the Korean Geotechnical Society
    • /
    • v.22 no.9
    • /
    • pp.45-59
    • /
    • 2006
  • The successful performance of any numerical geotechnical simulation depends on the accuracy and efficiency of the numerical implementation of constitutive model used to simulate the stress-strain (constitutive) response of the soil. The corner stone of the numerical implementation of constitutive models is the numerical integration of the incremental form of soil-plasticity constitutive equations over a discrete sequence of time steps. In this paper a well known two-surface soil plasticity model is implemented using a generalized implicit return mapping algorithm to arbitrary convex yield surfaces referred to as the Closest-Point-Projection method (CPPM). The two-surface model describes the nonlinear behavior of coarse-grained materials by incorporating a bounding surface concept together with isotropic and kinematic hardening as well as fabric formulation to account for the effect of fabric formation on the unloading response. In the course of investigating the performance of the CPPM integration method, it is proven that the algorithm is an accurate, robust, and efficient integration technique useful in finite element contexts. It is also shown that the algorithm produces a consistent tangent operator $\frac{d\sigma}{d\varepsilon}$ during the iterative process with quadratic convergence rate of the global iteration process.

Image Completion using Belief Propagation Based on Planar Priorities

  • Xiao, Mang;Li, Guangyao;Jiang, Yinyu;Xie, Li;He, Ye
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.9
    • /
    • pp.4405-4418
    • /
    • 2016
  • Automatic image completion techniques have difficulty processing images in which the target region has multiple planes or is non-facade. Here, we propose a new image completion method that uses belief propagation based on planar priorities. We first calculate planar information, which includes planar projection parameters, plane segments, and repetitive regularity extractions within the plane. Next, we convert this planar information into planar guide knowledge using the prior probabilities of patch transforms and offsets. Using the energy of the discrete Markov Random Field (MRF), we then define an objective function for image completion that uses the planar guide knowledge. Finally, in order to effectively optimize the MRF, we propose a new optimization scheme, termed Planar Priority-belief propagation that includes message-scheduling-based planar priority and dynamic label cropping. The results of experiment show that our approach exhibits advanced performance compared with existing approaches.

Stator Slot Shape Optimization of Induction Motors for Iron Loss Reduction (철손 저감을 위한 유도전동기 고정자 슬롯 형상 최적화)

  • Park, S.B.;Lee, H.B.;Park, I.H.;Chung, T.K.;Hahn, S.Y.
    • Proceedings of the KIEE Conference
    • /
    • 1994.07a
    • /
    • pp.150-152
    • /
    • 1994
  • In this paper, the optimum shape design of stator slot of induction motors for iron loss reduction is proposed. To obtain the flux distribution in induction motors, 2-D finite element method with voltage source is employed. The iron loss is calculated from the iron loss data given by the iron manufacturer. To calculate the sensitivity of iron loss to shape variation, the sensitivity analysis of discrete approach is used. The proposed algorithm is applied to a 3-phase squirrel cage induction motor. The nodes at stator slot boundary of the induction motor are defined as design parameters. By controlling these parameters under the constant volume of iron, we can minimize the iron loss. Furthermore, the stator copper loss is reduced by increasing the slot area. So the stator slot area is determined at the point that the summation of iron loss and copper loss of stator is minimized. Since the constraint of constant volume of iron is nonlinear to the design parameters, the Gradient Projection method is used as an optimization algorithm.

  • PDF

Reconstruction of In-beam PET for Carbon therapy with prior-knowledge of carbon beam-track

  • Kim, Kwangdon;Bae, Seungbin;Lee, Kisung;Chung, Yonghyun;An, Sujung;Joung, Jinhun
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.4 no.6
    • /
    • pp.384-390
    • /
    • 2015
  • There are two main artifacts in reconstructed images from in-beam positron emission tomography (PET). Unlike generic PET, in-beam PET uses the annihilation photons that occur during heavy ion therapy. Therefore, the geometry of in-beam PET is not a full ring, but a partial ring that has one or two openings around the rings in order for the hadrons to arrive at the tumor without prevention of detector blocks. This causes truncation in the projection data due to an absence of detector modules in the openings. The other is a ring artifact caused by the gaps between detector modules also found in generic PET. To sum up, in-beam PET has two kinds of gap: openings for hadrons, and gaps between the modules. We acquired three types of simulation results from a PET system: full-ring, C-ring and dual head. In this study, we aim to compensate for the artifacts that come from the two types of gap. In the case of truncation, we propose a method that uses prior knowledge of the location where annihilations occur, and we applied the discrete-cosine transform (DCT) gap-filling method proposed by Tuna et al. for inter-detector gap.

3D Automatic Mesh Generation Scheme for the Boundary Element Method (경계요소법을 위한 3차원 자동요소분할)

  • Lee, H.B.;Lee, S.H.;Kim, H.S.;Lee, K.S.;Hahn, S.Y.
    • Proceedings of the KIEE Conference
    • /
    • 1993.07b
    • /
    • pp.935-937
    • /
    • 1993
  • This paper presents a three dimensional automatic mesh generation scheme for the boundary element method, and this scheme can be applicable to practical problems of complex shape. The geometry of the problem is expressed as an assemblage of linear Coon's surfaces, and each surface is made up of four edge curves which are defined in the form of a parametric function. Curves are automatically segmented according to their characteristics. With these segments of curves, interior points and triangular mesh elements are generated in the parametric plane using Lindholm's method, and then their projection on the real surface forms the initial mesh. The refinement of initial mesh is performed so that the discrete triangular planes are close to the real continuous surfaces. The bisection method is used for the refinement. Finally, interior points in the refined mesh are rearranged so as to make each element be close with an equilateral triangle. An attempt has been made to apply the proposed method to a DY(Deflection Yoke) model.

  • PDF

A study on the lip shape recognition algorithm using 3-D Model (3차원 모델을 이용한 입모양 인식 알고리즘에 관한 연구)

  • 김동수;남기환;한준희;배철수;나상동
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 1998.11a
    • /
    • pp.181-185
    • /
    • 1998
  • Recently, research and developmental direction of communication system is concurrent adopting voice data and face image in speaking to provide more higher recognition rate then in the case of only voice data. Therefore, we present a method of lipreading in speech image sequence by using the 3-D facial shape model. The method use a feature information of the face image such as the opening-level of lip, the movement of jaw, and the projection height of lip. At first, we adjust the 3-D face model to speeching face image sequence. Then, to get a feature information we compute variance quantity from adjusted 3-D shape model of image sequence and use the variance quality of the adjusted 3-D model as recognition parameters. We use the intensity inclination values which obtaining from the variance in 3-D feature points as the separation of recognition units from the sequential image. After then, we use discrete HMM algorithm at recognition process, depending on multiple observation sequence which considers the variance of 3-D feature point fully. As a result of recognition experiment with the 8 Korean vowels and 2 Korean consonants, we have about 80% of recognition rate for the plosives and vowels.

  • PDF

A study on the lip shape recognition algorithm using 3-D Model (3차원 모델을 이용한 입모양 인식 알고리즘에 관한 연구)

  • 남기환;배철수
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.6 no.5
    • /
    • pp.783-788
    • /
    • 2002
  • Recently, research and developmental direction of communication system is concurrent adopting voice data and face image in speaking to provide more higher recognition rate then in the case of only voice data. Therefore, we present a method of lipreading in speech image sequence by using the 3-D facial shape model. The method use a feature information of the face image such as the opening-level of lip, the movement of jaw, and the projection height of lip. At first, we adjust the 3-D face model to speeching face Image sequence. Then, to get a feature information we compute variance quantity from adjusted 3-D shape model of image sequence and use the variance quality of the adjusted 3-D model as recognition parameters. We use the intensity inclination values which obtaining from the variance in 3-D feature points as the separation of recognition units from the sequential image. After then, we use discrete HMM algorithm at recognition process, depending on multiple observation sequence which considers the variance of 3-D feature point fully. As a result of recognition experiment with the 8 Korean vowels and 2 Korean consonants, we have about 80% of recognition rate for the plosives md vowels.

Sparse reconstruction of guided wavefield from limited measurements using compressed sensing

  • Qiao, Baijie;Mao, Zhu;Sun, Hao;Chen, Songmao;Chen, Xuefeng
    • Smart Structures and Systems
    • /
    • v.25 no.3
    • /
    • pp.369-384
    • /
    • 2020
  • A wavefield sparse reconstruction technique based on compressed sensing is developed in this work to dramatically reduce the number of measurements. Firstly, a severely underdetermined representation of guided wavefield at a snapshot is established in the spatial domain. Secondly, an optimal compressed sensing model of guided wavefield sparse reconstruction is established based on l1-norm penalty, where a suite of discrete cosine functions is selected as the dictionary to promote the sparsity. The regular, random and jittered undersampling schemes are compared and selected as the undersampling matrix of compressed sensing. Thirdly, a gradient projection method is employed to solve the compressed sensing model of wavefield sparse reconstruction from highly incomplete measurements. Finally, experiments with different excitation frequencies are conducted on an aluminum plate to verify the effectiveness of the proposed sparse reconstruction method, where a scanning laser Doppler vibrometer as the true benchmark is used to measure the original wavefield in a given inspection region. Experiments demonstrate that the missing wavefield data can be accurately reconstructed from less than 12% of the original measurements; The reconstruction accuracy of the jittered undersampling scheme is slightly higher than that of the random undersampling scheme in high probability, but the regular undersampling scheme fails to reconstruct the wavefield image; A quantified mapping relationship between the sparsity ratio and the recovery error over a special interval is established with respect to statistical modeling and analysis.