• Title/Summary/Keyword: piecewise smoothness

Search Result 6, Processing Time 0.018 seconds

Using Bayesian Approaches to Reduce Truncation Artifact in Magnetic Resonance Imaging

  • Lee, Su-Jin
    • Journal of Biomedical Engineering Research
    • /
    • v.19 no.6
    • /
    • pp.585-593
    • /
    • 1998
  • In Fourier magnetic resonance imaging (MRI), the number of phase encoded signals is often reduced to minimize the duration of the studies and maintain adequate signal-to-noise ratio. However, this results in the well-known truncation artifact, whose effect manifests itself as blurring and ringing in the image domain. In this paper, we propose a new regularization method in the context of a Bayesian framework to reduce truncation artifact. Since the truncation artifact appears in t도 phase direction only, the use of conventional piecewise-smoothness constraints with symmetric neighbors may result in the loss of small details and soft edge structures in the read direction. Here, we propose more elaborate forms of constraints than the conventional piecewise-smoothness constraints, which can capture actual spatial information about the MR images. Our experimental results indicate that the proposed method not only reduces the truncation artifact, but also improves tissue regularity and boundary definition without oversmoothing soft edge regions.

  • PDF

GRADIENT TYPE ESTIMATES FOR LINEAR ELLIPTIC SYSTEMS FROM COMPOSITE MATERIALS

  • Youchan Kim;Pilsoo Shin
    • Journal of the Korean Mathematical Society
    • /
    • v.60 no.3
    • /
    • pp.635-682
    • /
    • 2023
  • In this paper, we consider linear elliptic systems from composite materials where the coefficients depend on the shape and might have the discontinuity between the subregions. We derive a function which is related to the gradient of the weak solutions and which is not only locally piecewise Hölder continuous but locally Hölder continuous. The gradient of the weak solutions can be estimated by this derived function and we also prove the local piecewise gradient Hölder continuity which was obtained by the previous results.

Multiple change-point estimation in spectral representation

  • Kim, Jaehee
    • Communications for Statistical Applications and Methods
    • /
    • v.29 no.1
    • /
    • pp.127-150
    • /
    • 2022
  • We discuss multiple change-point estimation as edge detection in piecewise smooth functions with finitely many jump discontinuities. In this paper we propose change-point estimators using concentration kernels with Fourier coefficients. The change-points can be located via the signal based on Fourier transformation system. This method yields location and amplitude of the change-points with refinement via concentration kernels. We prove that, in an appropriate asymptotic framework, this method provides consistent estimators of change-points with an almost optimal rate. In a simulation study the proposed change-point estimators are compared and discussed. Applications of the proposed methods are provided with Nile flow data and daily won-dollar exchange rate data.

Reference Trajectory Design for Atmosphere Re-entry of Transportation Mechanical Structure (수송기계구조물의 대기권 재진입 기준궤도 설계)

  • Park, J.H.;Eom, W.S.
    • Journal of Power System Engineering
    • /
    • v.7 no.4
    • /
    • pp.67-73
    • /
    • 2003
  • The entry guidance design involves trajectory optimization and generation of a drag acceleration profile as the satisfaction of trajectory conditions during the entry flight. The reference trajectory is parameterized and optimized as piecewise linear functions of the velocity. A regularization technique is employed to achieve desired properties of the optimal drag profile. The regularized problem has smoothness properties and the minimization of performance index then prevents the drag acceleration from varying too fast, thus eliminating discontinuities. This paper shows the trajectory control using the simple control law as well as the information of reference drag acceleration.

  • PDF

Harmony Arrangements using B-Spline Tension Curves (B-스플라인 텐션 곡선을 이용한 음악 편곡)

  • Yoo, Min-Joon;Lee, In-Kwon;Kwon, Dae-Hyun
    • Journal of the HCI Society of Korea
    • /
    • v.1 no.1
    • /
    • pp.1-8
    • /
    • 2006
  • We suggest a graphical representation of the tension flow in tonal music using a piecewise parametric curve, which is a function of time illustrating the changing degree of tension in a corresponding chord progression. The tension curve can be edited by using conventional curve editing techniques to reharmonize the original music with reflecting the user's demand to control the tension of music. We introduce three different methods to measure the tension of a chord in terms of a specific key, which can be used to represent the tension of the chord numerically. Then, by interpolating the series of numerical tension values, a tension curve is constructed. In this paper, we show the tension curve editing method can be effectively used in several interesting applications: enhancing or weakening the overall feeling of tension in a whole song, the local control of tension in a specific region of music, the progressive transition of tension flow from source to target chord progressions, and natural connection of two songs with maintaining the smoothness of the tension flow. Our work shows the possibility of controlling the perceptual factor (tension) in music by using numerical methods. Most of the computations used in this paper are not expensive so they can be calculated in real time. We think that an interesting application of our method is an interactive modification of tension in background music according to the user's emotion or current scenario in the interactive environments such as games.

  • PDF

Direct Reconstruction of Displaced Subdivision Mesh from Unorganized 3D Points (연결정보가 없는 3차원 점으로부터 차이분할메쉬 직접 복원)

  • Jung, Won-Ki;Kim, Chang-Heon
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.29 no.6
    • /
    • pp.307-317
    • /
    • 2002
  • In this paper we propose a new mesh reconstruction scheme that produces a displaced subdivision surface directly from unorganized points. The displaced subdivision surface is a new mesh representation that defines a detailed mesh with a displacement map over a smooth domain surface, but original displaced subdivision surface algorithm needs an explicit polygonal mesh since it is not a mesh reconstruction algorithm but a mesh conversion (remeshing) algorithm. The main idea of our approach is that we sample surface detail from unorganized points without any topological information. For this, we predict a virtual triangular face from unorganized points for each sampling ray from a parameteric domain surface. Direct displaced subdivision surface reconstruction from unorganized points has much importance since the output of this algorithm has several important properties: It has compact mesh representation since most vertices can be represented by only a scalar value. Underlying structure of it is piecewise regular so it ran be easily transformed into a multiresolution mesh. Smoothness after mesh deformation is automatically preserved. We avoid time-consuming global energy optimization by employing the input data dependant mesh smoothing, so we can get a good quality displaced subdivision surface quickly.