• Title/Summary/Keyword: 경계점 좌표

Search Result 88, Processing Time 0.027 seconds

A Numerical Analysis of Free Surface Wave around a ship (선체주위 자유수면파의 수치해석)

  • Choon-Bum Hong;Seung-Hee Lee
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.31 no.3
    • /
    • pp.80-86
    • /
    • 1994
  • A numerical method for simulations of inviscid incompressible flow fields around a ship advancing on the free surface is developed. A body fitted coordinate system, generated by numerically solving elliptic type partial differential equations is used to conform the ship and free surface configurations. Three dimensional Euler equations transformed to the non-staggered body fitted coordinate system are discretised by finite difference method. Time and spatial derivatives are discretised by forward and centered differencings, respectively, and artificial dissipations are added to discretised convection terms for improvements of numerical stability. At each time steps, free surface elevations are recomputed to satisfy nonlinear free surface conditions. Poisson equations for pressure field are solved iteratively and the velocity field for next time step is extrapolated. To verify the developed numerical method, flow fields around a Wigley model are simulated(Fn=0.250-0.408) and compared with experimental data to show good agreements.

  • PDF

Mesh Geometry Compression for Mobile Graphics (모바일 그래픽스를 위한 메쉬 위치정보 압축)

  • Lee, Jong-Seok;Choe, Sung-Yul;Lee, Seung-Yong
    • 한국HCI학회:학술대회논문집
    • /
    • 2008.02a
    • /
    • pp.403-408
    • /
    • 2008
  • 본 논문은 모바일 그래픽스 응용에 적합한 메쉬 위치정보의 압축 기법을 제시한다. 제시한 기법은 복원 에러를 최소화하기 위한 메쉬 분할 기법과 기존의 방법에서 방생하는 시각적 손상문제를 해결한 지역적 정량화 기법으로 구성된다. 기존 방법에서는 분할된 조각 메쉬들 간의 경계가 벌어지는 시각적 손상문제가 방생하는데, 모든 조각 메쉬의 지역적 양자화 셀이 같은 크기와 정렬된 지역 좌표축을 갖게 하여 이 문제를 해결했다. 제시한 기법은 메쉬를 렌더링할 때 압축된 위치정보를 메모리에서 그래픽스 하드웨어로 전송하여 실시간으로 복원함으로써 모바일 기기의 자원을 절약하는 특징을 갖는다. 압축된 위치정보의 복원을 표준화된 렌더링 파이프라인에 결합이 가능하도록 설계함으로써 조각 메쉬당 한번의 행렬 곱셈으로 복원이 가능하다. 실험에서는 32 비트 부동소수점 수로 표현되는 위치정보를 8 비트 정수로 지역적 정량화하여 70%의 압축률에서 11 비트 전역적 정량화와 대등한 수준의 시각적 품질을 달성했다.

  • PDF

The Korean Geodetic Network Adjustments for EDM Area (국가기준점 망조정에 관한 연구 - EDM 관측지역)

  • Yang, Hyo-Jin;Choi, Yun-Soo;Kwon, Jay-Hyoun;Kim, Dong-Young
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.25 no.5
    • /
    • pp.393-398
    • /
    • 2007
  • According to the Korean datum change to a world geodetic system, the EDM area should be readjusted to provide consistent product over the country. The data set for EDM area is extracted from the previous KTN1987 DB and checked for the moved markers in XY network adjustment which provides quality verification. Then, EDM data set for the seven areas are rebuilt for the adjustment. Since the data is still based on the old datum, the coordinates of the data are transformed by applying the coordinate transformation parameters. Here, the transformation parameters, which were determined for the conversion of 1:50,000 topographic maps by NGII, were used. For each EDM point, the geoidal height from EGM96 model is applied to obtain the ellipsoidal height based on the GRS80. The measured distance projected onto GRS80 is adjusted using BL network adjustment by fixing 2nd order or 3rd order GPS control points. The results from the readjustment show the minimum standard error of 1.37" and the maximum standard error of 2.13". Considering the measurement accuracy of EDM (1.6" corresponding to about 2cm) and GPS position for fixed points (2cm), this result is considered to be reasonable and it is good for the practical use.

Efficient Nearest Surrounder Queries Processing (효율적인 Nearest Surrounder 질의 처리 방법)

  • Choi, Jung-Im;Chung, Jae-Hwa;Kim, Jong-Wan;Im, Seok-Jin;Kang, Sang-Won;Jung, Soon-Young
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2007.06c
    • /
    • pp.124-129
    • /
    • 2007
  • 지금까지 질의 점을 중심으로 최근접 객체(Nearest Neighbor : NN)를 찾는 다양한 연구가 진행되었다. 하지만 이 방법은 질의 점과 객체의 거리만을 고려하기 때문에 질의 점을 둘러싸고 있는 객체들을 찾을 수 없다는 문제점이 있다. 이것을 해결하기 위해서 제안 된 것이 최근접 주변객체(Nearest Surrounder : NS) 질의 처리이다. 최근접 주변 객체는 질의 점을 둘러싸고 있으면서 가장 가까운 객체들을 찾는 것에 대한 연구이다. 기존의 NS를 찾는 방법은 객체 인덱싱을 위하여 R-tree를 사용하며, 질의 점과 최소경계사각형(minimum bounding rectangle : MBR)이 이루는 각의 범위를 계산한다. 계산 수행 결과 각 MBR들 이 이루는 각의 범위가 겹치는 부분이 발생하면 해당 각 범위 내에서 질의 점으로부터 최소거리에 있는 MBR을 선택해야 하므로 범위별 질의 점과 MBR들의 최대 최소 거리를 구해야 한다. 이러한 범위별 계산 과정은 계산 비용을 높이는 단점이 있다. 따라서 본 논문에서는 NS를 필요로 하는 영역에서 각 범위별 겹쳐지는 MBR들의 꼭지점 좌표만을 비교한다. 이것은 기존 연구에서 계산 비용을 높이는 공통 각 계산 절차를 개선하고, 최대 최소 거리 계산 수행은 생략하여 NS를 찾는다. 제안 기법을 위해 논문에서 사용하는 각 알고리즘은 이전 연구보다 나은 계산비용 절감 효과를 가져 올 수 있다.

  • PDF

A Study on Iris Recognition by Iris Feature Extraction from Polar Coordinate Circular Iris Region (극 좌표계 원형 홍채영상에서의 특징 검출에 의한 홍채인식 연구)

  • Jeong, Dae-Sik;Park, Kang-Ryoung
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.44 no.3
    • /
    • pp.48-60
    • /
    • 2007
  • In previous researches for iris feature extraction, they transform a original iris image into rectangular one by stretching and interpolation, which causes the distortion of iris patterns. Consequently, it reduce iris recognition accuracy. So we are propose the method that extracts iris feature by using polar coordinates without distortion of iris patterns. Our proposed method has three strengths compared with previous researches. First, we extract iris feature directly from polar coordinate circular iris image. Though it requires a little more processing time, there is no degradation of accuracy for iris recognition and we compares the recognition performance of polar coordinate to rectangular type using by Hamming Distance, Cosine Distance and Euclidean Distance. Second, in general, the center position of pupil is different from that of iris due to camera angle, head position and gaze direction of user. So, we propose the method of iris feature detection based on polar coordinate circular iris region, which uses pupil and iris position and radius at the same time. Third, we overcome override point from iris patterns by using polar coordinates circular method. each overlapped point would be extracted from the same position of iris region. To overcome such problem, we modify Gabor filter's size and frequency on first track in order to consider low frequency iris patterns caused by overlapped points. Experimental results showed that EER is 0.29%, d' is 5,9 and EER is 0.16%, d' is 6,4 in case of using conventional rectangular image and proposed method, respectively.

Numerical Analysis of Flow Interference at Discontinuity Junction of fracture Network (단열교차점에서 유체간섭에 관한 수치적 고찰)

  • 박영진;이강근;이승구
    • Journal of the Korean Society of Groundwater Environment
    • /
    • v.4 no.3
    • /
    • pp.111-115
    • /
    • 1997
  • Discrete fracture model has become one of the alternatives for the classical continuum model to simulate the irregular aspects of the fluid flow and the solute transport in fractured rocks. It is based on the assumptions that the discharge in a single fracture is proportional to the cube of the aperture and the fractured rock can be represented by the statistical assemblage of such single fractures. This study is intended to evaluate the effect of the fracture junction on the cubic law. Numerical solution of flow in junction system was obtained by using the Boundary-Fitted Coordinate System (BFCS) method. Results with different intersection angles in crossing fractures show that the geometry of the junction affects the discharge pattern under the same simulation conditions. Therefore, strict numerical and experimental examinations on this subject are required.

  • PDF

Pacman Game Using Skin Color Extraction and Center of Gravity of Hand (손의 피부색 추출과 무게중심을 이용한 팩맨 게임)

  • Shin, Seong-Yoon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.17 no.6
    • /
    • pp.49-55
    • /
    • 2012
  • Pacman is one of the world-famous and have been chosen game in the game room at the arcade. In this paper, pacman game gives you the ability to perform by simple hand movement alone. First, we obtain binary RGB image to extract skin color, and convert into binary image YCbCr by minus the luminance in this image. Next, we extract the hand region by the product of an binary RGB image and binary YCbCr image. Finally, the hand region, we obtain the center of gravity by the minimum bounding rectangle and the center of the hand pixel area, and we used to obtain the center of the hand area with an average of two center of gravity. In other words, we presented the game of motion that can take the place of arrow key by using the center coordinates of hand. In addition, these experiments showed the average movement and error rate, and cause of the error type was also investigated.

A Study on the Efficiency of Cadastral Survey in Forest Areas Based on UAV LiDAR (UAV LiDAR 기반의 임야지역 지적측량 효율성 제고 방안)

  • Lee, Ki-Hoon
    • Journal of Cadastre & Land InformatiX
    • /
    • v.54 no.1
    • /
    • pp.5-17
    • /
    • 2024
  • In this study, we examined the applicability of UAV LiDAR for cadastral surveying and proposed the results. For this purpose, an experimental area was selected and point cloud data was created by scanning the terrain using UAV LiDAR. Since there is no comparative verification target in the forest area, the coordinates of the verification points were obtained by directly surveying the ridge and valley lines prescribed by the current law. Based on these points, the point cloud density within a 7cm radius was analyzed. As a result, an average of 46 point clouds were generated within a circle with a radius of 7 centimeters, which can build a more precise topography of the forest area, proving that precise cadastral surveying is possible. In the case of UAV LiDAR, it is expected that the boundaries of forest areas can be extracted more accurately and efficiently without the influence of trees compared to the existing cadastral survey method. This is expected to have many advantages in various fields that want to use it in the future, such as the creation of stereoscopic maps of forest areas and terrain modeling for disaster safety in the forest areas.

A Application Method of Plotting Original Data (도화원도의 활용방안)

  • Lee, Yong-Wook
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.29 no.5
    • /
    • pp.441-448
    • /
    • 2011
  • Lately, digital restitution was became common using digital aerial photos. Therefore, we can obtain three-dimensional data. As a plotting-maker is checked by naked eye, plotting original data is very useful for making reliable three-dimensional data including contour and elevation point layers. In this study, we want to make precise and accurate digital elevation model using plotting original data. Contour and elevation point layers was extracted in digital map and break line was extracted in plotting original data. And then, compared both of results. For comparison, we selected slight slope and complex topography area like a residence area, mountain and agricultural land. We extracted break line deleting layer until obtaining ideal digital elevation model. As the results, We could extract contour, elevation points, eight road and two boundary layers using break lines. And We could obtain precise elevation model. Editing break lines, the distortion of digital elevation model could be minimized in the complex and sharp slope area.

A Slope Information Based Fast Mask Generation Technique for ROI Coding (관심영역 코딩을 위한 기울기 정보 기반의 빠른 마스크 생성 기법)

  • Park, Sun-Hwa;Seo, Yeong-Geon;Lee, Bu-Kweon;Kang, Ki-Jun;Kim, Ho-Yong
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.1
    • /
    • pp.81-89
    • /
    • 2009
  • To support dynamic Region-of-Interest(ROI) in JPEG2000, a fast ROI mask generation is needed. In the existing methods of ROI coding, after scanning all the pixels in order and discriminating ROI, an ROI mask has been generated. Our method scans 4 pixels of the corners in one code block, and then based on those informations, scans the edges from the corners to get the boundaries of ROI and background. These informations are consisted of a distributed information of ROI and two coordinates of the pixels, which are the points the edges and the boundaries meet. These informations are transmitted to encoder and supported for fast ROI mask generation. There were no great differences between the proposed method and the existing methods in quality, but the proposed method showed superiority in speed.