• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2021.06a
• /
• pp.101-104
• /
• 2021

영상에 새로운 광원을 추가하거나 기존의 광원을 변경하여 영상 내 오브젝트들에 적용된 조명을 변경하는 것을 영상 기반 재조명이라 한다. 하지만, 영상에는 재조명을 위해 필요한 광원과 오브젝트들의 3차원 기하 정보가 부재하다는 문제가 있다. 이를 해결하기 위해, 본 연구에서는 영상으로부터 재조명에 필요한 요소들을 추정하는 접근법을 취한다. 오브젝트 표면의 노말과 알베도는 조명의 주 요소이지만 광원에는 독립적이므로 새로운 광원에 대한 재조명을 가능케 한다. 따라서 본 연구는 영상으로부터 노말맵과 알베도맵을 추정한 뒤, 이를 이용하여 영상 기반 렌더링하는 영상 재조명 방법을 제안한다. 조건부 적대적 생성망을 다양한 조명 환경에서 렌더링된 3차원 오브젝트 영상들과 그에 대응하는 노말맵, 알베도맵을 이용해 학습함으로써, 임의의 영상에 대한 노말맵과 알베도맵 추정기를 생성한다. 이를 통해 추정된 노말맵과 알베도맵은 3차원 공간상에서 새로운 광원에 대해 렌더링됨으로써 재조명 영상을 생성한다. 마지막으로, 영상 기반으로 재조명된 영상과 ground truth와의 비교 실험을 통해 본 연구에서 제안한 방법이 유효함을 확인한다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 1999.05a
• /
• pp.203-207
• /
• 1999

In this paper we propose the automated generation algorithm of penetration scenario using association mining technique. Until now known intrusion detections are classified into anomaly detection and misuse detection. The former uses statistical method, features selection, neural network method in order to decide intrusion, the latter uses conditional probability, expert system, state transition analysis, pattern matching for deciding intrusion. In proposed many intrusion detection algorithms unknown penetrations are created and updated by security experts. Our algorithm automatically generates penetration scenarios applying association mining technique to state transition technique. Association mining technique discovers efficient and useful unknown information in existing data. In this paper the algorithm we propose can automatically generate penetration scenarios to have been produced by security experts and is easy to cope with intrusions when it is compared to existing intrusion algorithms. Also It has advantage that maintenance cost is not high.

• Korean Journal of Remote Sensing
• /
• v.38 no.6_1
• /
• pp.1357-1369
• /
• 2022

Cloud removal is an essential image processing step for any task requiring time-series optical images, such as vegetation monitoring and change detection. This paper presents a two-stage cloud removal method that combines conditional generative adversarial networks (cGANs) with regression-based calibration to construct a cloud-free time-series optical image set. In the first stage, the cGANs generate initial prediction results using quantitative relationships between optical and synthetic aperture radar images. In the second stage, the relationships between the predicted results and the actual values in non-cloud areas are first quantified via random forest-based regression modeling and then used to calibrate the cGAN-based prediction results. The potential of the proposed method was evaluated from a cloud removal experiment using Sentinel-2 and COSMO-SkyMed images in the rice field cultivation area of Gimje. The cGAN model could effectively predict the reflectance values in the cloud-contaminated rice fields where severe changes in physical surface conditions happened. Moreover, the regression-based calibration in the second stage could improve the prediction accuracy, compared with a regression-based cloud removal method using a supplementary image that is temporally distant from the target image. These experimental results indicate that the proposed method can be effectively applied to restore cloud-contaminated areas when cloud-free optical images are unavailable for environmental monitoring.

• Journal of the Korea Society for Simulation
• /
• v.33 no.1
• /
• pp.19-26
• /
• 2024

The phase-type, PH, distribution is defined as the time to absorption into a terminal state in a continuous-time Markov chain. As the PH distribution includes family of exponential distributions, it has been widely used in stochastic models. Since the PH distribution is represented and generated by an initial probability vector and a generator matrix which is called the Markovian representation, we need to find a vector and a matrix that are consistent with given set of moments if we want simulate a PH distribution. In this paper, we propose an approach to simulate a PH distribution based on distribution function which can be obtained directly from moments. For the simulation of PH distribution of order 2, closed-form formula and streamlined procedures are given based on the Jordan decomposition and the minimal Laplace transform which is computationally more efficient than the moment matching methods for the Markovian representation. Our approach can be used more effectively than the Markovian representation in generating higher order PH distribution in queueing network simulation.

• Journal of KIISE:Software and Applications
• /
• v.33 no.10
• /
• pp.877-885
• /
• 2006

Recently it is proposed that the Bayesian networks used as conversational agent for topic inference is useful but the Bayesian networks require much time to model, and the Bayesian networks also have to be modified when the scripts, the database for conversation, are added or modified and this hinders the scalability of the agent. This paper presents a method to improve the scalability of the agent by constructing the Bayesian network from scripts automatically. The proposed method is to model the structure of Bayesian networks hierarchically and to utilize Noisy-OR gate to form the conditional probability distribution table (CPT). Experimental results with ten subjects confirm the usefulness of the proposed method.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.10a
• /
• pp.90-93
• /
• 1998

입？출력 데이터 쌍만을 이용하여 규칙 및 소속 함수를 자동적으로 결정하는 자기 학습 퍼지 알고리즘 중에서, 가장 이해하기 용이하고 퍼지 규칙 및 소속 함수 생성이 빠른 방법으로 기울기 강하를 이용한 방법들이 있다. 기울기 강하를 이용한 방법중에서 가장 대표적인 Araki가 제안한 방법은 퍼지 조건부가 퍼지 집합 형태이고 결론부는 단일값으로 구성된 알고리즘으로써 입력 퍼지 공간을 세분화하면서 시스템을 규명해나가는 간단하면서도 효율적인 알고리즘이다. 그러나 이 방법은 퍼지 입력 변수가 증가하면 퍼지 공간이 세분화 되면서 소속 함수 및 규칙 생성 개수가 급격히 제곱배로 증가하는 문제점을 가지고 있다. 따라서, 본 논문에서는 퍼지 입력 변수가 증가함에 따라 급격히 퍼지 규칙 및 소속 함수의 수가 증가하는 Araki 알고리즘의 문제점을 분석하여 소속 함수 및 규칙 수의 급격한 증가를 억제하고 Araki 방법에 비해 학습속도가 현저히 향상된 새로운 방안을 제안한다. 연구 결과, Arki 방법이 입력 변수의 개수가 증가 할수록 규칙 수가 기하 급수적으로 많이 필요하였던 것에 비해 제안한 방법은 훨씬 적은 규칙 수로 우수한 성능을 얻을 \ulcorner 있었다.

• Journal of KIISE
• /
• v.41 no.11
• /
• pp.927-934
• /
• 2014

In this paper, we propose an effective method for recognizing daily human activities from a stream of three dimensional body poses, which can be obtained by using Kinect-like RGB-D sensors. The body pose data provided by Kinect SDK or OpenNI may suffer from both the view variance problem and the scale variance problem, since they are represented in the 3D Cartesian coordinate system, the origin of which is located on the center of Kinect. In order to resolve the problem and get the view-invariant and scale-invariant features, we transform the pose data into the spherical coordinate system of which the origin is placed on the center of the subject's hip, and then perform on them the scale normalization using the length of the subject's arm. In order to represent effectively complex internal structures of high-level daily activities, we utilize Hidden state Conditional Random Field (HCRF), which is one of probabilistic graphical models. Through various experiments using two different datasets, KAD-70 and CAD-60, we showed the high performance of our method and the implementation system.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.22 no.2
• /
• pp.239-248
• /
• 2012

VANET (Vehicular Ad-hoc Network) is a type of MANET (Mobile Ad-hoc Network) which is the next-generation networking technology to provide communication between vehicles or between vehicle and RSU (Road Side Unit) using wireless communication. In VANET system, a vehicle accident is likely to cause awful disaster. Therefore, in VANET environment, authentication techniques for the privacy protection and message are needed. In order to provide them privacy, authentication, and conditional, non-repudiation features of the group signature scheme using a variety of security technologies are being studied. In this paper, and withdrawal of group members to avoid frequent VANET environment is suitable for vehicles produced by the group administrator for a private signing key to solve the key escrow problem of a group signature scheme is proposed. We proposed a message batch verification scheme using Bloom Filter that can verify multiple messages efficiently even for multiple communications with many vehicles.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.26 no.2B
• /
• pp.139-144
• /
• 2006

Using DNS data for turbulent flows in an open-channel with sidewalls, the mechanisms by which secondary flows are generated and by which Reynolds shear stresses are created, are demonstrated. Near the sidewall, secondary flows invading towards the sidewall are observed in the regions of both lower and upper corners, while secondary flows ejecting from the sidewall towards the center of the channel are created elsewhere. The distributions of Reynolds shear stresses near the sidewall are analyzed, connecting their productions with coherent structures. A quadrant analysis shows that sweeps are dominant in two corner regions where secondary flows invading towards the sidewall are generated, but that ejections are dominant in the region where secondary flows ejecting towards the center of the channel are created. Also, conditional quadrant analyses reveal that the productions of Reynolds shear stresses and the patterns of secondary flows are determined by the directional tendencies of coherent structures.

• The Korean Journal of Applied Statistics
• /
• v.10 no.1
• /
• pp.151-161
• /
• 1997

An easy Monte Carlo Gibbs sampling approach is suggested for Bayesian analysis of cumulative logit models for ordinal polytomous data. Because in the cumulative logit model the posterior conditional distributions of parameters are not given in convenient forms for random sample generation, appropriate latent variables are introduced into the model so that in the new model all the conditional distributions are given in very convenient forms for implementation of the Gibbs sampler.