• Journal of the Korea Computer Graphics Society
• /
• v.22 no.4
• /
• pp.11-19
• /
• 2016

In this paper, we propose an automatic segmentation method of renal parenchyma on abdominal CT image using graph-cuts with shape constraint based on multi-probabilistic atlas. The proposed method consists of following three steps. First, to use the various shape information of renal parenchyma, multi-probabilistic atlas is generated by cortex-based similarity registration. Second, initial seeds for graph-cuts are extracted by maximum a posteriori (MAP) estimation and renal parenchyma is segmented by graph-cuts with shape constraint. Third, to reduce alignment error of probabilistic atlas and increase segmentation accuracy, registration and segmentation are iteratively performed. To evaluate the performance of proposed method, qualitative and quantitative evaluation are performed. Experimental results show that the proposed method avoids a leakage into neighbor regions with similar intensity of renal parenchyma and shows improved segmentation accuracy.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.5
• /
• pp.572-579
• /
• 1988

In this paper, a system of automatic placement and routing for gate array layout design is proposed. In the placement stage, the circuit is partitioned and using the concept of min-cut slicing, and each partitioned module is placed, so that the routing density over the entire chip be uniformized and the total wiring length be minimized. In the global routing stage, the concept of the probabilistic routing density is introduced to unify the wiring congestions in each channel. In the detailed routing stage, the multi-terminal nets are partitioned into the two-terminal nets. The ordered channel graph is proposed which implies the vertical and the horizontal constranint graphs simultaneously. And using the ordered channel graph, the proposed routing algorithm assigns the signal nets to the tracks. Also the proposed placement and routing algorithms are implimented on IBM/PC-AT to construct PC-level gate array layout system.

• Management Science and Financial Engineering
• /
• v.16 no.1
• /
• pp.81-117
• /
• 2010

Semi-supervised learning incorporates unlabeled examples, whose labels are unknown, as well as labeled examples into learning process. Although transductive support vector machine (TSVM), one of semi-supervised learning models, was proposed about a decade ago, its application to large-scaled data has still been limited due to its high computational complexity. Our previous research addressed this limitation by introducing a branch-and-bound algorithm for finding an optimal solution to TSVM. In this paper, we propose three new techniques to enhance the performance of the branch-and-bound algorithm. The first one tightens min-cut bound, one of two bounding strategies. Another technique exploits a graph-based approximation to a support vector machine problem to avoid the most time-consuming step. The last one tries to fix the labels of unlabeled examples whose labels can be obviously predicted based on labeled examples. Experimental results are presented which demonstrate that the proposed techniques can reduce drastically the number of subproblems and eventually computational time.

• Proceedings of the KIEE Conference
• /
• 1988.07a
• /
• pp.591-594
• /
• 1988

A three-step heuristic algorithm for PLA column folding and row folding of column-folded PLA is presented, which is significantly faster than the earlier works and provides nearly optimal results. The three steps are i) min-cut partition of vertices in the column (or row) intersection graph, ii) determination of products' order using Fiduccia's min-net cut algorithm, and iii) head-tail pairing for column folding, while some heuristics are proposed for deciding row folding pairs. The time complexity of this algorithm is O($n^{2}$log n) compared to the O($n^{3}$) - O($n^{4}$) of the earlier works.$^[2][3][9]$ For a test PLA with 23 inputs, 19 outputs and 52 products, the number of column folding pairs obtained using this algorithm is 20 which is optimal, as compared to 17 in a previous work.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.31 no.2
• /
• pp.69-85
• /
• 2006

Transductive Support Vector Machine(TSVM) is one of semi-supervised learning algorithms which exploit the domain structure of the whole data by considering labeled and unlabeled data together. Although it was proposed several years ago, there has been no efficient algorithm which can handle problems with more than hundreds of training examples. In this paper, we propose an efficient branch-and-bound algorithm which can solve large-scale TSVM problems with thousands of training examples. The proposed algorithm uses two bounding techniques: min-cut bound and reduced SVM bound. The min-cut bound is derived from a capacitated graph whose cuts represent a lower bound to the optimal objective function value of the dual problem. The reduced SVM bound is obtained by constructing the SVM problem with only labeled data. Experimental results show that the accuracy rate of TSVM can be significantly improved by learning from the optimal solution of TSVM, rather than an approximated solution.

• Journal of Advanced Information Technology and Convergence
• /
• v.9 no.1
• /
• pp.103-113
• /
• 2019

Motivation: Polymerized actin-based cytoskeletal structures are crucial in shape, dynamics, and resilience of a cell. For example, dynamical actin-containing ruffles are located at leading edges of cells and have a significant impact on cell motility. Other filamentous actin (F-actin) bundles, called stress fibers, are essential in cell attachment and detachment. For this reason, their mechanistic understanding provides crucial information to solve practical problems related to cell interactions with materials in tissue engineering. Detecting and counting actin-based structures in a cellular ensemble is a fundamental first step. In this research, we suggest a new method to characterize F-actin wrapping fibers from confocal fluorescence image stacks. As fluorescently labeled F-actin often envelope the fibers, we first propose to segment these fibers by diminishing an energy based on maximum flow and minimum cut algorithm. The actual actin is detected through the use of bilateral filtering followed by a thresholding step. Later, concave actin bundles are detected through a graph-based procedure that actually determines if the considered actin filament is enclosing the fiber.

• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06a
• /
• pp.281-282
• /
• 2008

• Communications of the Korean Mathematical Society
• /
• v.19 no.3
• /
• pp.577-584
• /
• 2004

In a 4-valent multi 3-gon graph, every cut-through curve forms a simple closed circuit. Hence it is a weak arrangement of simple curves that is defined by Branko Grunbaum. In this paper, we study the edge properties of the 4-valent multi 3-gon graphs from the point of view of arrangement, and we show that they are 3 colorable.

• Journal of applied mathematics & informatics
• /
• v.23 no.1_2
• /
• pp.193-203
• /
• 2007

In this paper we consider the inverse minimum flow (ImF) problem, where lower and upper bounds for the flow must be changed as little as possible so that a given feasible flow becomes a minimum flow. A linear time and space method to decide if the problem has solution is presented. Strongly and weakly polynomial algorithms for solving the ImF problem are proposed. Some particular cases are studied and a numerical example is given.

• Journal of the Korean Society of Manufacturing Technology Engineers
• /
• v.6 no.3
• /
• pp.17-25
• /
• 1997

This paper aims to clarify the effects of grinding conditions on the grinding force, ground surface and chipping size of workpiece in surface grinding of various ferrites with the resin bond diamond wheel. The main conclusions obtained were as follows: In a constant peripheral wheel speed, the specific grinding energy is fitted by straight lines with grinding depth coefficient($\delta$) in a logarithmic graph. The effect of both depth of cut and workpiece speed on grinding energy becomes larger in the order of Mn-Zn, Cu-Ni-Zn and Sr. When using the diamond grain of the lower toughness, the roughness of the ground surface becomes lower. The ground surfaces show that the fracture process during grinding becomes more brittle in the order of Sr, Mn-Zn and Cu-Ni-Zn. The chipping size at the corner of workpiece in grinding increases with the the increases of the depth of cut and workpiece speed, and the decrease of peripheral wheel speed. The effect of both depth of cut and workpiece speed on chipping size becomes more larger in the order of Sr, Mn-Zn and Cu-Ni-Zn.