• Korean Journal of Computational Design and Engineering
• /
• v.6 no.1
• /
• pp.24-30
• /
• 2001

An efficient and robust algorithm to compute the exact Voronoi diagram of a circle set is presented. The circles are located in a two dimensional Euclidean space, the radii of the circles are non-negative and not necessarily equal, and the circles are allowed to intersect each other. The idea of the algorithm is to use the topology of the point set Voronoi diagram as a seed so that the correct topology of the circle set Voronoi diagram can be obtained through a number of edge flipping operations. Then, the geometries of the Voronoi edges of the circle set Voronoi diagram are computed. In particular, this paper discusses the topological aspect of the algorithm, and the following paper discusses the geometrical aspect. The main advantages of the proposed algorithm are in its robustness, speed, and the simplicity in its concept as well as implementation. Since the algorithm is based on the result of the point set Voronoi diagram and the flipping operation is the only topological operation, the algorithm is always as stable as the Voronoi diagram construction algorithm of a point set.

• Proceedings of the Society of Korea Industrial and System Engineering Conference
• /
• 2002.05a
• /
• pp.467-472
• /
• 2002

Presented in this paper is an algorithm to compute the Voronoi diagram of a circle set from the Voronoi diagram of a point set. The circles are located in Euclidean plane, the radii of the circles are non-negative and not necessarily equal, and the circles are allowed to intersect each other. The idea of the algorithm is to use the topology of the point set Voronoi diagram as a seed so that the correct topology of the circle set Voronoi diagram can be obtained through a number of edge flipping operations. Then, the geometries of the Voronoi edges of the circle set Voronoi diagram are computed. The main advantages of the proposed algorithm are in its robustness, speed, and the simplicity in its concept as well as implementation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.12
• /
• pp.6017-6037
• /
• 2017

In a multi-resolution image encoding system, the image is encoded into a single file as a layer of bit streams, and then it is transmitted layer by layer progressively to reduce the transmission time across a low bandwidth connection. This encoding scheme is also suitable for multiple decoders, each with different capabilities ranging from a handheld device to a PC. In our previous work, we proposed an edge adaptive hierarchical interpolation algorithm for multi-resolution image coding system. In this paper, we enhanced its compression efficiency by adding three major components. First, its prediction accuracy is improved using context adaptive error modeling as a feedback. Second, the conditional probability of prediction errors is sharpened by removing the sign redundancy among local prediction errors by applying sign flipping. Third, the conditional probability is sharpened further by reducing the number of distinct error symbols using error remapping function. Experimental results on benchmark data sets reveal that the enhanced algorithm achieves a better compression bit rate than our previous algorithm and other algorithms. It is shown that compression bit rate is much better for images that are rich in directional edges and textures. The enhanced algorithm also shows better rate-distortion performance and visual quality at the intermediate stages of progressive image transmission.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.25 no.6
• /
• pp.572-579
• /
• 2022

The analysis of foreign aircraft appearing suddenly in air defense identification zones requires a lot of cost and time. This study aims to develop a pre-trained model that can identify neighboring military aircraft based on aircraft photographs available on the web and present a model that can determine which aircraft corresponds to based on aerial photographs taken by allies. The advantages of this model are to reduce the cost and time required for model classification by proposing a pre-trained model and to improve the performance of the classifier by data augmentation of edge-detected images, cropping, flipping and so on.

• Journal of Biosystems Engineering
• /
• v.41 no.3
• /
• pp.201-207
• /
• 2016

Purpose: A water-spraying type automatic glochids removal system for cactus (Opuntia humifusa) stem was developed, and its performance was evaluated. The system was developed to reduce intensive human labor in removing glochids from cactus stem skin without inducing damage prior to further processing into value-added products. Methods: The developed system consists of conveyor and water-spraying systems. The conveyor system delivers cactus stems through water-spraying compartments and finally to a collecting box. In order to remove the glochids, rotating nozzles spray water over all areas (i.e., front and back faces and sides) of the cactus skin under controlled water pressure. Operating conditions such as conveyor speed, water pressure, angle of water-spraying nozzles, distance between conveyor belt and rotating nozzles, and angle of cactus flipping slide were adopted from our previous study and applied on the system design and manufacturing. The performance of glochids removal was evaluated by counting the number of glochids on the cactus stem before and after processing on the system. Results: The developed system performed efficiently and effectively under the pre-studied operating conditions except for the angle of cactus flipping slide. The new system had a glochids removal ratio of 94.1% without damaging the cactus skin. Considering the original number (approximately 30-60) of glochids, the remaining number was low (1-4), and most of them were found at the side edge of the cactus stem. This system can remove glochids from 360 cactus stems in 1 hr regardless of cactus size. Conclusions: The performance of the new system in glochids removal without damaging cactus skin is superior to any other existing device (i.e., brush type, rubber-friction type, and agitation type). The system is expected to be applied in cactus (O. humifusa) processing facilities.

• Journal of Information Processing Systems
• /
• v.20 no.1
• /
• pp.24-37
• /
• 2024

To address the requirement for high-speed encryption of large amounts of data, this study improves the widely adopted cipher block chaining (CBC) mode and proposes a controllable parallel cipher block chaining (CPCBC) block cipher mode of operation. The mode consists of two phases: extension and parallel encryption. In the extension phase, the degree of parallelism n is determined as needed. In the parallel encryption phase, n cipher blocks generated in the expansion phase are used as the initialization vectors to open n parallel encryption chains for parallel encryption. The security analysis demonstrates that CPCBC mode can enhance the resistance to byte-flipping attacks and padding oracle attacks if parallelism n is kept secret. Security has been improved when compared to the traditional CBC mode. Performance analysis reveals that this scheme has an almost linear acceleration ratio in the case of encrypting a large amount of data. Compared with the conventional CBC mode, the encryption speed is significantly faster.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.18 no.2
• /
• pp.123-131
• /
• 2005

According to ow previous study, we confirmed That the Petrov-Galerkin natural element method(PG-NEM) completely resolves the numerical integration inaccuracy in the conventional Bubnov-Galerkin natural element method(BG-NEM). This paper is an extension of PG-NEM to two-dimensional geometrically nonlinear problem. For the analysis, a linearized total Lagrangian formulation is approximated with the PS-NEM. At every load step, the grid points ate updated and the shape functions are reproduced from the relocated nodal distribution. This process enables the PG-NEM to provide more accurate and robust approximations. The representative numerical experiments performed by the test Fortran program, and the numerical results confirmed that the PG-NEM effectively and accurately approximates The large deformation problem.

• Tunnel and Underground Space
• /
• v.29 no.3
• /
• pp.184-196
• /
• 2019

This study aims to extract a 3D image of micro-cracks generated by hydraulic fracturing tests, using the deep learning method and X-ray computed tomography images. The pixel-level cracks are difficult to be detected via conventional image processing methods, such as global thresholding, canny edge detection, and the region growing method. Thus, the convolutional neural network-based encoder-decoder network is adapted to extract and analyze the micro-crack quantitatively. The number of training data can be acquired by dividing, rotating, and flipping images and the optimum combination for the image augmentation method is verified. Application of the optimal image augmentation method shows enhanced performance for not only the validation dataset but also the test dataset. In addition, the influence of the original number of training data to the performance of the deep learning-based neural network is confirmed, and it leads to succeed the pixel-level crack detection.