• Spatial Information Research
• /
• v.3 no.1
• /
• pp.65-80
• /
• 1995

GIS has been developed very rapidly during last few decades and the performance of GIS in terms of information processing such as automated mapping and facility management has been tremendous. However, its analytical capability is still very limited and it is often critisized due to lack of reality. The objective of this research is that first, linking housevalue models to GIS, second, reflecting the complexity of real world into the housevalue model using GIS in terms of incorpor¬rating polycentric urban structure and calculating distance through street network, and third, comparing the results of housevalue model at census tract to that of block group level.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.5
• /
• pp.75-82
• /
• 1998

Conventional vector quantization (VQ) codebook design methods have several drawbacks such as edge degradation and high computational complexity. In this paper, we first made activity coordinates from the horizonatal and the vertical activity of the input block. Then it is mapped on the 2-dimensional interconnected codebook, and the codebook is designed using kohonen self-organizing map (KSFM) learning algorithm after the search of a codevector that has the minumum distance from the input vector in a small window, centered by the mapped point. As the serch area is restricted within the window, the computational amount is reduced compared with usual VQ. From the resutls of computer simulation, proposed method shows a better perfomance, in the view point of edge reconstruction and PSNR, than previous codebook training methods. And we also obtained a higher PSNR than that of classified vector quantization (CVQ).

• Journal of the military operations research society of Korea
• /
• v.25 no.1
• /
• pp.29-36
• /
• 1999

In this paper, we are concerned with the K-shortest loopless path problem. The MPS algorithm, recently proposed by Martins et al., finds paths efficiently because it solves the shortest path problem only one time unlike other algorithms. But its computational complexity has not been known yet. We propose a few techniques by which the MPS algorithm can be implemented efficiently. First, we use min-heap data structure for the storage of candidate paths in order to reduce searching time for finding minimum distance path. Second, we prevent the eliminated paths from reentering in the list of candidate paths by lower bounding technique. Finally, we choose the source mode as a deviation node, by which selection time for the deviation node is reduced and the performance is improved in spite of the increase of the total number of candidate paths.

• Journal of Information Processing Systems
• /
• v.16 no.1
• /
• pp.30-41
• /
• 2020

Lines and textures are natural properties of the surface of natural objects, and their images can be sparsely represented in suitable frames such as wavelets, curvelets and wave atoms. Based on characteristics that the curvelets framework is good at expressing the line feature and wavesat is good at representing texture features, we propose a model for the weighted sparsity constraints of the two frames. Furtherly, a multi-step iterative fast algorithm for solving the model is also proposed based on the split Bergman method. By introducing auxiliary variables and the Bergman distance, the original problem is transformed into an iterative solution of two simple sub-problems, which greatly reduces the computational complexity. Experiments using standard images show that the split-based Bergman iterative algorithm in hybrid domain defeats the traditional Wavelets framework or curvelets framework both in terms of timeliness and recovery accuracy, which demonstrates the validity of the model and algorithm in this paper.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.23 no.5
• /
• pp.591-596
• /
• 1986

A binary continuous phase frequency shift keying (CPFSK), whose phase is a continuous function of time and instantaneous frequency is constant, is a bandwidth efficient constant envelope signalling scheme. A transmitting signal is formed by combined coding of a convolutional encoder and a binary CPFSK modulator. The signal is transmitted throuth additive white Gaussian noise(AWGN) channel. If the received signal is detected by a coherent maximum likelihood(ML) receiver, error probability can be expressed approximately in terms of minimum Euclidean distance. We propose rate 2/4 codes for the improvement of error performance without increating the data rate per bandwidth and the receiver complexity. Its minimum Euclidean distances are compared with those of rate \ulcornercodes as a function of modulation index and observation interval.

• Electronics and Telecommunications Trends
• /
• v.39 no.1
• /
• pp.48-61
• /
• 2024

The integration of high-capacity terrestrial networks with non-terrestrial communication using satellites has become essential to support seamless low-latency services based on artificial intelligence and big data. Tunable light sources have been instrumental in resolving the complexity of channel management in wavelength division multiplexing (WDM) systems, contributing to increased network flexibility and serving as optical sources for long-distance coherent systems. Recently, these light sources have been applied to beam-steering devices in laser communication and sensing applications across ground, aerial, and satellite transport. We examine the utilization and requirements of tunable lasers in WDM networks and describe the relevant development status. In addition, performance requirements and development directions for tunable lasers used in optical interference systems and beam-steering devices are reviewed.

• Journal of Korean Society of Transportation
• /
• v.30 no.4
• /
• pp.21-32
• /
• 2012

Exclusive bus lane (EBL) is typically located in the roadway median, and is accessed by weaving across the GPLs(general purpose lanes) before entering from the left lane of the GPLs. To maximize the potential for successful EBL operations, a critical design issue that requires special attention is the length of bus weaving section before entering EBL. The process of developing guidelines for the length of bus weaving section can be supported by a sensitivity analysis of performance measure (safety) with respect to the bus weaving distance. However, field data are difficult to obtain due to inherent complexity in creating performance measure (safety) samples under various interesting flows and bus weaving distance that are keys to research success. In this paper, VISSIM simulation is applied to simulate the operation of roadway weaving areas with EBL, and based on vehicle trajectory data from microscopic traffic simulation models, the Surrogate Safety Assessment Model (SSAM) computes the number of surrogate conflicts (or degree of safety) with respect to the bus weaving distance. Then, a multiple linear regression (MLR) model using safety data (number of surrogate conflicts) is developed. Finally, guidelines for bus weaving distance are established based on the developed MLR. Developed guidelines explicitly indicate that a longer bus weaving distance is required to maintain desired safety as weaving volume increases.

• Korean journal of applied entomology
• /
• v.51 no.1
• /
• pp.23-31
• /
• 2012

Understanding the ecological complexity and habitat of a species are crucially important to conserve an endangered species. This study evaluated the patch network ecology of the endangered species $Parnassius$ $bremeri$. The results indicated that 188 individuals were captured and 220 were recaptured, respectively. The sex ratio of female: male was 42:146; males were four times more abundant than females. The average longevity of an adult was $3.93{\pm}3.93$ days (male, $4.0{\pm}3.9$; female, $2.5{\pm}1.0$ days); the maximum longevity was 14 days for males and 13 days for females, respectively. Therefore, the expected longevity of males was longer than that of females. The average emigration distance for the species was 377 m, and the maximum emigration distance was 1550 m. The analysis of patch connectivity and individual colonization revealed that the ideal distance between patches was about 300 m. Moreover, a >600 m patch distance decreased the colonization rate severely. We also observed higher immigration and emigration between patches that were clustered in close proximity. This leads us to conclude that a higher number of patches at a close distance is best suited for $P.bremeri$. We find these results to be crucial to determine a policy to protect and conserve this endangered species.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.2
• /
• pp.28-38
• /
• 2000

This paper proposes a fractal compression method using the domain classification and local searching, which utilize DCT coefficient characteristic Generally, the fractal Image encoding method has a time consuming process to search a domain to be matched with range block In order to reduce computation complexity, the domain and range regions are respectively classified into 4 category by using the characteristics of DCT coefficients and each range region is encoded by a method suitable for the property of its category Since the bit amount of the compressed image depends on the number of range blocks, the matching of domain block and range block is induced on the large range block by using local search, so that compression ratio is increased by reducing the number of range block In the local search, the searching complexity is reduced by determining the direction and distance of searching using the characteristics of DCT coefficients The experimental results shows that the proposed algorithm have 1 dB higher PSNR and 0 806 higher compression ratio than previous algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.42 no.2
• /
• pp.453-459
• /
• 2017

Users tend to check in and post their statuses in location-based social networks (LBSNs) to describe that their interests are related to a point-of-interest (POI). While previous studies on discovering area-of-interests (AOIs) were conducted mostly on the basis of density-based clustering methods with the collection of geo-tagged photos from LBSNs, we focus on estimating a POI boundary, which corresponds to only one cluster containing its POI center. Using geo-tagged tweets recorded from Twitter users, this paper introduces a density-based low-complexity two-phase method to estimate a POI boundary by finding a suitable radius reachable from the POI center. We estimate a boundary of the POI as the convex hull of selected geo-tags through our two-phase density-based estimation, where each phase proceeds with different sizes of radius increment. It is shown that our method outperforms the conventional density-based clustering method in terms of computational complexity.