• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.33A no.3
• /
• pp.47-54
• /
• 1996

In this paper we propose a new timing recovery method by means of utilizing service data filling rate instead of timing information of transmitter. A proposed algorithm controls the phase locked loop in the opposite direction ot data filling rate of FIFO in receiver, and it is based on the fact that average of cell jitters is zero. The proposed method is simple compared with timing information method of transmitter. It can be utilized for timing recovery in synchronous digital hierarchy as well as in plesiochronous digial hierarchy without common reference clocks in end-to-end erminals. We implement the interactive video communication system and test the proposed algorithm. As a result, we hav econfirmed that it yields good perfomrnces in terms of jitters characteristics and hardware complexity.

• Journal of Information Processing Systems
• /
• v.19 no.4
• /
• pp.540-553
• /
• 2023

The hollow letter CAPTCHA (Completely Automated Public Turing test to tell Computers and Humans Apart) is an optimized version of solid CAPTCHA, specifically designed to weaken characteristic information and increase the difficulty of machine recognition. Although convolutional neural networks can solve CAPTCHA in a single step, a good attack result heavily relies on sufficient training data. To address this challenge, we propose a seed filling algorithm that converts hollow characters to solid ones after contour line restoration and applies three rounds of detection to remove noise background by eliminating noise blocks. Subsequently, we utilize a support vector machine to construct a feature vector for recognition. Security analysis and experiments show the effectiveness of this algorithm during the pre-processing stage, providing favorable conditions for subsequent recognition tasks and enhancing the accuracy of recognition for hollow CAPTCHA.

• Journal of the Korean Geosynthetics Society
• /
• v.17 no.1
• /
• pp.119-126
• /
• 2018

The ground cavity occurring in the downtown area is on the increase. However, when ground subsidence is occurred or a cavity that causes it to occur is found, time and economic difficulties are follwed in recovery. In advance, this study conducted to develop filling system for reinforcement material which is consist of polymer pouch and admixture as a new filler material. We developed a polymer pouch that is water soluble in the precedent study. Since the filling system is trenchless method and don't need any plant, it has time and economic benefits. This system uses air pressure to filling out cavity in a short time. We estimate this system with respect to filling speed and filling ratio by model experiment. In addition, we could confirm various filling condition using DEM Analysis. So, we could develop filling system and analysis it.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.1B
• /
• pp.86-100
• /
• 2004

To provide the end-to-end service differentiation for assured services, the random early demotion and promotion (REDP) marker in the edge router at each domain boundary monitors the aggregate flow of the incoming in-profile packets and demotes in-profile packets or promotes the previously demoted in-profile packets at the aggregate flow level according to the negotiated interdomain service level agreement (SLA). The REDP marker achieves UDP fairness in demoting and promoting packets through random and early marking decisions on packets. But, TCP fairness of the REDP marker is not obvious as for UDP sources. In this paper, to improve TCP fairness of the REDP marker, we propose a modified REDP marker where we combine a dropper, meters and a token filling rate configuration component with the REDP marker. To make packet transmission rates of TCP flows more fair, at the aggregate flow level the combined dropper drops incoming excessive in-profile packets randomly with a constant probability when the token level in the leaky bucket stays in demotion region without incoming demoted in-profile packets. Considering the case where the token level cannot stay in demotion region without the prior demotion, we propose a token filling rate configuration method using traffic meters. By using the token filling rate configuration method, the modified REDP marker newly configures a token filling rate which is less than the negotiated rate determined by interdomain SLA and larger than the current input aggregate in-profile traffic rate. Then, with the newly configured token filling rate, the token level in the modified REDP marker can stay in demotion region pertinently fir the operation of the dropper to improve TCP fairness. We experiment with the modified REDP marker using ns2 simulator fur TCP sources at the general case where the token level cannot stay in demotion region without the prior demotion at the negotiated rate set as the bottleneck link bandwidth. The simulation results demonstrate that through the combined dropper with the newly configured token filling rate, the modified REDP marker also increases both aggregate in-profile throughput and link utilization in addition to TCP fairness improvement compared to the REDP marker.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.8 no.4
• /
• pp.91-101
• /
• 2005

To determine stream network and watershed boundary using DEM, it is necessary to remove sink and flat area in proper way. There are filling algorithm and breaching algorithm to remove sink and Jenson and Domingue algorithm, relief algorithm and combined gradient algorithm to determine flow direction in flat area. In this study, the algorithms are reviewed. The computer program which uses filling algorithm with breaching algorithm and combined gradient algorithm to remove errors in DEM is developed. The results from this program are compared with Arc/Info which uses filling algorithm and Jenson and Domingue algorithm. The characteristics of stream network extracted from the DEM are analyzed. They are compared with the stream from NGIS map for stream morphology and characters by stream order to examine the value of this study.

• Journal of KIISE
• /
• v.44 no.2
• /
• pp.186-194
• /
• 2017

Depth-image-based rendering is a technique that can be applied in a variety of 3D-display systems. It generates the images that have been captured from virtual viewpoints by using a depth map. However, disoccluded hole-filling problems remain a challenging issue, as a newly exposed area appears in the virtual view. Image inpainting is a popular approach for the filling of the hole region. This paper presents a robust hole-filling method that reduces the error and generates a high quality-virtual view. First, the adaptive-patch size is decided using the color and depth information. Also, a partial filling method for which the patch similarity is used is proposed. These efforts reduce the error occurrence and the propagation. The experiment results show that the proposed method synthesizes the virtual view with a higher visual comfort compared with the existing methods.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.328-331
• /
• 2007

In this paper, the capacity of the clustered response model for correlated MIMO-OFDM fading channel is investigated. We compare the capacities achieved by correlation at receiver and achieved by correlation at both the transmitter and the receiver for the case where the channel is known and unknown at the transmitter are considered. It is found that the capacity achieved by correlation at receiver is better than the other. It is also shown that the capacity using the water-filling methed is larger than that using the uniform power allocation due to the water-filling gain. But it is negligible when the number of clusters is over the maximum rank of the sum correlation matrix and SNR is high.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.10
• /
• pp.3642-3667
• /
• 2021

Texture synthesis technology has the advantages of repairing texture and structure at the same time. However, during the filling process, the size of the patch is fixed, and the content of the filling is not fully considered. In order to be able to adaptively change the patch size, we used the exemplar-based inpainting technique as the test algorithm, considering the image structure and texture, calculated the image structure patch size and texture patch size, and comprehensively determined the image patch size. This can adaptively change the patch size according to the filling content. In addition, we use multi-layer images to calculate the priority, so that the order of image repair was more stable. The proposed repair algorithm is compared with other image repair algorithms. The experimental results showed that the proposed adaptive image repair algorithm can better repair the texture and structure of the image, which proved the effectiveness of the proposed algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.9
• /
• pp.4145-4164
• /
• 2016

Energy harvesting is an increasingly attractive source of power for cellular networks, and can be a promising solution for green networks. In this paper, we consider a cellular network with power beacons powering multiple mobile terminals with microwave power transfer in energy beamforming. In this network, the power beacons are powered by grid and renewable energy jointly. We adopt a dual-level control architecture, in which controllers collect information for a core controller, and the core controller has a real-time global view of the network. By implementing the water filling optimized power allocation strategy, the core controller optimizes the energy allocation among mobile terminals within the same cluster. In the proposed green energy cooperation paradigm, power beacons dynamically share their renewable energy by locally injecting/drawing renewable energy into/from other power beacons via the core controller. Then, we propose a new water filling optimized green energy cooperation management strategy, which jointly exploits water filling optimized power allocation strategy and green energy cooperation in cellular networks. Finally, we validate our works by simulations and show that the proposed water filling optimized green energy cooperation management strategy can achieve about 10% gains of MT's average rate and about 20% reduction of on-grid energy consumption.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.7
• /
• pp.53-65
• /
• 2012

Existing method of creating Stereoscopy image, creates viewpoint image from the left and right by shooting one object with 2 lens in certain distance. However, in case of 3-D TV using Stereoscopy camera, the necessity to transmit 2 viewpoint images from the left and right simultaneously, increases the amount of bandwidth. Various and more effective alternatives are under discussion. Among the alternatives, DIBR(Depth Image Based Rendering) creates viewpoint images from the left and right using one image and its Depth information, thus decreasing the amount of transmitted bandwidth. For this reason, there have been various studies on Algorithm to create DIBR Image in existing Static Scene. In this paper, I would like to suggest Gaussian Hole-filling solution, which utilizes reverse-depth image to fill the hole naturally, while minimizing distortion of background. In addition, we have analyzed the effectiveness of each Algorithm by comparing and calculating its functions.