• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.41 no.1
• /
• pp.19-26
• /
• 2004

In this paper, we suggest a 3D vision inspection method which use only one camera. If we have the database of pattern and can recognize the object, and also estimate the rotated shape of the parts, we can inspect the parts using only one image. We used the 3D database and the 2D geometrical pattern matching, and the rotation transition theory about the algorithm. As the results, we could have the capability of the recognition and inspection of the rotated object through the estimation of rotation an81e. We applied our suggested algorithm to the inspection of typical IC and capacitor, and compared our suggested algorithm with the conventional 2D inspection method and the feature space trajectory method.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.10
• /
• pp.1258-1263
• /
• 1999

본 논문에서는 CRCW(Concurrent Read Concurrent Write)와 CREW(Concurrent Read Exclusive Write) PRAM(Parallel Random Access Machine) 모델에서 무방향성 그래프 G=(V, E)의 극대 매칭을 구하기 위해 간결한 랜덤 병렬 알고리즘을 제안한다. CRCW PRAM 모델에서 m개의 선을 가진 그래프에 대해, 제안된 매칭 알고리즘은 m개의 프로세서 상에서 {{{{ OMICRON (log m)의 기대 수행 시간을 가진다. 또한 CRCW 알고리즘을 CREW PRAM 모델에서 구현한 CREW 알고리즘은 OMICRON (log^2 m)의 기대 수행 시간을 가지지만,OMICRON (m/logm) 개의 프로세서만을 가지고 수행될 수 있다.Abstract This paper presents simple randomized parallel algorithms for finding a maximal matching in an undirected graph G=(V, E) for the CRCW and CREW PRAM models. The algorithm for the CRCW model has {{{{ OMICRON (log m) expected running time using m processors, where m is the number of edges in G We also show that the CRCW algorithm can be implemented on a CREW PRAM. The CREW algorithm runs in {{{{ OMICRON (log^2 m) expected time, but it requires only OMICRON (m / log m) processors.

• Journal of Information Processing Systems
• /
• v.16 no.3
• /
• pp.663-676
• /
• 2020

Plant leaf classification is a significant application of image processing techniques in modern agriculture. In this paper, a multi-granular angle description method is proposed for plant leaf classification and retrieval. The proposed method can describe leaf information from coarse to fine using multi-granular angle features. In the proposed method, each leaf contour is partitioned first with equal arc length under different granularities. And then three kinds of angle features are derived under each granular partition of leaf contour: angle value, angle histogram, and angular ternary pattern. These multi-granular angle features can capture both local and globe information of the leaf contour, and make a comprehensive description. In leaf matching stage, the simple city block metric is used to compute the dissimilarity of each pair of leaf under different granularities. And the matching scores at different granularities are fused based on quotient space theory to obtain the final leaf similarity measurement. Plant leaf classification and retrieval experiments are conducted on two challenging leaf image databases: Swedish leaf database and Flavia leaf database. The experimental results and the comparison with state-of-the-art methods indicate that proposed method has promising classification and retrieval performance.

• Journal of Distribution Science
• /
• v.19 no.12
• /
• pp.15-22
• /
• 2021

Purpose: There is still lack of guidance for merchants toward price discount presentations (absolute/relative), especially for consumers in different purchase contexts. Based on the general evaluability theory, this study investigates consumers' preferences for the presentation of discounts in various contexts through experiments. Research design, data and methodology: The relationship between discount presentation and consumers' preference is investigated in Study 1 using a two-factor between-subject design of 2 (purchase type: material vs. experiential) ×2 (discount type: absolute vs. relative). The Moderating effect of thinking mode has been examined in Study 2 via a multi-factor intergroup design of 2 (purchase type: material vs. experiential) ×2 (discount type: absolute vs. relative) ×2 (cognitive load: high vs. low). One-way ANOVA and planned contrast have been performed for analysis. Results: Experiment 1 reveals that consumers prefer absolute discounts rather than relative discounts when in material purchases. However, when in experiential purchases, they are willing to choose relative discounts. Experiment 2 verifies the boundary conditions of matching effect and illustrates the generation of matching effect is determined by thinking mode. Conclusions: Our study enriches the theories of purchase type and thinking mode. Simultaneously, the results provide practical guidance for merchants to formulate the discount presentation and distribution pricing strategies.

• Current Optics and Photonics
• /
• v.5 no.5
• /
• pp.538-543
• /
• 2021

The evanescent wave coupling of a microring resonator is controlled by changing the gap distance between the bus waveguide and the microring waveguide. However, the interdependence of the bus waveguide's width and the coupling is not well understood. In this paper, we investigate the dependence of coupling strength on the bus waveguide's width. The strength of the evanescent wave coupling is analytically calculated using coupled-mode theory (CMT) and numerically calculated by three-dimensional finite-difference-time-domain (FDTD) simulation. The analytic and numerical simulation results show that the phase-matching condition in evanescent wave coupling does not provide maximum coupling strength, because both phase-matching and mode confinement influence the coupling. The analytic and simulation results for the evanescent coupling correspond to the experimental results. The optimized bus-waveguide width that provides maximum coupling strength results in intrinsic quality factors of up to 1.3 × 10⁶. This study provides reliable guidance for the design of microring resonators, depending on various applications.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 1999.05a
• /
• pp.185-191
• /
• 1999

Mathematical morphology based on set theory has been applied to various areas in image processing. Pitas proposed a object recognition algorithm using Morphological Shape Decomposition(MSD), and a new representation scheme called Morphological Shape Representation(MSR). The Pitas's algorithm is a simple and adequate approach to recognize objects that are rotated 45 degree-units with respect to the model object. However, this recognition scheme fails in case of random rotation. This disadvantage may be compensated by defining small angle increments. However, this solution may greatly increase computational complexity because the smaller the step makes more number of rotations to be necessary. In this paper, we propose a new method for object recognition based on MSD. The first step of our method decomposes a binary shape into a union of simple binary shapes, and then a new tree structure is constructed which ran represent the relations of binary shapes in an object. finally, we obtain the feature informations invariant to the rotation, translation, and scaling from the tree and calculate matching scores using efficient matching measure. Because our method does not need to rotate the object to be tested, it could be more efficient than Pitas's one. MSR has an intricate structure so that it might be difficult to calculate matching scores even for a little complex object. But our tree has simpler structure than MSR, and easier to calculated the matchng score. We experimented 20 test images scaled, rotated, and translated versions of five kinds of automobile images. The simulation result using octagonal structure elements shows 95% correct recognition rate. The experimental results using approximated circular structure elements are examined. Also, the effect of noise on MSR scheme is considered.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.1 no.1
• /
• pp.9-25
• /
• 1991

This tutorial paper has been written for biologists, physicians or beginners in fuzzy sets theory and applications. This field is introduced in the framework of medical diagnosis problems. The paper describes and illustrates with practical examples, a general methodology of special interest in the processing of borderline cases, that allows a graded assignment of diagnoses to patients. A pattern of medical knowledge consists of a tableau with linguistic entries or of fuzzy propositions. Relationships between symptoms and diagnoses are interpreted as labels of fuzzy sets. It is shown how possibility measures (soft matching) can be used and combined to derive diagnoses after measurements on collected data. The concepts and methods are illustrated in a biomedical application on inflammatory protein variations. In the case of poor diagnostic classifications, it is introduced appropriate ponderations, acting on the characterizations of proteins, in order to decrease their relative influence. As a consequence, when pattern matching is achieved, the final ranking of inflammatory syndromes assigned to a given patient might change to better fit the actual classification. Defuzzification of results (i.e. diagnostic groups assigned to patients) is performed as a non fuzzy sets partition issued from a "separating power", and not as the center of gravity method commonly employed in fuzzy control. It is then introduced a model of fuzzy connectionist expert system, in which an artificial neural network is designed to build the knowledge base of an expert system, from training examples (this model can also be used for specifications of rules in fuzzy logic control). Two types of weights are associated with the connections: primary linguistic weights, interpreted as labels of fuzzy sets, and secondary numerical weights. Cell activation is computed through MIN-MAX fuzzy equations of the weights. Learning consists in finding the (numerical) weights and the network topology. This feed forward network is described and illustrated in the same biomedical domain as in the first part.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.10a
• /
• pp.107-110
• /
• 2015

In this paper, we propose a coalitonal game theoritic approach to the power control problem in resource-constrained wireless sensor networks, where the objective is to enhance power efficiency of individual sensors while providing the QoS requirements. We model this problem as two-sided one-to-one matching game and deploly deferred acceptance procedure that produces a single matching in the core. Furthermore, we show that, by applying the procedure repeatedly, a certain stable state is achieved where no sensor can anticipate improvements in their power efficiency as far as all of them are subject to their own QoS constraints. We evaluate our proposal by comparing them with cluster-based and the local optimal solution obtained by maximizing the total system energy efficiency, where the objective function is non-convex.

• The Journal of the Acoustical Society of Korea
• /
• v.41 no.4
• /
• pp.375-388
• /
• 2022

This paper deals with the process of obtaining sound transmission loss of a cylindrical silencer lined with multi-layered poroelastic sound absorbing materials. The Biot model and the Johnson-Champoux-Allard-Lafarge (JCAL) model were used to deal with waves propagating in multi-layered poroelastic materials. The boundary conditions required for analysis of the silencer were obtained and the numerical process of finding modes was explained. A numerical experiment was conducted on the 2-layered silencer using the modes and the transmission loss converged with the first 12 modes. Finally, the mode matching method proposed in this research was validated by being compared with the results calculated from Finite Element Method (FEM) about different kinds of sound absorbing materials.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.2
• /
• pp.73-83
• /
• 2007

In network intrusion prevention, attack packets are detected and filtered out based on their attack signatures. Pattern matching is extensively used to find attack signatures and the most time-consuming execution part of Network Intrusion Prevention Systems(NIPS). Pattern matching is usually accelerated by hardware and should be performed at wire speed in NIPS. However, that alone is not good enough. First, pattern matching hardware should be able to generate sufficient pattern match information including the pattern index number and the location of the match found at wire speed. Second, it should support pattern grouping to reduce unnecessary pattern matches. Third, it should always have a constant worst-case performance even if the number of patterns is increased. Finally it should be able to update patterns in a few minutes or seconds without stopping its operations, We propose a system architecture to meet the above requirement. The system architecture can process multiple pattern characters in parallel and employs a pipeline architecture to achieve high speed. Using Xilinx FPGA simulation, we show that the new system stales well to achieve a high speed oner 10Gbps and satisfies all of the above requirements.