• Journal of the Korean Association of Geographic Information Studies
• /
• v.13 no.1
• /
• pp.62-73
• /
• 2010

A bird is needed efficient conservation through habitat management, as the representative of an organism to evaluate the steady of complex ecosystem. So, this study will offer the useful basic data for preserving habitat from now on, as presenting a estimating model with the GIS program which selected factors effecting the habitat of a forest-dwelling bird in Changwon. As the resort of the survey, the number of forest-dwelling birds living in the 135 survey sites were 5 order, 15 family, 26 species and 922 individual. Also, as the result of making habitat analysis into a predict model, 'NDVI', 'Distance to valley', 'Distance to mixed forest' and 'Area of field' were significant and they had R-squares of 51.3%. Next, as the resort of researching the accuracy of Model, it was a reasonable prediction, as the correlation coefficient is 0.735 and MAPE is 20.7%, and a predict map of habitat was made with the model. This map could predict species diversity of no investigated areas and could be an useful basic data for preserving habitat, as an on-the-spot survey.

• Korean Journal of Remote Sensing
• /
• v.36 no.3
• /
• pp.449-460
• /
• 2020

Super-resolution is a technique used to reconstruct an image with low-resolution into that of high-resolution. Recently, deep-learning based super resolution has become the mainstream, and applications of these methods are widely used in the remote sensing field. In this paper, we propose a super-resolution method based on the deep back-projection network model to improve the satellite image resolution by the factor of four. In the process, we customized the loss function with the edge loss to result in a more detailed feature of the boundary of each object and to improve the stability of the model training using generative adversarial network based on Wasserstein distance loss. Also, we have applied the detail preserving image down-scaling method to enhance the naturalness of the training output. Finally, by including the modified-residual learning with a panchromatic feature in the final step of the training process. Our proposed method is able to reconstruct fine features and high frequency information. Comparing the results of our method with that of the others, we propose that the super-resolution method improves the sharpness and the clarity of WorldView-3 and KOMPSAT-2 images.

• Journal of Broadcast Engineering
• /
• v.2 no.2
• /
• pp.114-124
• /
• 1997

In object based coding, binary shape ccx:ling plays an important role by ccx:ling the outer shape of object. Here we propose a new shape ccx:ling tool, which enccx:les the outline of shape from a baseline. Different from 2-D (Vertex) shape ccx:ling algorithms. the proposed method encodeds the data that are extracted in a I-D fashion. The enccx:led data consist of the starting position, distance lists, and turning point lists. In the lossless ccx:ling mode, every contour pixel is input for ccx:ling, whereas variable sampling has been employed to enccx:le fewer contour pixels while preserving reasonable distortion. For interframe ccx:ling, a fast motion compensation was achieved by use of distance and turning point lists. Subjective viewing tests proved that the proposed method outperforms the current shape ccx:ling standard, CAE, in MPEG-4. In objective results for compression efficiency, the proposed method was significantly better in intraframe coding than CAE, whereas CAE was better in interframe ccx:ling.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.4
• /
• pp.427-431
• /
• 2010

Multidimensional scaling (MDS) is a widely used method for dimensionality reduction, of which purpose is to represent high-dimensional data in a low-dimensional space while preserving distances among objects as much as possible. MDS has mainly been applied to data visualization and feature selection. Among various MDS methods, the classical MDS is not readily applicable to data which has large numbers of objects, on normal desktop computers due to its computational complexity. More precisely, it needs to solve eigenpair problems on dissimilarity matrices based on Euclidean distance. Thus, running time and required memory of the classical MDS highly increase as n (the number of objects) grows up, restricting its use in large-scale domains. In this paper, we propose an efficient approximation algorithm for the classical MDS based on divide-and-conquer and CUDA. Through a set of experiments, we show that our approach is highly efficient and effective for analysis and visualization of data consisting of several thousands of objects.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.8
• /
• pp.2140-2156
• /
• 2023

The Wireless Sensor Network (WSN), is constructed out of teeny-tiny sensor nodes that are very low-cost, have a low impact on the environment in terms of the amount of power they consume, and are able to successfully transmit data to the base station. The primary challenges that are presented by WSN are those that are posed by the distance between nodes, the amount of energy that is consumed, and the delay in time. The sensor node's source of power supply is a battery, and this particular battery is not capable of being recharged. In this scenario, the amount of energy that is consumed rises in direct proportion to the distance that separates the nodes. Here, we present a Hybrid Firefly Glow-Worm Swarm Optimization (HF-GSO) guided routing strategy for preserving WSNs' low power footprint. An efficient fitness function based on firefly optimization is used to select the Cluster Head (CH) in this procedure. It aids in minimising power consumption and the occurrence of dead sensor nodes. After a cluster head (CH) has been chosen, the Glow-Worm Swarm Optimization (GSO) algorithm is used to figure out the best path for sending data to the sink node. Power consumption, throughput, packet delivery ratio, and network lifetime are just some of the metrics measured and compared between the proposed method and methods that are conceptually similar to those already in use. Simulation results showed that the proposed method significantly reduced energy consumption compared to the state-of-the-art methods, while simultaneously increasing the number of functioning sensor nodes by 2.4%. Proposed method produces superior outcomes compared to alternative optimization-based methods.

• Journal of Computing Science and Engineering
• /
• v.6 no.3
• /
• pp.219-226
• /
• 2012

Recently, shape analysis of human organs has achieved much attention, owing to its potential to localize structural abnormalities. For a group-wise shape analysis, it is important to accurately restore the shape of a target structure in each subject and to build the inter-subject shape correspondences. To accomplish this, we propose a shape modeling method based on the Laplacian deformation framework. We deform a template model of a target structure in the segmented images while restoring subject-specific shape features by using Laplacian surface representation. In order to build the inter-subject shape correspondences, we implemented the progressive weighting scheme for adaptively controlling the rigidity parameter of the deformable model. This weighting scheme helps to preserve the relative distance between each point in the template model as much as possible during model deformation. This area-preserving deformation allows each point of the template model to be located at an anatomically consistent position in the target structure. Another advantage of our method is its application to human organs of non-spherical topology. We present the experiments for evaluating the robustness of shape modeling against large variations in shape and size with the synthetic sets of the second cervical vertebrae (C2), which has a complex shape with holes.

• Journal of Computing Science and Engineering
• /
• v.6 no.3
• /
• pp.193-206
• /
• 2012

Keys play a fundamental role in all data models. They allow database systems to uniquely identify data items, and therefore, promote efficient data processing in many applications. Due to this, support is required to discover keys. These include keys that are semantically meaningful for the application domain, or are satisfied by a given database. We study the discovery of keys from SQL tables. We investigate the structural and computational properties of Armstrong tables for sets of SQL keys. Inspections of Armstrong tables enable data engineers to consolidate their understanding of semantically meaningful keys, and to communicate this understanding to other stake-holders. The stake-holders may want to make changes to the tables or provide entirely different tables to communicate their views to the data engineers. For such a purpose, we propose data mining algorithms that discover keys from a given SQL table. We combine the key mining algorithms with Armstrong table computations to generate informative Armstrong tables, that is, key-preserving semantic samples of existing SQL tables. Finally, we define formal measures to assess the distance between sets of SQL keys. The measures can be applied to validate the usefulness of Armstrong tables, and to automate the marking and feedback of non-multiple choice questions in database courses.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.5C
• /
• pp.627-631
• /
• 2004

An efficient algorithm for clustering of GPDFs(Gaussian Probability Density Functions) in a speech recognition model is proposed in this paper. The proposed algorithm is based on CNN with the divergence as its distance measure and is applied to a speech recognition. The algorithm is compared with conventional Dk-means(Divergence-based k-means) algorithm in CDHMM(Continuous Density Hidden Markov Model). The results show that it can reduce about 31.3％ of GPDFs over Dk-means algorithm without suffering any recognition performance. When compared with the case that no clustering is employed and full GPDFs are used, the proposed algorithm can save about 61.8％ of GPDFs while preserving the recognition performance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.6
• /
• pp.2612-2633
• /
• 2020

Due to the explosive growth of multimedia speech data, how to protect the privacy of speech data and how to efficiently retrieve speech data have become a hot spot for researchers in recent years. In this paper, we proposed an encrypted speech retrieval scheme based on long short-term memory (LSTM) neural network and deep hashing. This scheme not only achieves efficient retrieval of massive speech in cloud environment, but also effectively avoids the risk of sensitive information leakage. Firstly, a novel speech encryption algorithm based on 4D quadratic autonomous hyperchaotic system is proposed to realize the privacy and security of speech data in the cloud. Secondly, the integrated LSTM network model and deep hashing algorithm are used to extract high-level features of speech data. It is used to solve the high dimensional and temporality problems of speech data, and increase the retrieval efficiency and retrieval accuracy of the proposed scheme. Finally, the normalized Hamming distance algorithm is used to achieve matching. Compared with the existing algorithms, the proposed scheme has good discrimination and robustness and it has high recall, precision and retrieval efficiency under various content preserving operations. Meanwhile, the proposed speech encryption algorithm has high key space and can effectively resist exhaustive attacks.

• Computers and Concrete
• /
• v.15 no.1
• /
• pp.55-71
• /
• 2015

This paper presents a novel harmony search (HS)-based data-driven single input rule modules (SIRMs)-connected fuzzy inference system (FIS) for the prediction of stress in externally prestressed tendon. The proposed method attempts to extract causal relationship of a system from an input-output pairs of data even without knowing the complete physical knowledge of the system. The monotonicity property is then exploited as an additional qualitative information to obtain a meaningful SIRMs-connected FIS model. This method is then validated using results from test data of the literature. Several parameters, such as initial tendon depth to beam ratio; deviators spacing to the initial tendon depth ratio; and distance of a concentrated load from the nearest support to the effective beam span are considered. A computer simulation for estimating the stress increase in externally prestressed tendon, ${\Delta}f_{ps}$, is then reported. The contributions of this paper is two folds; (i) it contributes towards a new monotonicity-preserving data-driven FIS model in fuzzy modeling and (ii) it provides a novel solution for estimating the ${\Delta}f_{ps}$ even without a complete physical knowledge of unbonded tendons.