• Journal of the Korea Society of Computer and Information
• /
• v.26 no.1
• /
• pp.45-55
• /
• 2021

This paper has proposed an algorithm that detecting for dense small vehicle in large image efficiently. It is consisted of two Ensemble Deep-Learning Network algorithms based on Coarse to Fine method. The system can detect vehicle exactly on selected sub image. In the Coarse step, it can make Voting Space using the result of various Deep-Learning Network individually. To select sub-region, it makes Voting Map by to combine each Voting Space. In the Fine step, the sub-region selected in the Coarse step is transferred to final Deep-Learning Network. The sub-region can be defined by using dynamic windows. In this paper, pre-defined mapping table has used to define dynamic windows for perspective road image. Identity judgment of vehicle moving on each sub-region is determined by closest center point of bottom of the detected vehicle's box information. And it is tracked by vehicle's box information on the continuous images. The proposed algorithm has evaluated for performance of detection and cost in real time using day and night images captured by CCTV on the road.

• Journal of Korea Multimedia Society
• /
• v.8 no.4
• /
• pp.502-508
• /
• 2005

This paper proposes a dynamic hybrid patching technique that can improve the performance of VOD systems by adopting the advantages of both greedy patching and grace patching to use a VOD server's limited network-I/O bandwidth. The proposed technique uses grace patching to the requests for the videos, arrival intervals of which are smaller than the size of patching window, and uses greedy patching to the rest requests. In addition, proposed patching technique expands the latest particular patching multicast into a regular multicast for a new request. In result, the patching multicast data for the new request can be the data from the beginning to the skew point of the video and the holding time of a dispatched channel can exceedingly decrease. Simulation results confirm that the proposed technique is better than grace patching in terms of defection rate and average service latency.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.2
• /
• pp.60-67
• /
• 2009

Analyzing protein-protein interactions(PPI) is an important task in bioinformatics as it can help in new drugs' discovery process. However, due to vast amount of PPI data and their complexity, efficient visualization of the data is still remained as a challenging problem. We have developed efficient and effective visualization system that integrates Gene Ontology(GO) and PPI network to provide better insights to scientists. To provide efficient data visualization, we have employed dynamic interactive graph drawing methods and context-based browsing strategy. In addition, quick and flexible cross-reference system between GO and PPI; LCA(Least Common Ancestor) finding for GO; and etc are supported as special features. In terms of interface, our visualization system provides two separate graphical windows side-by-side for GO graphs and PPI network, and also provides cross-reference functions between them.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.5
• /
• pp.943-950
• /
• 2005

Recently, many of researches on stream transmission for satisfying each of different real-time transmission condition of the multimedia data that demands various service quality through high-speed networks have been studied actively. In this paper, we design a scheme that discriminately reserves the network resources for the transmission of each multimedia application and propose a bandwidth allocation scheme for improving the utilization ratio of free resources. And we also propose a pipelining scheme for providing flexible real-time transmission. The proposed schemes can be used to support a real-time transmission by applying feedback transmission control method based on receiving buffer for guaranteeing the synchronization conditions requested by the multimedia data. Moreover, we propose a transmission control scheme that can take the amount of network resources down to the minimum amount within the range of permissible error-range under the guarantee with no quality degradation simultaneously when the bottleneck is caused by the network congestion. Finally, we propose a dynamic bandwidth smoothing scheme that can smooth the maximum bandwidth to the demand of each video steam for giving continuous transmission to the delay sensitive video steam between senders and receivers.

• KIPS Transactions on Software and Data Engineering
• /
• v.8 no.4
• /
• pp.171-178
• /
• 2019

The use of anti-scatter grids in radiographic imaging has the advantage of preventing the image distortion caused by scattered radiation. However, it carries the side effect of leaving artifacts in the X-ray image. In this paper, we propose a grid line suppression technique using discrete cosine transform(DCT). In X-ray images, the grid lines have different characteristics depending on the shape of the object and the area of the image. To solve this problem, we adopt the DCT transform based on a dynamic segmentation, and propose a filter transfer function for each individual segment. An algorithm for detecting the band of grid lines in frequency domain and a band stop filter(BSF) with a filter transfer function of a combination of Kaiser window and Butterworth filter have been proposed. To solve the blocking effects, we present a method to determine the pixel values using multiple structured images. The validity of the proposed theory has been evaluated from the experimental results using 140 X-ray images.

• Journal of Korea Society of Industrial Information Systems
• /
• v.28 no.4
• /
• pp.21-34
• /
• 2023

Federated Learning is divided into synchronous federated learning and asynchronous federated learning. Asynchronous federated learning has a time advantage over synchronous federated learning, but asynchronous federated learning still has some challenges to obtain better performance. In particular, preventing performance degradation in non-IID training datasets, selecting appropriate clients, and managing stale gradient information are important for improving model performance. In this paper, we deal with K-asynchronous federated learning by using non-IID datasets. In addition, unlike traditional method using static K, we proposed an algorithm that adaptively adjusts K and we can reduce the learning time. Additionally, the we show that model performance is improved by using stale gradient handling method. Finally, we use a method of judging model performance to obtain strong model stability. Experiment results show that overall algorithm can obtain advantages of reducing training time, improving model accuracy, and improving model stability.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.6C
• /
• pp.848-856
• /
• 2004

In this paper, a fast stereo matching algorithm based on pixel-wise matching strategy, which can get a stable and accurate disparity map, is proposed. Since a stereo image pair has small differences each other and the differences between left and right images are just caused by horizontal shifts with some order, the matching using a large window will not be needed within a given search range. However, disparity results of conventional pixel-based matching methods are somewhat unstable and wrinkled, the principal direction of disparities is checked by the accumulated cost along a path on array with the dynamic programming method. Experimental results showed that the proposed method could remove almost all disparity noise and set a good quality disparity map in very short time.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.27 no.4
• /
• pp.721-729
• /
• 2017

In order to take rapid action against malware, efficiency in malware analysis is essential. For instance, it would be helpful to identify and eliminate open-source function bodies or other safe portions out of the target binary codes. In this paper, we propose an tool to create open source dynamic link library files in Windows environment, extract signature information by opensource and compiler version, and compare open source function information to find suspicious function. In addition, the tool can save the information used in the comparison to the DB and use it later, reducing the analysis time overhead.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.1
• /
• pp.128-133
• /
• 2005

Respond time and processing rate representing how many tasks can be done during an unit time in a client/server environment are generally use for measuring the performance of computers. In this paper, we suggest a window buffer managing scheme based on a window with many of short-term sliced slots where a media stream is allocated and deallocated into them so that it can maximize the utilization ration of the limited buffer on a multimedia server. And we also propose a buffer substitution scheme for reducing I/O times of a multimedia server by counting re-reference time point about a used block and then it can be reused by the next consecutive media stream.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.05a
• /
• pp.273-276
• /
• 2003

In this study, Automatic Speech Recognition Application System is designed and implemented to realize transformation from present GUI-centered web services to VUI-centered web service. Due to ASP's restriction with web in speed and implantation, in this study, Automatic Speech Recognition Application System with Java beans Component Architecture is devised and studied. Also the voice web browsing which is able to transfer voice and graphic information simultaneously is studied using Remote AWT(Abstract Windows Toolkit).