• Proceedings of the Korean Information Science Society Conference
• /
• 2000.04b
• /
• pp.589-591
• /
• 2000

비디오 데이터가 포함하고 있는 카메라와 이동물체의 동작정보를 추출하기 위한 대표적인 방법으로 동작벡터 추출알고리즘이 있다. 본 논문에서는 영상 내에 밝기 값 분포가 균일한 영역이 존재할 때 부정확한 정합 결과를 보이는 것은 기존 알고리즘의 문제점과 이를 개선할 수 있는 계층적 블록정합 알고리즘의 정합오류 전파가능성, 높은 시간복잡도 문제를 동시에 해결할 수 있는 블록정합 알고리즘을 제안한다. 제안하는 알고리즘은 Coarse-to-Fine 방식의 탐색방법과 Dynamic Control Strategy를 결합한 것으로서 정합한 블록의 상황에 따라 탐색 레이어를 동적으로 변경시키는 방법을 사용한다. 본 알고리즘은 크게 두단계로 나뉘어 지는데 탐색 레이어를 결정하는 Control 변경 결정 단계와 정합도 측정함수를 통해 블록에 대한 정합 정확도를 측정하는 단계로 구성이 된다.

• Journal of Communications and Networks
• /
• v.9 no.2
• /
• pp.167-176
• /
• 2007

In multimedia communication systems, efficient transmission system design should incorporate the use of matching unequal error protection (UEP), since source coders exhibit unequal bit error sensitivity. In this paper, we present UEP schemes which exploit differences in bit error protection levels in orthogonal frequency division multiplexing (OFDM) systems over frequency selective fading channels. We introduce an UEP scheme which improves the link performance with multiple transmit and receive antennas. Especially, we propose a new receiver structure based on two stage Maximum Likelihood detection (MLD) schemes which can approach the performance of a full search MLD receiver with much reduced computational complexity. In the performance analysis, we derive a generalized pairwise error probability expression for the proposed UEP schemes. Simulation results show that the proposed schemes achieve a significant performance gain over the conventional equal error protection (EEP) scheme.

• Journal of the Korean Society of Safety
• /
• v.11 no.3
• /
• pp.143-153
• /
• 1996

Shutdown of boiler plants is a dynamic, complicated, and hazardous operation. Operational error is a major contributor to danserous situations during boiler plant shutdowns. It is important to develop an automatic system which synthesizes operating procedures to safely go from normal operation to complete shutdown. Knowledge representation for automatic shutdown of boiler plants makes use of the hierarchical, rule-based framework for heuristic knowledge, the semantic network, frame for process topology, and AI techniques such as rule matching, forward chaining, backward chaining, and searching. This knowledge representation and modeling account for the operational states, primitive operation devices, effects of their application, and planning methodology. Also, this is designed to automatically formulate subgoals, search for positive operation devices, formulate constraints, and synthesize shutdown procedures in boiler plants.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.30 no.2
• /
• pp.125-134
• /
• 2012

In this paper, we propose a method to analyze M:N corresponding relations in semantic matching, especially focusing on feature class matching. Similarities between any class pairs are measured by spatial objects which coexist in the class pairs, and corresponding classes are obtained by clustering with these pairwise similarities. We applied a graph embedding method, which constructs a global configuration of each class in a low-dimensional Euclidean space while preserving the above pairwise similarities, so that the distances between the embedded classes are proportional to the overall degree of similarity on the edge paths in the graph. Thus, the clustering problem could be solved by employing a general clustering algorithm with the embedded coordinates. We applied the proposed method to polygon object layers in a topographic map and land parcel categories in a cadastral map of Suwon area and evaluated the results. F-measures of the detected class pairs were analyzed to validate the results. And some class pairs which would not detected by analysis on nominal class names were detected by the proposed method.

• Journal of Cadastre & Land InformatiX
• /
• v.50 no.2
• /
• pp.155-168
• /
• 2020

Open source is a key growth engine of the 4th industrial revolution, and the continuous development and use of various algorithms for image processing is expected. The purpose of this study is to examine the effectiveness of the UAS image processing open source based algorithm by comparing and analyzing the water reproduction and moving object filtering function and the time required for data processing in 3D reproduction. Five matching algorithms were compared based on recall and processing speed through the 'ANN-Benchmarks' program, and HNSW (Hierarchical Navigable Small World) matching algorithm was judged to be the best. Based on this, 108 algorithms for image processing were constructed by combining each methods of triangulation, point cloud data densification, and surface generation. In addition, the 3D reproduction and data processing time of 108 algorithms for image processing were studied for UAS (Unmanned Aerial System) images of a park adjacent to the sea, and compared and analyzed with the commercial image processing software 'Pix4D Mapper'. As a result of the study, the algorithms that are good in terms of reproducing water and filtering functions of moving objects during 3D reproduction were specified, respectively, and the algorithm with the lowest required time was selected, and the effectiveness of the algorithm was verified by comparing it with the result of 'Pix4D Mapper'.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.4B
• /
• pp.353-364
• /
• 2002

In this paper, a new onto-digital stereo object-tracking system using hierarchical digital algorithms and optical BPEJTC is proposed. This proposed system can adaptively track a moving target by controlling the convergence of stereo camera. firstly, the target is detected through the background matching of the sequential input images by using optical BPEJTC and then the target area is segmented by using the target projection mask which is composed by hierarchical digital processing of image subtraction, logical operation and morphological filtering. Secondly, the location's coordinate of the moving target object for each of the sequential input frames can be extracted through carrying out optical BPEJTC between the reference image of the target region mask and the stereo input image. Finally, the convergence and pan/tilt of stereo camera can be sequentially controlled by using these target coordinate values and the target can be kept in tracking. Also, a possibility of real-time implementation of the adaptive stereo object tracking system is suggested through optically implementing the proposed target extraction and convergence control algorithms.

• Journal of Biomedical Engineering Research
• /
• v.24 no.2
• /
• pp.61-68
• /
• 2003

This paper presents a quantitative analysis method for fall in sick times of the cerebral infarction patients using three types of magnetic resonance image, which play an important role in deciding method of medical treatment. For this object, image characteristics obtained by three radiographic methods of MRI and their relation were analyzed by means of object centered hierarchical Planning method. This methode presents an approach to the knowledge based processes for image interpretation and analysis. To compare three type of MRI. a multiple warping algorithm and affine transform method performed for image matching. Then each fall in sick times level of cerebral infarction was quantified and pseudo-color mapping performed by comparing gray level value one another according to Previously obtained hand maid data. The result of this study was compared to a medical doctors decision.

• The KIPS Transactions:PartB
• /
• v.14B no.4
• /
• pp.263-272
• /
• 2007

This paper proposes a skeleton-based hierarchical shape description scheme, called a skeleton tree, for accurate shape-based image retrieval. A skeleton tree represents an object shape as a hierarchical tree where high-level nodes describe parts of coarse trunk regions and low-level nodes describe fine details of boundary regions. Each node refines the shape of its parent node. Most of the noise disturbances are limited to bottom level nodes and the boundary noise is reduced by decreasing weights on the bottom levels. The similarity of two skeleton trees is computed by considering the best match of a skeleton tree to a sub-tree of another skeleton tree. The proposed method uses a hybrid similarity measure by employing both Fourier descriptors and moment invariants in computing the similarity of two skeleton trees. Several experimental results are presented demonstrating the validity of the skeleton tree scheme for the shape description and indexing.

• Journal of Broadcast Engineering
• /
• v.1 no.1
• /
• pp.7-13
• /
• 1996

MASF is a kind of temporal filter proposed for noise reduction and temporal band limitation. MASF uses motion vectors to extract temporal information in spatial domain. Therefore, inaccurate motion information causes some distortions in MASF operation. Currently, bilinear interpolation after BMA(Block Matching Algorithm) is used for the motion estimation sheme of MASF. But, this method results in unreliable estimation when the object in image sequence has larger movement than the maximum displacement assumed in BMA or the input images are severely corrupted with noise. In order to i:;olve this problem, we analyse the effect of inaccurate motion on MASF and propose a hierarchical motion estimation algorithm based on the analysis results. Experimental results show that the proposed method produces reliable output under large motion and noisy situations.

• Journal of Broadcast Engineering
• /
• v.3 no.1
• /
• pp.85-92
• /
• 1998

The block matching algorithm is the most popular motion estimation method in image sequence coding. In this paper, we propose a VLSI architecture. for implementing a recently proposed fast bolck matching algorith, which uses spatial correlation of motion vectors and hierarchical searching scheme. The proposed architecture consists of a basic searching unit based on a systolic array and two shift register arrays. And it covers a search range of -32~ +31. By using the basic searching unit repeatedly, it reduces the number of gatyes for implementation. For basic searching unit implementation, a proper systolic array can be selected among various conventional ones by trading-off between speed and hardware cost. In this paper, a structure is selected as the basic searching unit so that the hardware cost can be minimized. The proposed overall architecture is fast enough for low bit-rate applications (frame size of $352{\times}288$, 3Oframes/sec) and can be implemented by less than 20,000 gates. Moreover, by simply modifying the basic searching unit, the architecture can be used for the higher bit-rate application of the frame size of $720{\times}480$ and 30 frames/sec.