• The KIPS Transactions:PartB
• /
• v.11B no.3
• /
• pp.327-336
• /
• 2004

For visual inspection system in real industrial environment, it is one of most important tasks to design fast and stable pattern matching algorithm. This paper presents an edge-based point correlation algorithm avoiding full search in visual inspection system. Conventional algorithms based on NGC(normalized gray-level correlation) have to overcome some difficulties for applying to automated inspection system in factory environment. First of all, NGC algorithms need high time complexity and thus high performance hardware to satisfy real-time process. In addition, lighting condition in realistic factory environments if not stable and therefore intensity variation from uncontrolled lights gives many roubles for applying directly NGC as pattern matching algorithm in this paper, we propose an algorithm to solve these problems from using thinned and binarized edge data and skipping full point search with edge-map analysis. A point correlation algorithm with the thinned edges is introduced with image pyramid technique to reduce the time complexity. Matching edges instead of using original gray-level pixel data overcomes NGC problems and pyramid of edges also provides fast and stable processing. All proposed methods are preyed from experiments using real images.

• Wind and Structures
• /
• v.34 no.1
• /
• pp.115-125
• /
• 2022

The high-Reynolds number flow around a rectangular cylinder, having streamwise to crossflow length ratio equal to 5 is analyzed in the present paper. The flow is characterized by shear-layer separation from the upstream edges. Vortical structures of different size form from the roll-up of these shear layers, move downstream and interact with the classical vortex shedding further downstream in the wake. The corresponding mean flow is characterized by a recirculation region along the lateral surface of the cylinder, ending by mean flow reattachment close to the trailing edge. The mean flow features on the cylinder side have been shown to be highly sensitive to set-up parameters both in numerical simulations and in experiments. The results of 21 Large Eddy Simulations (LES) are analyzed herein to highlight the impact of the lateral mean recirculation characteristics on the near-wake flow features and on some bulk quantities. The considered simulations have been carried out at Reynolds number Re=DU_∞/ν=40 000, being D the crossflow dimension, U_∞ the freestream velocity and ν the kinematic viscosity of air; the flow is set to have zero angle of attack. Some simulations are carried out with sharp edges (Mariotti et al. 2017), others with different values of the rounding of the upstream edges (Rocchio et al. 2020) and an additional LES is carried out to match the value of the roundness of the upstream edges in the experiments in Pasqualetto et al. (2022). The dimensions of the mean recirculation zone vary considerably in these simulations, allowing us to single out meaningful trends. The streamwise length of the lateral mean recirculation and the streamwise distance from the upstream edge of its center are the parameters controlling the considered quantities. The wake width increases linearly with these parameters, while the vortex-shedding non-dimensional frequency shows a linear decrease. The drag coefficient also linearly decreases with increasing the recirculation length and this is due to a reduction of the suctions on the base. However, the overall variation of C_D is small. Finally, a significant, and once again linear, increase of the fluctuations of the lift coefficient is found for increasing the mean recirculation streamwise length.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.3
• /
• pp.93-101
• /
• 2009

This paper suggests a new algorithm automatically searching for Region-of-Interest(ROI) with high speed, using the edge information of high frequency subband transformed with wavelet. The proposed method executes a searching algorithm of 4-direction object boundary by the unit of block using the edge information, and detects ROIs. The whole image is splitted by $64{\times}64$ or $32{\times}32$ sized blocks and the blocks can be ROI block or background block according to taking the edges or not. The 4-directions searche the image from the outside to the center and the algorithm uses a feature that the low-DOF image has some edges as one goes to center. After searching all the edges, the method regards the inner blocks of the edges as ROI, and makes the ROI masks and sends them to server. This is one of the dynamic ROI method. The existing methods have had some problems of complicated filtering and region merge, but this method improved considerably the problems. Also, it was possible to apply to an application requiring real-time processing caused by the process of the unit of block.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.5
• /
• pp.559-565
• /
• 1988

A new valley operator is presented for extracting sketch features which contain valleys and edges subject to local intensities. It is a very simple operator using the local probablities in a 3x3 local window. Experimental results show its excellent performance over the existing valley or edge operators.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1987.04a
• /
• pp.46-48
• /
• 1987

In the difference picture(DP) which is obtatined from two subsequent images we detect edge intersection points(EIP) and estimate the directions in which edges disappear at those points, Then we group the DP regions which the motion of the object makes and we extract the moving object.

• Journal of applied mathematics & informatics
• /
• v.26 no.3_4
• /
• pp.531-540
• /
• 2008

We discuss the decomposition problems on circuit graphs and triangular graphs, and show how they can be applied to obtain results on spanning trees or hamiltonian cycles. We also prove that every circuit graph containing no separating 3-cycles can be extended by adding new edges to a triangular graph containing no separating 3-cycles.

• Proceedings of the Korean Vacuum Society Conference
• /
• 1998.06a
• /
• pp.117-117
• /
• 1998

• Bulletin of the Korean Mathematical Society
• /
• v.51 no.1
• /
• pp.229-235
• /
• 2014

We enumerate black and white colored d-ary trees with no leftmost ${\square}$-edges, which is a generalization of hybrid binary trees. Then the multi-colored hybrid d-ary trees with the same condition is studied.

• 제어로봇시스템학회:학술대회논문집
• /
• 1993.10a
• /
• pp.168-172
• /
• 1993

As the worst-case analysis for interval plants, a conjecture whether the supremum of the integral of square error(ISE) is attained at the extreme point such as vertices, Kharitonov vertices, CB segment, and edges is suggested. We present a sufficient condition for which the worst performance index occurs at one ofvertices of uncertain parameter space. Numerical examples are also given.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2012.10a
• /
• pp.512-513
• /
• 2012