• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2003년도 Proceedings of ACRS 2003 ISRS
• /
• pp.820-824
• /
• 2003

One of the most important research areas on remote sensing is spectral unmixing of hyper-spectral data. For spectral unmixing of hyper spectral data, accurate land cover information is necessary. But obtaining accurate land cover information is difficult process. Obtaining land cover information from high-resolution data may be a useful solution. In this study spectral signature of endmembers on ASTER acquired in October was calculated from land cover information on IKONOS acquired in September. Then the spectral signature of endmembers applied to ASTER images acquired on January and March. Then the result of spectral unmxing of them evauateted. The spectral signatures of endmembers could be applied to different seasonal images. When it applied to an ASTER image which have similar zenith angle to the image of the spectral signatures of endmembers, spectral unmixing result was reliable. Although test data has different zenith angle from the image of spectral signatures of endmembers, the spectral unmixing results of urban and vegetation were reliable.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2008년도 심포지엄 논문집 정보 및 제어부문
• /
• pp.99-100
• /
• 2008

This paper proposes a Gaussian Mixture Model (GMM) - based speech emotion recognition methods using four feature parameters; 1) Fast Fourier Transform(FFT) spectral entropy, 2) delta FFT spectral entropy, 3) Mel-frequency Filter Bank (MFB) spectral entropy, and 4) delta MFB spectral entropy. In addition, we use four emotions in a speech database including anger, sadness, happiness, and neutrality. We perform speech emotion recognition experiments using each pre-defined emotion and gender. The experimental results show that the proposed emotion recognition using FFT spectral-based entropy and MFB spectral-based entropy performs better than existing emotion recognition based on GMM using energy, Zero Crossing Rate (ZCR), Linear Prediction Coefficient (LPC), and pitch parameters. In experimental Results, we attained a maximum recognition rate of 75.1% when we used MFB spectral entropy and delta MFB spectral entropy.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2004년도 Proceedings of ISRS 2004
• /
• pp.609-612
• /
• 2004

Geometric shape in a surface material sometimes produces different slopes that have different illuminations. It causes some difficulties to get same classification results or to identify as an object for the different facets in a surface material. A regression method is suggested to adjust the spectral information of different facets in a surface material using image segments. The method to adjust spectral information in a building facets was very successful. The most important advantage of this method is to keep the intensity of spectral information as well as spectral response. This method can also be implemented in an adaptive way.

• Journal of the Korean Data and Information Science Society
• /
• 제18권4호
• /
• pp.1135-1143
• /
• 2007

The singular value decomposition and the spectral decomposition are the useful methods in the area of matrix computation for multivariate techniques such as principal component analysis and multidimensional scaling. These techniques aim to find a simpler geometric structure for the data points. The singular value decomposition and the spectral decomposition are the methods being used in these techniques for this purpose. In this paper, the singular value decomposition and the spectral decomposition are compared.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권7호
• /
• pp.2568-2584
• /
• 2015

Spectral clustering has become one of the most popular clustering approaches in recent years. Similarity graph constructed on the data is one of the key factors that influence the performance of spectral clustering. However, the similarity graphs constructed by existing methods usually contain some unreliable edges. To construct reliable similarity graph for spectral clustering, an efficient method based on Markov random walk (MRW) is proposed in this paper. In the proposed method, theMRW model is defined on the raw k-NN graph and the neighbors of each sample are determined by the probability of the MRW. Since the high order transition probabilities carry complex relationships among data, the neighbors in the graph determined by our proposed method are more reliable than those of the existing methods. Experiments are performed on the synthetic and real-world datasets for performance evaluation and comparison. The results show that the graph obtained by our proposed method reflects the structure of the data better than those of the state-of-the-art methods and can effectively improve the performance of spectral clustering.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2004년도 ICEIC The International Conference on Electronics Informations and Communications
• /
• pp.137-142
• /
• 2004

In this paper, we propose a new scheme for geometry coding of three-dimensional (3-D) mesh models using a fixed spectral basis. In order to code the mesh geometry information, we generate a fixed spectral basis using the dual graph derived from the 3-D mesh topology. After we partition a 3-D mesh model into several independent sub-meshes to reduce coding complexity, the mesh geometry information is projected onto the generated orthonormal bases which are the eigenvectors of the Laplacian matrix of the 3-D mesh. Finally, spectral coefficients are coded by a quantizer and a variable length coder. The proposed scheme can not only overcome difficulty of generating a fixed spectral basis, but also reduce coding complexity. Moreover, we can provide an efficient multi-resolution representation of 3-D meshes.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2009년도 추계학술대회
• /
• pp.738-741
• /
• 2009

본 연구는 잡음을 포함한 음성 환경에서의 음성인식을 개선방안에 관한 것이다. 우리는 음성인식에서 잡음 섞인 음성으로부터 얻은 스펙트럴 envelope에서 곡들의 스펙트럴 subtraction 및 복원이 보다 더 효과적임을 알 수 있었다. 본 연구에서, 평균화된 스펙트럴 envelope은 모음 스펙트럼으로부터 추출하여 곡들의 강조에 사용하였다. 낮은 주파수 영역에서의 모음 스펙트럴 정보는 강조되어지고 자음으로부터 얻은 스펙트럼은 변하지 않는다. 시뮬레이션으로 살펴보면, 강조계수는 켑스트럴 영역에서 변한다. 이 방법으로 잡음석인 숫자음성 인식에서 적용하였으며 인식결과가 개선됨을 알 수 있었다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 하계종합학술대회 논문집 Ⅳ
• /
• pp.2343-2346
• /
• 2003

The spatial resolution of multispectral images can be improved by merging them with higher resolution image data. A fundamental problem frequently occurred in existing fusion processes, is the distortion of spectral information. This paper presents a spatially adaptive image fusion algorithm which produces visually natural images and retains the quality of local spectral information as well. High frequency information of the high resolution image to be inserted to the resampled multispectral images is controlled by adaptive gains to incorporate the difference of local spectral characteristics between the high and the low resolution images into the fusion. Each gain is estimated to minimize the l$_2$-norm of the error between the original and the estimated pixel values defined in a spatially adaptive window of which the weight are proportional to the spectral correlation measurements of the corresponding regions. This method is applied to a set of co-registered Landsat7 ETM＋ panchromatic and multispectral image data.

• 한국컴퓨터정보학회논문지
• /
• 제21권11호
• /
• pp.1-7
• /
• 2016

In this paper, we proposed real-time relative radiometric calibration processing method for SWIR(Short Wavelength Infra-Red) sensor using 'Hyper-Spectral Imager'. Until now domestic research for Hyper-Spectral Imager has been performing with foreign sensor device. So we have been studying hyper spectral sensor device to meet domestic requirement, especially military purpose. To improve detection & identify capability in 'Hyper-Spectral Imager', it is necessary to expend sensing wavelength from visual and NIR(Near Infra-Red) to SWIR. We aimed to design real-time processor for SWIR sensor which can control the sensor ROIC(Read-Out IC) and process calibrate the image. To build Hyper-Spectral sensor device, we will review the SWIR sensor and its signal processing board. And we will analyze relative radiometric calibration processing method and result. We will explain several SWIR sensors, our target sensor and its control method, steps for acquisition of reference images and processing result.

• ETRI Journal
• /
• 제44권5호
• /
• pp.769-779
• /
• 2022

Spectral clustering has become a typical and efficient clustering method used in a variety of applications. The critical step of spectral clustering is the similarity measurement, which largely determines the performance of the spectral clustering method. In this paper, we propose a novel spectral clustering algorithm based on the local similarity measure of shared neighbors. This similarity measurement exploits the local density information between data points based on the weight of the shared neighbors in a directed k-nearest neighbor graph with only one parameter k, that is, the number of nearest neighbors. Numerical experiments on synthetic and real-world datasets demonstrate that our proposed algorithm outperforms other existing spectral clustering algorithms in terms of the clustering performance measured via the normalized mutual information, clustering accuracy, and F-measure. As an example, the proposed method can provide an improvement of 15.82% in the clustering performance for the Soybean dataset.