• Nuclear Engineering and Technology
• /
• v.50 no.1
• /
• pp.25-34
• /
• 2018

The CINDER code has about 60 years of development history, and is thus one of the world's best transmutation computing codes to date. Unfortunately, it is complex and cumbersome to use. Preparing auxiliary input files for activation computation from MCNPX output and executing them using Perl script (activation script) is the first difficulty, and separation of gamma source computing script (gamma script), which analyzes the spectra files produced by CINDER code and creates source definition format for MCNPX code, is the second difficulty. In addition, for highly nonlinear problems, multiple human interventions may increase the possibility of errors. Postprocessing such as making plots with large text outputs is also time consuming. One way to improve these limitations is to make a graphical user interface wrapper that includes all codes, such as MCNPX and CINDER, and all scripts with a visual C#.NET tool. The graphical user interface merges all the codes and provides easy postprocessing of graphics data and Microsoft office tools, such as Excel sheets, which make the CINDER code easy to use. This study describes the VCINDER code (with visual C#.NET) and gives a typical application example.

• Journal of Korean Society for Geospatial Information Science
• /
• v.3 no.2 s.6
• /
• pp.221-225
• /
• 1995

Unauthorized users cant acquire and enough accuracy in applications of the navigation or geodesy by the single GPS positioning technique because of the measurement errors and US DoDs intentional errors. The solution of these restrictions is the Dgps technique that is to eliminate the common errors between the reference station and the desired point and can achieve a high accuracy. DGPS postprocessing system is implemented by using the offset distances between the known position of a reference station and the position obtained from GPS satellite data. The preliminary experiments include static tests and a dynamic test of cruising a ship.

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.1424-1427
• /
• 2002

This paper proposes a novel postprocessing algorithm for reducing the blocking artifacts in low bit rate block-based transform coded images, that use adaptive neural network filter (NNF) in wavelet transform domain. n this algorithm, after performing a 2-level wavelet transform of the decompressed image, the existence of locking artifacts is determined using statistical characteristic of neighborhood blocks. And then a different one-dimensional (1-D) or 2-D NNF is used to reduce the locking artifacts according to the classified regions. That is, for HL and LH subbands regions with the blocking artifacts, a different 1-D NNF is used. And 2-D NNF is used in HH subband. Experimental results show that the proposed algorithm produced better results than those of conventional algorithms both subjectively and objectively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.7
• /
• pp.1685-1695
• /
• 1996

The postprocessing of compressed images based on the projections onto convex sets and the constrained minimization imposes several constraints on the procesed data. The quantization constraint has been commonly used in various algorithms. Quantization is many-to-one mapping, by which all the dat in a quantization region are mapped to the corresponding representative level. The basic idea behind the projection onto the QCS(quantization constraint set) is to prevent the processed data from diverging from the original quantization region in order to redue the artifacts caused by filtering in postprocessing. However, there have been few efforts to analye the POQCS(projection onto the QCS). This paper analyzed mathematically the POQCS of filtered data from the viewpoint of minimizing the mean square error. Our analysis shows that a proper filtering technique followed by the POQCS can reduce the quantization distortion. In the conventional POQCS, the outside data of each quantization region are mapped into the corresponding boundary. Our analysis also shows that mappingthe outside data to the boundary of a subregion of the quantization region yields lower distortion than does the mapping to the boundary of the original region. In addition, several examples and discussions on the theory are introduced.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.3C
• /
• pp.257-263
• /
• 2003

Error control and concealment in video communication is becoming increasingly important because transmission errors can cause single or multiple loss of macroblocks in video delivery over unreliable channels such as wireless networks and the internet. This paper describes a temporal error concealment by postprocessing. Lost image blocks are overlapped block motion compensated (OBMC) using median of motion vectors from adjacent blocks at the decoder. The results show a significant improvement over zero motion error concealment and other temporal concealment methods such as Motion Vector Rational Interpolation or Side Match Criterion OBMC by 1.4 to 3.5㏈ gain in PSNR. We present experimental results showing improvements in PSNR and computational complexity.

• Journal of Institute of Control, Robotics and Systems
• /
• v.9 no.7
• /
• pp.498-506
• /
• 2003

A computer vision system applied to an intelligent safety vehicle has been required to be worked on a small sized real time special purposed hardware not on a general purposed computer. In addition, the system should have a high reliability even under the adverse road traffic environment. This paper presents a design and an implementation of an onboard hardware system taking into account for high speed image processing to analyze a road traffic scene. The system is mainly composed of two parts: an early processing module of FPGA and a postprocessing module of DSP. The early processing module is designed to extract several image primitives such as the intensity of a gray level image and edge attributes in a real-time Especially, the module is optimized for the Sobel edge operation. The postprocessing module of DSP utilizes the image features from the early processing module for making image understanding or image analysis of a road traffic scene. The performance of the proposed system is evaluated by an experiment of a lane-related information extraction. The experiment shows the successful results of image processing speed of twenty-five frames of 320$\times$240 pixels per second.

• Journal of the Korean Society for Precision Engineering
• /
• v.12 no.7
• /
• pp.32-45
• /
• 1995

In this paper, we present a new method to tool path planning problem for rough cut of pocket milling operations. The key idea is to formulate the tool path problem into a TSP (Travelling Salesman Problem) so that the powerful neural network approach can be effectively applied. Specifically, our method is composed of three procedures: a) discretization of the pocket area into a finite number of tool points, b) neural network approach (called SOM-Self Organizing Map) for path finding, and c) postprocessing for path smoothing and feedrate adjustment. By the neural network procedure, an efficient tool path (in the sense of path length and tool retraction) can be robustly obtained for any arbitrary shaped pockets with many islands. In the postprocessing, a) the detailed shape of the path is fine tuned by eliminating sharp corners of the path segments, and b) any cross-overs between the path segments and islands. With the determined tool path, the feedrate adjustment is finally performed for legitimate motion without requiring excessive cutting forces. The validity and powerfulness of the algorithm is demonstrated through various computer simulations and real machining.

• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.334-336
• /
• 2004

The postprocessing of fingerprint images is widely used in the elimination of the false minutiae caused by skeletonization. This paper presents the images were duplicated by The SOFM. And this Method showed that the good performance of eliminating false minutiae and fast processing.

• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 1997.10a
• /
• pp.278-283
• /
• 1997

This paper proposes a systematic design method for axial(or thrust) magnetic bearings using optimal design methodology. The objective of the optimal design is to minimize bearing volume. The constraints include the bearing load capacity, linearized bearing stiffness and damping, the magnetic flux density, and geometric relations. In order to obtain design values which can be applied to fabrication of bearings, branch and bound method was introduced in the postprocessing procedure of optimal design results. Verification of the proposed design methodology was perfomed by an example.

• Proceedings of the Korea Concrete Institute Conference
• /
• 1994.10a
• /
• pp.261-266
• /
• 1994

The objective of this study is to develop the expert system for R/C box culvert design. This program provided various functions to improve automatic design. The program is composed of five steps. The characteristics of each step are as follows; 1) Preprocessing Step, 2) Analysis Step, 3) View of Memberforce Step, 4) Postprocessing Step, 5) Printing of Design-Sheet Step. Finally, Expert System and Knowledge Database System is developed for the drawing of optimal R/C box-culvert design.