• Journal of Korea Port Economic Association
• /
• v.26 no.2
• /
• pp.19-35
• /
• 2010

The purpose of this paper is to develop a benchmark of performance standards for Global Logistics Provider in the merging logistics market. The Data Envelopment Analysis (DEA) can be employed to compare and analyse the efficiencies of Global Logistics Provider(3PL, 4PL). That is because Global Logistics Providers are able to reach the highest level of efficiency by using Logistics institutions and Logistics service systematically. This research is focused on analyzing the efficiencies of top 40 Global Logistics Providers. The framework assumes that the Providers use three inputs to produce one output. The inputs include number of employees information system, and number of warehouses. The output is the annual turnover. The results show that Panalpina, C.H. Robinson Worldwide, Maersk Logistics/Damco, Hub Group, Lander Global Logistics on Global Logistics Providers are the efficient providers. This paper also allows the inefficient DMUs to establish their benchmarking strategies. The strategies are dependent on the assets such as number of employees, information system, and number of warehouses.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.40 no.1
• /
• pp.30-38
• /
• 2003

This paper presents an efficient region-based motion segmentation method for segmenting of moving objects in a traffic scene with a focus on a Video Monitoring System (VMS). The presented method consists of two phases: motion detection and motion segmentation. Using the adaptive thresholding technique, the differences between two consecutive frames are analyzed to detect the movements of objects in a scene. To segment the detected regions into meaningful objects which have the similar intensity and motion information, the regions are initially segmented using a k-means clustering algorithm and then, the neighboring regions with the similar motion information are merged. Since we deal with not the whole image, but the detected regions in the segmentation phase, the computational cost is reduced dramatically. Experimental results demonstrate robustness in the occlusions among multiple moving objects and the change in environmental conditions as well.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.3
• /
• pp.237-246
• /
• 2001

A high speed context-free marker-controlled and minima imposition-free watershed transform is proposed for efficient multi-object detection and segmentation from a complex background. The context-free markers are extracted from a complex backgrounded multi-object image using a noise tolerant attention operator. These make marker-controlled watershed possible for the over-segmentation reduction without region merging. The proposed method presents a marker-constrained labeling that can speed up the segmentation of a marker-controlled watershed transform by eliminating the necessity of the minima imposition. Simulation results show that the proposed method can efficiently detects and segments multiple objects from a complex background while reducing over- segmentation and the computation time.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.7
• /
• pp.104-115
• /
• 1999

This paper proposes an efficient method for 3D modeling of a human face from trinocular images by reconstructing face surface using range data. By using a trinocular camera system, we mitigated the tradeoff between the occlusion problem and the range resolution limitation which is the critical limitation in binocular camera system. We also propose an MPC_MBS (Matching Pixel Count Multiple Baseline Stereo) area-based matching method to reduce boundary overreach phenomenon and to improve both of accuracy and precision in matching. In this method, the computing time can be reduced significantly by removing the redundancies. In the model generation sub-pixel accurate surface data are achieved by 2D interpolation of disparity values, and are sampled to make regular triangular meshes. The data size of the triangular mesh model can be controlled by merging the vertices that lie on the same plane within user defined error threshold.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.41 no.1
• /
• pp.38-46
• /
• 2004

Image segmentation is the task which partitions the image into meaningful regions and considered to be one of the most important steps in computer vision and image processing. Image segmentation is also widely used in object-based video compression such as MPEG-4 to extract out the object regions from the given frame. Watershed algorithm is frequently used to obtain the more accurate region boundaries. But, it is well known that the watershed algorithm is extremely sensitive to gradient noise and usually results in oversegmentation. To solve such a problem, we propose an image segmentation method which is robust to noise by using stabilized inverse diffusion equation (SIDE) and is more efficient in segmentation by employing multiresolution approach. In this paper, we apply both the region projection method using labels of adjacent regions and the region merging method based on region adjacency graph (RAG). Experimental results on noisy image show that the oversegmenation is reduced and segmentation efficiency is increased.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.5
• /
• pp.25-34
• /
• 2010

By introducing additional nodes called Steiner points, the problem of Steiner Minimum Tree whose length can be shorter than Minimum Spanning Tree and which connects all input terminal nodes belongs to Non-Polynomial Complete domain. Though diverse heuristic methods can be applied to the problem, most of them may meet serious pains in computing and waiting for a solution of the problem with numerous input nodes. For numerous input nodes, an efficient PTAS approximation method producing candidate unit steiner trees with portals in most bottom layer, merging them hierarchically to construct their parent steiner trees in upper layer and building swiftly final approximation Steiner tree in most top layer is suggested in this paper. The experiment with 16,000 input nodes and designed 16 unit areas in most bottom layer shows 85.4% execution time improvement in serial processing and 98.9% in parallel processing comparing with pure Steiner heuristic method, though 0.24% overhead of tree length. Therefore, the suggested PTAS Steiner tree method can have a wide range applications to build a large scale approximation Steiner tree quickly.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.44 no.10
• /
• pp.49-54
• /
• 2007

As digital contents based on 3D graphics are increased, the requirement for low power 3D graphic hardware for mobile devices is increased. We design a transformation engine for mobile 3D graphic processor. We propose a simplified transformation engine for mobile 3D graphic processor. The area of the transformation engine is reduced by merging a mapping transformation unit into a projective transformation unit and by replacing a clipping unit with a selection unit. It consists of a viewing transformation unit a projective transformation unit a divide by w nit, and a selection unit. It can process 32 bit floating point format of the IEEE-754 standard or a reduced 24 bit floating point format. It has a pipelined architecture so that a vertex is processed every 4 cycles except for the initial latency. The RTL code is verified using an FPGA.

• The Journal of the Convergence on Culture Technology
• /
• v.6 no.1
• /
• pp.255-261
• /
• 2020

Versatile and innovative interdisciplinary professionals refer to those who can engage in an efficient cooperation with experts in other fields or to those who can themselves put knowledge of different fields together. This article aims to look into Galileo Galilei as an example of historic figure that made remarkable achievements by merging knowledge in multiple fields of study. It also shows that Galileo, who had active exchange with painters during the Renaissance, presented the findings from his telescope observations in the form of drawings and that he used them to build core logics that criticizes the traditional Aristotelian cosmology. Galileo drew the critical logics, hardly achievable from a simple observation report or mathematical demonstration, from his hand drawing. The Galileo case well proposes the goals and direction of how the modern society should nurture its interdisciplinary professionals today.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.5
• /
• pp.61-69
• /
• 2014

Collaborative filtering recommendation creates similar item subset or similar user subset based on user preference about items and predict user preference to particular item by using them. Thus, if preference matrix has low density, reliability of recommendation will be sharply decreased. To solve these problems we suggest Hybrid Preference Prediction Technique Using Weighting based Data Reliability. Preference prediction is carried out by creating similar item subset and similar user subset and predicting user preference by each subset and merging each predictive value by weighting point applying model condition. According to this technique, we can increase accuracy of user preference prediction and implement recommendation system which can provide highly reliable recommendation when density of preference matrix is low. Efficiency of this system is verified by Mean Absolute Error. Proposed technique shows average 21.7% improvement than Hao Ji's technique when preference matrix sparsity is more than 84% through experiment.

• The Bulletin of The Korean Astronomical Society
• /
• v.37 no.2
• /
• pp.98.2-98.2
• /
• 2012

We firstly present the unified Far-UV continuum map of the Taurus-Auriga-Perseus (TPA) complex, one of the largest local associations of dark cloud located in (l, b)=([154,180], [-28, -2]), by merging both FIMS and GALEX. The FUV continuum map shows that dust extinction correlate well with the FUV around the complex. It shows strong absorption in FUV toward the dense Taurus cloud while it does not in California cloud. It turned out that it is related to the relative location of each cloud and Perseus OB2 association. We also present some results of dust scattering simulation based on Monte Carlo Radiative Transfer technique (MCRT). Through this dust scattering simulation, we have derived the scattering parameter for this region, albedo(a)=$0.42^{+0.05}{_{-0.05}}$, asymmetry factor(g)=$0.47^{+0.11}{_{-0.27}}$. The optical parameters we obtained seem reasonable compared to the theoretical model values ~0.40 and ~0.65 for the albedo and the phase function though the phase function is rather small. Using the result of simulation, we figured out the geometries of each cloud in the complex region, especially their distances and thicknesses. Our predictions from the results are in good agreement with the previous studies related to the TPA complex. For example, the Taurus cloud is within ~200pc from the Sun and the Perseus seems to be multi-layered, at least two. The California cloud is more distant than the other cloud on average at ~350 pc and Auriga cloud seems to be between the Taurus cloud and the eastern end of the California cloud. We figured out that across the TPA complex region, there might be some correlation between the LSR velocity and the distance to each cloud in the complex.