• Journal of KIISE:Software and Applications
• /
• v.34 no.1
• /
• pp.59-69
• /
• 2007

In the video with a various environment, background modeling is important for extraction and recognition the moving object. For this object recognition, many methods of the background modeling are proposed in a process of preprocess. Among these there is a Kumar method which represents the Queue-based background modeling. Because this has a fixed period of updating examination of the frame, there is a limit for various system. This paper use a background modeling based on the queue. We propose the method that major parameters are decided as adaptive by background model. They are the queue size of the sliding window, the sire of grouping by the brightness of the visual and the period of updating examination of the frame. In order to determine the factors, in every process, RCO (Ratio of Correct Object), REO (Ratio of Error Object) and UR (Update Ratio) are considered to be the standard of evaluation. The proposed method can improve the existing techniques of the background modeling which is unfit for the real-time processing and recognize the object more efficient.

• Journal of Digital Convergence
• /
• v.14 no.8
• /
• pp.261-267
• /
• 2016

In this paper, we studied the range-free localization algorithm between sensor nodes based on the Radical Line for sensor networks. Routing in wireless sensor networks should reduce the overall energy consumption of the sensor network, or induce equivalent energy consumption of all the sensor nodes. In particular, when the amount of data to send more data, the energy consumption becomes worse. New methods have been proposed to address this. So as to allow evenly control the overall energy consumption. For this, the paper covers designing a localization algorithm that can obtain the location information of the peripheral nodes with fewer operations. For the operation of the algorithm is applicable Radical Line. The experimental environment is windows 7, the Visual C ++ 2010, MSSQL 2008. The experimental results could be localized to perform an error rate of 0.1837.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.5
• /
• pp.1153-1161
• /
• 1997

In this paper, we propose Teloemedicine system on CBM(Computer Based Multimedia) based collaborative multimedia which supports special medicine and collaborative medicine with DB, face-to-face dffedt.This system is an application developed by SDK (Software Development Kit) of DooRae(Distributed Objected Oriented Multimedia Application Crafting Environment for Collaborative)framework.And this system is devel-Oriented Multimedia Applecation Crafting Environment for Collaborative) framework, And this system is devel-oped on windows 95 and windows NT.The scenario of this system is limited within only hospital(LAN), but it is possibloe to support many applications development in various nerwork(MAN, PSYN, WAN)on DooRae.This system has a smoth interaction by video and audio, multiple session, multiple participation, application sharing, toolbox including ICON and whiteboard.Also this system supports realo or non-real type without con-straint of the and space.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.2A
• /
• pp.137-145
• /
• 2002

In the method of 3D modeling, stereo matching method which obtains three dimensional depth information from the two images is taken from the different view points. In general, it is very essential work for the 3D modeling from 2D stereo images to estimate the exact disparity through fading the conjugate pair of pixel from the left and right image. In this paper to solve the problems of the stereo image disparity estimation, we introduce a novel approach method to improve the exactness and efficiency of the disparity. In the first place, we perform a wavelet transformation of the stereo images and set the reference points in the image by the feature-based matching method. This reference points have very high probability over 95 %. In the base of these reference points we can decide the size of the variable block searching windows for estimating dense disparity of area based method and perform the ordering constraint to prevent mismatching. By doing this, we could estimate the disparity in a short time and solve the occlusion caused by applying the fried-sized windows and probable error caused by repeating patterns.

• Convergence Security Journal
• /
• v.8 no.4
• /
• pp.65-71
• /
• 2008

According to the capacity of hard disk drive is increasing day by day, the amount of data that forensic investigators should analyze is also increasing. This trend need tremendous time and effort in determining which files are important as evidence on computers. Using the file system APIs provided by Windows system is the easy way to identify those files. This method, however, requires a large amount of time as the number of files increase and changes the access time of files. Moreover, some files cannot be accessed due to the use of operating system. To resolve these problems, forensic analysis should be conducted by using the Master File Table (MFT). In this paper, We implement the file access program which interprets the MFT information in NTFS file system. We also extensibly compare the program with the previous method. Experimental results show that the presented program reduces the file access time then others. As a result, The file access method using MFT information is forensically sound and also alleviates the investigation time.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.24 no.5
• /
• pp.861-870
• /
• 2014

According to the intelligence of the malicious code to extract the executable file in physical memory is emerging as an import researh issue. In previous physical memory studies on executable file extraction which is targeting running files, they are not extracted as same as original file saved in disc. Therefore, we need a method that can extract files as same as original one saved in disc and also can analyze file-information loaded in physical memory. In this paper, we provide a method that executable file extraction by analyzing information of Windows kernel file object. Also we analyze the characteristic of physical memory loaded file data from the experiment and we demonstrate superiority because the suggested method can effectively extract more of original file data than the existing method.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.2
• /
• pp.295-303
• /
• 2004

In this Paper, we discuss an active TCP link of unsynchronized transmission mode network in two-way traffic and the Improvement of its traffic patron thorough the network pathway of protocol is shown. This is because the traffic pattern is performed on the basis of existing windows which are distributing information in several periods of time in the way of interfacing LTS control module, which is controlling by an information of exceeding the time limit of feedback loop determined by RTP, with TCP. The simulation to utilize this efficiently is performed with the circumstance of bench mark based on physical modeling of the self-similarity traffic in the performance of TCP. In this paper, we use a methodology to understand and evaluate the effect of change of transmitting protocol in sticks under the condition of the self-similar traffic in two-way network and it is shown that an improvement of congestion control by self-similarity under a heavy condition.

• Journal of KIISE:Software and Applications
• /
• v.31 no.2
• /
• pp.213-223
• /
• 2004

In this paper, we propose a new face detection method for real-time applications. It is based on the template-matching and appearance-based method. At first, we apply Min-max normalization with histogram equalization to the input image according to the variation of intensity. By applying the PCA transform to both the input image and template, PC components are obtained and they are applied to the LDA transform. Then, we estimate the distances between the input image and template, and we select one region which has the smallest distance. SVM is used for final decision whether the candidate face region is a real face or not. Since we detect a face region not the full region but within the $\pm$12 search window, our method shows a good speed and detection rate. Through the experiments with 6 category input videos, our algorithm shows the better performance than the existing methods that use only the PCA transform. and the PCA and LDA transform.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.10
• /
• pp.2596-2604
• /
• 1997

There are two kinds of backends in ACK:code generator(full-fledged backend) and code expander(fast backend). Code generators generate target code using string pattern matching and code expanders generate target code using macro expansion. ACK translates EM to SPARC code using code expander. The corresponding SPARC code sequences for a EM code are generated and then push-pop optimization is performed. But, there is the problem of maintaining hybrid stack. And code expander is not considered to passes parameters of a procedure call through register windows. The purpose of this paper is to improve SPARC code quality. We suggest a method of SPARC cod generation using EM tree. Our method is divided into two phases:EM tree building phase and code expansion phase. The EM tree building phase creates the EM tree and code expansion phase translates it into SPARC code. EM tree is designed to pass parameters of a procedure call through register windows. To remove hybrid stack, we extract an additional information from EM code. We improved many disadvantages that arise from code expander in ACK.

• Journal of KIISE:Computing Practices and Letters
• /
• v.7 no.4
• /
• pp.299-308
• /
• 2001

The company invests its time and money for temporary maintenance to satisfy the fast change of the computer use environment and the user's demands. Therefore, various problems occur including low performance because of duplication of codes and unstable structures from the restructuring and redevelopment. Furthermore, if a developer, who did not participate in initial process of development, wrote additional program codes to upgrade or restructure, it would cause many problems such as lack or lose of development documentation, understanding of documentation and reuse of existing program language. This study, Object-oriented Refactoring Process, suggests that the developers can reuse object unit to overcome the limit of the reusing code. In addition, this paper shows case study to verify our process by adjusting the project called "D2D", which is a case tool for developing windows system from Company D. Our works get positive results such as improvement of system pelfonnance, decreased cost of development and maintenance and optimizing structure and class.