• The Journal of the Acoustical Society of Korea
• /
• v.28 no.3
• /
• pp.260-267
• /
• 2009

It is very difficult to form a desired complex sound field at a designated region precisely as an application of acoustic arrays, which is one of important objects of array systems. To solve the problem, a filter design method was suggested, which employed the concept of an inverse method using the acoustical holography based on the boundary element method. In the acoustical holography used for the source identification, the measured field data are employed to reconstruct the vibro-acoustic parameters on the source surface. In the analogous problem of source array design, the desired field data at some specific points in the sound field was set as constraints and the volume velocity at the surface points of the source plane became the source signal to satisfy the desired sound field. In the filter design, the constraints for the desired sound field are set, first. The array source and given space are modelled by the boundary elements. Then, the desired source parameters are inversely calculated in a way similar to the holographic source identification method. As a test example, a target field comprised of a quiet region and a plane wave propagation region was simultaneously realized by using the array with 16 loudspeakers.

• Journal of Advanced Navigation Technology
• /
• v.28 no.3
• /
• pp.278-287
• /
• 2024

In this paper, telemetry link budget model for small launch vehicle is proposed, and telemetry link budget simulator is implemented. The proposed link budget model consist of geometry model and propagation loss model. The geometry model is calculation of look angle between ground station and small launch vehicle. The propagation loss model consist of free space loss, polarization loss, and de-pointing loss which are appropriate to the small launch vehicle flight environment. The proposed propagation loss model can be calculate propagation loss without complex calculation of propagation environments. The link budget simulator is implemented in MATLAB. The simulator calculate look angle, free space loss, polarization loss parameter, de-pointing loss and received signal level in ground station by using position of ground station, routing of small launch vehicle, 3-D radiation patterns of antennas.

• Korean Journal of Remote Sensing
• /
• v.34 no.5
• /
• pp.811-827
• /
• 2018

The purpose of this study is to compare machine learning algorithm and deep learning algorithm in crop classification using multi-temporal remote sensing data. For this, impacts of machine learning and deep learning algorithms on (a) hyper-parameter and (2) training sample size were compared and analyzed for Haenam-gun, Korea and Illinois State, USA. In the comparison experiment, support vector machine (SVM) was applied as machine learning algorithm and convolutional neural network (CNN) was applied as deep learning algorithm. In particular, 2D-CNN considering 2-dimensional spatial information and 3D-CNN with extended time dimension from 2D-CNN were applied as CNN. As a result of the experiment, it was found that the hyper-parameter values of CNN, considering various hyper-parameter, defined in the two study areas were similar compared with SVM. Based on this result, although it takes much time to optimize the model in CNN, it is considered that it is possible to apply transfer learning that can extend optimized CNN model to other regions. Then, in the experiment results with various training sample size, the impact of that on CNN was larger than SVM. In particular, this impact was exaggerated in Illinois State with heterogeneous spatial patterns. In addition, the lowest classification performance of 3D-CNN was presented in Illinois State, which is considered to be due to over-fitting as complexity of the model. That is, the classification performance was relatively degraded due to heterogeneous patterns and noise effect of input data, although the training accuracy of 3D-CNN model was high. This result simply that a proper classification algorithms should be selected considering spatial characteristics of study areas. Also, a large amount of training samples is necessary to guarantee higher classification performance in CNN, particularly in 3D-CNN.

• Journal of Korean Society for Geospatial Information Science
• /
• v.8 no.1 s.15
• /
• pp.51-63
• /
• 2000

Dynamic traffic assignment(DTA) has been a topic of substantial research during the past decade. While DTA is gradually maturing, many aspects of DTA still need improvement, especially regarding its formulation and solution algerian Recently, with its promise for In(Intelligent Transportation System) and GIS(Geographic Information System) applications, DTA have received increasing attention. This potential also implies higher requirement for DTA modeling, especially regarding its solution efficiency for real-time implementation. But DTA have many mathematical difficulties in searching process due to the complexity of spatial and temporal variables. Although many solution algorithms have been studied, conventional methods cannot iud the solution in case that objective function or constraints is not convex. In this paper, the genetic algorithm to find the solution of DTA is applied and the Merchant-Nemhauser model is used as DTA model because it has a nonconvex constraint set. To handle the nonconvex constraint set the GENOCOP III system which is a kind of the genetic algorithm is used in this study. Results for the sample network have been compared with the results of conventional method.

• Journal of Korea Spatial Information System Society
• /
• v.6 no.1 s.11
• /
• pp.73-85
• /
• 2004

Recently, as the growth of the wireless Internet, PDA and HPC, the focus of research and development related with GIS(Geographic Information System) has been changed to the Real-Time Mobile GIS to service LBS. To offer LBS efficiently, there must be the Real-Time GIS platform that can deal with dynamic status of moving objects and a location index which can deal with the characteristics of location data. Location data can use the same data type(e.g., point) of GIS, but the management of location data is very different. Therefore, in this paper, we studied the Real-Time Mobile GIS using the HBR-tree to manage mass of location data efficiently. The Real-Time Mobile GIS which is developed in this paper consists of the HBR-tree and the Real-Time GIS Platform HBR-tree. we proposed in this paper, is a combined index type of the R-tree and the spatial hash Although location data are updated frequently, update operations are done within the same hash table in the HBR-tree, so it costs less than other tree-based indexes Since the HBR-tree uses the same search mechanism of the R-tree, it is possible to search location data quickly. The Real-Time GIS platform consists of a Real-Time GIS engine that is extended from a main memory database system. a middleware which can transfer spatial, aspatial data to clients and receive location data from clients, and a mobile client which operates on the mobile devices. Especially, this paper described the performance evaluation conducted with practical tests if the HBR-tree and the Real-Time GIS engine respectively.

• Journal of the Korean Institute of Landscape Architecture
• /
• v.43 no.2
• /
• pp.1-12
• /
• 2015

This study explores urban gardening and garden culture in residential area as an everydayness that has been overlooked during the modern period urbanization and investigates the meaning and value of urban gardening from the perspective of urban formations and growth in spontaneous urban residential area, Haebangchon. The result identified that urban gardening as a meaning of contemporary culture is a new clue to improving the urban physical environment and changing the lives and community network of residents. Haebangchon is one of the few remaining spontaneous habitations in Seoul, and was created as a temporary unlicensed shantytown in 1940s. It became the representative habitation for common people in downtown Seoul through the revitalization of the 60s and the local reform through self-sustaining redevelopment projects during the 70s through the 90s. This area still contains the image of times during the 50s to the 60s, the 70s to the 80s and present, with the percentage of long-term stay residents high. Within this context, the site is divided into third quarters, and the research undertaken by observation and investigation to determine characteristics of urban gardening as an everydayness. It can be said that urban gardening and garden culture in Haebangchon is a unique location culture that has accumulated in the crevices of the physical condition and culture of life. These places are an expression of resident's desires that seeking out nature and gardening as revealed in densely-populated areas and the grounds of practical acting and participating in care and cultivation. It forms a unique, indigenous local landscape as an accumulation of everyday life of residents. Urban gardens in detached home has retained the original function of the dwelling and the garden, or 'madang', and takes on the characteristic of public space through the sharing of a public nature as well as semi-private spatial characteristic. Also, urban gardens including small kitchen garden and flowerpots that appear in the narrow streets provide pleasure as a part of nature that blossoms in narrow alley and functions as a public garden for exchanging with neighbors by sharing produce. This paper provides the concept of redefining the relationship between the private-public area that occurs between outside spaces that are cut off in a modern city.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.9 no.3
• /
• pp.39-52
• /
• 1999

In this paper we propose a new watermarking technique for copyright protection of images. The proposed technique is based on a spatial masking method with a spatial scale parameter. In general it becomes more robust against various attacks but with some degradations on the image quality as the amplitude of the watermark increases. On the other hand it becomes perceptually more invisible but more vulnerable to various attacks as the amplitude of the watermark decreases. Thus it is quite complex to decide the compromise between the robustness of watermark and its visibility. We note that watermarking using the spread spectrum is not robust enought. That is there may be some areas in the image that are tolerable to strong watermark signals. However large smooth areas may not be strong enough. Thus in order to enhance the invisibility of watermarked image for those areas the spatial masking characteristics of the HVS(Human Visual System) should be exploited. That is for texture regions the magnitude of the watermark can be large whereas for those smooth regions the magnitude of the watermark can be small. As a result the proposed watermarking algorithm is intend to satisfy both the robustness of watermark and the quality of the image. The experimental results show that the proposed algorithm is robust to image deformations(such as compression adding noise image scaling clipping and collusion attack).

• Korean Journal of Crystallography
• /
• v.17 no.2
• /
• pp.60-65
• /
• 2006

표면 및 계면층의 결정구조, 결함구조, 불순물 편석, 표면의 전자 구조, 원자 진동 등과 같은 산화물의 표면물성은 촉매, 센서, 소결, 마찰, 부식 등과 같은 분야에서 그 특성을 좌우한다. 고체 표면의 결정구조 해석 수단으로 저에너지 이온산란 분광법이 유용한 도구로 알려져 있는데, 이 방법의 뛰어난 표면민감성은 표면에서의 효과적인 이온 중성화 과정에 기인한다. $He^+$, $Ne^+$, $Ar^+$ 등과 같은 이온은 Auger 중성화 과정에 의하여 쉽게 중성원자화 되고, 중성화 확율의 타겟에 대한 의존성이 낮기 때문에 이온빔으로서 종종 사용된다. 산란각도를 180$^{\circ}$로 고정하여 산란이온 검출기를 설치한 직충돌 이온산란 분광법의 경우는 산란된 이온의 궤적이 입사궤도와 거의 동일하기 때문에 산란궤적의 계산이 간단해지고, 수 층 깊이의 원자구조의 해석이 가능해진다. 본 고에서는 고체 표면의 원자구조를 실공간에서 해석할 수 있는 직충돌 이온산란 분광법에 대하여 측정의 기본원리, 측정장치, 간단한 분석 예 등에 관하여 기술하고자 하며, 다음 편에서는 복잡한 표면구조를 가지는 반도체 표면에서 직충돌 이온산란분광법의 이용하여 해석한 예를 중심으로 기술하고자 한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.11
• /
• pp.2264-2275
• /
• 1994

In this paper, image compression based on neural networks is presented with block classification and coding. Multilayer neural networks with error back-propagation learning algorithm are used to transform the normalized image date into the compressed hidden values by reducing spatial redundancies. Image compression can basically be achieved with smaller number of hidden neurons than the numbers of input and output neurons. Additionally, the image blocks can be grouped for adaptive compression rates depending on the characteristics of the complexity of the blocks in accordance with the sensitivity of the human visual system(HVS). The quantized output of the hidden neuron can also be entropy coded for an efficient transmission. In computer simulation, this approach lie in the good performances even with images outside the training set and about 25:1 compression rate was achieved using the entropy coding without much degradation of the reconstructed images.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.05a
• /
• pp.529-532
• /
• 2012

This paper presents the system modeling, analysis, and controller design and implementation with a inverted pendulum system in order to test robust algorithm for sweeping machine. The balancing of an inverted pendulum by moving pendulum robot like as 'segway' along a horizontal track is a classic problem in the area of control. This paper will describe two methods to swing a pendulum attached to a cart from an initial downwards position to an upright position and maintain that state. The results of real experiment show that the proposed control system has superior performance for following a reference command at certain initial conditions.