• Industrial Engineering and Management Systems
• /
• v.3 no.2
• /
• pp.123-128
• /
• 2004

A tree structure model has been proposed for representing the unequal-area facility layout. Each facility has a different rectangular shape specified by its area and aspect ratio. In this layout problem, based on the assumption that the shop floor has enough space for laying out the facilities, no constraint is considered for a shop floor. Objectives are minimizing total part movement between facilities and total rectangular layout area where all facilities and dead spaces are enclosed. Using the genetic code corresponding to two kinds of information, facility sequence and branching positions in the tree structure model, a genetic algorithm has been applied for finding non-dominated solutions in the two-objective layout problem. We use three kinds of crossover (PMX, OX, CX) for the former part of the chromosome and one-point crossover for the latter part. Two kinds of layout problems have been tested by the proposed method. The results demonstrate that the presented algorithm is able to find good solutions in enough short time.

• Journal of Korea Multimedia Society
• /
• v.14 no.5
• /
• pp.642-649
• /
• 2011

Among the various aspects of offline handwritten character patterns, it is the great variety of writing styles and variations that renders the task of computer recognition very hard. The immense variety of character shape has been recognized but rarely studied during the past decades of numerous research efforts. This paper tries to address the problem of measuring image distortions and handwritten character patterns with respect to reference patterns. This work is based on mass-spring mesh model with the introduction of simulated electric charge as a source of the external force that can aid decoding the shape distortion. Given an input image and a reference image, the charge is defined, and then the relaxation procedure goes to find the optimum configuration of shape or patterns of least potential. The relaxation process is based on the fourth order Runge-Kutta algorithm, well-known for numerical integration. The proposed method of modeling is rigorous mathematically and leads to interesting results. Additional feature of the method is the global affine transformation that helps analyzing distortion and finding a good match by removing a large scale linear disparity between two images.

• Ocean Systems Engineering
• /
• v.14 no.2
• /
• pp.157-169
• /
• 2024

The sudden release of water from a dam failure can trigger bores on a flat surface and exert substantial impact forces on structures. This flow poses a high-risk flood hazard to downstream urban areas, making it imperative to study its impact on structures and devise effective energy dissipators to mitigate its force. In this study, a combination of Genetic Algorithm optimization and numerical modeling is employed to identify the optimal energy dissipator. The analysis reveals that a round arc-shaped structure proves most effective, followed by a triangular shape. These shapes offer wide adaptability in terms of structure dimensions. Structures with higher elevation, especially those with round or triangular shapes, demonstrate superior energy dissipation capabilities. Conversely, square-shaped structures necessitate minimal height to minimize impact forces. The optimal width for dissipating energy is found to be 0.9 meters, allowing for effective wave run-up and propagation. Furthermore, the force exerted on structures increases with higher initial water levels, but diminishes with distance from the dam, highlighting the importance of placement in mitigating impact forces.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.5
• /
• pp.137-144
• /
• 2014

This paper proposes a novel procedure that uses a combination of overlapped basic convex shapes to decompose 2D silhouette image. A basic convex shape is used here as a structuring element to give a meaningful interpretation to 2D images. Poisson equation is utilized to obtain the basic shapes for either the whole image or a partial region or segment of an image. The reconstruction procedure is used to combine the basic convex shapes to generate the original shape. The decomposition process involves a merging stage, filtering stage and finalized by compromising stage. The merging procedure is based on solving Poisson's equation for two regions satisfying the same symmetrical conditions which leads to finding equivalencies between basic shapes that need to be merged. We implemented and tested our novel algorithm using 2D silhouette images. The test results showed that the proposed algorithm lead to an efficient shape decomposition procedure that transforms any shape into a simpler basic convex shapes.

• Korean Journal of Computational Design and Engineering
• /
• v.4 no.3
• /
• pp.259-268
• /
• 1999

In order to reduce the cost of product and save the processing time, optimal nesting of two-dimensional part is an important application in number of industries like shipbuilding and garment making. There have been many studies on finding the optimal solution of two-dimensional nesting. The problem of two-dimensional nesting has a non-deterministic characteristic and there have been various attempts to solve the problem by reducing the size of problem rather than solving the problem as a whole. Heuristic method and linearlization are often used to find an optimal solution of the problem. In this paper, theoretical and practical nesting algorithm for rectangular, circular and irregular shape of two-dimensional parts is proposed. Both No-Fit-Polygon and Minkowski-Sum are used for solving the overlapping problem of two parts and the dynamic programming technique is used for reducing the number search spae in order to find an optimal solution. Also, nesting designer's expertise is complied into the proposed algorithm to supplement the heuristic method.

• Korean Journal of Remote Sensing
• /
• v.30 no.6
• /
• pp.731-742
• /
• 2014

In this study, we developed a new algorithm which can construct model buildings used as a surface boundary in numerical models using GIS with latitudinal and longitudinal information of building vertices. The algorithm established the outer boundary of a building first, by finding segments passing neighboring two vertices of the building and connecting the segments. Then, the algorithm determined the region inside the outer boundary as the building. The new algorithm overcame the limit that the algorithm developed in the previous study had in constructing concave buildings. In addition, the new algorithm successfully constructed a building with complicated shape. To investigate effects of the modification in building shape caused by the building-construction algorithm on flows and pollutant dispersion around buildings, a computational fluid dynamics model was used and three kinds of building type were considered. In the downwind region, patterns in flow and pollutant dispersion were little affected by the modification in building shape caused. However, because of reduction in air space resulted from the building-shape modification, vortex structure was not resolved or smaller vortex was resolved near the buildings. The changes in flow pattern affected dispersion patterns of scalar pollutants emitted around the buildings.

• Journal of the Institute of Convergence Signal Processing
• /
• v.4 no.4
• /
• pp.81-86
• /
• 2003

Current growth of VLSI design depends critically on the research and development of automatic layout tool. Automatic layout is composed of placement assigning a specific shape to a block and arranging the block on the layout surface and routing finding the interconnection of all the nets. Algorithms performing placement and routing impact on performance and area of VLSI design. Switchbox routing is a problem interconnecting each terminals on all four sides of the region, unlike channel routing. In this paper we propose a genetic algorithm searching solution space for switchbox routing problem. We compare the performance of proposed genetic algorithm(GA) for switchbox routing with that of other switchbox routing algorithm by analyzing the results of each implementation. Consequently experimental results show that out proposed algorithm reduce routing length and number of the via over the other switchbox routing algorithms.

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

Inferring and recognizing 3D objects form a 2D occuluded image has been an important research area of computer vision. The octree model, a hierarchical volume description of 3D objects, may be utilized to generate projected images from arbitrary viewing directions, thereby providing an efficient means of the data base for 3D object recognition. We present a fast algorithm of finding the 4 pairs of feature points to estimate the viewing direction. The method is based on matching the object contour to the reference occuluded shapes of 49 viewing directions. The initially best matched viewing direction is calibrated by searching for the 4 pairs of feature points between the input image and the image projected along the estimated viewing direction. Then the input shape is recognized by matching to the projectd shape. The computational complexity of the proposed method is shown to be O(n$^{2}$) in the worst case, and that of the simple combinatorial method is O(m$^{4}$.n$^{4}$) where m and n denote the number of feature points of the 3D model object and the 2D object respectively.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2009.04a
• /
• pp.23-25
• /
• 2009

Nowadays, owing to the development of techniques for collecting geographic information, an increasing need is thus appearing: integrating heterogeneous databases. This paper proposes an algorithm for finding matching relationship between two node sets in road network data. We found the corresponding node pair using link shape linked with them as well as their location. The accuracy of matching was grown by this process. Result then can be used to reflect the topological information in performing link matching.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.17 no.6
• /
• pp.337-346
• /
• 2022

This paper addresses the problem of vision-based ear loops ansd attachment inspection in mask production lines. This paper focuses on connections with ear loops and mask filter by an efficient combined approach. The proposed method used a template matching, shape detection and summation of histogram with preprocessing. We had a parameter for detecting defects heuristically. If the shape vertices are lower than the parameters our proposed method will find defective mask automatically. After finding normal masks in mask ear loops attachment status inspection algorithm our proposed method conducts attachment amount inspection. Our experimental results showed that the precision is 1 and the recall is 0.99 in the mask attachment status inspection and attachment amount inspection.