• 한국항공우주학회지
• /
• 제48권3호
• /
• pp.175-185
• /
• 2020

유도무기는 원통형 형상에서 기인한 기하학적 특성으로 6자유도 공력계수에 물리적 구배 조건을 내포하게 된다. 본 연구는 부가적으로 주어진 물리적 구배 정보를 공력계수 모형화에서 효과적으로 이용할 목적으로 구배 보강 가우스 과정을 사용하였다. 물리적 구배 정보를 활용한 공력계수 예측의 정확성을 살펴보기 위해, 가우스 과정에 기초한 공력계수 예측 모형을 구배 정보의 유무에 따라 각각 구성한 후 서로의 예측 정확도를 비교·분석하였다. 그 결과, 물리적 구배 정보를 고려한 공력계수 예측은 부여된 구배 조건을 정확히 만족하였을 뿐만 아니라 그렇지 않은 모형에 비해 예측 정확도가 더 우수함을 확인하였다. 다만, 구배 보강 가우스 과정으로는 물리적 구배 정보를 연속적으로 부여할 수 없으며 추가된 구배 정보로 인해 공력계수 예측 모형 구성에 요구되는 표본수가 증가하는 단점도 확인하였다.

• 제어로봇시스템학회논문지
• /
• 제12권5호
• /
• pp.444-449
• /
• 2006

Path planning is a key element in navigation of a mobile robot. Several algorithms such as a gradient method have been successfully implemented so for. Although the gradient method can provide the global optimal path, it computes the navigation function over the whole environment at all times, which result in high computational cost. This paper proposes a high-speed path planning scheme, called a gradient method with topological information, in which the search space for computation of a navigation function can be remarkably reduced by exploiting the characteristics of the topological information reflecting the topology of the navigation path. The computing time of the gradient method with topological information can therefore be significantly decreased without losing the global optimality. This reduced path update period allows the mobile robot to find a collision-free path even in the dynamic environment.

• International journal of advanced smart convergence
• /
• 제7권4호
• /
• pp.108-113
• /
• 2018

In this study, we introduce a new image gradient computation based on understanding of image generation. Most images consist of groups of pixels with similar color information because the images are generally obtained by taking a picture of the real world. The general gradient operator for an image compares only the neighboring pixels and cannot obtain information about a wide area, and there is a risk of falling into a local minimum problem. Therefore, it is necessary to attempt to introduce the gradient operator of the interval concept. We present a bow-tie gradient by color values of pixels on bow-tie region of a given pixel. To confirm the superiority of our study, we applied our bow-tie gradient to image segmentation algorithms for various images.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권11호
• /
• pp.2754-2768
• /
• 2013

Video fingerprints generated from global features are usually vulnerable against general geometric transformations. In this paper, a novel video fingerprinting algorithm is proposed, in which a new spatio-temporal gradient is designed to represent the spatial and temporal information for each frame, and a new partition scheme, based on concentric circle and rings, is developed to resist the attacks efficiently. The centroids of spatio-temporal gradient orientations (CSTGO) within the circle and rings are then calculated to generate a robust fingerprint. Our experiments with different attacks have demonstrated that the proposed approach outperforms the state-of-the-art methods in terms of robustness and discrimination.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권11호
• /
• pp.4355-4371
• /
• 2020

Phase retrieval, recovering a signal from phaseless measurements, is generally considered to be an NP-hard problem. This paper adopts an amplitude-based nonconvex optimization cost function to develop a new stochastic gradient algorithm, named stochastic reweighted phase retrieval (SRPR). SRPR is a stochastic gradient iteration algorithm, which runs in two stages: First, we use a truncated sample stochastic variance reduction algorithm to initialize the objective function. The second stage is the gradient refinement stage, which uses continuous updating of the amplitude-based stochastic weighted gradient algorithm to improve the initial estimate. Because of the stochastic method, each iteration of the two stages of SRPR involves only one equation. Therefore, SRPR is simple, scalable, and fast. Compared with the state-of-the-art phase retrieval algorithm, simulation results show that SRPR has a faster convergence speed and fewer magnitude-only measurements required to reconstruct the signal, under the real- or complex- cases.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 ITC-CSCC -2
• /
• pp.1204-1207
• /
• 2002

The fixed points of two known gradient flows defined on adjoint orbits of orthogonal groups are analyzed through the critical point analysis of the potential functions. The results show that some known properties of these gradient flows are shared with the gradient flows of the same potential functions with respect to other metrics.

• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2021년도 춘계학술대회
• /
• pp.2-4
• /
• 2021

분산된 환경에서 머신 러닝의 학습 가중치를 공유하여 학습하는 방법은 훈련 데이터를 직접 공유하는 것이 아니기 때문에 안전한 것으로 여겨졌다. 하지만, 최근 연구에 따르면 악의적인 공격자가 공유된 가중치를 분석하여 원본 데이터를 완벽하게 복원할 수 있는 취약점이 발견되었다. Gradient Leakage Attack은 이러한 취약점을 이용해 훈련 데이터를 복원하는 공격 기법이다. 본 연구에서는 개별 장치에서 학습을 진행하고 가중치를 서버와 공유하는 학습 환경인 연합 학습 환경에서 해당 공격을 방어하기 위해 이산 코사인 변환에 기반한 이미지 변환 기법을 제시한다. 실험 결과, 우리의 이미지 변환 기법을 적용하면 공유된 가중치로부터 원본 데이터를 완벽하게 복원할 수 없다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권4호
• /
• pp.1760-1778
• /
• 2018

For image segmentation with intensity inhomogeneity, many region-based level set methods have been proposed. Some of them however can't get the relatively ideal segmentation results under the severe intensity inhomogeneity and weak edges, and without use of the image gradient information. To improve that, we propose a new level set method combined with local direction gradient in this paper. Firstly, based on two assumptions on intensity inhomogeneity to images, the relationships between segmentation objects and image gradients to local minimum and maximum around a pixel are presented, from which a new pixel classification method based on weight of Euclidian distance is introduced. Secondly, to implement the model, variational level set method combined with image spatial neighborhood information is used, which enhances the anti-noise capacity of the proposed gradient information based model. Thirdly, a new diffusion process with an edge indicator function is incorporated into the level set function to classify the pixels in homogeneous regions of the same segmentation object, and also to make the proposed method more insensitive to initial contours and stable numerical implementation. To verify our proposed method, different testing images including synthetic images, magnetic resonance imaging (MRI) and real-world images are introduced. The image segmentation results demonstrate that our method can deal with the relatively severe intensity inhomogeneity and obtain the comparatively ideal segmentation results efficiently.

• 대한의용생체공학회:의공학회지
• /
• 제17권1호
• /
• pp.19-24
• /
• 1996

이 논문의 목적은 Target field approach방법을 사용하여 2차원적인 공간선택을 할 수 있는 고차 평면 경사 자계코일(High-Order SGC: High-Order Surface Gradient Coil)을 설계하는 것이다. 지금까지 쓰이던 원통형의 고차경사자제코일을 이용한 2차원적 원형 선택방법은 한 개의 RF Pulse로 2차원적인 공간 선택을 할 수 있는 장점이 있었으나 선택되어지는 체적의 지름이 6 ~ 8cm로 너무 크다는 단점이 있었다. 이 논문에서는 이와 같은 단점을 극복하기 위해 영상을 얻고자하는 부분에 코일을 좀 더 가까이 붙일 수 있어서 적은 전력으로 선택되어지는 체적의 지름을 1 ~ 4cm까지 줄일 수 있는 표면 고차자계코일을 Target field approach방법을 이용하여 설계하였으며 Phantom과 인체영상을 통해 제작된 코일의 성능을 확인해 보았다. 이전의 Field component 방법을 이용하여 설계한 코일에 의해서 선택되어지는 체적은 타원에 가까운 모양이 되었으나, Target field approach 방법을 이용하여 설계한 코일에 의해서 선택되어지는 체적은 이상적인 원에 가까운 모양이 되었다.

• 전자공학회논문지S
• /
• 제34S권1호
• /
• pp.72-79
• /
• 1997

Most open magnetic resonance imaging systems have used the planar gradient coils whose inductances were minimized through the magnetic energy minimization procedure in the spatial frequency domain. Though the planar gradient coils have smaller inductance than conventional gradient coils, the planar gradient coils often suffer from their poor magnetic field linearity. Scaling the spatial frequencies of the current density function designed by the magnetic energy minimization, magnetic field linearity of the planar gradient coils can be greatly improved with small sacrifice of gradient coil inductance. We have found that the figure of merit of the planar gradient coils, defined by the gradient strength divided by the linearity error and the inductance, can be improved by proposed technique.