• 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.

• The KIPS Transactions:PartD
• /
• v.14D no.2
• /
• pp.169-180
• /
• 2007

This paper discusses a new unsupervised XML document clustering technique based on the function transform and FFT(Fast Fourier Transform). An XML document is transformed into a discrete function based on the hierarchical nesting structure of the elements. The discrete function is, then, transformed into vectors using FFT. The vectors of two documents are compared using a weighted Euclidean distance metric. If the comparison is lower than the pre specified threshold, the two documents are considered similar in the structure and are grouped into the same cluster. XML clustering can be useful for the storage and searching of XML documents. The experiments were conducted with 800 synthetic documents and also with 520 real documents. The experiments showed that the function transform and FFT are effective for the incremental and unsupervised clustering of XML documents similar in structure.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.5
• /
• pp.2414-2433
• /
• 2019

The aim of this paper is to design a 3D laser radar prototype based on laser triangulation. The mathematical model of distance sensitivity is deduced; a pixel-distance conversion formula is discussed and used to complete 3D scanning. The center position extraction algorithm of the spot is proposed, and the error of the linear laser, camera distortion and installation are corrected by using the proposed weighted average algorithm. Finally, the three-dimensional analytic computational algorithm is given to transform the measured distance into point cloud data. The experimental results show that this 3D laser radar can accomplish the 3D object scanning and the environment 3D reconstruction task. In addition, the experiment result proves that the product of the camera focal length and the baseline length is the key factor to influence measurement accuracy.

• The Transactions of the Korean Institute of Electrical Engineers P
• /
• v.65 no.1
• /
• pp.66-71
• /
• 2016

According to the development of depth sensing devices and depth estimation technology, depth information becomes more important for object detection in computer vision. In terms of recognition rate, pedestrian detection methods have been improved more accurately. However, the methods makes slower detection time. So, many researches have overcome this problem by using GPU. Here, we propose a real-time pedestrian detection algorithm that does not rely on GPU. First, the depth-weighted distance map is used for detecting expected human regions. Next, human detection is performed on the regions. The performance for the proposed approach is evaluated and compared with the previous methods. We show that proposed method can detect human about 7 times faster than conventional ones.

• Journal of Korea Multimedia Society
• /
• v.17 no.12
• /
• pp.1446-1452
• /
• 2014

Existing LDA uses the transform matrix that maximizes distance between classes. So we have to convert from an image to one-dimensional vector as training vector. However, in 2D-LDA, we can directly use two-dimensional image itself as training matrix, so that the classification performance can be enhanced about 20% comparing LDA, since the training matrix preserves the spatial information of two-dimensional image. However 2D-LDA uses same calculation schema for transformation matrix and therefore both LDA and 2D-LDA has the heteroscedastic problem which means that the class classification cannot obtain beneficial information of spatial distances of class clusters since LDA uses only data correlation-based covariance matrix of the training data without any reference to distances between classes. In this paper, we propose a new method to apply training matrix of 2D-LDA by using WPS-LDA idea that calculates the reciprocal of distance between classes and apply this weight to between class scatter matrix. The experimental result shows that the discriminating power of proposed 2D-LDA with weighted between class scatter has been improved up to 2% than original 2D-LDA. This method has good performance, especially when the distance between two classes is very close and the dimension of projection axis is low.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.10
• /
• pp.4797-4813
• /
• 2018

The transform domain communication system (Hereinafter referred to as TDCS) takes on numerous advantages, inclusive of anti-jamming and low probability of detection. Yet its application is confined by the consistent spectrum in the transmitter and receiver, which is not possible in the case of a huge distance exsits between them. In this paper, a TDCS based modified weighted fractional fourier transform (WFRFT) is proposed to solve the problem resulting from spectrum mismatching for TDCS application. The amplitude and phase information are incorporated with the TDCS signals and transmit to the receiver together in the wake of a modified WFRFT. The basic function and the TDCS signals shall be accessible to the receivers in the wake of an inverse WFRFT transform, which make sure that the original information can be demodulated properly. The system's reliability while transmitting signals with different modulation methods and with spectrum mismatching is demonstrated by bit error rate (BER). In the meantime, the constellations of the signals and the BER performances at the eavesdropper demonstrate the proposed system is better secured.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.51 no.12
• /
• pp.583-595
• /
• 2002

Homing operation can be defined as a series of actions which are necessary for a mobile robot to move from the current position with any arbitrary orientation to a desired position with a specified orientation, while avoiding possible obstacles. In this paper, a homing and obstacle avoidance algorithm for nonholonomic mobile robots is proposed. The proposed algorithm consists of a local goal generator, a discrete state controller, and local path tracking controller based on Aicardi's path following algorithm. In the discrete state controller, 4 states are defined according to the environmental conditions and 4 desired high-level command for the states are given as follows: avoid, wander, home and homing zones. The proposed local goal generator is designed to generate the desired local path by using weighted distance transforms which are newly made to satisfy the nonholonomic constraints of mobile robots. Here, subgoals are also found as vertices of the desired local path. To demonstrate result effectiveness and applicability of the proposed algorithm, computer simulations are illustrated and experimental results for a real mobile robot system are also provided.

• The Journal of the Acoustical Society of Korea
• /
• v.40 no.5
• /
• pp.460-465
• /
• 2021

In active sonar, time delay estimation is used to find the distance between the target and the sonar. Among the time delay estimation methods for active sonar, estimation in the frequency domain is widely used. When estimating in the frequency domain, the time delay can be thought of as a frequency estimator, so it can be used relatively easily. However, this method is prone to rapid increase in error due to noise. In this paper, we propose a new method which applies weighted dictionary and sparsity in order to reduce this error increase and we extend it to two receivers to propose an algorithm for estimating the time delay between two receivers. And the case of applying the proposed method and the case of not applying the proposed method including the conventional frequency domain algorithm and Generalized Cross Correlation-Phase transform (GCC-PHAT) in a white noise environment were compared with one another. And we show that the newly proposed method has a performance gain of about 15 dB to about 60 dB compared to other algorithms.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1998.08a
• /
• pp.250-253
• /
• 1998

In digital communicatioin networks, speech recognition systems conventionally reconstruct speech followed by extracting feature [parameters. In this paper, we consider a useful approach by incorporating speech coding parameters into the speech recognizer. Most speech coders employed in the networks represent line spectral pairs as spectral parameters. In order to improve the recognition performance of the LSP-based speech recognizer, we introduce two different ways: one is to devise weighed distance measures of LSPs and the other is to transform LSPs into a new feature set, named a pseudo-cepstrum. Experiments on speaker-independent connected-digit recognition showed that the weighted distance measures significantly improved the recognition accuracy than the unweighted one of LSPs. Especially we could obtain more improved performance by using PCEP. Compared to the conventional methods employing mel-frequency cepstral coefficients, the proposed methods achieved higher performance in recognition accuracies.

• Journal of Korea Multimedia Society
• /
• v.11 no.3
• /
• pp.292-300
• /
• 2008

An algorithm for detecting a line segment in an image is presented using incremental pixel extension. We use a different approach from conventional algorithms, such as the Hough transform approach and the line segment grouping approach. The Canny edge is calculated and an arbitrary point is selected among the edge elements. After the arbitrary point is selected, a base line approximating the line segment is calculated and edge pixels within an arbitrary radius are selected. A weighted value is assigned to each edge pixel, which is selected by using the error of the distance and the direction between the pixel and the base line. A line segment is extracted by Jilting a line using the weighted least square method after determining whether selected pixels are linked or delinked using the sum comparison of the weights. The proposed algorithm is compared with two other methods and results show that our algorithm is faster and can detect the real line segment.