• Journal of the Korean Operations Research and Management Science Society
• /
• v.42 no.1
• /
• pp.43-52
• /
• 2017

We consider the order consolidation problem that arises in production systems where customer orders are processed in batches. The problem involves maximizing the number of batches while satisfying the following conditions: (i) the total quantity processed in each batch must be above a prescribed level; (ii) the quantity in an order can be split and processed in more than one batches; (iii) each batch can include up to two different orders but can do so only when the two orders are compatible pair. This problem is known to be NP-hard and max-SNP hard. In this study, we develop an approximation algorithm with factor 1/3.

• Journal of Korea Multimedia Society
• /
• v.21 no.3
• /
• pp.333-341
• /
• 2018

In this paper, we propose an algorithm to automatically detect gait's joints. The proposed method classifies gait's types into front gait and flank gait so as to automatically detect gait's joints. And then according to classified types, the proposed applies joint extracting algorithm to input images. Firstly, we split input images into foreground image using difference images of Hue and gray-scale image of input and background one and extract gait's object. The proposed method classifies gaits into front gait and flank gait using ratio of Face's width to torso's width. Then classified gait's type, joints are detected 10 at front gait and detected 7~8 at flank gait. The proposed method is applied to the camera's input and the result shows that the proposed method automatically extracts joints.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.23 no.3
• /
• pp.49-62
• /
• 1998

In the ring loading problem, traffic demands are given for each pair of nodes in an undirected ring network with n nodes and a flow is routed in either of the two directions, clockwise and counter-clockwise. The load of a link is the sum of the flows routed through the link and the objective of the Problem is to minimize the maximum load on the ring. In the ring loading problem with integer demand splitting, each demand can be split between the two directions and the flow routed in each direction is restricted to integers. Recently, Vachani et al. ［INFORMS J. Computing 8 (1996) 235-242］ have developed an Ο(n$^3$) algorithm for solving this integer version of the ring loading problem and independently, Schrijver et al. ［to appear in SIAM J. Disc. Math.］ have presented an algorithm which solves the problem with ｛0,1｝ demands in Ο（n$^2$｜K｜ ) time where K denotes the index set of the origin-desㅇtination pairs of nodes having flow demands. In this paper, we develop an algorithm which solves the problem in Ο(n ｜K｜) time.

• Proceedings of the KOSOMBE Conference
• /
• v.1989 no.05
• /
• pp.19-22
• /
• 1989

This paper represents a syntactic peak detection algorithm which detects peaks in the ECG signal. In the algorithm, the input waveform is linearly approximated by "split-and-merge" method, and then each line segment is symbolized with primitive set. The peeks in the symbolized input waveform are recognized by the finite-state automata, which the deterministic finite-state language is parsed by. This proposed algorithm correctly detects peaks in a normal ECG signal as well as in the abnormal ECG signal such as tachycardia and the contaminated signal with noise.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.12
• /
• pp.1677-1685
• /
• 1988

In this paper, a new contour coding algorithm is investigated for use in region based image coding. Generally the contour data may be encoded by its chain codes or chain difference codes. But the data compression efficiency is low because of heavy burden for initial absolute coordinates of each chain. To alleviate this problem, the depth first search in graph traversal algorithm, is applied to the chain difference coding method. The proposed coding scheme is shown to be very efficient for contour images obtained by split-merge segmentation. Finally, we can reuce data about 60% in comparison with modified chain difference coding.

• Korean Journal of Remote Sensing
• /
• v.11 no.2
• /
• pp.43-57
• /
• 1995

This paper presents reconstruction of disparity in images. To achieve this, the algorithm was made up of two different procedures - one is extraction of boundaries for man-made structures and the other is matching of the structures. In the extraction of boundaries for man-made structures, we assume that man-made structures are composed of lines and the lines make up closed polygon. The convertional algorithms of the edges extraction may not perceive man-made structures and have problems that matching algorithms were too complex. This paper proposed sub-pixel boundaries extraction algorithm that fused split-and-merge and image improvement algorithms to overcome complexity. In matching procedure, feature-based algorithm that minimize the proposed cost function are used and the cost fuction considers movement of mid-points for left and right images to match structures. Because we could not obtain disparity of inner parts for the man-made structures, interpolation method was used. The experiment showed good results.

• Bulletin of the Korean Chemical Society
• /
• v.22 no.5
• /
• pp.455-462
• /
• 2001

The time-dependent tracking inversion method is studied to extract the potential energy surface of the electronic excited state in the photodissociation of triatomic molecules. Based on the relay of the regularized inversion procedure and time-dependent wave packet propagation, the algorithm extracts the underlying potential energy surface piece by piece by tracking the time-dependent data, which can be synthesized from Raman excitation profiles. We have demonstrated the algorithm to extract the potential energy surface of electronic excited state for NO2 molecule where the wave packet split on a saddle-shaped surface. Finally, we describe the merits of the time-dependent tracking inversion method compared with the time-independent inversion method and discussed several extensions of the algorithm.

• Journal of information and communication convergence engineering
• /
• v.20 no.3
• /
• pp.212-218
• /
• 2022

The performance of vision-based intelligent systems, such as self-driving cars and unmanned aerial vehicles, is subject to weather conditions, notably the frequently encountered haze or fog. As a result, studies on haze removal have garnered increasing interest from academia and industry. This paper hereby presents a 4K-capable hardware implementation of an efficient haze removal algorithm with the following two improvements. First, the depth-dependent haze distribution is predicted using a linear model of four haze-relevant features, where the model parameters are obtained through maximum likelihood estimates. Second, the approximated quad-decomposition method is adopted to estimate the atmospheric light. Extensive experimental results then follow to verify the efficacy of the proposed algorithm against well-known benchmark methods. For real-time processing, this paper also presents a pipelined architecture comprised of customized macros, such as split multipliers, parallel dividers, and serial dividers. The implementation results demonstrated that the proposed hardware design can handle DCI 4K videos at 30.8 frames per second.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.10 no.1
• /
• pp.1-6
• /
• 2014

In this paper, we propose a CPLD low power algorithm considering the structure. The proposed algorithm is implemented CPLD circuit FC(Feasible Cluster) for generating a problem occurs when the node being split to overcome the area and power consumption can reduce the algorithm. CPLD to configure and limitations of the LE is that the number of OR-terms. FC consists of an OR node is divided into mainly as a way to reduce the power consumption with the highest number of output nodes is divided into a top priority. The highest number of output nodes with the highest number of switching nodes become a cut-point. Division of the node is the number of OR-terms of the number of OR-terms LE is greater than adding the input and output of the inverter converts the AND. Reduce the level, power consumption and area. The proposed algorithm to MCNC logic circuits by applying a synthetic benchmark experimental results of 13% compared to the number of logical blocks decreased. 8% of the power consumption results in a reduced efficiency of the algorithm represented been demonstrated.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.10
• /
• pp.2597-2607
• /
• 1999

In this paper, we propose an efficient large item generation algorithm that overcomes the problem of the existing algorithm for making large items from quantitative attributes. The proposed algorithm splits dataset into variable size of intervals by min_split_support and merges the intervals according to the support of each interval. It reflects characteristic of data to generated large items and can generate finer large items than the existing algorithm. It is shown through the performance evaluation that our proposed algorithm outperforms the existing algorithm.