• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.3
• /
• pp.99-105
• /
• 2011

In this paper, we proposed a method for estimating an accurate gamut based on segment maxima method. According to the number of segments in the segment maxima, a local concavity is generated in the vicinity of lightness axis or a gamut is reduced in high chroma region. It induces artifacts or deterioration of the image quality. To remove these artifacts, the number of segment is determined according to the number of samples. and a local concavity is modified by extending a detected concave point to the line connecting two adjacent boundary points. Experimental results show that the contours in a uniform color region and speckle artifacts from the conventional segment maxima algorithm are removed.

• Journal of the Society of Naval Architects of Korea
• /
• v.56 no.5
• /
• pp.418-426
• /
• 2019

To derive a simplified analytic solution which can be utilized as a fundamental solution for the wave maker design, a segment of the wave board has been idealized as a submerged line segment in a two dimensional domain of a wave flume. The lower end of the line segment could be located at arbitrary depth of the wave flume and the upper end of the board could be also submerged to any depth from the free surface. The freely oscillating motion of the wave board is assumed to be defined by determining the condition of horizontal oscillation on both ends differently. The submerged wave board oscillating in horizontal direction could be specified by selecting the amplitude, frequency and the phase lag differently on lower and upper ends of the board. The simplified two dimensional wave generated by the wave board segment has been obtained by the first order perturbation method. It is found that the general solution of the freely oscillating wave board in two dimensional domain could be decomposed into the solution of flap motion with lower end hinge and swing motion with upper end hinge. The case study of the analytic solutions has been carried out to evaluate the effect on the wave height due to the difference of oscillation frequency, phase difference and variation of stroke between for the motion of both ends. It is found that the solution of the freely oscillating wave board could be utilized for the development of high performance wavemaker especially for irregular waves.

• Journal of Institute of Control, Robotics and Systems
• /
• v.20 no.11
• /
• pp.1153-1163
• /
• 2014

An efficient 3D SLAM (Simultaneous Localization and Map Building) method is developed for urban building environments using a tilted 2D LRF (Laser Range Finder), in which a 3D map is composed of perpendicular/horizontal planar polygons. While the mobile robot is moving, from the LRF scan distance data in each scan period, line segments on the scan plane are successively extracted. We propose an "expected line segment" concept for matching: to add each of these scan line segments to the most suitable line segment group for each perpendicular/horizontal planar polygon in the 3D map. After performing 2D localization to determine the pose of the mobile robot, we construct updated perpendicular/horizontal infinite planes and then determine their boundaries to obtain the perpendicular/horizontal planar polygons which constitute our 3D map. Finally, the proposed SLAM algorithm is validated via extensive simulations and experiments.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.3
• /
• pp.1-8
• /
• 2016

The printed circuit board (PCB) can be used only 2 layers of front and back. Therefore, the wiring line segments are located in 2 layers without crossing each other. In this case, the line segment can be appear in both layers and this line segment is to resolve the crossing problem go through the via. The via minimization problem (VMP) has minimum number of via in layout design problem. The VMP is classified by NP-complete because of the polynomial time algorithm to solve the optimal solution has been unknown yet. This paper suggests polynomial time algorithm that can be solve the optimal solution of VMP. This algorithm transforms n-line segments into vertices, and p-crossing into edges of a graph. Then this graph is partitioned into 3-coloring sets of each vertex in each set independent each other. For 3-coloring sets $C_i$, (i=1,2,3), the $C_1$ is assigned to front F, $C_2$ is back B, and $C_3$ is B-F and connected with via. For the various experimental data, though this algorithm can be require O(np) polynomial time, we obtain the optimal solution for all of data.

• Smart Structures and Systems
• /
• v.24 no.4
• /
• pp.475-490
• /
• 2019

The detection of structural damage without a priori information on the healthy state is challenging. In order to address the issue, the study presents a baseline-free approach to detect damage in beam structures based on an actual influence line. In particular, a multi-segment function-fitting calculation is developed to extract the actual deflection influence line (DIL) of a damaged beam from bridge responses due to a passing vehicle. An intact basis function based on the measurement position is introduced. The damage index is defined as the difference between the actual DIL and a constructed function related to the intact basis, and the damage location is indicated based on the local peak value of the damage index curve. The damage basis function is formulated by using the detected damage location. Based on the intact and damage basis functions, damage severity is quantified by fitting the actual DIL using the least-square calculation. Both numerical and experimental examples are provided to investigate the feasibility of the proposed method. The results indicate that the present baseline-free approach is effective in detecting the damage of beam structures.

• Journal of Korea Multimedia Society
• /
• v.7 no.4
• /
• pp.579-591
• /
• 2004

This paper presents a new arc segmentation method which extracts curves from simple drawing consisted of straight lines and curves and segments them into circular arcs. First, it finds center points and finds line segments and curve segments by tracing connected center points. Next, it expands the segment by searching neighbor segment at the two endpoints. Next, it removes straight lines and segments the extracted curves into circular arcs by using the recursive subdivision method. The proposed method has been compared with previous vectorization software and vector based arc segmentation method. Experimental results show that the proposed method produces more correct results for the curves which contain intersection with other lines or curves.

• Journal of Institute of Control, Robotics and Systems
• /
• v.14 no.12
• /
• pp.1294-1301
• /
• 2008

Under passive RFID environment, this paper presents a new localization of a mobile robot traversing over the floor covered with tags, which is superior to existing methods in terms of estimation performance and cost effectiveness. Basically, it is assumed that a mobile robot is traveling along a series of straight line segments, each segment at a certain constant velocity, and that the number of tags sensed by a mobile robot at each sampling instant is at most one. First, for a given line segment with known starting point, the velocity and position of a mobile robot is estimated using the spatial and temporal information acquired from the traversed tag. Some discussions are made on the validity of the basic assumptions and the localization for the initial segment with unknown starting point. Second, for a given tag distribution density, the optimal tag arrangement is considered to reduce the position estimation error as well as to make easy the tag attachment on the floor. After reviewing typical tag arrangements, the pseudorandom tag arrangement is devised inspired from the Sudoku puzzle, a number placement puzzle. Third, through experiments using our passive RFID localization system, the validity and performance of the mobile robot localization proposed in this paper is demonstrated.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.26 no.10
• /
• pp.1961-1970
• /
• 2002

A laser scanner is widely used fur a device fur acquiring point data in reverse engineering. It is more efficient to generate a surface automatically from the line-typed data than scattered data of points clouds. In the case of a compound model, it is hard to represent all the scanned data into one surface maintaining its original line characteristics. In this paper, a method is presented to generate a surface by the segmentation of measured point data. After forming triangular net, the segmentation is done by the user input such as the angle between triangles, the number of facets to be considered as small segment, and the angle for combining small segment. B-spline fitting is implemented to the point data in each segment. The surface generation through segmentation shows a reliable result when it is applied to the models with curvature deviation regions. An useful algorithm for surface reconstruction is developed and verified by applying an practical model and shows a good tools fur reverse engineering in design modification.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.6
• /
• pp.709-713
• /
• 2005

A new algorithm is proposed for the extraction of line segments to construct 3D wire-frame models of building from the high-resolution aerial images. The purpose of this study Is the accurate and effective extraction of line segments, considering the problems such as discordance of lines and blurred edges existing in the conventional methods. Using the edge map extracted from aerial images, chain code tracking of edges was performed. Then, we extract the line segments considering the strength of edges and the direction of them. SUSAN (Smallest Uni-value Segment Assimilating Nucleus) algorithm proposed by Smith was used to extract an edge map. The proposed algorithm consists of 4 steps: removal of the horizontal, vertical and diagonal components of edges to reduce non-candidate point of line segments based on the chain code tracking of the edge map, removal of contiguous points, removal of the same angle points, and the extraction of the start and end points to be line segments. By comparing the proposed algorithm with Boldt algorithm, better results were obtained regarding the extraction of the representative line segments of buildings, having relatively less extraction of unnecessary line segments.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.1
• /
• pp.12-17
• /
• 2005

The segment matching method shows better performance than the global and points-based methods to compare reference signature with an input signature. However, the segment-to-segment matching method has the problem of decreasing recognition rate according to the variation of partitioning points. This paper proposes a fusion model based on the segment matching and HMM to construct a more reliable authentic system. First, a segment matching classifier is designed by conventional technique to calculate matching values lot dynamic information of signatures. And also, a novel HMM classifier is constructed by using the principal component analysis to calculate matching values for static information of signatures. Finally, SVM classifier is adopted to effectively combine two independent classifiers. From the various experiments, we find that the proposed method shows better performance than the conventional segment matching method.