• Proceedings of the KSRS Conference
• /
• 대한원격탐사학회 2008년도 International Symposium on Remote Sensing
• /
• pp.361-364
• /
• 2008

It is well known that combining spatial and spectral information can improve land use classification from satellite imagery. High spatial resolution classification has a limitation when only using the spectral information due to the complex spatial arrangement of features and spectral heterogeneity within each class. Therefore, extracting the spatial information is one of the most important steps in high resolution satellite image classification. In this paper, we propose a new spatial feature extraction method. The extracted features are integrated with spectral bands to improve overall classification accuracy. The classification is achieved by applying a Support Vector Machines classifier. In order to evaluate the proposed feature extraction method, we applied our approach to KOMPSAT-2 data and compared the result with the other methods.

• Proceedings of the KSRS Conference
• /
• 대한원격탐사학회 2007년도 Proceedings of ISRS 2007
• /
• pp.530-532
• /
• 2007

Multi-Spectral Camera(MSC) is a main payload on the KOMPSAT-2 satellite to perform the earth remote sensing. The MSC instrument has one(1) channel for panchromatic imaging and four(4) channel for multi-spectral imaging covering the spectral range from 450nm to 900nm using TDI CCD Focal Plane Array (FPA). The compression method on KOMPSAT-2 MSC was selected and used to match EOS input rate and PDTS output data rate on MSC image data chain. At once the MSC performance was carefully handled to minimize any degradation so that it was analyzed and restored in KGS(KOMPSAT Ground Station) during LEOP and Cal./Val.(Calibration and Validation) phase. In this paper, on-orbit image data chain in MSC and image data processing on KGS including general MSC description is briefly described. The influences on image performance between on-board compression algorithms and between performance restoration methods in ground station are analyzed and discussed.

• Speech Sciences
• /
• 제11권4호
• /
• pp.17-28
• /
• 2004

In this paper, we propose a statistical approach to improve the performance of spectral quantization of speech coders. The proposed techniques compensate for the distortion in a decoded line spectrum pairs (LSP) vector based on a statistical mapping function between a decoded LSP vector and its corresponding original LSP vector. We first develop two codebook-based probabilistic matching (CBPM) methods based on linear mapping functions according to different assumption of distribution of LSP vectors. In addition, we propose an iterative procedure for the two CBPMs. We apply the proposed techniques to a predictive vector quantizer used for the IS-641 speech coder. The experimental results show that the proposed techniques reduce average spectral distortion by around 0.064dB.

• Journal of The Korean Astronomical Society
• /
• 제47권5호
• /
• pp.195-199
• /
• 2014

We present a GUI-based interactive Python program, VIMAP, which generates radio spectral index maps of active galactic nuclei (AGN) from Very Long Baseline Interferometry (VLBI) maps obtained at different frequencies. VIMAP is a handy tool for the spectral analysis of synchrotron emission from AGN jets, specifically of spectral index distributions, turn-over frequencies, and core-shifts. In general, the required accurate image alignment is difficult to achieve because of a loss of absolute spatial coordinate information during VLBI data reduction (self-calibration) and/or intrinsic variations of source structure as function of frequency. These issues are overcome by VIMAP which in turn is based on the two-dimensional cross-correlation algorithm of Croke & Gabuzda (2008). In this paper, we briefly review the problem of aligning VLBI AGN maps, describe the workflow of VIMAP, and present an analysis of archival VLBI maps of the active nucleus 3C 120.

• Proceedings of the Korean Information Science Society Conference
• /
• 한국정보과학회 2005년도 한국컴퓨터종합학술대회 논문집 Vol.32 No.1 (A)
• /
• pp.892-894
• /
• 2005

Graph partitioning provides an important tool for data clustering, but is an NP-hard combinatorial optimization problem. Spectral clustering where the clustering is performed by the eigen-decomposition of an affinity matrix [1,2]. This is a popular way of solving the graph partitioning problem. On the other hand, semidefinite relaxation, is an alternative way of relaxing combinatorial optimization. issuing to a convex optimization[4]. In this paper we present a semidefinite programming (SDP) approach to graph equi-partitioning for clustering and then we use eigen-decomposition to obtain an optimal partition set. Therefore, the method is referred to as semidefinite spectral clustering (SSC). Numerical experiments with several artificial and real data sets, demonstrate the useful behavior of our SSC. compared to existing spectral clustering methods.

• Proceedings of the Korean Information Science Society Conference
• /
• 한국정보과학회 2004년도 가을 학술발표논문집 Vol.31 No.2 (1)
• /
• pp.697-699
• /
• 2004

Despite many successful spectral clustering algorithm (based on the spectral decomposition of Laplacian(1) or stochastic matrix(2) ) there are several unsolved problems. Most spectral clustering Problems are based on the normalized of algorithm(3) . are close to the classical graph paritioning problem which is NP-hard problem. To get good solution in polynomial time. it needs to establish its convex form by using relaxation. In this paper, we apply a novel optimization technique. semidefinite programming(SDP). to the unsupervised clustering Problem. and present a new multiple Partitioning method. Experimental results confirm that the Proposed method improves the clustering performance. especially in the Problem of being mixed with non-compact clusters compared to the previous multiple spectral clustering methods.

• Proceedings of the KSRS Conference
• /
• 대한원격탐사학회 2003년도 Proceedings of ACRS 2003 ISRS
• /
• pp.732-734
• /
• 2003

In the middle -resolution remote sensing, the Ground Sampled Distance(GSD) sensed and sampled by the detector is generally larger than the size of objects(or materials) of interest, in which case several objects are embedded in a single pixel and cannot be detected spatially. This study is intended to solve this problem of a hyperspectral data with high spectral resolution. We examined the detection algorithm, Linear Spectral Mixing Model, and also made a test on the Hyperion data. To find class Endmembers, we applied two methods, Spectral Library and Geometric Model, and compared them with each other.

• Transactions of the Korean Society of Mechanical Engineers
• /
• 제18권1호
• /
• pp.166-174
• /
• 1994

A critical evaluation is made of the spectral bias which occurs in the use of a laser doppler velocimeter(LDV). Two processing algorithms are considered for spectral estimates: the sample and hold interpolation method(SH) and the nonuniform Shannon reconstruction technique(SR). Assessment is made of these for varying data densities $(0.05{\le}d.d.{\le}5)$ and turbulence levels(t.i.=30%, 100%). As an improved version of the spectral estimator, the utility of POCS (the projection onto convex sets) has been tested in the present study. This algorithm is found useful to be in the region when $d.d.{\gep}3.$

• Current Optics and Photonics
• /
• 제5권4호
• /
• pp.431-443
• /
• 2021

Sparse unmixing has been proven to be an effective method for hyperspectral unmixing. Hyperspectral images contain rich spectral and spatial information. The means to make full use of spectral information, spatial information, and enhanced sparsity constraints are the main research directions to improve the accuracy of sparse unmixing. However, many algorithms only focus on one or two of these factors, because it is difficult to construct an unmixing model that considers all three factors. To address this issue, a novel algorithm called multiview-based spectral weighted and low-rank row-sparsity unmixing is proposed. A multiview data set is generated through spectral partitioning, and then spectral weighting is imposed on it to exploit the abundant spectral information. The row-sparsity approach, which controls the sparsity by the l_2,0 norm, outperforms the single-sparsity approach in many scenarios. Many algorithms use convex relaxation methods to solve the l_2,0 norm to avoid the NP-hard problem, but this will reduce sparsity and unmixing accuracy. In this paper, a row-hard-threshold function is introduced to solve the l_2,0 norm directly, which guarantees the sparsity of the results. The high spatial correlation of hyperspectral images is associated with low column rank; therefore, the low-rank constraint is adopted to utilize spatial information. Experiments with simulated and real data prove that the proposed algorithm can obtain better unmixing results.

• Journal of the Korean Geographical Society
• /
• 제51권4호
• /
• pp.509-523
• /
• 2016

The soil prediction can provide quantitative soil information for sustainable mountainous ecosystem management. Visible near infrared spectroscopy, one of soil prediction methods, has been applied to predict several soil properties with effective costs, rapid and nondesctructive analysis, and satisfactory accuracy. Spectral preprocessing is a essential procedure to correct noisy spectra for visible near infrared spectroscopy. However, there are no attempts to evaluate various spectral preprocessing methods. We tested 5 different pretreatments, namely continuum removal, Savitzky-Golay filter, discrete wavelet transform, 1st derivative, and 2nd derivative to predict soil carbon(C) and nitrogen(N). Partial least squares regression was used for the prediction method. The total of 153 soil samples was split into 122 samples for calibration and 31 samples for validation. In the all range, absorption was increased with increasing C contents. Specifically, the visible region (650nm and 700nm) showed high values of the correlation coefficient with soil C and N contents. For spectral preprocessing methods, continuum removal had the highest prediction accuracy(Root Mean Square Error) for C(9.53mg/g) and N(0.79mg/g). Therefore, continuum removal was selected as the best preprocessing method. Additionally, there were no distinct differences between Savitzky-Golay filter and discrete wavelet transform for visual assessment and the methods showed similar validation results. According to the results, we also recommended Savitzky-Golay filter that is a simple pre-treatment with continuum removal.