• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.10a
• /
• pp.801-804
• /
• 2001

This article is concerned with automatic segmentation of two adjacent vowels for speech signals. All kinds of transition case of adjacent vowels can be characterized by spectrogram. Firstly the voiced-speech is extracted by the histogram analysis of vowel indicator which consists of wavelet low pass components. Secondly given phonetic transcription and transition pattern spectrogram, the voiced-speech portion which has consecutive vowels automatically segmented by the template matching. The cross-correlation function is adapted as a template matching method and the modified correlation coefficient is calculated for all frames. The largest value on the modified correlation coefficient series indicates the boundary of two consecutive vowel sounds. The experiment is performed for 154 vowel transition sets. The 154 spectrogram templates are gathered from 154 words(PRW Speech DB) and the 161 test words(PBW Speech DB) which are uttered by 5 speakers were tested. The experimental result shows the validity of the method.

• Journal of Information Technology and Architecture
• /
• v.10 no.1
• /
• pp.79-91
• /
• 2013

This paper proposes a systematic methodology that could be used to decide which one shows the best performance among space filling curves (SFCs) in applying lower-dimensional transformations to histogram sequences. A histogram sequence represents a time-series converted from an image by the given SFC. Due to the high-dimensionality nature, histogram sequences are very difficult to be stored and searched in their original form. To solve this problem, we generally use lower-dimensional transformations, which produce lower bounds among high dimensional sequences, but the tightness of those lower-bounds is highly affected by the types of SFC. In this paper, we attack a challenging problem of evaluating which SFC shows the better performance when we apply the lower-dimensional transformation to histogram sequences. For this, we first present a concept of spatial locality, which comes from an intuition of "if the entries are adjacent in a histogram sequence, their corresponding cells should also be adjacent in its original image." We also propose spatial locality preservation metric (slpm in short) that quantitatively evaluates spatial locality and present its formal computation method. We then evaluate five SFCs from the perspective of slpm and verify that this evaluation result concurs with the performance evaluation of lower-dimensional transformations in real image matching. Finally, we perform k-NN (k-nearest neighbors) search based on lower-dimensional transformations and validate accuracy of the proposed slpm by providing that the Hilbert-order with the highest slpm also shows the best performance in k-NN search.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.8 no.4
• /
• pp.14-23
• /
• 2005

This paper proposes a method for matching two different images, especially satellite images. In the general image matching fields, when an image is compared to other image, they may have different properties on the size, contents, brightness, etc. If there is no noise in each image, in other words, they have identical pixel level and unchanged edges, the image matching method will be simple comparison between two images with pixel by pixel. However, in many applications, most of images to be matched should have much different properties. This paper proposes an efficient method for matching satellite images. This method is to match a raw satellite image with GCP chips. From this we can make a geometrically corrected image. The proposed method is based on wavelet transformation, not required any pre-processing such as histogram equalization, analysis of raw image like the traditional methods.

• Journal of KIISE:Software and Applications
• /
• v.37 no.11
• /
• pp.859-865
• /
• 2010

In this paper, a new method for finger vein recognition is proposed. Researchers are recently interested in the finger vein recognition since it is a good way to avoid the forgery in finger prints recognition and the inconveniences in obtaining images of the iris for iris recognition. The vein images are processed to obtain the line shaped vein images through the local histogram equalization and a thinning process. This thinned vein images are processed for matching, using a new matching algorithm, named HS(HeeSung) matching algorithm. This algorithm yields an excellent recognition rate when it is applied to the curve-linear images processed through a thinning or an edge detection. In our experiment with the finger vein images, the recognition rate has reached up to 99.20% using this algorithm applied to 650finger vein images(130person ${\times}$ 5images each). It takes only about 60 milliseconds to match one pair of images.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.26 no.3D
• /
• pp.519-525
• /
• 2006

The traditional area-based matching or efficient matching methods using epipolar geometry and height restriction of stereo images, which have a confined search space for image matching, have still some disadvantages such as mismatching and timeconsuming, especially in the dense metropolitan city that very high and similar buildings exist. To solve these problems, a new image matching method through building recognition has been presented. This paper described building recognition in color stereo images using edge and color information as a elementary study of new matching scheme. We introduce the modified Hausdorff distance for using edge information, and the modified color indexing with 3-D RGB histogram for using color information. Color information or edge information alone is not enough to find conjugate building pairs. For edge information only, building recognition rate shows 46.5%, for color information only, 7.1%. However, building recognition rate distinctly increase 78.5% when both information are combined.

• 한국HCI학회:학술대회논문집
• /
• 2009.02a
• /
• pp.669-672
• /
• 2009

The techniques extract shape descriptors from 3D models and use these descriptors for indices for comparing shape similarities. Most similarity search techniques focus on comparisons of each individual 3D model from databases. However, our similarity search technique can compare not only each individual 3D model, but also partial shape similarities. The partial shape matching technique extends the user's query request by finding similar parts of 3D models and finding 3D models which contain similar parts. We have implemented an experimental partial shape-matching search system for 3D pagoda models, and preliminary experiments show that the system successfully retrieves similar 3D model parts efficiently.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.4
• /
• pp.113-120
• /
• 2004

In this paper, we propose an efficient feature extraction and image retrieval algorithm for content-based retrieval method. First, we extract the object using Gaussian edge detector for input image which is key frames of MPEG video and extract the object features that are location feature, distributed dimension feature and invariant moments feature. Next, we extract the characteristic color feature using the proposed HAQ(Histogram Analysis md Quantization) algorithm. Finally, we implement an retrieval of four features in sequence with the proposed matching method for query image which is a shot frame except the key frames of MPEG video. The purpose of this paper is to propose the novel content-based image retrieval algerian which retrieves the key frame in the shot boundary of MPEG video belonging to the scene requested by user. The experimental results show an efficient retrieval for 836 sample images in 10 music videos using the proposed algorithm.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.5
• /
• pp.35-42
• /
• 2013

Shot boundary detection is an essential step for efficient browsing, sorting, and classification of video data. Robust shot detection method should overcome the disturbances caused by pixel brightness and object movement between frames. In this paper, two shot boundary detection methods are presented to address these problem by using segmentation, object movement, and pixel brightness. The first method is based on the histogram that reflects object movements and the morphological dilation operation that considers pixel brightness. The second method uses the pixel brightness information of segmented and whole blocks between frames. Experiments on digitized video data of National Archive of Korea show that the proposed methods outperforms the existing pixel-based and histogram-based methods.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.34 no.6
• /
• pp.1765-1777
• /
• 2014

This study evaluated PMM (Probability Matching Method) for parameter estimation of the Z - R relation. As a first step, the sensitivity analysis was done to decide the threshold number of data pairs and the data interval for the development of a histogram. As a result, it was found that at least 1,000 number of data pairs are required to apply the PMM for the parameter estimation. This amount of data is similar to that collected for two hours. Also, the number of intervals for the histogram was found to be at least 100. Additionally, it was found that the matching the first-order moment is better than the cumulative probability, and that the data pairs comprising 30 to 100% are better for the PMM application. Finally, above findings were applied to a real rainfall event observed by the Bislsan radar and optimal parameters were estimated. The radar rain rate derived by applying these parameters was found to be well matched to the rain gauge rain rate.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.11a
• /
• pp.191-194
• /
• 2009

본 논문에서는 효율적인 다시점 비디오 부호화를 위해 히스토그램(histogram)을 이용한 다시점 비디오의 휘도(luminance)와 색차(chrominance)성분 보상 기법을 제안한다. 다시점 비디오는 카메라의 기하학적인 위치 차이와 여러 대의 카메라가 동일한 특성을 가지도록 완벽히 조정되지 못함으로 인해 동일한 시간대에 촬영된 인접한 시점 영상 간에 휘도와 색상의 차이가 발생할 수 있다. 이러한 특성은 인접한 카메라로부터 획득된 영상을 참조하여 시점간 움직임 예측 시에 오정합의 원인이 되어 부호화 효율을 떨어뜨리게 된다. 본 논문에서는 효율적인 다시점 비디오 부호화를 위해 시점간의 히스토그램을 비교하여 정합하는 휘도 및 색차 보상 기법을 수행한다. 일정한 시간 대역(time interval)에서 다시점 비디오의 평균 누적 히스토그램을 이용하여 참조 영상을 생성하고 각 시점별로 정합 함수를 통해 다시점 영상 간의 휘도와 색상의 불일치성을 보상한다. 제안하는 조명 보상 기법을 통하여 다시점 비디오 부호화 효율을 높일 수 있었다.