• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2000년도 춘계학술대회논문집A
• /
• pp.345-350
• /
• 2000

Adaptive finite element analysis, which its solution error meets with the user defined allowable error, is recently used far improving reliability of finite element analysis results. This adaptive analysis is composed of two procedures; one is the error estimation of an analysis result and another is the reconstruction of finite elements. In the rp-method, an element size is controlled by relocating of nodal positions(r-method) and the order of an element shape function is determined by the hierarchical polynomial(p-method) corresponding to the element solution error. In order to show the effectiveness and accuracy of the suggested rp-method, various numerical examples were analyzed and these analysis results were examined by comparing with those obtained by the existed methods. As a result of this study, following conclusions are obtained. (1) rp-method is more accurate and effective than the r- and p-method. (2) The solution convergency of the rp-method is controlled by means of the iterative calculation numbers of the r- and p- method each other.

• 천문학회보
• /
• 제44권2호
• /
• pp.74.2-74.2
• /
• 2019

We present a possible bias in the estimation of velocity dispersions for galaxy groups due to the contribution of subgroups which are infalling into the groups. We execute a systematic search for flux-limited galaxy groups and subgroups based on the spectroscopic galaxies with r < 17.77 mag of SDSS data release 12, by using DBSCAN (Density-Based Spatial Clustering of Application with Noise) and Hierarchical Clustering Method which are well known unsupervised machine learning algorithm. A total of 2042 groups with at least 10 members are found and ~20% of groups have subgroups. We found that the estimation of velocity dispersions of groups using total galaxies including those in subgroups are underestimated by ~10% compared to the case of using only galaxies in main groups. This result suggests that the subgroups should be properly considered for mass measurement of galaxy groups based on the velocity dispersion.

• 한국멀티미디어학회논문지
• /
• 제17권3호
• /
• pp.333-341
• /
• 2014

다시점 비디오는 하나의 3차원 장면을 여러 시점에서 다수의 카메라로 촬영한 동영상으로 다시점 비디오 부호화는 카메라의 수에 비례하여 데이터의 양이 증가하기 때문에 계산량을 줄일 수 있는 다시점 비디오 부호화 기술이 필요하다. 본 논문에서 다시점 비디오의 부호화를 위한 움직임 추정의 계산량을 줄이면서 화질을 유지하는 움직임 추정 기법을 제안한다. 제안한 움직임 추정 기법은 움직임 벡터의 분포 특성을 이용한 효과적인 초기 종료 움직임 추정 기법이다. 제안한 움직임 추정기법은 계층적 움직임 추정 기법으로 다중 사각형 탐색 패턴, 래스터 탐색 패턴, 수정된 다이아몬드 탐색 패턴 그리고 작은 다이아몬드 탐색으로 이루어져있다. 제안한 기법의 성능은 JMVC의 고속 움직임 추정 기법인 TZ 탐색 기법과 전역 탐색 기법(FS)의 성능과 비교한 경우, 영상 화질과 비트량을 비슷하지만 움직임 추정 속도를 각각 약 1.7~4.5배, 90배 향상시킨다.

• Communications for Statistical Applications and Methods
• /
• 제21권1호
• /
• pp.45-60
• /
• 2014

We introduce a MCMC sampling for a generalized linear normal random effects model with the ordered probit link function based on latent variables from suitable truncated normal distribution. Such models have proven useful in practice and we have observed numerically reasonable results in the estimation of fixed effects when the random effect term is provided. Applications that utilize Korean Welfare Panel Study data can be difficult to model; subsequently, we find that an ordered probit model with the random effects leads to an improved analyses with more accurate and precise inferences.

• 천문학회지
• /
• 제38권2호
• /
• pp.145-148
• /
• 2005

We present a photometric study of galaxies in the central regions of six nearby galaxy clusters at redshift z=0.0231${\~}$0.0951. We have derived BVI photometry of the galaxies from the CCD images obtained at the Bohyunsan Optical Astronomical Observatory (BOAO) in Korea, and JHKs photometry of the bright galaxies from the 2MASS extended source catalog. Comparing the galaxy photometry results with the simple stellar population model of Bruzual & Charlot (2003) in the optical & NIR color-color diagrams, we have estimated the ages and metallicities of early type galaxies. We have found that the observed galaxies had recent star-formation mostly 5 ${\~}$ 7 Gyrs ago but the spread in age estimation is rather large. The average metallicities are [Fe/H]=0.l${\~}$0.5 dex. These results support the hypothesis that large early type galaxies in clusters are formed via hierarchical merging of smaller galaxies.

• 한국데이터정보과학회:학술대회논문집
• /
• 한국데이터정보과학회 2005년도 춘계학술대회
• /
• pp.83-126
• /
• 2005

Single-index models have found applications in econometrics and biometrics, where multidimensional regression models are often encountered. Here we propose a nonparametric estimation approach that combines wavelet methods for non-equispaced designs with Bayesian models. We consider a wavelet series expansion of the unknown regression function and set prior distributions for the wavelet coefficients and the other model parameters. To ensure model identifiability, the direction parameter is represented via its polar coordinates. We employ ad hoc hierarchical mixture priors that perform shrinkage on wavelet coefficients and use Markov chain Monte Carlo methods for a posteriori inference. We investigate an independence-type Metropolis-Hastings algorithm to produce samples for the direction parameter. Our method leads to simultaneous estimates of the link function and of the index parameters. We present results on both simulated and real data, where we look at comparisons with other methods.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송∙미디어공학회 2017년도 하계학술대회
• /
• pp.70-73
• /
• 2017

본 논문에서 프레임 율 향상을 위한 새로운 움직임 추정 알고리즘에 대해 제안한다. 계산량을 줄이고 다해상도의 영상을 이용하기 위하여 원본 프레임들을 계층적 구조로 형성하고, 최상위 계층에서 단방향 움직임 추정을 수행한다. 최상위 계층은 낮은 해상도 때문에 움직임 벡터의 정확도가 낮아지므로, 정확도를 향상시키기 위해 각각의 블록은 5 개의 움직임 벡터 후보들을 가진다. 이 후보들은 아래 계층들에서 수정되며, 움직임 추정이 완료되면 최하위 계층의 움직임 벡터들은 SAD (sum of absolute difference) 값을 이용해서 최종적으로 수정된다. 이렇게 구해진 단방향 움직임 벡터들은 양방향 움직임 벡터로 변환되고 양방향 보간법을 사용하여 보간 프레임을 생성한다. 결과적으로, 제안하는 알고리즘은 기존 알고리즘들에 비해 낮은 계산량을 나타내면서 PSNR (peak signal-to-noise ratio) 수치에서 최대 1.3 dB 의 향상을 나타냈고, 주관적으로도 더 선명한 결과를 보여주었다.

• Communications for Statistical Applications and Methods
• /
• 제22권3호
• /
• pp.265-276
• /
• 2015

In this paper, we propose hierarchical cluster analysis and multidimensional scaling for joint distribution valued data. Information technology is increasing the necessity of statistical methods for large and complex data. Symbolic Data Analysis (SDA) is an attractive framework for the data. In SDA, target objects are typically represented by aggregated data. Most methods on SDA deal with objects represented as intervals and histograms. However, those methods cannot consider information among variables including correlation. In addition, objects represented as a joint distribution can contain information among variables. Therefore, we focus on methods for joint distribution valued data. We expanded the two well-known exploratory methods using the dissimilarities adopted Hall Type relative projection index among joint distribution valued data. We show a simulation study and an actual example of proposed methods.

• IEIE Transactions on Smart Processing and Computing
• /
• 제5권4호
• /
• pp.235-242
• /
• 2016

The emerging High-Efficiency Video Coding (HEVC) standard attempts to improve coding efficiency by a factor of two over H.264/Advanced Video Coding (AVC) at the expense of an increase in computational complexity. Mode decision with motion estimation (ME) is still one of the most time-consuming computations in HEVC, as it is with H.264/AVC. Thus, fast mode decisions are not only an important issue to be researched, but also an urgent one. Several schemes for fast mode decisions have been presented in reference software and in other studies. However, the conventional hierarchical mode decision can be useless when block-level parallelism is exploited. This paper proposes operation-level exploration that offers more chances for early termination. An early termination condition is checked between integer and fractional MEs and between the parts of one partition type. The fast decision points of the proposed algorithm do not overlap those in previous works. Thus, the proposed algorithms are easily used with other fast algorithms, and consequently, independent speed-up is possible.

• 한국자동차공학회논문집
• /
• 제22권3호
• /
• pp.241-249
• /
• 2014

This paper presents a path planning algorithm of an autonomous vehicle (ADAM III) for collision avoidance in the presence of multiple obstacles. Under the requirements that a low-cost GPS is used and its computation should be completed with a sampling time of sub-second, heading angle estimation is proposed to improve performance degradation of its measurement and a hierarchical structure for path planning is used. Once it is decided that obstacle avoidance is necessary, the path planning consists in three steps: waypoint generation, trajectory candidate generation, and trajectory selection. While the waypoints and the corresponding trajectory candidates are generated based on position of obstacles, the final desired trajectory is determined with considerations of kinematic constraints as well as an optimal condition in a term of lateral deviation. Finally the proposed algorithm was validated experimentally through field tests and its demonstration was performed in Autonomous Vehicle Competition (AVC) 2013.