• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.6
• /
• pp.30-37
• /
• 1997

We present an efficient technique, bidirectioanl inertial maximum cost search technique, for th edetection and segmentation of circular shaped objects using the spatial information around the neighborhood of the boundary candidates. This technique searches boundary candidates using local pixdl information such as pixel value and its direction. And then to exclude pseudo-boundary caused by shadows or noises, the local contrast is defined between the clique of the boundary candidates and the cliques of the background. In order to effectively segment circular shaped boundary, the technique also uses the curvature based on trigonometirc function which determines circular shaped boundary segments. Since the proposed technique is applied to the pixel cliques instead of a pixel itself, it is proposed method can easily find out circular boundaries form iamges of the PCB containing circular shaped parts and the trees with round fruits compared to boundary detection by using the pixel information and the laplacian curvature.

• Korean Journal of Computational Design and Engineering
• /
• v.4 no.2
• /
• pp.121-126
• /
• 1999

Existing data structures for non-manifold solid modelers use basic dat entities, such as vertex, edge, loop, face, shell, and region to find adjacency relationships. But, no one clearly identified what additional types of data entitles are necessary to represent incidence relationships. In this paper, we classified the boundary information of vertex, edge, face , and region from the 3-D space view. As the results we can clearly define the boundary information required for adjacency relationships. The existing B-rep data structures for solid modeler are compared whether they have the required boundary information.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.8
• /
• pp.2764-2782
• /
• 2021

Existing city-level boundary nodes identification methods need to locate all IP addresses on the path to differentiate which IP is the boundary node. However, these methods are susceptible to time-delay, the accuracy of location information and other factors, and the resource consumption of locating all IPes is tremendous. To improve the recognition rate and reduce the locating cost, this paper proposes an algorithm for city-level boundary node identification based on bidirectional approaching. Different from the existing methods based on time-delay information and location results, the proposed algorithm uses topological analysis to construct a set of candidate boundary nodes and then identifies the boundary nodes. The proposed algorithm can identify the boundary of the target city network without high-precision location information and dramatically reduces resource consumption compared with the traditional algorithm. Meanwhile, it can label some errors in the existing IP address database. Based on 45,182,326 measurement results from Zhengzhou, Chengdu and Hangzhou in China and New York, Los Angeles and Dallas in the United States, the experimental results show that: The algorithm can accurately identify the city boundary nodes using only 20.33% location resources, and more than 80.29% of the boundary nodes can be mined with a precision of more than 70.73%.

• International Journal of Contents
• /
• v.2 no.3
• /
• pp.22-26
• /
• 2006

In this paper we introduce a new circle detection algorithm for occluded on/off pupil and iris boundary extraction. The proposed algorithm employs 7-step processing to detect a center and radius of occluded on/off eye images using the property of the chords. The algorithm deals with two types of occluded pupil and iris boundary information; one is composed of circle-shaped, incomplete objects, which is called occluded on iris images and the other type consists of arc objects in which circular information has partially disappeared, called occluded off iris images. This method shows that the center and radius of iris boundary can be detected from as little as one-third of the occluded on/off iris information image. It is also shown that the proposed algorithm computed the center and radius of the incomplete iris boundary information which has partially occluded and disappeared. Experimental results on RGB images and IR images show that the proposed method has encouraging performance of boundary detection for pupil and iris segmentation. The experimental results show satisfactorily the detection of circle from incomplete circle shape information which is occluded as well as the detection of pupil/iris boundary circle of the occluded on/off image.

• Structural Engineering and Mechanics
• /
• v.6 no.3
• /
• pp.339-345
• /
• 1998

The computation size and accuracy in the boundary element method are mutually coupled and strongly influenced by the formulations in boundary discretization and integration. This aspect is studied numerically for two-dimensional elastodynamic problems in the frequency-domain. The localized nature of error is observed in the computed results. A boundary discretization criterion is examined. The number of integration points in the boundary integration is studied to find the optimum number for accuracy. Useful information is obtained concerning the optimization in boundary discretization and integration.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.10
• /
• pp.1294-1304
• /
• 1995

In this paper, a method has been proposed for the fully automatic detection of left ventricular endocardial boundary in B-mode short axis echocardiography without manual intervention by human operator. The proposed method makes use of the weighted model that approximates to endocardium and incomplete edge information for echocardiography. Therefore, this method is more effective than boundary detection by only edge information. The implementation of this method is as follows. First, the proposed algorithms are used in order to detect the approximate boundary, then a weighted model with the approximate boundary is constructed. Finally, the cavity center of the left ventricle performing the Hough transform with the weighted model and edge image can be found automatically, and then the endocardial boundary using detected center, original image, weighted model, and edge image can be detected. validations of this method with experimental results on echo image of dog's heart and clinical echocardiography is verified.

• Journal of computational fluids engineering
• /
• v.18 no.2
• /
• pp.56-65
• /
• 2013

Two compression ramp problems and an impinging shock problem are computed to investigate influence of turbulence models and eddy viscosity on the shock-wave / boundary layer interaction. A Navier-Stokes boundary layer generation code was applied to the generation of inflow boundary conditions. Computational results are validated well with the experimental data and effects of turbulence models are investigated. It is shown that the behavior of turbulence (eddy) viscosity directly affects both the extent of the separation and shock-wave positions over the separation.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.11 no.3
• /
• pp.136-150
• /
• 2008

Many studies have been carried out for automatic extraction of building by LiDAR data or airphoto. Combining the benefits of 3D location information data and shape information data of image can improve the accuracy. So, in this research building recognition algorithm based on contour was used to improve accuracy of building recognition by LiDAR data and elaborate building boundary recognition by airphoto. Building recognition algorithm based on contour can generate building boundary and roof structure information. Also it shows better accuracy of building detection than the existing recognition methods based on TIN or NDSM. Out of creating buffers in regular size on the building boundary which is presumed by contour, this research limits the boundary area of airphoto and elaborate building boundary to fit into edge of airphoto by double active contour. From the result of this research, 3D building boundary will be able to be detected by optimal matching on the constant range of extracted boundary in the future.

• The KIPS Transactions:PartB
• /
• v.8B no.5
• /
• pp.539-548
• /
• 2001

In this paper, we propose that fast tracking algorithm for moving object is separated from background, using partial boundary line information. After detecting boundary line from input image, we track moving object by using the algorithm which takes boundary line information as feature of moving object. we extract moving vector on the imput image which has environmental variation, using high-performance BMA, and we extract moving object on the basis of moving vector. Next, we extract boundary line on the moving object as an initial feature-vector generating step for the moving object. Among those boundary lines, we consider a part of the boundary line in every direction as feature vector. And then, as a step for the moving object, we extract moving vector from feature vector generated under the information of the boundary line of the moving object on the previous frame, and we perform tracking moving object from the current frame. As a result, we show that the proposed algorithm using feature vector generated by each directional boundary line is simple tracking operation cost compared with the previous active contour tracking algorithm that changes processing time by boundary line size of moving object. The simulation for proposed algorithm shows that BMA operation is reduced about 39% in real image and tracking error is less than 2 pixel when the size of feature vector is [$10{\times}5$] using the information of each direction boundary line. Also the proposed algorithm just needs 200 times of search operation bout processing cost is varies by the size of boundary line on the previous algorithm.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.31 no.2
• /
• pp.111-119
• /
• 2013

It is essential and fundamental to extract boundary information of target object via massive three-dimensional point data acquired from laser scanner. Especially extracting boundary information of manmade features such as buildings is quite important because building is one of the major components consisting complex contemporary urban area, and has artificially defined shape. In this research, extended ${\chi}$-algorithm using geometry information of point data was proposed to extract boundary information of building from three-dimensional point data consisting building. The proposed algorithm begins with composing Delaunay triangulation process for given points and removes edges satisfying specific conditions process. Additionally, to make whole boundary extraction process efficient, we used Sweep-hull algorithm for constructing Delaunay triangulation. To verify the performance of the proposed extended ${\chi}$-algorithm, we compared the proposed algorithm with Encasing Polygon Generating Algorithm and ${\alpha}$-Shape Algorithm, which had been researched in the area of feature extraction. Further, the extracted boundary information from the proposed algorithm was analysed against manually digitized building boundary in order to test accuracy of the result of extracting boundary. The experimental results showed that extended ${\chi}$-algorithm proposed in this research proved to improve the speed of extracting boundary information compared to the existing algorithm with a higher accuracy for detecting boundary information.