• International Journal of Computer Science & Network Security
• /
• v.23 no.7
• /
• pp.61-70
• /
• 2023

Image segmentation is a very crucial step in effective digital image processing. In the past decade, several research contributions were given related to this field. However, a general segmentation algorithm suitable for various applications is still challenging. Among several image segmentation approaches, graph-based approach has gained popularity due to its basic ability which reflects global image properties. This paper proposes a methodology to partition the image with its pixel, region and texture along with its intensity. To make segmentation faster in large images, it is processed in parallel among several CPUs. A way to achieve this is to split images into tiles that are independently processed. However, regions overlapping the tile border are split or lost when the minimum size requirements of the segmentation algorithm are not met. Here the contributions are made to segment the image on the basis of its pixel using min-cut/max-flow algorithm along with edge-based segmentation of the image. To segment on the basis of the region using a homogenous optimum cut algorithm with boundary segmentation. On the basis of texture, the object type using spectral partitioning technique is identified which also minimizes the graph cut value.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.1
• /
• pp.143-152
• /
• 2013

Given weighted graph G=(V,E), n=|V|, m=|E|, the minimum cut problem is classified with source s and sink t or without s and t. Given undirected weighted graph without s and t, Stoer-Wagner algorithm is most popular. This algorithm fixes arbitrary vertex, and arranges maximum adjacency (MA)-ordering. In the last, the sum of weights of the incident edges for last ordered vertex is computed by cut value, and the last 2 vertices are merged. Therefore, this algorithm runs $\frac{n(n-1)}{2}$ times. Given graph with s and t, Ford-Fulkerson algorithm determines the bottleneck edges in the arbitrary augmenting path from s to t. If the augmenting path is no more exist, we determine the minimum cut value by combine the all of the bottleneck edges. This paper suggests minimum cut algorithm for undirected weighted graph with s and t. This algorithm suggests MA-merging and computes cut value simultaneously. This algorithm runs n-1 times and successfully divides V into disjoint S and V sets on the basis of minimum cut, but the Stoer-Wagner is fails sometimes. The proposed algorithm runs more than Ford-Fulkerson algorithm, but finds the minimum cut value within n-1 processing times.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.1695-1700
• /
• 2005

In this paper, we propose an optimal thresholding method for the voxel coloring in the reconstruction of a 3D shape. Our purposed method is a new approach to resolve the trade-off error of the threshold value on determining the photo-consistency in the conventional method. Optimal thresholding value is decided to compare the surface voxel of photo-consistency with inside voxel on the optic ray of the center camera. As iterating the process of the voxels, the threshold value is approached to the optimal value for the individual surface voxel. And also, graph cut method is reduced to the surface noise on eliminating neighboring voxel. To verify the proposed algorithm, we simulated in the virtual and real environment. It is advantaged to speed up and accuracy of a 3D face reconstruction by applying the methods of optimal threshold and graph cut as compare with conventional algorithms.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.5
• /
• pp.1102-1110
• /
• 2005

In this paper, we proposed a advanced approach to resolve the trade-off problem for the threshold value determining the photo-consistency in the previous algorithms. The threshold value for the surface voxel is substituted the photo-consistency value of the inside voxel. As iterating the voxel coloring process, the threshold is approached to the optimal value for the individual surface voxel. we present an energy minimization formulation of the binary labeling problem that surface voxels classify into opacity or transparency. The energy formula consists of the data term and the smoothness term. As considering neighboring voxels in the labeling problem, the unevenness of reconstructed surface is reduced. The labeling whose energy is the global minimum can be computed using a graph cut.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.66 no.1
• /
• pp.107-113
• /
• 2017

Unlike regular images, there is no ground truth for bio surface images. Result of biosurface imaging is not only significantly affected by the environment and the condition of the bio surface, it requires more detailed expression than regular images. Therefore, unlike algorithms tested on regular images, studies on bio surface images requires a highly precise optimization process. We aim to optimize the graph cut algorithm, known to be the most outstanding among the stereo visions, by considering baseline, lambda, and disparity range. Optimal results were in the range of 1~10 for lambda. The disparity ranged from -30 to -50, indicating an optimal value in a slightly higher range. Furthermore, we verified the tested optimization data using SIFT.

• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 2000.04a
• /
• pp.567-572
• /
• 2000

From the experimental study of W-EDM for alloyed steel, the characteristics such as Hand Drum Form and surface roughness have been observed and evaluated for various conditions. In square hole, the increase of IP as to made condition, the calculate high value of surface roughness. Also compare dimensionless square hole with circle hole' graph, In circle hole, if a value of surface roughness IP 6 in a side of circle it show a 0.4${\mu}{\textrm}{m}$ and in IP 8, 0.6${\mu}{\textrm}{m}$, in IP 10, 0.7${\mu}{\textrm}{m}$, in IP 12, 0.8${\mu}{\textrm}{m}$ higher than before. This figure show the surface roughness is higher than before, because a table move in either X-axis or Y-axis in square hole, on the contrary, in circle there table move in X-axis and Y-axis at the same time. hand drum form getting small when wire tension increase 1000gf to 1500gf, at the same working conditions. The smaller of off time, the maller of hand drum form in same condition and same wire tension. but if you compare square hole with circle hole' graph, hand drum form displayed in maintained term of working condision, on the contrary, in case of square hole variation of hand drum form is more increase than a grow of IP

• 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.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.5
• /
• pp.129-139
• /
• 2012

Given digraph network $D=(N,A),n{\in}N,a=c(u,v){\in}A$ with source s and sink t, the maximum flow from s to t is determined by cut (S, T) that splits N to $s{\in}S$ and $t{\in}T$ disjoint sets with minimum cut value. The Ford-Fulkerson (F-F) algorithm with time complexity $O(NA^2)$ has been well known to this problem. The F-F algorithm finds all possible augmenting paths from s to t with residual capacity arcs and determines bottleneck arc that has a minimum residual capacity among the paths. After completion of algorithm, you should be determine the minimum cut by combination of bottleneck arcs. This paper suggests maximum adjacency merging and compute cut value method is called by MA-merging algorithm. We start the initial value to S={s}, T={t}, Then we select the maximum capacity $_{max}c(u,v)$ in the graph and merge to adjacent set S or T. Finally, we compute cut value of S or T. This algorithm runs n-1 times. We experiment Ford-Fulkerson and MA-merging algorithm for various 8 digraph. As a results, MA-merging algorithm can be finds minimum cut during the n-1 running times with time complexity O(N).

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2000.05a
• /
• pp.739-742
• /
• 2000

From the experimental study of W-EDM for alloyed steel, the characteristics such as Hand Drum Form and surface roughness have been observed and evaluated for various conditions. In square hole, the increase of If as to made condition the calculate high value of surface roughness. Also compare dimensionless square hole with circle hole' graph. In circle hole, if a value of surface roughness IP 6 in a side of circle it show a 0.4${\mu}{\textrm}{m}$ and in IP 8, 0.6${\mu}{\textrm}{m}$, in IP 10, 0.7${\mu}{\textrm}{m}$, in IP 12. 0.8${\mu}{\textrm}{m}$ higher than before. This figure show the surface roughness is higher than before, because a table move in either X-axis or Y-axis in square hole, on the contrary, in circle there table move in X-axis and Y-axis at the same time. hand drum form getting small when wire tension increase 1000gf to 1500gf, at the same working conditions. the smaller of off time, the mailer of hand drum form in same condition and same wire tension. but if you compare square hole with circle hole' graph hand drum form displayed in maintained term of working condision, on the contrary, in case of square hole variation of hand drum form is more increase than a grow of IP

• The Journal of the Korea Contents Association
• /
• v.17 no.10
• /
• pp.567-575
• /
• 2017

In this study, when diagnosis pancreatic cancer by dual time point PET/CT, we propose SUVm 2.52 as the threshold value for performing the dual time point PET/CT exam. The hypothesis of normal distribution was adopted through data conversion of 60 pancreatic diseases. The proposed SUVm2.52 boundary value showed a significance level that could be applied to both 120 and 180 minutes of delay time scan for pancreatic cancer determination (p<0.05). C-value variation shows that delay time 2 hour test is more useful than delay time 3 hour test. When the SUVm 2.52 is set to the boundary value and the double-time point PET/CT exam is performed, the probability of distinguishing cancer from inflammation in the delayed image is 95%. When the delayed test is performed with the proposed boundary value SUVm 2.52, Compared with general PET / CT scans, it is thought that it may be helpful to distinguish pancreatic cancer.