• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 2009년도 IWAIT
• /
• 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 Information Processing Systems
• /
• 제16권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.

• 대한원격탐사학회지
• /
• 제11권1호
• /
• pp.47-64
• /
• 1995

In this paper, an algorithm that finds man-made structures in a praylevel aerial images is proposed to perform stereo matching. An extracted contour of buildings must have a high accuracy in order to get a good feature-based stereo matching result. Therefore this study focuses on the use of edge following in the original image rather than use of ordinary edge filters. The Algorithm is composed of two main categories; one is to find candidate regions in the whole image and the other is to extract exact contours of each building which each candidate region.. The region growing method using the centroid linkage method of variance value is used to find candidate regions of building and the contour line tracing algorithm based on an adge following method is used to extract exact contours. The result shows that the almost contours of building composed of line segments are extracted.

• 한국정보과학회논문지:소프트웨어및응용
• /
• 제32권11호
• /
• pp.1013-1020
• /
• 2005

본 논문은 모양 특성을 이용한 효과적인 식물 잎 이미지 검색 시스템을 제시한다. 잎 이미지의 더 효과적인 표현을 위해 개선된 MPP 알고리즘을 제안하고, 매칭에 소요되는 시간을 줄이기 위해 기존의 Nearest Neighbor(NN) 검색을 수정한 동적인 매칭 알고리즘을 제시한다. 특히, 더 나은 정확율과 효율성을 위해, 잎 모양과 잎차례를 스케치하여 질의할 수 있도록 하였다. 실험에서는 제안한 알고리즘과 기존의 알고리즘인 CCD(Centroid Contour Distance), Fourier Descriptor. Curvature Scale Space Descriptor (CSSD), Moment Invariants, MPP와 비교하였다. 1000여개의 식물 잎 이미지를 통한 실험결과는 제안한 방법이 기존의 기법보다 더 좋은 성능임을 보였다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1991년도 한국자동제어학술회의논문집(국제학술편); KOEX, Seoul; 22-24 Oct. 1991
• /
• pp.1730-1733
• /
• 1991

In this paper, we two dimensional processing method is presented, which can accurately determine the orientation of an part. Matching bewteen the object and the object contour is decomposed to estimate the orientation of the object and to evaluate the similarity new approach is very robust with respect to noise and no preprocessing of the contour is required. Also, this method has many advantages over the converntional correlation technique. With only a few uniformly sampled points, this method can estimate the accurate orientation in an efficient manner even in a noisy environment.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제2권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.

• 음성과학
• /
• 제5권1호
• /
• pp.49-62
• /
• 1999

This study is concerned with the educational program Visual Analysis Tool (VAT) for sound development for foreign intonation using personal computer. The VAT can run on IBM-PC 386 compatible or higher. It shows the spectrogram, waveform, intensity and the pitch contour. The system can work freely on either waveform zoom in-out or the documentation of measured value. In this paper, intensity and pitch contour information were used. Twelve French sentences were recorded from a French conversational tape. And three Korean participated in this study. They spoke out twelve sentences repeatly and trid to make the same pitch contour - by visually matching their pitcgh contour to the native speaker's. A sentences were recorded again when the participants themselves became familiar with intonation, intensity and pauses. The difference of pitch contour(rising or falling), pitch value, energy, total duration of sentences and the boundary of rhythmic group between native speaker's and theirs before and after training were compared. The results were as following: 1) In a declarative sentence: a native speaker's general pitch contour falls at the end of sentences. But the participant's pitch contours were flat before training. 2) In an interrogative: the native speaker made his pitch contours it rise at the end of sentences with the exception of wh-questions (qu'est-ce que) and a pitch value varied a greath. In the interrogative 'S + V' form sentences, we found the pitch contour rose higher in comparison to other sentences and it varied a great deal. 3) In an exclamatory sentence: the pitch contour looked like a shape of a mountain. But the participants could not make it fall before or after training.

• 한국통신학회논문지
• /
• 제24권12B호
• /
• pp.2359-2368
• /
• 1999

본 논문에서는 2차원 영상을 기반으로 3차원 목표물을 인식하는 기법의 한 예로서 적외선 영상으로부터 추출된 물체의 모양 정보와 모양 정보의 신뢰도를 이용해서 지상에서 지상용 차량을 인식하는 기법(ground-to-ground vehicle recognition)을 제안한다. 우선 목표물 추출과정에서 얻어진 마스크의 윤곽선 상에 있는 점들 중 에지 경사도의 크기와 밝기값이 일정한 값 이상이 되는 점들을 신뢰도가 높은 점이라고 정의하고 신뢰도가 높은 점들을 연결해서 신뢰도가 높은 부분 윤곽선(sub-contour)을 추출한다. 모델로부터 입력 영상의 신뢰도가 높은 윤곽선에 해당되는 윤곽선을 선택한 후 각각 해당되는 윤곽선들은 이산 정현 변환(Discrete Sine Transform)을 사용해서 특징값을 계산한 다음 서로 비교한다. 실험 결과 영상 분할이 불완전한 경우 신뢰도를 이용한 방법이 그렇지 않은 방법보다 더 나은 결과를 보였다.

• 한국인터넷방송통신학회논문지
• /
• 제15권1호
• /
• pp.139-145
• /
• 2015

본 논문은 16-QAM 신호 전송시 시분산 채널에서 발생되는 부호간 간섭을 줄이기 위해 사용되는 적응 등화알고리즘인 VSCA (Variable stepsize Square Contour Algorithm)와 VSDA (Variable stepsize Square contour Decision directed Algorithm)의 성능 비교에 관한 것이다. SCA 에서는 송신 신호의 2차 통계치인 Constellation Dependent Constant를 이용하여 수신 신호의 진폭과 위상을 보상하지만, 이들 VSCA와 VSDA에서는 constellation matching을 위한 distance adjusted approach 개념을 이용한 step size를 변화시켜 적응 등화 성능을 더욱 개선시킨 것이다. 논문에서는 컴퓨터 시뮬레이션을 통하여 VSCA와 VSDA의 성능을 비교하였으며, 이를 위한 성능 지수로는 등화기 출력 신호 성상도, 잔류 isi양, 최대 찌그러짐 및 MSE를 사용하였다. 이들 알고리즘의 성능 비교 결과 모든 비교지수에서 VSCA 알고리즘이 VSDA보다 우월함을 확인하였다.

• IEIE Transactions on Smart Processing and Computing
• /
• 제6권2호
• /
• pp.76-84
• /
• 2017

This paper presents an efficient method for generating spatiotemporal images in order to detect leukocyte motion in microvessels. Leveraging the constraint that leukocytes move along the contour line of the blood vessel wall, our proposed method efficiently generates spatiotemporal images for leukocyte motion detection. To that end, translational motion caused by in vivo movement is first removed by a template matching method. Second, the blood vessel region is detected by an automatic threshold selection method in order to binarize temporal variance images. Then, the contour of the blood vessel wall is expressed via B-spline function. Finally, using the detected blood vessel wall's contour as an initial curve, the plasma layer for the most accurate position is determined in order to find the spatial axis via snake, and the spatiotemporal images are generated. Experimental results show that the spatiotemporal images are generated effectively through comparison of each step with three images.