• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.2
• /
• pp.825-836
• /
• 2016

In this paper, a speed-up technique for the non-local means (NLM) image denoising method based on local binary descriptor (LBD) is proposed. In the NLM, most of the computation time is spent on searching for non-local similar patches in the search window. The local binary descriptor which represents the structure of patch as binary strings is employed to speed up the search process in the NLM. The descriptor allows for a fast and accurate preselection of non-local similar patches by bitwise operations. Using this approach, a tradeoff between time-saving and noise removal can be obtained. Simulations exhibit that despite being principally constructed for speed, the proposed algorithm outperforms in terms of denoising quality as well. Furthermore, a parallel implementation on GPU brings NLM-LBD to real-time image denoising.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.10 no.2
• /
• pp.257-266
• /
• 1999

In this paper, a spline-type divided-difference interpolation technique is proposed to efficiently evaluate the impedance matrix elements in the MoM analysis of layered medium problems. This method is combined with the fast computational method of the basis-expanded and tested dyadic Green's functions (expressed in the spectral domain integrals) in a recent literature. For the sake of its validity, the proposed method is applied to analyze the characteristics of a microstrip gap discontinuity, a microstrip filter, and an aperture coupled patch antenna. Numerical results obtained by this approach are in good agreement with those of other approaches.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2001.10a
• /
• pp.287-294
• /
• 2001

In static analysis of a variety of structures, the matrix method of structural analysis is the most widely used and powerful analysis method. However, this method has drawback requiring high-performance computers with many memory units and fast processing units in the case of analyzing complex and large structures accurately. Therefore, it's very difficult to analyze these structures accurately in personal computers. For overcoming the drawback of the matrix method of structural analysis, authors suggest transfer stiffness coefficient method(TSCM). The TSCM is very suitable to a personal computer because the concept of the TSCM is based on the transfer of the stiffness coefficient for an analytical structure. In this paper, the static analysis algorithm for frame structures is formulated by the TSCM. We confirm the validity of the proposed method through the compare of computation results by the TSCM and the NASTRAN.

• Korean Journal of Computational Design and Engineering
• /
• v.12 no.6
• /
• pp.413-421
• /
• 2007

3D rendering is becoming a common feature of mobile application programs with the rapid advance of mobile devices. Since the existing rendering engines do not provide triangulation functions, mobile 3D programs have focused on an efficient handling with pre-tessellated geometry. In addition, triangulation is comparatively expensive in computation, so it seems that the triangulation cannot be easily implemented on mobile devices with limited resources. Triangulation of 3D geometry is the essential process of visualization of 3D model data and many different triangulation methods have been reported. We developed a light and fast visualization process that involves constrained triangulation based on Voronoi diagram and applied it to a mobile computer application. In this paper, we applied kd-tree to the original incremental construction algorithm and produced new O(nlogn) incremental construction algorithm. And we show a simple and efficient constrained triangulation method based on Voronoi diagram. This paper also describes an implementation of mobile STEP data viewer as an application of our proposed algorithms.

• International Journal of Contents
• /
• v.11 no.2
• /
• pp.1-8
• /
• 2015

In this paper, we describe a novel method for document layout analysis that is based on a Fuzzy Energy Matrix (FEM). A FEM is a two-dimensional matrix that contains the likelihood of text and non-text and is generated through the use of Fuzzy theory. The key idea is to define an Energy map for the document to categorize text and non-text. The proposed mechanism is designed for execution with a low-resolution document image, and hence our method has a fast processing speed. The proposed method has been tested on public ICDAR 2009 datasets to conduct a comparison against other state-of-the-art methods, and it was also tested with Korean documents. The results of the experiment indicate that this scheme achieves superior segmentation accuracy, in terms of both precision and recall, and also requires less time for computation than other state-of-the-art document image analysis methods.

• Journal of the Korean Society for Railway
• /
• v.8 no.1
• /
• pp.1-5
• /
• 2005

This paper has presented the parallel cyclic redundancy check (CRC) technique that performs CRC computation in parallel superior to the conventional CRC technique that processes data bits serially. Also, it has showed that the implemented parallel CRC circuit has been successfully applied to the inductively coupled passive RFTD system working at a frequency of 13.56㎒ in order to process the detection of logical faults more fast and the system has been verified experimentally. In comparison with previous works, the proposed RFID system using the parallel CRC technique has been shown to reduce the latency and increase the data processing rates about 15％ In the results. Therefore, it seems reasonable to conclude that the parallel CRC realization in the RFID system offers a means of maintaining the integrity of data in the high speed RFID system.

• Proceedings of the KSR Conference
• /
• 2004.10a
• /
• pp.1235-1240
• /
• 2004

This paper has presented the parallel cyclic redundancy check (CRC) technique that performs CRC computation in parallel superior to the conventional CRC technique that processes data bits serially. Also, it has showed that the implemented parallel CRC circuit had been successfully applied to the inductively coupled passive RFID system working at a frequency of 13.56MHz in order to process the detection of logical faults more fast and the system had been verified experimentally. In comparison with previous works, the proposed RFID system using the parallel CRC technique has been shown to reduce the latency and increase the data processing rates in the results. Therefore, it seems reasonable to conclude that the parallel CRC realization in the RFID system offers a means of maintaining the integrity of data in the high speed RFID system.

• Journal of the Korean Society for Railway
• /
• v.13 no.6
• /
• pp.601-607
• /
• 2010

The objective of this paper is to propose a fast and easy Binary Artificial Bee Colony (BABC) heuristic algorithm to optimize NP-hard scheduling problem of railway track maintenance considering real conditions. The optimal or best solutions can be found using proposed BABC within very short or user specified computation time. We can greatly maximize the objective value using this proposed method in 30, 60, 100 and 200 work size railway track maintenance scheduling problems for experiment and analysis.

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.1539-1542
• /
• 2002

In layout of LSI and PWB, block pack- ing problem is very important in order to reduce chip area. Sequence-pair is typical one of conventional pack- ing method and can search nearly-optimal solution by using Simulated Annealing(SA). SA takes huge computation time due to evaluating of various packing results. Therefore, Sequence-pair is not effective enough for fast layout evaluation including estimation of wire length and rotation of every blocks. This paper proposes an efficient block packing method to minimize wire length and chip area. Our method searches an optimal packing efficient- ly by using a cluster growth algorithm with changing the most valuable packing score on packing process.

• Journal of Navigation and Port Research
• /
• v.33 no.2
• /
• pp.143-151
• /
• 2009

The field of vehicle routing is currently growing rapidly because of many actual applications in truckload and less than truckload trucking, courier services, door to door services, and many other problems that generally hinder the optimization of transportation costs in a logistics network. The rapidly increasing number of customers in such a network has caused problems such as difficulty in cost optimization in terms of getting a global optimum solution in an acceptable time. Fast algorithms are needed to find sufficient solutions in a limited time that can be used for real time scheduling. In this paper, the nearest L-method (NLNM) is proposed to obtain a vehicle routing solution. String neighbors of different lengths were chosen, tested and compared. The applied de crossing procedure is meant to solve the routes by NLNM by giving a better solution and shorter computation time than that of NLNM with long string neighbors.