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

Scale-invariant feature is an effective method for retrieving and classifying images. In this study, we analyze a scale-invariant planar curve features for developing 2D shapes. Scale-space filtering is used to determine contour structures on different scales. However, it is difficult to track significant points on different scales. In mathematics, curvature is considered to be fundamental feature of a planar curve. However, the curvature of a digitized planar curve depends on a scale. Therefore, automatic scale detection for curvature analysis is required for practical use. We propose a technique for achieving automatic scale detection based on difference of curvature. Once the curvature values are normalized with regard to the scale, we can calculate difference in the curvature values for different scales. Further, an appropriate scale and its position are detected simultaneously, thereby avoiding tracking problem. Appropriate scales and their positions can be detected with high accuracy. An advantage of the proposed method is that the detected significant points do not need to be located in the same contour. The validity of the proposed method is confirmed by experimental results.

• Journal of Broadcast Engineering
• /
• v.13 no.6
• /
• pp.962-965
• /
• 2008

2-D shape descriptors, which are vectors representing characteristics of shapes, enable comparison and classification of shapes and are mainly applied to image and 3-D model retrieval. Existing descriptors have limitations that they only describe shapes of single closed contours or lack in precision, making it difficult to be applied to shapes with multiple contours. Therefore, in this paper, we propose a new shape descriptor called Multi-Curvature-Scale Space that can be applied to shapes with multiple contours. Specifically, we represent the topology of the sub-contours in the multi-contour along with Curvature-Scale Space descriptors to represent the shapes of each sub-contours. Also, by allowing the weight of each component to be controlled when computing the distance between descriptors the weight, we deal with ambiguities in measuring similarity between shapes. Results of various experiments that prove the effectiveness of proposed descriptor are presented.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.05a
• /
• pp.731-734
• /
• 2007

본 연구는 구조광 기반의 깊이 에지를 이용하여 조명의 변화와 복잡한 배경에 상관없이 손 제스처의 외곽선 영상을 안정적으로 획득하였고, 제스처 영상을 표현하기 위하여 Curvature Scale Space(CSS) map을 이용하였다. 기존의 CSS map은 외곽선 영상의 깊은 굴곡과 완만한 굴곡을 잘 구분하지 못하는 문제점이 있었으나, 본 연구에서는 이러한 문제점을 분석하고, 이를 개선하기 위해서 각도 좌표를 이용한 CSS map 생성 방법을 제안하였다. 실험을 통해서 제안한 방법이 기존의 CSS map보다 우수한 인식 성능이 있음을 보였다.

• Journal of Korea Multimedia Society
• /
• v.14 no.5
• /
• pp.622-631
• /
• 2011

Corners play an important role in describing object features for pattern recognition and identification. This paper proposed a fast and adaptive corner detector in both coarse and fine scale, followed by the framework of the curvature scale space (CSS). An adaptive curvature threshold and evaluating of angles of corner candidates are added to original CSS to remove round corners and false corners in the detecting process. The efficiency of proposed method is compared to other popular detectors in both accuracy criteria, stability and time consuming. Results illustrate that the proposed method performs extremely surpass in both areas.

• Journal of the Chungcheong Mathematical Society
• /
• v.34 no.1
• /
• pp.37-53
• /
• 2021

In this paper we define scaled visual curvature and visual Frenet frame that can be visually accepted for discrete space curves. Scaled visual curvature is relatively simple compared to multi-scale visual curvature and easy to control the influence of noise. We adopt scaled minimizing directions of height functions on each neighborhood. Minimizing direction at a point of a curve is a direction that makes the point a local minimum. Minimizing direction can be given by a small noise around the point. To reduce this kind of influence of noise we exmine the direction whether it makes the point minimum in a neighborhood of some size. If this happens we call the direction scaled minimizing direction of C at p ∈ C in a neighborhood Br(p). Normal vector of a space curve is a second derivative of the curve but we characterize the normal vector of a curve by an integration of minimizing directions. Since integration is more robust to noise, we can find more robust definition of discrete normal vector, visual normal vector. On the other hand, the set of minimizing directions span the normal plane in the case of smooth curve. So we can find the tangent vector from minimizing directions. This lead to the definition of visual tangent vector which is orthogonal to the visual normal vector. By the cross product of visual tangent vector and visual normal vector, we can define visual binormal vector and form a Frenet frame. We examine these concepts to some discrete curve with noise and can see that the scaled visual curvature and visual Frenet frame approximate the original geometric invariants.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.6
• /
• pp.114-123
• /
• 2003

The current paper proposes a new vertex selection scheme for polygon-based contour coding. To efficiently characterize the shape of an object, we incorporate the curvature information in addition to the conventional maximum distance criterion in vertex selection process. The proposed method consists of "two-step procedure." At first, contour pixels of high curvature value are selected as key vortices based on the curvature scale space (CSS), thereby dividing an overall contour into several contour-segments. Each segment is considered as an open contour whose end points are two consecutive key vortices and is processed independently. In the second step, vertices for each contour segment are selected using progressive vertex selection (PVS) method in order to obtain minimum number of vertices under the given maximum distance criterion ( $D_{max}$$^{*}$). Furthermore, the obtained vortices are adjusted using the dynamic programming (DP) technique to optimal positions in the error area sense. Experimental results are presented to compare the approximation performances of the proposed and conventional methods.imation performances of the proposed and conventional methods.

• The KIPS Transactions:PartB
• /
• v.12B no.5 s.101
• /
• pp.527-534
• /
• 2005

Rotation and scale variations make it difficult to solve the problem of shape description and recognition because these variations change the location of points composing the shape. However, some geometric Invariant points and the relations among them are not changed by these variations. Therefore, if points in image space depicted with the r-y coordinates system can be transformed into a new coordinates system that are invariant to rotation and scale, the problem of shape description and recognition becomes easier. This paper presents a shape description method via transformation from the image space into the invariant feature space having two axes: representing relative distance from a centroid and contour segment curvature(CSC). The relative distance describes how far a point departs from the centroid, and the CSC represents the degree of fluctuation in a contour segment. After transformation, mesh features were used to describe the shape mapped onto the feature space. Experimental results show that the proposed method is robust to rotation and scale variations.

• Tunnel and Underground Space
• /
• v.6 no.1
• /
• pp.10-18
• /
• 1996

Arched openings are generally excavated in underground construction works. Since stress distribution around openings depends on geological structure in rock mass, any shape of arched openings fully conformed with in-situ stress condition should be recommended to maintain mechanical safety of structures. Shape of arched openings is specified by both roof curvature and height-width ratio, and especially this report presents deformation behaviors related with roof curvature. Scale model tests and numerical studies of various shaped openings are conducted, where rectangular opening shows the greatest convergence. Through the anlayses of various arched opengings, as radius of roof curvature is increased, roof lowering and sidewall closure are remarkably increased, whereas floor heaving is increased little by little. By the way, it is useful that displacements of openings are roughly estimated in the stage of preliminary investigation. To find out elastic displacements of arched openings with any roof curvature, regressional formula and charts by least square method are represented. In addition elastoplastic deformation behavoirs of arched openings concerning associated adn non-associated flow rule are discussed.

• Journal of Digital Contents Society
• /
• v.10 no.3
• /
• pp.423-431
• /
• 2009

There are various image retrieval methods using shape, color and texture features. One of the most active area is using shape and color information. A number of shape representations have been suggested to recognize shapes even under affine transformation. There are many kinds of method for shape recognition, the well-known method is Fourier descriptors and moment invariant. The other method is CSS(Curvature Scale Space). The maxima of curvature scale space image have already been used to represent 2-D shapes in different applications. Because preexistence CSS exists several problems, in this paper we use improved CSS method for retrieval image. There are two kinds of method, One is using RGB color information feature and the other is using HSI color information feature. In this paper we used HSI color model to represent color histogram before, then use it as comparison measure. The similarity is measured by using Euclidean distance and for reduce search time and accuracy, We use DTW for measure similarity. Compare with the result of using Euclidean distance, we can find efficiency elevated.

• Proceedings of the IEEK Conference
• /
• 2003.11a
• /
• pp.505-508
• /
• 2003

The current paper proposes a new vertex selection scheme for polygon-based contour ceding. To efficiently characterize the shape of an object, we incorporate the curvature information in addition to the conventional maximum distance criterion in vertex selection process. The proposed method consists of “two-step procedure.” At first, contour pixels of high curvature value are selected as key vertices based on the curvature scale space (CSS), thereby dividing an overall contour into several contour-segments. Each segment is considered as an open contour whose end points are two consecutive key vertices and is processed independently. In the second step, vertices for each contour segment are selected using progressive vertex selection (PVS) method in order to obtain minimum number of vertices under the given maximum distance criterion ( $D_{MAX}$). Experimental results are presented to compare the approximation performances of the proposed and conventional methods.s.