• Journal of the Society of Naval Architects of Korea
• /
• v.38 no.1
• /
• pp.1-8
• /
• 2001

The computations of the turbulent flow around the ship models with the free-surface effects were carried out. Incompressible Reynolds-Averaged Navier-Stokes equations were solved by using an explicit finite-difference method with the nonstaggered grid system. The method employed second-order finite differences for the spatial discretization and a four-stage Runge-Kutta scheme for the temporal integration. For the turbulence closure, a modified Baldwin-Lomax model was exploited. The location of the free surface was determined by solving the equation of the kinematic free-surface condition using the Lax-Wendroff scheme and a free-surface conforming grid was generated at each time step so that one of the grid boundary surfaces always coincides with the free surface. An inviscid approximation of the dynamic free-surface boundary condition was applied as the boundary conditions for the velocity and pressure on the free surface. To validate the computational method developed in the present study, the computations were carried out for beth Wigley and Series 60 $C_B=0.6$ ship model and the computational results showed good agreements with the experimental data.

• Journal of the Institute of Convergence Signal Processing
• /
• v.1 no.1
• /
• pp.23-31
• /
• 2000

Iterative curve evolution techniques are powerful methods for image segmentation. Classical methods proposed curve evolutions which guarantee close contours at convergence and, combined with the level set method, they easily handled curve topology changes. In this paper, we present a new geometric active contour model based on level set methods introduced by Osher & Sethian for detection of object boundaries or shape and we adopt anisotropic diffusion filtering method for removing noise from original image. Classical methods allow only one-way curve evolutions : shrinking or expanding of the curve. Thus, the initial curve must encircle all the objects to be segmented or several curves must be used, each one totally inside one object. But our method allows a two-way curve evolution : parts of the curve evolve in the outward direction while others evolve in the inward direction. It offers much more freedom in the initial curve position than with a classical geodesic search method. Our algorithm performs accurate and precise segmentations from noisy images with complex objects(jncluding sharp angles, deep concavities or holes), Besides it easily handled curve topology changes. In order to minimize the processing time, we use the narrow band method which allows us to perform calculations in the neighborhood of the contour and not in the whole image.

• The KIPS Transactions:PartD
• /
• v.10D no.6
• /
• pp.873-884
• /
• 2003

So far, significant achievements have been studied on the development of models for spatial and spatiotemporal objects with indeterminate boundaries which are found in many applications for geographic analysis and image understanding. Therefore, in this paper we propose the spatiotemporal data model which is applicable for spatial and spatiotemporal objects with uncertainty. Based on this model, we defined topological relationships among the indeterminate spatiotemporal objects and designed the algorithm for the operations. For compatibility with existing spatial models, the proposed model has been designed by extending the spatiotemporal object model which is based on the open GIS specification. We defined indeterminate spatial objects, such as the objects whose position and the shape change discretely over time, and the objects whose shape changes continuously as well as the position. We defined topological relationships among these objects using the extended 9-IM. The proposed model can be efficiently applied to the management systems of natural resource data, westher information, geographic information. and so on.

• Spatial Information Research
• /
• v.19 no.1
• /
• pp.117-126
• /
• 2011

Recently, AR applications provide location-based spatial information by GPS. Also, the spatial information is displayed by the angle of the camera. So far, traditional spatial indexes in spatial database field retrieve and filter spatial information by the minimum bounding rectangle (MBR) algorithm.(ex. R-tree) MBR strategy is a useful technique in the geographic information systems and location based services. But MBR technique doesn't reflect the characteristics of spatial queries in AR. Spatial queries of AR applications have high possibility of the dead space area between MBRs of non-leaf node and query area. We propose triangle node filtering algorithm that improved efficiency of spatial retrieval used the triangle node filtering techniques by exclusion the dead space. In this paper, the proposed algorithm has been implemented on PostgreSQL/PostGIS. Experimental results show the spatial retrieval that using the proposed algorithm better performance than the spatial retrieval that of the minimum bounding rectangle algorithm.

• Proceedings of the Plant Resources Society of Korea Conference
• /
• 2021.04a
• /
• pp.32-32
• /
• 2021

본 연구에서는 DMZ 일원인 경기도 파주시 광탄면과 양주군 백석면에 걸쳐있는 박달산(363m) 주변의 관속식물상을 조사하였다. 파주시는 동쪽은 양주시, 서쪽은 한강을 경계로 김포시, 북부는 임진강을 경계로 북한과 접하고 있다. 남쪽은 고양시, 북쪽은 연천군에 접하고 있으며, 북위 37° 42'~38° 07', 동경 126° 41'~127° 01'에 위치한다. 박달산은 파주시 광탄면 경계에 위치하였으며, 현재 명칭은 박달나무가 많아서 박달산이라고 부르고 있으나 예전에는 독수리가 많아서 수리봉이라는 명칭으로 부르기도 했다. 박달산 주변에 분포하는 관속식물 현황은 79과 211속 288종 3아종 36변종 4품종 331분류군으로 조사되었다. 양치식물은 5과 10속 11종 1변종 12분류군, 나자식물은 2과 3속 5종 5분류군, 쌍자엽식물은 63과 154속 208종 3아종 22변종 3품종 236분류군, 단자엽식물 9과 44속 61종 13변종 1품종 78분류군으로 조사되었다. 희귀식물은 취약종(VU)에 속하는 왜박주가리(Tylophora floribunda Miq.) 1분류군, 약관심종(LC)에 속하는 태백제비꽃(Viola albida Palib.), 이팝나무(Chionanthus retusus Lindl. & Paxton) 2분류군이 조사되었다. 특산식물은 키버들(Salix koriyanagi Kimura), 외대으아리(Clematis brachyuran Maxim.), 서울제비꽃(Viola seoulensis Nakai), 오동나무(Paulownia coreana Uyeki), 백운산원추리(Hemerocallis hakuunensis Nakai) 5분류군이 조사되었다. 침입외래식물은 가시박(Sicyos angulatus L.), 단풍잎돼지풀(Ambrosia trifida L.), 돼지풀(Ambrosia artemisiifolia L.) 등 28분류군으로 조사되었다.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.11 no.12
• /
• pp.1225-1230
• /
• 2016

This paper deals with performing missions of a small biped robot using image processing. Localization is required for stable walking under a given map. Localization of the robot is done by extracting boundary on a driving course. Estimation of three parameters including location and orientation is required when walking on a plane. In this paper, two parameters including the location of the robot along the vertical direction of robot's walking direction and an orientation is estimated for localization. Color is used for the detection of obstacles and normalized values are used for the stable detection.

• Annual Conference of KIPS
• /
• 2015.10a
• /
• pp.377-378
• /
• 2015

실내형 자율 주행 로봇에서의 가장 중요한 기술력은 IGS(indoor GPS System)라 할 수 있다. 재난로봇이나 정찰로봇, 경계로봇등 새로운 로봇의 영역이 늘어남에 따라 실내에서 로봇을 안전하게 구동시키는 연구가 활발히 진행되고 있다. 기존 GPS를 사용할 수 없는 실내에서, LED 조명으로 통신이 가능한 가시광통신은 실내위치 정보를 정밀히 파악하기에 적합하다. 이에 가시광통신을 이용하여 LED 조명별 기준위치를 파악하는 서로 다른 16진수의 데이터를 전송하고, 그 위치를 파악하여 LED 조명의 위치를 식별할 수 있음을 확인한다. 이러한 실험결과를 통하여 가시광통신을 이용해 실내형 자율 주행 로봇의 실내 위치 추정 시스템을 제안한다.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.18 no.6
• /
• pp.1291-1298
• /
• 2023

Surveillance reconnaissance sensor network is used for surveillance in wartime and area of operation. In this paper, we propose a target localization method using the detection signal strength of seismic sensors. Relay equipment calculates the target location using coordinate information and detection signal strength of the seismic sensors. Target localization error deviation due to environmental factors was minimized by subtracting the dynamic offset when calculating the target location. Field test shows improvement of target localization through reduction of errors. The average error was decreased to 3.62m. Up to 62% improved result was obtained compared to weighted centroid localization method.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.6
• /
• pp.88-95
• /
• 2011

An embedded mobile device mostly has lower computation power than a general purpose computer because of its relatively lower system specifications. Consequently, conventional face tracking and face detection methods, requiring complex algorithms for higher recognition rates, are unsuitable in a mobile environment aiming for real time detection. On the other hand, by applying a real-time tracking and detecting algorithm, we would be able to provide a two-way interactive multimedia service between an user and a mobile device thus providing a far better quality of service in comparison to a one-way service. Therefore it is necessary to develop a real-time face and eye tracking technique optimized to a mobile environment. For this reason, in this paper, we proposes a method of tracking horizontal face position of a user on a T-DMB device for enhancing the quality of 3D DMB content. The proposed method uses the orientation of edges to estimate the left and right boundary of the face, and by the color edge information, the horizontal position and size of face is determined finally to decide the horizontal face. The sobel gradient vector is projected vertically and candidates of face boundaries are selected, and we proposed a smoothing method and a peak-detection method for the precise decision. Because general face detection algorithms use multi-scale feature vectors, the detection time is too long on a mobile environment. However the proposed algorithm which uses the single-scale detection method can detect the face more faster than conventional face detection methods.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.17 no.1
• /
• pp.17-24
• /
• 2024

In this paper, we propose a highly secure technique to hide confidential data in image pixels using a quadruple encryption techniques. In the proposed technique, the boundary surface where the image outline exists and the flat surface with little change in pixel values are investigated. At the boundary of the image, in order to preserve the characteristics of the boundary, one bit of confidential data that has been multiply encrypted is spatially encrypted again in the LSB of the pixel located at the boundary to hide the confidential data. At the boundary of an image, in order to preserve the characteristics of the boundary, one bit of confidential data that is multiplely encrypted is hidden in the LSB of the pixel located at the boundary by spatially encrypting it. In pixels that are not on the border of the image but on a flat surface with little change in pixel value, 2-bit confidential data that is multiply encrypted is hidden in the lower 2 bits of the pixel using location-based encryption and spatial encryption techniques. When applying the proposed technique to hide confidential data, the image quality of the stego-image is up to 49.64dB, and the amount of confidential data hidden increases by up to 92.2% compared to the existing LSB method. Without an encryption key, the encrypted confidential data hidden in the stego-image cannot be extracted, and even if extracted, it cannot be decrypted, so the security of the confidential data hidden in the stego-image is maintained very strongly. The proposed technique can be effectively used to hide copyright information in general commercial images such as webtoons that do not require the use of reversible data hiding techniques.