• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.6
• /
• pp.71-80
• /
• 1994

The purpose of this paper is to explore the use of fuzzy set theory for image processing and analysis. As an application example, the fuzzy method of edge detection is proposed to extract the edges of raised characters on tires.In general, Sobel, Prewitt, Robert and LoG filters are used to detect the edge, but it is difficult to detect the edge because of ambiguity of representations, noise and general problems in the interpretation of tire image. Therefore, in his paper, the fuzzy property plane has been extracted from the spatial domain using the ramp-mapping function. And then the ideas of fuzzy MIN and MAX are applied in removing noise and enhancement of the image simultaneously. From the result of MIN and MAX procedure a new fuzzy singleton is generated by extracting the difference between adjacent membership function values. And the edges are extracted by applying fuzzy $\alpha$-cut set to the fuzzy singletion, Finally, these ideas are applied to the tire images.

• Korean Journal of Computational Design and Engineering
• /
• v.15 no.1
• /
• pp.33-42
• /
• 2010

In this study, new medial surface calculation methods using Voronoi diagrams are investigated for the point samples extracted on closed surface models. The medial surface is defined by the closure of all points having more than one closest point on the shape boundary. It is a one of essential geometric information in 3D and can be used in many areas such as 3D shape analysis, dimension reduction, freeform shape deformation, image processing, computer vision, FEM analysis, etc. In industrial parts, the idealized solid parts and shell shapes including sharp edges and vertices are frequently used. Other medial surface extraction methods using Voronoi diagram have inherent separation and branch problems, so that they are not appropriate to the sharp edged objects and have difficulties to be applied to industrial parts. In addition, the branched surfaces on sharp edges in shell shapes should be eliminated to obtain representative medial shapes. In order to avoid separation and branch problems, the new approach by analyzing the shapes and specially sampling on surfaces has been developed.

• Korean Journal of Computational Design and Engineering
• /
• v.22 no.1
• /
• pp.28-36
• /
• 2017

Sharing of CAD data plays a key role in the PLM and a lightweight model is widely used for visualizing and sharing a large data. The lightweight model is mainly composed of triangular elements to minimize file size. There is no problem at all to visually confirm the shape based on these triangular elements but there is a limit to numerically calculate the exact position on the curve or surface. In this paper, a boundary curve generation method using triangular elements is proposed to increase the utilization of lightweight models. After matching connectivity of triangular elements, boundary element edges are extracted. Boundary curves are generated by connecting of these boundary element edges. This proposed method has been tested on several models to demonstrate the feasibility.

• Proceedings of the KIEE Conference
• /
• 1995.07b
• /
• pp.883-885
• /
• 1995

Edges are one of the most important features used in various computer vision applications. Most of the known edge detection techniques are categorized into three gropus: First two approaches are to find gray level changes using first-order or second-order differentiation. The third method uses intrinsic propoeties of edges such as the result shown during scale space filtering. In this paper, we study various kind of edge detection techniques. Two images (Lenna image and a certain image which is composed of step, ramp, roof, and other artificial edge patterns) are used to compare different edge detection techniques and to verify the advantages and disadvantage of each techniques.

• Journal of Electrical Engineering and information Science
• /
• v.2 no.6
• /
• pp.43-47
• /
• 1997

A procedure presented in this paper generates test sequences to check the conformity of an implementation with a protocol specification, which is modeled as a deterministic finite state machine (FSM). Given a FSM, a common procedure of test sequence generation, first, constructs a directed graph which edges include the state check after each transition, and produces a symmetric graph G* from and, finally, finds a Euler tour of G*. We propose a technique to determine a minimum-cost tour of the transition graph of the FSM. The proposed technique using Multiple Unique State Signature (MUSS) solves an open issue that one MUIO sequence assignment may lead to two more edges of unit cost being replicated to from G* while an optimal assignment may lead to the replication of a single edge of high cost. In this paper, randomly generated FSMs have been studied as test cases. The result shows that the proposed technique saves the cost 4∼28% and 2∼21% over the previous approach using MUIO and MUSP, respectively.

• ETRI Journal
• /
• v.33 no.4
• /
• pp.547-557
• /
• 2011

This study presents an approach for extracting boundaries of various buildings, which have concave boundaries, inner yards, non-right-angled corners, and nonlinear edges. The approach comprises four steps: building point segmentation, boundary tracing, boundary grouping, and regularization. In the second and third steps, conventional algorithms are improved for more accurate boundary extraction, and in the final step, a new algorithm is presented to extract nonlinear edges. The unique characteristics of airborne light detection and ranging (LIDAR) data are considered in some steps. The performance and practicality of the presented algorithm were evaluated for buildings of various shapes, and the average omission and commission error of building polygon areas were 0.038 and 0.033, respectively.

• Journal of the Korean Society of Manufacturing Process Engineers
• /
• v.9 no.1
• /
• pp.74-80
• /
• 2010

The purpose of reverse engineering design using 3D measurement data is an accurate reconstruction of real body. In oder to accomplish this object, it is important that creating exact extracting edges should be studying out first of all. This study used edge-based method to find out edge point from the measuring point data. The characteristics are analysed using the mean curvature block method on the fitting NURBS curve and defined edges through block removal condition. The results showed that only using the NURBS curve of maximum curvature analysis to define correct edge of real geometry is limited, but this segmentation approach provides simplified necessary condition for edge classification, and an effectiveness to classify a straight line, curves and fillets etc.

• ETRI Journal
• /
• v.29 no.5
• /
• pp.655-666
• /
• 2007

There are nodes and edges in a topological map. Node data has been used as a main source of information for the localization of mobile robots. In contrast, edge data is regarded as a minor source of information, and it has been used in an intuitive and heuristic way. However, edge data also can be used as a good source of information and provide a way to use edge data efficiently. For that purpose, we define a data format which describes the shape of an edge. This format is called local generalized Voronoi graph's angle (LGA). However, the LGA is constituted of too many samples; therefore, real time localization cannot be performed. To reduce the number of samples, we propose a compression method which utilizes wavelet transformation. This method abstracts the LGA by key factors using far fewer samples than the LGA. Experiments show that the LGA accurately describes the shape of the edges and that the key factors preserve most information of the LGA while reducing the number of samples.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.29B no.10
• /
• pp.78-89
• /
• 1992

In this paper, a multiresolution edge detction algorithm for speckle images is proposed. Due to the signal dependency of speckle images, the number of edge points detected depends on the local average intensity. Thus the edge detection method independent of the average intensity is required to detect properly real significant changes in an original signal. In the proposed method, candidate area is first selected based on the statistical propeties of speckle images,i.e., based on the busyness measure such as the CoV(coefficient of variation) and the difference between the real and theoretical CDF(cumulative density function). Then the real edges are extracted in a multiresolution environment. Computer simulation with test images shows that the proposed method reduces significantly false edges in relatively homogeneous areas while detects fine details properly.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.29B no.1
• /
• pp.50-57
• /
• 1992

This paper proposes and analyzes a new CFAR(Constant False Alarm Rate) detector called the EXGO(Excision Greatest Of)-CFAR. This is the combination of the EXCA(Excision Cell Averaging)-CFAR that shows a good performance under the influence of interferences and the GO(Greatest Of)-CFAR that fights well with clutter edges. For the performance analysis, the formulas for the detection probability and the false alarm probability are derived and computed, and the results are compared with other existing CFAR detectors. Our analysis shows that the proposed EXGO-CFAR considerably improves the false-alarm-rate performance of the EXCA-CFAR at clutter edges while maintaining the high detection probability performance of the EXCA-CFAR in the homogeneous and/or interference noise environment.