• 한국지능시스템학회논문지
• /
• 제21권1호
• /
• pp.6-11
• /
• 2011

본 논문에서는 고유특징 정규화 및 추출 기법(ERE: Eigenfeature Regularization and Extraction)을 이용한 걸음걸이 바이오 정보 기반 사용자 인식 시스템을 제안한다. 먼저 카메라 센서에서 취득한 걸음걸이 시퀀스로부터 사용자 인식을 위한 특징 정보로 걸음걸이 에너지 영상(GEI: Gait Energy Image)을 생성한다. 학습 단계에서는 갤러리 걸음걸이 에너지 영상에 ERE를 적용하여 정규화된 변환행렬을 획득하여 고유공간(eigenspace)에 사상된 특징정보를 구하고, 검증 단계에서는 걸음걸이 에너지 영상을 학습단계에서 생성한 고유공간에 사상하여 최근접 이웃 분류기를 이용하여 사용자를 인식한다. 제안한 시스템의 유효성 검증을 위해 CASIA 걸음걸이 데이터셋 A를 이용하여 실험하였고, 기존 연구에 비해 인식 정확도 면에서 우수한 성능을 보여주었다.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2004년도 추계학술대회
• /
• pp.1288-1293
• /
• 2004

Inverse radiation problems are solved for estimating the boundary conditions such as temperature distribution and wall emissivity in axisymmetric absorbing, emitting and scattering medium, given the measured incident radiative heat fluxes. Various regularization methods, such as hybrid genetic algorithm, conjugate-gradient method and Newton method, were adopted to solve the inverse problem, while discussing their features in terms of estimation accuracy and computational efficiency. Additionally, we propose a new combined approach of adopting the genetic algorithm as an initial value selector, whereas using the conjugate-gradient method and Newton method to reduce their dependence on the initial value.

• 대한기계학회논문집B
• /
• 제29권8호
• /
• pp.903-910
• /
• 2005

Inverse radiation problems are solved for estimating the boundary conditions such as temperature distribution and wall emissivity in axisymmetric absorbing, emitting and scattering medium, given the measured incident radiative heat fluxes. Various regularization methods, such as hybrid genetic algorithm, conjugate-gradient method and finite-difference Newton method, were adopted to solve the inverse problem, while discussing their features in terms of estimation accuracy and computational efficiency. Additionally, we propose a new combined approach that adopts the hybrid genetic algorithm as an initial value selector and uses the finite-difference Newton method as an optimization procedure.

• Communications for Statistical Applications and Methods
• /
• 제9권1호
• /
• pp.87-100
• /
• 2002

Poorly-posed problems in the balanced discriminant analysis was considered. We restrict consideration to the case of observations and the number of variables are the same and small. When these problems exist, we do not use a maximum likelihood estimates(MLE) to estimate covariance matrices. Instead of MLE, an alternative estimate for the covariance matrices are proposed. This alternative method make good use of two regularization parameters, $\lambda$} and $\gamma$. A new test rule for the discriminant function is suggested and examined via limited hut informative simulation study. From the simulation study, it is shown that the suggested test rule gives better test result than other previously suggested method in terms of error rate criterion.

• 한국ITS학회 논문지
• /
• 제22권6호
• /
• pp.17-31
• /
• 2023

활동기반 모델은 현대의 복잡한 개인의 통행행태를 반영한 정교한 기반의 수요예측이 가능하지만, 분석 대상지의 상세한 인구정보가 필수적으로 요구된다. 최근 다양한 심층생성 모델을 활용한 합성인구 생성 기법이 개발되었고, 설문조사를 통해 수집된 샘플 데이터에 존재하지 않는 실제 인구와 유사한 인구 특성을 모사한 데이터를 생성해내는 방법론이 제시되었다. 이는 이산형으로 이루어진 샘플 데이터를 연속형 데이터로 변환하여 분포 영역을 정의한 뒤 생성된 표본 데이터의 거리를 정교하게 계산하여, 불가능한 인구 특성 조합을 억제하는 방식으로 데이터의 확률 분포를 학습한다. 하지만 데이터 변환 과정에 활용되는 개체 임베딩이 잘 학습되지 않으면 의도와 다르게 왜곡된 연속형 분포 영역이 정의될 수 있고, 원본 데이터 표현의 오류로 인한 잘못된 합성인구를 생성할 가능성이 존재한다. 따라서 본 연구에서는 정확도 높은 임베딩을 추출하여 간접적으로 합성인구 생성 성능을 증가시키고자 한다. 결과적으로 합성인구의 다양성과 정확성 측면에서 기존 대비 약 28.87% 성능이 향상하였다.

• 방송공학회논문지
• /
• 제8권1호
• /
• pp.19-29
• /
• 2003

기존의 영상 획득 시스템들이 어느 정도의 엘리어싱을 허용하도록 제작되어왔음에도 불구하고, 고해상도 영상에 대한 요구는 점점 더 증가하고 있다. 본 논문에서는 부정확한 부화소 단위의 위치 추정 오류를 고려한 고해상도 재구성 알고리즘을 제안한다. 부정확한 부화소 위치 추정 오류로 인해 생기는 불량위치문제(ill-posedness)를 해결하기 위해 정규화 반복 연산법을 적용하였다, 특히 여러 장의 저해강도 영상들을 개별적으로 고려하기에 적합한 다중채널 영상 재구성 방법을 도입하였다. 각 저해상도 영상에서 발생하는 움직임 추정오류는 서로 다른 경향성을 나타내므로, 정규화 파라미터들은 각 채널에 맞게 결정되어야 한다. 이를 위해 정규화 파라미터들을 자동으로 결정하는 방법을 제안한다. 제안한 알고리즘은 움직임 추정 오류에 매우 안정하며, 원 영상과 잡음에 대한 사전정보를 필요로 하지 않는다. 또한 주관적인 측면과 객관적인 측면에서 모두 우수한 결과를 실험적으로 보인다.

• 전기학회논문지
• /
• 제57권7호
• /
• pp.1290-1294
• /
• 2008

We present a novel deblurring algorithm for bi-level images blurred by some parameterizable point spread function. The proposed method iteratively searches unknown parameters in the point spread function and noise-to-signal ratio by minimizing an objective function that is based on the binariness and the difference between two intensity values of restoring image. In simulations and experiments, the proposed method showed improved performance compared with the Wiener filtering based method in terms of bit error rate after segmentation.

• Genomics & Informatics
• /
• 제14권4호
• /
• pp.187-195
• /
• 2016

In genetic association studies with high-dimensional genomic data, multiple group testing procedures are often required in order to identify disease/trait-related genes or genetic regions, where multiple genetic sites or variants are located within the same gene or genetic region. However, statistical testing procedures based on an individual test suffer from multiple testing issues such as the control of family-wise error rate and dependent tests. Moreover, detecting only a few of genes associated with a phenotype outcome among tens of thousands of genes is of main interest in genetic association studies. In this reason regularization procedures, where a phenotype outcome regresses on all genomic markers and then regression coefficients are estimated based on a penalized likelihood, have been considered as a good alternative approach to analysis of high-dimensional genomic data. But, selection performance of regularization procedures has been rarely compared with that of statistical group testing procedures. In this article, we performed extensive simulation studies where commonly used group testing procedures such as principal component analysis, Hotelling's $T^2$ test, and permutation test are compared with group lasso (least absolute selection and shrinkage operator) in terms of true positive selection. Also, we applied all methods considered in simulation studies to identify genes associated with ovarian cancer from over 20,000 genetic sites generated from Illumina Infinium HumanMethylation27K Beadchip. We found a big discrepancy of selected genes between multiple group testing procedures and group lasso.

• 대한의용생체공학회:의공학회지
• /
• 제36권5호
• /
• pp.211-220
• /
• 2015

Recently, model-based iterative reconstruction (MBIR) has played an important role in transmission tomography by significantly improving the quality of reconstructed images for low-dose scans. MBIR is based on the penalized-likelihood (PL) approach, where the penalty term (also known as the regularizer) stabilizes the unstable likelihood term, thereby suppressing the noise. In this work we further improve MBIR by using a more expressive regularizer which can restore the underlying image more accurately. Here we used a spline regularizer derived from a linear combination of the two-dimensional splines with first- and second-order spatial derivatives and applied it to a non-quadratic convex penalty function. To derive a PL algorithm with the spline regularizer, we used a separable paraboloidal surrogates algorithm for convex optimization. The experimental results demonstrate that our regularization method improves reconstruction accuracy in terms of both regional percentage error and contrast recovery coefficient by restoring smooth edges as well as sharp edges more accurately.

• 대한의용생체공학회:의공학회지
• /
• 제22권4호
• /
• pp.311-319
• /
• 2001

Statistical reconstruction methods in the context of a Bayesian framework have played an important role in emission tomography since they allow to incorporate a priori information into the reconstruction algorithm. Given the ill-posed nature of tomographic inversion and the poor quality of projection data, the Bayesian approach uses regularizers to stabilize solutions by incorporating suitable prior models. In this work we show that, while the quantitative performance of the standard filtered backprojection (FBP) algorithm is not as good as that of Bayesian methods, the application of spline-regularized smoothing to the sinogram space can make the FBP algorithm improve its performance by inheriting the advantages of using the spline priors in Bayesian methods. We first show how to implement the spline-regularized smoothing filter by deriving mathematical relationship between the regularization and the lowpass filtering. We then compare quantitative performance of our new FBP algorithms using the quantitation of bias/variance and the total squared error (TSE) measured over noise trials. Our numerical results show that the second-order spline filter applied to FBP yields the best results in terms of TSE among the three different spline orders considered in our experiments.