• Geophysics and Geophysical Exploration
• /
• v.14 no.3
• /
• pp.203-213
• /
• 2011

Time-lapse seismic surveys make repeated seismic surveys at different stages of oil production of a hydrocarbon reservoir to monitor changes in reservoir like fluid saturation. Since the repeatable surface seismic measurements can identify fluid types and map fluid saturations, oil and gas companies can make much more informed decision during not only production but also drilling and development. If time-lapse seismic surveys compare 3D seismic surveys, the time-lapse surveys are widely called as 4D seismic. A meaningful time-lapse interpretation is based on the repeatability of seismic surveys, which mainly depends on improved positioning and reduced noise (if surveys were designed properly through a feasibility study). The time-lapse interpretation can help oil and gas companies to maximize oil and gas recovery. This paper discusses about time-lapse seismic surveys mainly focused on feasibility, repeatability, data processing and interpretation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.11C
• /
• pp.929-939
• /
• 2010

The growth of multimedia technology forces the development of video detection for large database management and illegal copy detection. To meet this demand, this paper proposes a fast video detection method to apply to a large database. The fast video detection algorithm uses spatial features using the gray value distribution from frames and temporal features using the temporal similarity map. We form the video signature using the extracted spatial feature and temporal feature, and carry out a stepwise matching method. The performance was evaluated by accuracy, extraction and matching time, and signature size using the original videos and their modified versions such as brightness change, lossy compression, text/logo overlay. We show empirical parameter selection and the experimental results for the simple matching method using only spatial feature and compare the results with existing algorithms. According to the experimental results, the proposed method has good performance in accuracy, processing time, and signature size. Therefore, the proposed fast detection algorithm is suitable for video detection with the large database.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.9 no.11
• /
• pp.1317-1322
• /
• 2014

To complete an image, it is needed to go through the process to capture the actual actor's motion and compose it with virtual environment. Due to the excessive cost for production or lack of post-processing technology, however, it is mostly conducted by manual labor. The actor plays his role depending on his own imagination at the virtual chromakey studio, and at that time, he has to move considering the possible collision with or reaction to an object that does not exist. And in the process of composition applying CG, when the actor's motion does not go with the virtual environment, the original image may have to be discarded and it is necessary to remake the film. The current study suggested and realized depth-based real-time 3D virtual image composition system to reduce the ratio of remaking the film, shorten the production time, and lower the production cost. As it is possible to figure out the mutual collision or reaction by composing the virtual background, 3D model, and the actual actor in real time at the site of filming, the actor's wrong position or acting can be corrected right there instantly.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.366-369
• /
• 2005

Background subtraction is mainly used for the real-time extraction and tracking of moving objects from image sequences. In the outdoor environment, there are many changeable factor such as gradually changing illumination, swaying trees and suddenly moving objects, which are to be considered for the adaptive processing. Normally, GMM(Gaussian Mixture Model) is used to subtract the background adaptively considering the various changes in the scenes, and the adaptive GMMs improving the real-time performance were worked. This paper, for on-line background subtraction, applied the improved adaptive GMM, which uses the small constant for learning rate ${\alpha}$ and is not able to speedily adapt the suddenly movement of objects, So, this paper proposed and evaluated the dynamic control method of ${\alpha}$ using the adaptive selection of the number of component distributions and the global variances of pixel values.

• KIPS Transactions on Software and Data Engineering
• /
• v.6 no.1
• /
• pp.23-28
• /
• 2017

Shape from focus (SFF) is a technique used to reconstruct 3D shape of objects from a sequence of images obtained at different focus settings of the lens. In this paper, a new shape from focus method for 3D reconstruction of microscopic objects is described, which is based on gradient operator in Mathematical Morphology. Conventionally, in SFF methods, a single focus measure is used for measuring the focus quality. Due to the complex shape and texture of microscopic objects, single measure based operators are not sufficient, so we propose morphological operators with multi-structuring elements for computing the focus values. Finally, an optimal focus measure is obtained by combining the response of all focus measures. The experimental results showed that the proposed algorithm has provided more accurate depth maps than the existing methods in terms of three-dimensional shape recovery.

• The KIPS Transactions:PartB
• /
• v.12B no.4 s.100
• /
• pp.429-436
• /
• 2005

A simple stereo matching algorithm using population-based incremental learning(PBIL) is proposed in this paper to decrease the general problem of genetic algorithms, such as memory consumption and inefficiency of search. PBIL is a variation of genetic algorithms using stochastic search and competitive teaming based on a probability vector. The structure of PBIL is simpler than that of other genetic algorithm families, such as serial and parallel ones, due to the use of a probability vector. The PBIL strategy is simplified and adapted for stereo matching circumstances. Thus, gene pool, chromosome crossover, and gene mutation we removed, while the evolution rule, that fitter chromosomes should have higher survival probabilities, is preserved. As a result, memory space is decreased, matching rules are simplified and computation cost is reduced. In addition, a scheme controlling the distance of neighbors for disparity smoothness is inserted to obtain a wide-area consistency of disparities, like a result of coarse-to-fine matchers. Because of this scheme, the proposed algorithm can produce a stable disparity map with a small fixed-size window. Finally, an alterative version of the proposed algorithm without using probability vector is also presented for simpler set-ups.

• The KIPS Transactions:PartD
• /
• v.8D no.6
• /
• pp.853-860
• /
• 2001

In the object-oriented software development, redesigning of classes and reorganizing of class hierarchy structures should be necessary to reduce many of the headaches of object-oriented software design and maintenance. To support this task, in this paper, we propose a theoretical foundation for class hierarchy reorganizations that is relatively complete, correct, formal and easy to understand and use. We introduce the flattened class hierarchy that characterizes the class hierarchy structures in object-oriented software evolution. And we also present an algorithm which transforms a given class hierarchy into the normalized form. The flattened class hierarchy helps us map the inheritance and aggregation paths in a class hierarchy to paths in an object hierarchy that is an instance of the class hierarchy. By applying the algorithm into a given class hierarchy, we can make a new, object-preserved, and flattened class hierarchy that is the cornerstone for reorganization of class hierarchy structure and plays an important role as a bridge on the incremental evolutionary changes and reuse of object-oriented software to reorganize class hierarchies.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2005.05a
• /
• pp.266-273
• /
• 2005

Data mining techniques enable us to generate useful information for decision support from the data sources which are generated and accumulated in the process of routine organizational management activities. College administration system is a typical example that produces a warehouse of student records as each and every student enters a college and undertakes the curricular and extracurricular activities. So far, these data have been utilized to a very limited student service purposes, such as issuance of transcripts, graduation evaluation, GPA calculation, etc. In this paper, we utilize Holland career search test results, TOEIC score, course work list, and GPA score as the input for data mining and generation the student advisory information. Factor analysis, AHP(Analytic Hierarchy Process), artificial neural net, and CART(Classification And Regression Tree) techniques are deployed in the data mining process. Since these data mining techniques are very powerful in processing and discovering useful knowledge and information from large scale student databases, we can expect a highly sophisticated student advisory knowledge and services which may not be obtained with the human student advice experts.

• The KIPS Transactions:PartB
• /
• v.14B no.6
• /
• pp.401-406
• /
• 2007

This study discusses the development of a u-Health care system that can detect quickly and cope actively with emergent situations of chronic disease patients who lead everyday life. If a patient's emergent situation is detected by personal health care host(PHCH), which is composed of acceleration and vibration sensors, GPS, and CDMA communication module, a text message on the patient's current location is transmitted to the hospital and the guardian's mobile terminal so that they can cope with the situation immediately. Especially, the system analyzes data from sensors by using neural network and determines emergent situations such as syncope and convulsion promptly. The exact location of patients can also be found in the electronic map by using GPS information. The experiments show that this system is very effective to find emergencies promptly for chronic disease patients who cannot take care of themselves and it is expected to save many lives.

• The KIPS Transactions:PartB
• /
• v.15B no.1
• /
• pp.9-16
• /
• 2008

In this paper, we present an algorithm for synthesizing intermediate view image from a stereoscopic pair of images. An image of multiview is need for people in order to easily recognize 3D image. However, if many cameras are use for that, not only does system get more complicated but also transmission rating cause a big trouble. Hence, stereo images are photograph and issue on the sending side and algorithm to generate several intermediate view image is able to be use on the receiving side. The proposed method is based on disparity space image. First of all, disparity space image that is depicted by the gap of pixel followed by disparity of stereo image is generated. Disparity map is made by utilizing disparity space image for searching for optimal disparity path then eventual intermediate view image is generated after occlusion region which does not match is processed. Experimental results illustrate the performance of the proposed technique and we obtained a high quality image of more than 30 dB PSNR.