• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.3_4
• /
• pp.168-185
• /
• 2003

This paper presents a progressive algorithm that not only can narrow down the search domain in the course of face identification but also can fast reconstruct various 3D objects from a sketch drawing. The sketch drawing, edge-vertex graph without hidden line removal, which serves as input for reconstruction process, is obtained from an inaccurate freehand sketch of a 3D wireframe object. The algorithm is executed in two stages. In the face identification stage, we generate and classify potential faces into implausible, basis, and minimal faces by using geometrical and topological constraints to reduce search space. The proposed algorithm searches the space of minimal faces only to identify actual faces of an object fast. In the object reconstruction stage, we progressively calculate a 3D structure by optimizing the coordinates of vertices of an object according to the sketch order of faces. The progressive method reconstructs the most plausible 3D object quickly by applying 3D constraints that are derived from the relationship between the object and the sketch drawing in the optimization process. Furthermore, it allows the designer to change viewpoint during sketching. The progressive reconstruction algorithm is discussed, and examples from a working implementation are given.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11a
• /
• pp.742-744
• /
• 2005

본 논문에서는 인접 블록의 움직임 벡터를 이용한 움직임 예측 알고리즘을 제안하였다. 제안된 알고리즘은 두개의 탐색 단계로 구성된다. 첫 번째 단계는 인접 블록의 움직임 벡터를 이용한 탐색점에서 오차값이 제일 작은 위치를 초기 시작 위치로 사용하였다. 두 번째 단계는 첫 번째 단계에서 찾은 시작 위치에서 정확한 움직임 예측을 위한 패턴과 방법을 적용 하였다. 제안된 알고리즘은 움직임 벡터가 클 경우에 불필요한 탐색점 개수를 줄이고, 성능저하의 원인인 지역적 최소값(local minimum)에 빠질 위험을 감소시켰다. 제안된 알고리즘은 NTSS, 4SS, IDFS, ARPS와 비교 했으며, 성능면에서는 평균 PSNR이 $0.27\~2.56dB$향상되었고, 탐색점 개수면에서는 평균 27개 감소 하였다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.4
• /
• pp.773-779
• /
• 2011

The width of a submarine's turbulent wake, using Shear-free and Ship wake theory, is proportional to $x^n,\;({\frac{1}{5}}{\leq}n<{\frac{1}{2}})$ If we assume submarine's length, width, velocity are 65m, 6.5m, 6kts respectively, and the minimum diffusion of turbulent wake ; ${\infty}\;x^{1/5}$, the width of wake behind the submarine is about 20m at 1.2km, 30m at 15km when there is no breaking waves on the sea surface. However, in the case of breaking waves, it is very limited to identify submarine's wake on the sea surface because wind generated turbulent wake has higher turbulent kinetic energy than that of submarine's wake. As a result, there is a high possibility to detect submarine's wake on the sea surface in the shallow water such as the Yellow-Sea using a proper detection method such as SAR. This means that in anti-submarine operations, non-acoustic sea surface serveillance applied turbulent wake will be very effective way to detect a submarine in near future. To do this we have to develop exact theory of submarine's turbulent wake above all.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.1
• /
• pp.43-54
• /
• 1996

This paper presents new heuristic search algorithms for searching rectilinear r(L1), link metric, and combined shortest paths in the presence of orthogonal obstacles. The GMD(GuidedMinimum Detour) algorithm combines the best features of maze-running algorithms and line-search algorithms. The SGMD(Line-by-Line GuidedMinimum Detour)algorithm is a modiffication of the GMD algorithm that improves efficiency using line-by-line extensions. Our GMD and LGMD algorithms always find a rectilinear shortest path using the guided A search method without constructing a connection graph that contains a shortest path. The GMD and the LGMD algorithms can be implemented in O(m＋eloge＋NlogN) and O(eloge＋NlogN) time, respectively, and O(e＋N) space, where m is the total number of searched nodes, is the number of boundary sides of obstacles, and N is the total number of searched line segment. Based on the LGMD algorithm, we consider not only the problems of finding a link metric shortest path in terms of the number of bends, but also the combined L1 metric and Link Metric shortest path in terms of the length and the number of bands.

• Tunnel and Underground Space
• /
• v.18 no.3
• /
• pp.194-201
• /
• 2008

In order to investigate the characteristics in tensile strength of transversely isotropic rock, a new anisotropic tensile failure function was suggested. According to the function, the tensile strength is minimum in the normal direction to a weakness plane and rises exponentially to its maximum on a plane perpendicular to the weakness plane. The anisotropic function is defined in terms of three strength parameters which can be identified trom direct tensile tests of transversely isotropic rocks. By incorporating the suggested function into the critical plane approach, a numerical procedure which enables to search the tensile strength and the direction of critical plane at failure was presented. The validity of the suggested numerical procedure was checked through the simulation of direct tensile tests reported in a literature. The numerical results from the simulation were in good agreements with those from the laboratory tests.

• Journal of Korea Multimedia Society
• /
• v.13 no.2
• /
• pp.185-195
• /
• 2010

In this paper, we propose an efficient inter and intra prediction algorithms for fast encoding of H.264/AVC. First, inter prediction mode decision method decides early using temporal/spatial correlation information and pixel direction information. Second, intra prediction mode decision method selects block size judging smoothness degree with inner/outer pixel value variation and decides prediction mode using representative pixel and reference pixel. Lastly, adaptive motion search region restriction sets search region using mode information of neighboring block and predicted motion vector. The experimental results show that proposed method can achieve about 18~53% reduction compared with the existing JM 14.1 in the encoding time. In RD performance, the proposed method does not cause significant PSNR value losses while increasing bitrates slightly.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.10b
• /
• pp.1243-1246
• /
• 2000

응용프로그램을 실행시키는 것은 많은 디스크 대역폭을 필요로 하고 있다. 데이터를 조회하는데 걸리는 시간을 최소로 하는 것이 성능을 향상시키는 가장 큰 문제이다. 디스크 기술은 속도와 용량면에서 많은 발전이 있었음에도 불구하고, 프로그램에서 요구하는 요구사항이 증가함하고 있다. 멀티미디어 서버는 여러 종류의 텍스트나 이미지, 비디오 등의 다양한 데이터 타입을 지원한다. 따라서 다른 데이터 타입들은 다른 마감시간의 요구와 우선 순위를 가지고 있다. 연속적인 오디오나 비디오 같은 것들 은 마감시간 제약을 가지고 있다. 이 논문에서 제한한 알고리즘은 모든 요청들을 두 개의 큐로 유지하고 탐색 시간을 최소화함으로써 디스크 대역폭의 처리율을 극대화시킨다. 즉 다양한 우선 순위의 요청들을 해당 클래스로 나누고 주기적인 요청을 위한 큐와 비 주기적인 요청이나 대화형 요청들을 위한 또 하나의 큐로 나누고 요청의 마감시간과 디스크 헤드의 움직임을 고려하여 스케줄링한다.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.45 no.6
• /
• pp.123-131
• /
• 2008

In Oriental medicine, the status of a tongue is the important indicator to diagnose the condition of one's health like the physiological and the clinicopathological changes of internal organs in a body. A tongue diagnosis is not only convenient but also non-invasive, and therefore widely used in Oriental medicine. However, the tongue diagnosis is affected by examination circumstances like a light source, patient's posture, and doctor's condition a lot. To develop an automatic tongue diagnosis system for an objective and standardized diagnosis, segmenting a tongue region from a facial image captured and classifying tongue coating are inevitable but difficult since the colors of a tongue, lips, and skin in a mouth are similar. The proposed method includes preprocessing, over-segmenting, detecting the edge with a local minimum over a shading area from the structure of a tongue, correcting local minima or detecting the edge with the greatest color difference, selecting one edge to correspond to a tongue shape, and smoothing edges, where preprocessing consists of down-sampling to reduce computation time, histogram equalization, and edge enhancement, which produces the region of a segmented tongue. Finally, the systematic procedure separated only a tongue region from a face image with a tongue, which was obtained from a digital tongue diagnosis system. Oriental medical doctors' evaluation for the results illustrated that the segmented region excluding a non-tongue region provides important information for the accurate diagnosis. The proposed method can be used for an objective and standardized diagnosis and for an u-Healthcare system.

• Journal of Agricultural Extension & Community Development
• /
• v.20 no.2
• /
• pp.431-450
• /
• 2013

The present study aims to evaluate the potential accessibility of public healthcare facilities in rural areas. Population is prepared and analyzed in spatially microscopic level using dasymetric mapping method. According to the analysis on the accessibility to public facilities which is conducted using shortest distance, Gun areas and Eup/Myeon areas are 1,845m and 1,777m from residential areas respectively. Areas in Gangwon-do and Gyeongsangbuk-do have relatively low accessibility while Eup areas tend to have higher accessibility. The present study is meaningful in that it shows the status quo of and regional differences of potential accessibility of rural public facilities in Korea. Furthermore, the findings are also meaningful as they can be utilized as fundamental data to locate the facilities and improve the service delivery of medical facilities.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.4A
• /
• pp.250-259
• /
• 2012

This paper compared and investigated the choice of optimal algorithm affects on the directivity synthesis of linear array in the satisfaction to the design specification of the desired directivity, convergence characteristic, and adaptability. Optimal algorithms use a quasi-Newton method(DFP and BFGS method) for realizing the desired directivity, used a quasi-ideal beam, steering beam, and a multi-beam, chosen as desired directivity. In the numerical result, this paper verified the effectiveness of the quasi-Newton method to the directivity synthesis, and offered a solving approach of occurred problems in the numerical simulation process.