• Journal of Digital Contents Society
• /
• v.8 no.2
• /
• pp.107-112
• /
• 2007

With the evolution to distributed computing technology, the concept of conventional client/server function has been advanced to Service-Oriented Architecture, which can share the information between heterogeneous systems as services. To success Service-Oriented Architecture, the conjunction between business layer and application layer is one of the important techniques. In this paper, we classify services into two views, vertical and horizontal, and introduce matching technique with service classification for SOA.

• Journal of Intelligence and Information Systems
• /
• v.6 no.1
• /
• pp.65-72
• /
• 2000

In this paper we propose the new binary image matching algorithm called the Fuzzy logic induced Hausdorff Distance(FHD) for finding the maximally matched image with the query image. The membership histogram is obtained by normalizing the cardinality of the subset with the corresponding radius after obtaining the distribution of the minimum distance computed by the Hausdroff distance between two binary images. in the proposed algorithm, The fuzzy influence method Center of Gravity(COG) is applied to calculate the best matching candidate in the membership function described above. The proposed algorithm shows the excellent results for the face image recognition when the noise is added to the query image as well as for the character recognition.

• Coupled systems mechanics
• /
• v.7 no.3
• /
• pp.255-268
• /
• 2018

Stability of MBC1, a specific matching boundary condition, is proved for atomic simulations of a diatomic chain. The boundary condition and the Newton equations that govern the atomic dynamics form a coupled system. Energy functions that decay along with time are constructed for both the boundary with the same type atoms and the one with different type atoms. For a nonlinear chain, MBC1 is also shown stable. Numerical verifications are presented. Moreover, MBC1 is proved to be stable for a two dimensional square lattice.

• Proceedings of the Korean Printing Society Conference
• /
• 2000.12a
• /
• pp.0.2-0
• /
• 2000

Most important step for the color matching in scanner is the color coordinate transformation from the scanner RGB space to device independent uniform color space. A variety of color calibration technologies have been developed for input device. Linear or nonlinear matrices have been conveniently applied to correct the color filter\`s mismatch with color matching function in scanners. The color matching accuracy is expected to be further improved when the nonlinear matrices are optimized into subdivided smaller color spaces than in single matrix of the entire color space. This article proposed the scanner calibration method using subspace division regression analysis and it were compared with conventional method.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.4
• /
• pp.1120-1128
• /
• 1999

The model-based object recognition is defined as a graph matching process between model images and an input image. In this paper, a graph matching problem is modeled as a n optimization problems and a genetic algorithm is proposed to solve the problems. For this work, fitness function, data structured and genetic operators are developed The simulation results are shown that the proposed genetic algorithm can match feature points between model image and input image for recognition of partially occluded two-dimensional objects. The performance fo the proposed technique is compare with that of a neural network technique.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.2
• /
• pp.77-87
• /
• 1996

Existing area-based stereo matching algorithms utilize a single rectangular correlation area for computing cross-correlation between corresponding points in stereo images, and compute disparity by finding the peak in the vicinity of depth discontinuity, since, because of inconstnat disparities around discontinuities, the cross-correlation becomes low in such area. Inthis paper, a new area-based matching strategy is proposed exploiting multiple directional correlation masks instead of a single one. The proposed technique computes multiple cross-covariance functions using each oriented mask. Peaks are detected from each covariance function and the disparity is computed by choosing the location with the highest covariance value. Proposed approach can also be applied to compute disparity gradients without obtaining dense depth data. A number of examples are presented using synthetic and natural stereo images.

• Journal of Dental Rehabilitation and Applied Science
• /
• v.23 no.3
• /
• pp.219-225
• /
• 2007

The ability of a dentist to select and communicate an acceptable shade match to a dental laboratory may be the most important factor in esthetic restorative dentistry. However, shade matching is a very complex situation. In this study, an attempt was made to compare and evaluate the conventional visual assessment and colorimetric analysis in clinical shade matching. 20 patients were selected and their maxillary central incisors shade were measured by Vita classic shade guide, using $Shadepilot^{TM}$ and ShadeEye $NCC^{(R)}$. The results indicate that there is much variation in the shade selection by visual and instrumental methods.

• Journal of Dental Rehabilitation and Applied Science
• /
• v.23 no.2
• /
• pp.131-137
• /
• 2007

The ability of a dentist to select and communicate an acceptable shade match to a dental laboratory may be the most important factor in esthetic restorative dentistry. However, shade matching is a very complex situation. In this study, an attempt was made to compare and evaluate the conventional visual assessment and colorimetric analysis in clinical shade matching. 20 patients were selected and their maxillary central incisors shade were measured by Vita classic shade guide, using $Shadepilot^{TM}$ and ShadeEye $NCC^{(R)}$. The results indicate that there is much variation in the shade selection by visual and instrumental methods.

• Journal of Institute of Control, Robotics and Systems
• /
• v.16 no.8
• /
• pp.744-750
• /
• 2010

To segment instances of vehicle classes in a sparse stereo-matching data set, this paper presents an algorithm for clustering based on DP (Dynamic Programming). The algorithm is agglomerative: it begins with each element in the set as a separate cluster and merges them into successively larger clusters according to similarity of two clusters. Here, similarity is formulated as a cost function of DP. The proposed algorithm is proven to be effective by experiments performed on various images acquired by a moving vehicle.

• Journal of the Korean Graphic Arts Communication Society
• /
• v.19 no.1
• /
• pp.4-16
• /
• 2001

Most important step for the color matching in scanner is the color coordinate transformation from the scanner RGB space to device independent uniform color space. A variety of color calibration technologies have been developed for input device. Linear or nonlinear matrices have been conveniently applied to correct the color filter's mismatch with color matching function in scanners. The color matching accuracy is expected to be further improved when the nonlinear matrices are optimized into subdivided smaller color spaces than in single matrix of the entire color space. This article proposed the scanner calibration method using subspace division regression analysis and it were compared with conventional method.