• Fibers and Polymers
• /
• v.6 no.2
• /
• pp.156-161
• /
• 2005

The gray line-profile method is introduced to find fabric density. Some patterned fabrics like stripe design as well as solid fabrics of basic weave structures are used to verify the efficiency and accuracy of the method. The approach is compared with Fourier transform method. Although the gray line-profile method is concise, it shows good results in both solid and patterned fabrics. In addition, it does not require a pre-processing or filtering technique in space or frequency domain to enhance the image suitable for the analysis. However, the approach is slightly influenced by the filter size for finding the local minimums of profile graph.

• Journal of IKEEE
• /
• v.13 no.4
• /
• pp.1-7
• /
• 2009

A video segmentation algorithm, which can extract objects even with non-stationary backgrounds, is proposed in this work. The proposed algorithm is composed of three steps. First, we perform an initial segmentation interactively to build the probability density functions of colors per each macro block via kernel density estimation. Then, for each subsequent frame, we construct a coherence strip, which is likely to contain the object contour, by exploiting spatio-temporal correlations. Finally, we perform the segmentation by minimizing an energy function composed of color, coherence, and smoothness terms. Experimental results on various test sequences show that the proposed algorithm provides accurate segmentation results.

• Proceedings of the Korean Nuclear Society Conference
• /
• 1995.10a
• /
• pp.254-259
• /
• 1995

Large scale display panel(LSDP) is a main component in the next generation main control rooms. LSDP is located at the front of VDU-based operator's workstation and plays an important role in providing operators with overall information of plant status through mimic diagram, text/digit, graph, and so on. A critical matter determined at the first stage of LSDP design is how much information is displayed, because the information density of LSDP affects operator's performance. Many human factors guidelines recommend low information density of displays to avoid degrade of operator's performance, but doesn't provide a useful limit of information density. In this paper, we considered information density as the number of plant parameters and investigated the proper number of plant parameters through a human factors experiment. The experiment with 4 subjects was carried out and response time, error, and heart rate variation as criterion measures were recorded and analyzed. As the results, it is identified that the proper number of parameters in a LSDP is about thirty.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.9 no.6
• /
• pp.788-794
• /
• 1985

A study on the number density in a dual beam LDV is carried out with moving particles of various irregular arrangements. Ratious of the particle diameter to the particle to the fringe Spacing are D/.delta. = 0.3, 0.5, 1.0 and 1.5. In the case of the small number of moving particles(N<10), the visibility is influenced much by the difference of the phase of particles for one side fringe and the change in visibility is shown remarkable. In the case of the larger number of particles, the decreasing rate for visibility on the graph is smooth because the effect of the phase difference of particles is decreased by more unitorm distribution of particles over fringes. And the formula of the number density on the basis of probability is fairly compared with experimental values.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.10C
• /
• pp.935-941
• /
• 2007

In this paper, we suggest the power allocation method which enhances the performance in high SNR for LDPC codes. In this method, bit power is unequally allocated proportionally to the difference of the degree distributions of variable and check nodes of Tanner graph between practically used codes and the codes optimized by density evolution. Simulation is performed to the codes in IEEE 802.16e standards, and the results show that the proposed method works well in high SNR.

• Journal of the Regional Association of Architectural Institute of Korea
• /
• v.21 no.3
• /
• pp.11-21
• /
• 2019

The purpose of this study was to present an analysis model for finding the correlation between visibility and evacuation time as users move in the outpatient department of the general hospital. The spatial scope of the study was limited to the first floor and second floor which are used for the outpatient department. Traffic density in outpatient departments was surveyed on site. Based on the surveyed traffic density, the evacuation simulation model was established for calculating the escape route and evacuation time for an individual user. The traffic density of the outpatient department as per the evacuation time was also calculated. With using evacuation simulations, the flow of evacuees was calculated through the density of traffic over the time of evacuation. Visibility data were set in the simulation model for users' escape routes. A correlation analysis between the product of evacuation flow measure and visibility measure of the evacuation population and evacuation time was performed. The analysis result showed negative correlation within a specific distance range. This study presented an analysis model showing that the evacuation condition considering spatial visibility in the outpatient department of general hospital visibility was negatively related to the analyzed evacuation time at the design stage.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.34C no.7
• /
• pp.9-17
• /
• 1997

This paper proposes a routing model based on the HVHD for four-layer routing problems. Differing from the HVHV and HVHH models, the proposed HVHD model permits diagonal routing on the fourth laye rwith a grid of 45.deg., 90.deg. and 135.deg. directions. The developed algorithm which uses a channel-graph including weights routes a layer using diagonal model and the othe rthree layers using HVH model. Applications to several benchmark examples verify that approximately 10~25 percent reduction of channel density can be achieved compared to the conventional four-layer channel routing algorithms.

• ETRI Journal
• /
• v.31 no.2
• /
• pp.240-242
• /
• 2009

A computationally efficient implementation of the progressive edge-growth algorithm is presented. This implementation uses an array of red-black (RB) trees to manage the layered structure of check nodes and adopts a new strategy to expand the Tanner graph. The complexity analysis and the simulation results show that the proposed approach reduces the computational effort effectively. In constructing a low-density parity check code with a length of $10^4$, the RB-tree-array-based implementation takes no more 10% of the time required by the original method.

• Proceedings of the KIEE Conference
• /
• 1988.07a
• /
• pp.595-598
• /
• 1988

In this paper, a new folding algorithm for design of high density PLA's is proposed. This algorithm generates transform matrix so that programmed region of each row becomes narrow. Based on transform matrix, folding pair is selected. In the process of generating transform matrix, interval degree and dense degree are used to improve folding ratio. This paper also proposes an efficient folding pair graph which has short time of selection folding pair. This proposed algorithm is named PLAFOLII and implemented in C language on VAX-11/750 (UNIX) computer. Through various example, efficiency of this algorithm is verified.

• The Journal of Korea Robotics Society
• /
• v.17 no.4
• /
• pp.407-416
• /
• 2022

Multiple AMRs have been proved to be effective in improving warehouse productivity by eliminating workers' wasteful walking time. Although Multi-agent Path Finding (MAPF)-based solution is an optimal approach for this task, its deployment in practice is challenging mainly due to its imperfect plan-execution capabilities and insufficient computing resources for high-density environments. In this paper, we present a MAPF-based fleet management system architecture that robustly manages multiple robots by re-computing their paths whenever it is necessary. To achieve this, we defined four events that trigger our MAPF solver framework to generate new paths. These paths are then delivered to each AMR through ROS2 message topic. We also optimized a graph structure that effectively captures spatial information of the warehouse. By using this graph structure we can reduce computational burden while keeping its rescheduling functionality. With proposed MAPF-based fleet management system, we can control AMRs without collision or deadlock. We applied our fleet management system to the real logistics warehouse with 10 AMRs and observed that it works without a problem. We also present the usage statistic of adopting AMRs with proposed fleet management system to the warehouse. We show that it is useful over 25% of daily working time.