• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.625-628
• /
• 1999

In this paper, we consider the problem of finding the depth of a object in two images taken with cameras. For solving this problem, we introduce a spherical concave mirror model. First, a virtual concave mirror is assumed, and then a scene is obtained by camera at two different position which are on the surface of the mirror. The depth of object is calculated from two scenes by using the spherical-mirror equation. The algorithm has been tested on a real scene containing several objects, and showed that it is more useful for farther object.

• Journal of the Korean Society for Precision Engineering
• /
• v.15 no.11
• /
• pp.130-136
• /
• 1998

This paper develops an efficient algorithm for the minimum distance calculation between two general polyhedra(convex and/or concave) in three-dimensional space. The polyhedra approximate objects using flat polygons which composed of more than three vertices. The algorithm developed in this paper basically computes minimum distance between two polygons(one polygon per object) and finds a set of two polygons which makes a global minimum distance. The advantage of the algorithm is that the global minimum distance can be computed in any cases. But the big disadvantage is that the minimum distance computing time is rapidly increased with the number of polygons which used to approximate an object. This paper develops a method to eliminate sets of two polygons which have no possibility of minimum distance occurrence, and an efficient algorithm to compute a minimum distance between two polygons in order to compensate the inherent disadvantage of the algorithm. The correctness of the algorithm is verified not only comparing analytically calculated exact minimum distance with one calculated using the developed algorithm but also watching a line which connects two points making a global minimum distance of a convex object and/or a concave object. The algorithm efficiently finds minimum distance between two convex objects made of 224 polygons respectively with a computation time of about 0.1 second.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.1876-1879
• /
• 1997

This paper developes an efficient algorithm for the minimum distance calculation between general polyhedra(convex and/or concave). The polyhedron approximates and object using flat polygons which composed of more than three veritices. The algorithm developed in this paper basically computes minimun distance betwen two convex polygons and finds a set of polygons whcih makes a global minimum distance. The advantage of the algorithm is that the global minimum distance can be computed in any cases. But the big disadvantage is that minimum distance computing time is repidly increased with the number of polygons which used to approximate an object. This paper developes a method to eliminate unnecessary sets of polygons, and an efficinet algorithm to compute a minimum distance between two polygons in order to compensate the inherent disadvantage of the algorithm. It takes only a few times iteration to find minimum distance for msot polygons. The correctness of the algortihm are visually tested with a line which connects two points making a global minimum distance of simple convex object(box) and concave object(pipe). The algorithm can find minimum distance between two convex objects made of about 200 polygons respectively less than a second computing time.

• Proceedings of the IEEK Conference
• /
• 2002.06d
• /
• pp.73-76
• /
• 2002

This paper has been studied an algorithm for segmenting gaseous object images. A new methodology for segmenting gaseous object images is introduced. Proposed method consists offuzzy-based boundary detector applicable to gaseous as well as rigid objects and concave region filling to recover object regions.

• Proceedings of the KIEE Conference
• /
• 2001.11c
• /
• pp.169-171
• /
• 2001

Unlike rigid objects, the edge intensity of a gaseous object is various along the object boundary (edge intensities of some pixels on a gaseous object boundary are weaker than those of small rigid objects or noise itself). Therefore, the conventional edge detectors may not adequately detect boundary-like edge pixels for gaseous objects. In this paper A new methodology for segmenting gaseous object images is introduced. Proposed method consists of fuzzy-based boundary detector applicable to gaseous as well as rigid objects and concave region filling to recover object regions.

• Journal of Korean Institute of Industrial Engineers
• /
• v.19 no.2
• /
• pp.3-13
• /
• 1993

In this study, we develop a B & B type algorithm for the concave minimization problem with 0-1 knapsack constraint. Our algorithm reformulates the original problem into the singly linearly constrained concave minimization problem by relaxing 0-1 integer constraint in order to get a lower bound. But this relaxed problem is the concave minimization problem known as NP-hard. Thus the linear function that underestimates the concave objective function over the given domain set is introduced. The introduction of this function bears the following important meanings. Firstly, we can efficiently calculate the lower bound of the optimal object value using the conventional convex optimization methods. Secondly, the above linear function like the concave objective function generates the vertices of the relaxed solution set of the subproblem, which is used to update the upper bound. The fact that the linear underestimating function is uniquely determined over a given simplex enables us to fix underestimating function by considering the simplex containing the relaxed solution set. The initial containing simplex that is the intersection of the linear constraint and the nonnegative orthant is sequentially partitioned into the subsimplices which are related to subproblems.

• Korean Journal of Computational Design and Engineering
• /
• v.4 no.1
• /
• pp.60-68
• /
• 1999

In reverse engineering (RE) sustems, the quality of the data aquisition process is crucial to the accuracy of the reverse engineered three dimensional computer-aided design (CAD) model. However, these tasks are predominantly done manually, and little work has been done to improve the efficiency of scanning by determining the minimum number of scans and the optimal scanning directions. In this paper, new scanning and registration methods using tooling balls are developed to assist in determining the optimal parameter for these processes. When the object to scanned has no concavity, attaching path of the object and its bounding rectangle are used for optimal scanning and registration. Then minimum number of tooling balls and their positions are calculated automatically. In the case of concave parts, the scanning plan should include a complete scan of the concave area. With the surface normal vector and the scanning direction, the minimum degree of rotating the part can be calculated. But the maximum rotation should be restricted in order to prevent occlusion of the part. Finally tow sample part ar scanned based on the proposed methods and the results are discussed.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.22 no.3
• /
• pp.11-22
• /
• 1997

The aim of this paper is to develop the B & B type algorithms for globally minimizing concave function under 0-1 knapsack constraint. The linear convex envelope underestimating the concave object function is introduced for the bounding operations which locate the vertices of the solution set. And the simplex containing the solution set is sequentially partitioned into the subsimplices over which the convex envelopes are calculated in the candidate problems. The adoption of cutting plane method enhances the efficiency of the algorithm. These mean valid inequalities with respect to the integer solution which eliminate the nonintegral points before the bounding operation. The implementations are effectively concretized in connection with the branching stategys.

• Journal of Biomedical Engineering Research
• /
• v.26 no.6
• /
• pp.357-363
• /
• 2005

Active contour models have been extensively used to segment, match, and track objects of interest in computer vision and image processing applications, particularly to locate object boundaries. With conventional methods an object boundary can be extracted by controlling the internal energy and external energy based on energy minimization. However, this still leaves a number of problems, such as initialization and poor convergence in concave regions. In particular, a contour is unable to enter a concave region based on the stretching and bending characteristic of the internal energy. Therefore, this study proposes a method that controls the internal energy by moving the local perpendicular bisector point of each control point on the contour, and determines the object boundary by minimizing the energy relative to the external energy. Convergence at a concave region can then be effectively implemented as regards the feature of interest using the internal energy, plus several objects can be detected using a multi-detection method based on the initial contour. The proposed method is compared with other conventional methods through objective validation and subjective consideration. As a result, it is anticipated that the proposed method can be efficiently applied to the detection of the pulmonary parenchyma region in medical images.

• Computers and Concrete
• /
• v.8 no.6
• /
• pp.693-715
• /
• 2011

The main object of this study is to evaluate the seismic response effects on a reinforced concrete building isolated by triple concave friction pendulum (TCFP) bearings. The site-response effects arise from the difference in the local soil conditions at the support points of the buildings. The local soil conditions are, therefore, considered as soft, medium and firm; separately. The results on the responses of the isolated building are compared with those of the non-isolated. The building model used in the time history analysis, which is a two-dimensional and eight-storey reinforced concrete building with and without the seismic isolation bearings and/or the local soil conditions, is composed of two-dimensional moment resisting frames for superstructure and of plane elements featuring plane-stress for substructure. The TCFP bearings for isolating the building are modelled as of a series arrangement of the three single concave friction pendulum (SCFP) bearings. In order to investigate the efficiency of both the seismic isolation bearings and the site-response effects on the buildings, the time history analyses are elaborately conducted. It is noted that the site-response effects are important for the isolated building constructed on soft, medium or firm type local foundation soil. The results of the analysis demonstrate that the site-response has significant effects on the response values of the structure-seismic isolation-foundation soil system.