• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.8
• /
• pp.89-96
• /
• 2015

Human visual system has chromatic adaptation to determine the color of an object regardless of illumination, whereas digital camera records illumination and reflectance together, giving the color appearance of the scene varied under different illumination. NMFsc(nonnegative matrix factorization with sparseness constraint) was recently introduced to estimate original object color by using sparseness constraint. In NMFsc, low sparseness constraint is used to estimate illumination and high sparseness constraint is used to estimate reflectance. However, NMFsc has an illumination estimation error for images with large uniform area, which is considered as dominant chromaticity. To overcome the defects of NMFsc, illumination estimation via nonnegative matrix factorization with dominant chromaticity image is proposed. First, image is converted to chromaticity color space and analyzed by chromaticity histogram. Chromaticity histogram segments the original image into similar chromaticity images. A segmented region with the lowest standard deviation is determined as dominant chromaticity region. Next, dominant chromaticity is removed in the original image. Then, illumination estimation using nonnegative matrix factorization is performed on the image without dominant chromaticity. To evaluate the proposed method, experimental results are analyzed by average angular error in the real world dataset and it has shown that the proposed method with 5.5 average angular error achieve better illuminant estimation over the previous method with 5.7 average angular error.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.737-741
• /
• 2009

This paper addresses the factorization method to estimate the projective structure of a scene from feature (points) correspondences over images with occlusions. We propose both a column and a row space approaches to estimate the depth parameter using the subspace constraints. The projective depth parameters are estimated by maximizing projection onto the subspace based either on the Joint Projection matrix (JPM) or on the the Joint Structure matrix (JSM). We perform the maximization over significant observation and employ Tardif's Camera Basis Constraints (CBC) method for the matrix factorization, thus the missing data problem can be overcome. The depth estimation and the matrix factorization alternate until convergence is reached. Result of Experiments on both real and synthetic image sequences has confirmed the effectiveness of our proposed method.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.383-388
• /
• 2005

Depth recovery in robot vision is an essential problem to infer the three dimensional geometry of scenes from a sequence of the two dimensional images. In the past, many studies have been proposed for the depth estimation such as stereopsis, motion parallax and blurring phenomena. Among cues for depth estimation, depth from lens translation is based on shape from motion by using feature points. This approach is derived from the correspondence of feature points detected in images and performs the depth estimation that uses information on the motion of feature points. The approaches using motion vectors suffer from the occlusion or missing part problem, and the image blur is ignored in the feature point detection. This paper presents a novel approach to the defocus technique based depth from lens translation using sequential SVD factorization. Solving such the problems requires modeling of mutual relationship between the light and optics until reaching the image plane. For this mutuality, we first discuss the optical properties of a camera system, because the image blur varies according to camera parameter settings. The camera system accounts for the camera model integrating a thin lens based camera model to explain the light and optical properties and a perspective projection camera model to explain the depth from lens translation. Then, depth from lens translation is proposed to use the feature points detected in edges of the image blur. The feature points contain the depth information derived from an amount of blur of width. The shape and motion can be estimated from the motion of feature points. This method uses the sequential SVD factorization to represent the orthogonal matrices that are singular value decomposition. Some experiments have been performed with a sequence of real and synthetic images comparing the presented method with the depth from lens translation. Experimental results have demonstrated the validity and shown the applicability of the proposed method to the depth estimation.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10a
• /
• pp.56-59
• /
• 1996

Worst-case state estimation will be proposed in this paper. By using the worst-case disturbance and worst-case state estimation, we can obtain right/left constrained coprime factors. If constrained coprime factors are used in designing a controller, the infinity-norm of closed-loop transfer matrix can be smaller than any constant .gamma.(> .gamma.$_{opt}$) without matrix dilation optimization. The derivation of left/right constrained coprime factors is achieved by doubly coprime factorization for the plant constrained by the infinity norm. And the parameterization of stabilizing controllers gives us easily understanding for H$_{\infty}$ control theory.ry.

• International journal of advanced smart convergence
• /
• v.8 no.2
• /
• pp.39-46
• /
• 2019

Human mobility estimation plays a key factor in a lot of promising applications including location-based recommendation systems, urban planning, and disease outbreak control. We study the human mobility estimation problem in the case where recent locations of a person-of-interest are unknown. Since matrix decomposition is used to perform latent semantic analysis of multi-dimensional data, we propose a human location estimation algorithm based on matrix factorization to reconstruct the human movement patterns through the use of information of persons with correlated movements. Specifically, the optimization problem which minimizes the difference between the reconstructed and actual movement data is first formulated. Then, the gradient descent algorithm is applied to adjust parameters which contribute to reconstructed mobility data. The experiment results show that the proposed framework can be used for the prediction of human location and achieves higher predictive accuracy than a baseline model.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.39 no.4
• /
• pp.380-385
• /
• 1990

This Paper presents a general algorithm for the parameter estimation of an antoregressive moving average process observed in additive white noise. The algorithm is based on the Gauss-Newton recursive prediction error method. For the parameter estimation, the output measurement is modelled as an innovation process using the spectral factorization, so that noise free RPE ARMA estimation can be used. Using apriori known properties leads to algorithm with smaller computation and better accuracy be the parsimony principle. Computer simulation examples show the effectiveness of the proposed algorithm.

• The KIPS Transactions:PartB
• /
• v.13B no.5 s.108
• /
• pp.499-506
• /
• 2006

This Paper describes a fast and stable camera pose estimation method for real-time augmented reality systems. From the feature tracking results of a marker on a single frame, we estimate the camera rotation matrix and the translation vector. For the camera pose estimation, we use the shape factorization method based on the scaled orthographic Projection model. In the scaled orthographic factorization method, all feature points of an object are assumed roughly at the same distance from the camera, which means the selected reference point and the object shape affect the accuracy of the estimation. This paper proposes a flexible and stable selection method for the reference point. Based on the proposed method, we implemented a video augmentation system that inserts virtual 3D objects into the input video frames. Experimental results showed that the proposed camera pose estimation method is fast and robust relative to the previous methods and it is applicable to various augmented reality applications.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.27 no.1
• /
• pp.103-108
• /
• 2023

We study the problem of selecting a subset of sensor nodes in sensor networks in order to maximize the performance of parameter estimation. To achieve a low-complexity sensor selection algorithm, we propose a greedy iterative algorithm that allows us to select one sensor node at a time so as to maximize the log-determinant of the inverse of the estimation error covariance matrix without resort to direct minimization of the estimation error. We apply QR factorization to the observation matrix in the log-determinant to derive an analytic selection rule which enables a fast selection of the next node at each iteration. We conduct the extensive experiments to show that the proposed algorithm offers a competitive performance in terms of estimation performance and complexity as compared with previous sensor selection techniques and provides a practical solution to the selection problem for various network applications.

• Journal of Institute of Control, Robotics and Systems
• /
• v.5 no.2
• /
• pp.158-165
• /
• 1999

비행시험을 통해 획득한 데이터의 해석과정에서 대상 항공기의 크기가 소형인 경우에는 엔진진동이나 외부의 교란에 의한 잡음이나 바이어스 등의 강도가 높기 때문에 데이터의 처리과정에서 많은 문제점을 산출하게 된다. 이와 같은 문제점을 해결하기 위해 상태추정 알고리즘이 사용되며, 본 논문에서는 항공기의 비선형 세로운동 방정식의 경우에 확장형 칼만 필터를 적용하여 항공기 세로운동의 상태변수들을 추정하였으며, 또한 확률근사과정, 이노베이션에 대한 궤환 적응 등 적응형 칼만 필터를 사용하여 수렴속도와 정확도 둥을 향상시킨 알고리즘을 제안하고 그 결과를 나타내었다.

• 한국HCI학회:학술대회논문집
• /
• 2006.02a
• /
• pp.486-492
• /
• 2006

본 논문에서는 비디오에서의 특징점 추적을 통해 얻은 2D 좌표를 이용한 3D 구조를 추정하는 방법과 네 점 이상의 공통점을 이용한 융합 방법을 제안한다. 영상의 각 프레임에서 공통되는 특징점을 이용하여 형상을 추정한다. 영상의 각 프레임에 대한 특징점의 추적은 Lucas-Kanade 방법을 사용하였다. 3D 좌표 추정 방법으로 개선된 직교분해기법을 사용하였다. 개선된 직교분해기법에서는 3D 좌표를 복원함과 동시에 카메라의 위치와 방향을 계산할 수 있다. 복원된 부분 데이터들은 전체를 이루는 일부분이므로, 융합을 통해 완성된 모습을 만들 수 있다. 복원된 부분 데이터들의 서로 다른 좌표계를 기준 좌표계로 변환함으로써 융합할 수 있다. 융합은 카메라의 모션에 해당하는 카메라의 위치와 방향에 의존된다. 융합 과정은 모두 선형으로 평균 0.5초 이하의 수행 속도를 보이며 융합의 오차는 평균 0.1cm 이하의 오차를 보였다.