• Journal of Korea Multimedia Society
• /
• v.13 no.5
• /
• pp.702-709
• /
• 2010

The performance of mass segmentation is greatly influenced by an initial position of a mass. Some researchers performed mass segmentation with the initial position of a mass given by radiologists. The purpose of our research is to find the initial position for mass segmentation and to notify the segmented mass to radiologists without any additional information on mammograms. The proposed system consists of breast segmentation by region growing and opening operations, decision of an initial seed with characteristics of masses, and mass segmentation by a level set segmentation. A seed for mass segmentation is set based on mass scoring measure calculated by block-based variances and masked information in a sub-sampled mammogram. We used a DDSM database to evaluate the system. The accuracy of mass detection is 78% sensitivity at 4 FP/image, and it reached 92% if multiple views for masses were considered.

• Proceedings of the KIEE Conference
• /
• 2007.04a
• /
• pp.207-209
• /
• 2007

In this paper, we introduce a genetic optimization of fuzzy set-fuzzy model using successive tuning method to carry out the model identification of complex and nonlinear systems. To identity we use genetic alrogithrt1 (GA) sand C-Means clustering. GA is used for determination the number of input, the seleced input variables, the number of membership function, and the conclusion inference type. Information Granules (IG) with the aid of C-Means clustering algorithm help determine the initial paramters of fuzzy model such as the initial apexes of the, membership functions in the premise part and the initial values of polyminial functions in the consequence part of the fuzzy rules. The overall design arises as a hybrid structural and parametric optimization. Genetic algorithms and C-Means clustering are used to generate the structurally as well as parametrically optimized fuzzy model. To identify the structure and estimate parameters of the fuzzy model we introduce the successive tuning method with variant generation-based evolution by means of GA. Numerical example is included to evaluate the performance of the proposed model.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.27 no.2
• /
• pp.153-171
• /
• 2002

In this paper, we present an efficient pricing strategy, the pivot and probe Algorithm for Network Flow Problems(PAPANET), specifically for solving capacitated, linear network flow problem (NPs). The PAPANET begins with an initial relaxed network problem(RNP), consisting of all the nodes and initial candidate arcs(possibly a few least cost arcs form the original problem and a set of all the artificial and slack arcs). After an initial solution to the RNP is derived by pivoting, the PROBE procedure identifies a set of most violated arcs from the noncandidate arcs that are not considered to be in the current RNP, and adds them to the RNP. The procedure also discards a set of least favorable, zero flow, nonbasic arcs from the RNP. The new RNP is solved to optimality and the procedure continues until all of the dual constraints of the noncandidate arcs are satisfied by the dual solution to the RNP. The PAPANET effectively reduces the problem size, time per pivot, and solution CPU time by eliminating noncandidate arcs. Computational tests on randomly generated problems indicate that PAPANET achieves and average savings of 50-80% of the solution CPU time of that of a comparable standard network simplex implementation.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.4
• /
• pp.967-975
• /
• 2010

Image segmentation is one of the first steps leading to image analysis and interpretation, which is to distinguish objects from background. However, the active contour model can't exactly extract the desired objects because the phase only is 2. In this paper, we propose the method which can find the desired contours by composing the initial curve near the objects which have intensities of special range. The initial curve is calculated by the histogram equalization, the Gaussian equalization, and the threshold. The proposed method reduce the calculation speed and exactly detect the wanted objects because the initial curve set near by interested area. The proposed method also shows more efficient than the active contour model in the results applied the CT and MR images.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.9
• /
• pp.21-29
• /
• 2015

The set partitioning problem is a well-known NP-hard combinatorial optimization problem, and it is formulated as an integer programming model. This paper proposes an Integer Programming-based Local Search for solving the set partitioning problem. The key point is to solve the set partitioning problem as the set covering problem. First, an initial solution is generated by a simple heuristic for the set covering problem, and then the solution is set as the current solution. Next, the following process is repeated. The original set covering problem is reduced based on the current solution, and the reduced problem is solved by Integer Programming which includes a specific element in the objective function to derive the solution for the set partitioning problem. Experimental results on a set of OR-Library instances show that the proposed algorithm outperforms pure integer programming as well as the existing heuristic algorithms both in solution quality and time.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.4 no.3
• /
• pp.337-340
• /
• 2004

The clustering problem can be formulated as the problem to find the number of clusters and a partition matrix from a given data set using the iterative or non-iterative algorithms. The author proposes a nearest neighbor and validity-based clustering algorithm where each data point in the data set is linked with the nearest neighbor data point to form initial clusters and then a cluster in the initial clusters is linked with the nearest neighbor cluster to form a new cluster. The linking between clusters is continued until no more linking is possible. An optimal set of clusters is identified by using the conventional cluster validity index. Experimental results on well-known data sets are provided to show the effectiveness of the proposed clustering algorithm.

• Journal of Korea Multimedia Society
• /
• v.13 no.8
• /
• pp.1142-1153
• /
• 2010

Conjunctival injection is the initial symptom of various eye diseases such as conjunctivitis, keratitis, or uveitis. The quantification of conjunctival injection may help the diagnosis and follow-up evaluation of various eye diseases. The size of the sclera is an important factor for the quantification of conjunctival injection. However, previous manual segmentation is time-consuming.Automatic segmentation is needed to extract the objective region of interest. This paper proposed a method based on the level set algorithm to segment the sclera from an anterior eye image. The initial model of the level set algorithm is calculated using the Lab color space, k-means algorithm and the geometric information. The level set algorithm was applied to the images in which the valley between the eyeball and skin was enhanced using the hessian analysis. This algorithm was tested with 52 images of the anterior eye segment. Results showed that the proposed method performs better than those with the level set algorithm using an arbitrary circle, or the region growing algorithm with color information. The proposed method for the segmentation of sclera may become an important component for the objective measurement of the conjunctival injection.

• Journal of Intelligence and Information Systems
• /
• v.13 no.1
• /
• pp.1-14
• /
• 2007

Character images for the background screen of cell phones are one of the fast growing sectors of the mobile content market. However, character image buyers currently experience tremendous difficulties in searching for desired images due to the awkward image search process. Content-based image retrieval (CBIR) widely used for image retrieval could be a good candidate as a solution to this problem, but it needs to overcome the limitation of the mobile Internet environment where an initial query set (IQS) cannot be easily provided as in the PC-based environment. We propose a new approach, IQS-AutoGen, which automatically generates an initial query set for CBIR on the mobile Internet. The approach applies the collaborative filtering (CF), a well-known recommendation technique, to the CBIR process by using users' preference information collected during the relevance feedback process of CBIR. The results of the experiment using a PC-based prototype system show that the proposed approach successfully satisfies the initial query requirement of CBIR in the mobile Internet environment, thereby outperforming the current image search process on the mobile Internet.

• International Journal of Aeronautical and Space Sciences
• /
• v.14 no.4
• /
• pp.324-333
• /
• 2013

The purpose of this paper is to improve the efficiency of multi-objective topology optimization using a genetic algorithm (GA) with bar-system representation. We proposed a new GA using an elite initial population obtained from a Solid Isotropic Material with Penalization (SIMP) using a weighted sum method. SIMP with a weighted sum method is one of the most established methods using sensitivity analysis. Although the implementation of the SIMP method is straightforward and computationally effective, it may be difficult to find a complete Pareto-optimal set in a multi-objective optimization problem. In this study, to build a more convergent and diverse global Pareto-optimal set and reduce the GA computational cost, some individuals, with similar topology to the local optimum solution obtained from the SIMP using the weighted sum method, were introduced for the initial population of the GA. The proposed method was applied to a structural topology optimization example and the results of the proposed method were compared with those of the traditional method using standard random initialization for the initial population of the GA.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.18 no.2
• /
• pp.241-250
• /
• 2023

In this paper, when using the LMS algorithm for adaptive ultrasonic beamforming system, the effect of initial value setting on the margin of step parameters was studied. To this end, quasi-ideal beams, rotational beams with arbitrarily set beam widths were used as examples. In the numerical simulations, an arbitrary initial value(the number of sound sources fixed to any number) was set in the ultrasonic beamforming system, and the margin of the step parameter and convergence characteristics thereof were compared.