• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.7
• /
• pp.629-638
• /
• 2000

The main difference between mono-volume rendering and multi-volume rendering is data intermixing. In this paper, we first propose a selective rendering method for fast visualizing specific volume according to the surface level and then present data intermixing method for multiple volumes. The selective rendering method is to generate distance transformed volume using a distance transform to determine the minimum distance to the nearest interesting part and then render it. The data intermixing method for multiple volumes is to combine several volumes using intensity weighted intermixing method, opacity weighted intermixing method, opacity weighted intermixing method with depth information and then render it. We show the results of selective rendering of left ventricle and right ventricle generated from EBCT cardiac images and of data intermixing for combining original volume and left ventricular volume or right ventricular volume. Our method offers a visualization technique of specific volume according to the surface level and an acceleration technique using a distance transformed volume and the effective visual output and relation of multiple images using three different intermixing methods in three-dimensional space.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.27 no.2
• /
• pp.146-159
• /
• 2023

This paper proposes a hybrid algorithm combining K-means clustering and watershed algorithms for flower segmentation and counting. We use the K-means clustering algorithm to obtain the main colors in a complex background according to the cluster centers and then take a color space transformation to extract pixel values for the hue, saturation, and value of flower color. Next, we apply the threshold segmentation technique to segment flowers precisely and obtain the binary image of flowers. Based on this, we take the Euclidean distance transformation to obtain the distance map and apply it to find the local maxima of the connected components. Afterward, the proposed algorithm adaptively determines a minimum distance between each peak and apply it to label connected components using the watershed segmentation with eight-connectivity. On a dataset of 30 images, the test results reveal that the proposed method is more efficient and precise for the counting of overlapped flowers ignoring the degree of overlap, number of overlap, and relatively irregular shape.

• Proceedings of the IEEK Conference
• /
• 2001.06b
• /
• pp.121-124
• /
• 2001

This paper proposed resource allocation algorithm for the minimum switching activity of functional unit in high level synthesis process as like DSP which is circuit to give many functional unit. The resource allocation method after scheduling use the power function calculating average hamming distance and switching activity of the between two input. First of all, the switching activity is calculated by the input value after calculating the average hamming distance between operation. In this paper, the proposed method though high If level simulation find switching activity in circuit each functional unit exchange for binary sequence length and value bit are logic one value. To use the switching activity find the allocation with minimal power consumption, the proposed method visits all control steps one by one and determines the allocation with minimal power consumption at each control step. As the existing method, the execution time can be fast according to use the number of operator and max control step. And it is the reduction effect from 6% to 8%.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.22 no.2
• /
• pp.208-213
• /
• 2011

This paper analyzes potential interference effects of Ultra Wide Band(UWB) on Global Positioning System(GPS) which is providing safety service. For the interference analysis, positioning error method is used to determine the minimum protection distance to meet positioning error of 2.5 m below and Minimum Coupling Loss(MCL) method is used to determine the required protection ratio(I/N) from the protection distance of UWB transmitter and GPS receiver to meet positioning error of 2.5 m below. In a result, the minimum protection distance to meet positioning error of 2.5 m below was about 10 m and the protection ratio to meet positioning error 2.5 m below was -20 dB. The protection ratio proposed in this paper is the same value of the protection ratio of safety service proposed by ITU-R. The obtained protection ratio can be used for the protection standard of domestic GPS system for the safe of life service.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.18 no.3
• /
• pp.113-127
• /
• 2015

Recently, there has been a growing interest in UAS(Unmanned Aerial System), and it is required to develop techniques to effectively detect water body from the recorded images in order to implement flood monitoring using UAS. This study used a UAS with RGB and NIR+RG bands to achieve images, and applied supervised classification method to evaluate the accuracy of water body detection. Firstly, the result for accuracy in water body image classification by RGB images showed high Kappa coefficients of 0.791 and 0.783 for the artificial neural network and minimum distance method respectively, and the maximum likelihood method showed the lowest, 0.561. Moreover, in the evaluation of accuracy in water body image classification by NIR+RG images, the magalanobis and minimum distance method showed high values of 0.869 and 0.830 respectively, and in the artificial neural network method, it was very low as 0.779. Especially, RGB band revealed errors to classify trees or grasslands of Songsan amusement park as water body, but NIR+RG presented noticeable improvement in this matter. Therefore, it was concluded that images with NIR+RG band, compared those with RGB band, are more effective for detection of water body when the mahalanobis and minimum distance method were applied.

• Journal of the Korean Society for Precision Engineering
• /
• v.16 no.12
• /
• pp.204-213
• /
• 1999

This paper suggests a numerical method of finding optimal geometric path and minimum-time motion for a manipulator arm. To find the minimum-time motion, the optimal geometric path is searched first, and the minimum-time motion is searched on this optimal path. In the algorithm finding optimal geometric path, the objective function is minimizing the combination of joint velocities, joint-jerks, and actuator forces as well as avoiding several static obstacles, where global search is performed by adjusting the seed points of the obstacle models. In the minimum-time algorithm, the traveling time is expressed by the linear combinations of finite-term quintic B-splines and the coefficients of the splines are obtained by nonlinear programming to minimize the total traveling time subject to the constraints of the velocity-dependent actuator forces. These two search algorithms are basically similar and their convergences are quite stable.

• Journal of Korean Society of Transportation
• /
• v.22 no.6
• /
• pp.101-108
• /
• 2004

The new transit fare in the Seoul Metropolitan is basically determined based on the distance-based fare system (DBFS). The total fare in DBFS consists of three parts- (1) basic fare, (2) transfer fare, and (3) extra fare. The fixed amount of basic fare for each mode is charged when a passenger gets on a mode, and it proceeds until traveling within basic travel distance. The transfer fare may be added when a passenger switches from the present mode to another. The extra fare is imposed if the total travel distance exceeds the basic travel distance, and after that, the longer distance the more extra fare based on the extra-fare-charging rule. This study proposes an algorithm for finding minimum fare route in DBFS. This study first exploits the link-label-based searching method to enable shortest path algorithms to implement without network expansion at junction nodes in inter-modal transit networks. Moreover, the link-expansion technique is adopted in order for each mode's travel to be treated like duplicated links, which have the same start and end nodes, but different link features. In this study, therefore, some notations associated with modes can be saved, thus the existing link-based shortest path algorithm is applicable without any loss of generality. For fare calculation as next steps, a mathematical formula is proposed to embrace fare-charging process using search process of two adjacent links illustrated from the origin. A shortest path algorithm for finding a minimum fare route is derived by converting the formula as a recursive form. The implementation process of the algorithm is evaluated through a simple network test.

• Proceedings of the IEEK Conference
• /
• 2003.11a
• /
• pp.505-508
• /
• 2003

The current paper proposes a new vertex selection scheme for polygon-based contour ceding. To efficiently characterize the shape of an object, we incorporate the curvature information in addition to the conventional maximum distance criterion in vertex selection process. The proposed method consists of “two-step procedure.” At first, contour pixels of high curvature value are selected as key vertices based on the curvature scale space (CSS), thereby dividing an overall contour into several contour-segments. Each segment is considered as an open contour whose end points are two consecutive key vertices and is processed independently. In the second step, vertices for each contour segment are selected using progressive vertex selection (PVS) method in order to obtain minimum number of vertices under the given maximum distance criterion ( $D_{MAX}$). Experimental results are presented to compare the approximation performances of the proposed and conventional methods.s.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.6A
• /
• pp.438-449
• /
• 2012

This paper presents new CRC-p codes for VHF band maritime wireless communication system based on performance analysis of various CRC codes. For this purpose, we firstly describe the method of determination of undetected error probability and minimum Hamming distance according to variation of CRC codeword length. By using the fact that the dual code of cyclic Hamming code and primitive BCH code become maximum length codes, we present an algorithm for computation of undetected error probability and minimum Hamming distance where the concept of simple hardware that is consisted of linear feedback shift register is utilized to compute the weight distribution of CRC codes. We also present construction of transmit data frame of VHF band maritime wireless communication system and specification of major communication parameters. Finally, new optimal CRC-p codes are presented based on the simulation results of undetected error probability and minimum Hamming distance using the various generator polynomials of CRC codes, and their performances are evaluated with simulation results of bit error rate based on the Rician maritime channel model and ${\pi}$/4-DQPSK modulator.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.11
• /
• pp.2015-2021
• /
• 2017

Recently, a lot of attention is fallen to IoT(Internet of Things) for hyper-connected society and the number of unlicensed wireless device has been increasing. Thus, this paper analyzed the impact of unlicensed wireless device on the basis of 802.11ah on licensed LTE user equipment in 900 MHz frequency band for efficient frequency use. As the interference analysis method, Minimum Coupling Loss (MCL) method and Monte Carlo (MC) method were used. In case of one interferer, minimum separation distance between interferer and victim was calculated as about 22 m through the MCL method under the assumption of the worst case. The maximum number of interferer to meet the interference probability of 5% below within a cell radius of the victim was computed as about 3000 by using MC method based on statistical technique. The analysis method and results in this paper are expected to be used for the coexistence between unlicensed wireless device and licensed wireless device.