• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.2 no.6
• /
• pp.280-298
• /
• 2008

For efficient content-based image retrieval, diverse visual features such as color, texture, and shape have been widely used. In the case of leaf images, further improvement can be achieved based on the following observations. Most plants have unique shape of leaves that consist of one or more blades. Hence, blade-based matching can be more efficient than whole shape-based matching since the number and shape of blades are very effective to filtering out dissimilar leaves. Guaranteeing rotational invariance is critical for matching accuracy. In this paper, we propose a new shape representation, indexing and matching scheme for leaf image retrieval. For leaf shape representation, we generated a distance curve that is a sequence of distances between the leaf’s center and all the contour points. For matching, we developed a blade-based matching algorithm called rotation invariant - partial dynamic time warping (RI-PDTW). To speed up the matching, we suggest two additional techniques: i) priority queue-based pruning of unnecessary blade sequences for rotational invariance, and ii) lower bound-based pruning of unnecessary partial dynamic time warping (PDTW) calculations. We implemented a prototype system on the GEMINI framework [1][2]. Using experimental results, we showed that our scheme achieves excellent performance compared to competitive schemes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.1
• /
• pp.133-142
• /
• 1993

This paper prrsents shape matching of two-dimensional object. This shape matching is applied to two-dimensional simple c10sedcurves represented by polygons. A large number of shape matching procedures have proposed baseed on teh view that shape can be represented by a vector of numerical features, and that this representation can be matched using techniques from statical pattern recognition. The varieties of features that have been extracted from shapes and used to represent them are numerous. But all of these feature-based approches suffer from the shortcoming that the descriptor of a segment of a shape do not ordinarily bear any simple relations hip to the description for the entire shape. We solve the segment matching problem of shape matching, defined as the recognition of a piece of a shape as approximate match to a part of large shape, by using relaxation labeling technique.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.4
• /
• pp.1-8
• /
• 1994

In this paper, we propose an efficient two-step pattern matching method which promises shape distortion-tolerant recognition of handwritten of handwritten Hangul syllables. In the first step, nonlinear shape normalization is carried out to compensate for global shape distortions in handwritten characters, then a preliminary classification based on simple pattern matching is performed. In the next step, nonlinear pattern matching which achieves best matching between input and reference pattern is carried out to compensate for local shape distortions, then detailed classification which determines the final result of classification is performed. As the performance of recognition systems based on pattern matching methods is greatly effected by the quality of reference patterns. we construct reference patterns by combining the proposed nonlinear pattern matching method with a well-known averaging techniques. Experimental results reveal that recognition performance is greatly improved by the proposed two-step pattern matching method and the reference pattern construction scheme.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.12
• /
• pp.1817-1824
• /
• 1990

This paper describes a shape matching algorithm for occluded or distorted two-dimensional objects. In our approach, the shape matchin is viewed as a segment matching problem. A shape matching algorithm, based on both the stochastic labeling technique and the hypothesis generate-test paradigm, is proposed, and a simple technique which performs the stochastic labeling process in accordance with the definition of consisten labeling assignment without requiring an iterative updating process of probability valiues is also proposed. Several simulation results show that the proposed algorithm is very effective when occlusion, scaling or change of orientation has occurred in the object.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.307-310
• /
• 2009

In this paper, we present a robust shape matching approach based on bottom-up segmentation. We show how over-segmentation results can be used to overcome both ambiguity of contour matching and occlusion. To measure the shape difference between a template and the object in the input, we use oriented chamfer matching. However, in contrast to previous work, we eliminate the affection of the background clutters before calculating the shape differences using over-segmentation results. By this method, we can increase the matching cost interval between true matching and false matching, which gives reliable results. Finally, our experiments also demonstrate that our method is robust despite the presence of occlusion.

• Journal of the Korean Data and Information Science Society
• /
• v.18 no.1
• /
• pp.247-257
• /
• 2007

In this paper, we develop the noninformative priors for the common shape parameter in the gamma distributions. We develop the matching priors and reveal that the second order matching prior does not exist. It turns out that the one-at-a-time reference prior and the two group reference prior satisfy a first order probability matching criterion. Some simulation study is peformed.

• Journal of the Korean Data and Information Science Society
• /
• v.26 no.1
• /
• pp.243-253
• /
• 2015

In this paper, we develop the noninformative priors for the common shape parameter of several inverse Gaussian distributions. Specially, we want to develop noninformative priors which satisfy certain objective criterion. The probability matching priors and reference priors of the common shape parameter will be developed. It turns out that the second order matching prior does not exist. The reference priors satisfy the first order matching criterion, but Jeffrey's prior is not the first order matching prior. We showed that the proposed reference prior matches the target coverage probabilities in a frequentist sense through simulation study, and an example based on real data is given.

• Journal of Korean Society of Disaster and Security
• /
• v.12 no.3
• /
• pp.13-24
• /
• 2019

The concept of shape similarity has been applied to verify the accuracy of the SIND model, the real-time prediction model for disaster risk. However, the CRITIC method, one of the most widely used in geometric methodology, is definitely limited to apply to complex shape such as hazard map for coastal disaster. Therefore, we suggested the modified CRITIC method of which we added the shape factors such as RCCI and TF to consider complicated shapes. The matching pairs were manually divided into exact-matching pairs and mis-matching pairs to evaluate the applicability of the new method for shape similarity into hazard maps for storm surges. And the shape similarity of each matching pair was calculated by changing the weights of each shape factor and criteria. Newly proposed methodology and the calculated weights were applied to the objects of the existent hazard map and the results from SIND model. About 90% of exact-matching pairs had the shape similarity of 0.5 or higher, and about 70% of mis-matching pairs were it below 0.5. As future works, if we would calibrate narrowly and adjust carefully multi-objects corresponding to one object, it would be expected that the shape similarity of the exact-matching pairs will increase overall while it of the mis-matching pairs will decrease.

• International Journal of CAD/CAM
• /
• v.7 no.1
• /
• pp.113-120
• /
• 2007

Sketch based query plays an important role in shape matching for 3D shape retrieval system. Some researchers suggest the sketch based query interfaces. It is more effective to capture the needs of users rather than query by example. In this paper, we propose a new 2D sketch based query interface with coarse filters for shape matching. Coarse filtering enables to eliminate unfavorable shapes from shapes in DB. For the purpose of coarse filtering, we use two filters with the topological and geometric patterns. For the validity of our method, we show the experimental results.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2006.11a
• /
• pp.506-509
• /
• 2006

Shaped Sound Focusing is defined as the generation of acoustically bright shape in space using multiple sources. The acoustically bright shape is a spatially focused region with relatively high acoustic potential energy level. In view of the energy transfer, acoustical focusing is essential because acoustic energy is very small to use other type of energy. Practically, focused sound shape control not a point is meaningful because there are so many needs to enlarge the focal region especially in clinical uses and others. If focused sound shape can be controlled, it offers various kinds of solutions for clinical uses and others because a regional focusing is essentially needed to reduce a treatment time and enhance the performance of transducers. For making the shaped-sound field, control variables, such as a number of sources, excitation frequency, source positioning, etc., should be taken according to geometrical sound shape. To verify these relations between them, wavenumber domain matching method is suggested because wavenumber spectrum can provide the information of control variables of sources. In this paper, the procedures of shaped sound focusing using wavenumber domain matching and relations between control variables and geometrical sound shape are covered in case of an acoustical ring.