• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.4
• /
• pp.580-589
• /
• 1990

This paper describes an efficient method of texture image segmentation based on conditional 1-dimensional histograms. We consider the multi-dimensional histogram, and it is projected into each axis in order to obtain conditional 1-dimensional histograms. And we extract uniform regions by iteratively applying the peak-valley detection method to conditional 1-dimensional histograms. In view of the amount of memory and computation time, the proposed method is superior to the conventional method which uses the multi-dimensional histogram. By applying the proposed method to the artificial and natural texture images some desirable results are obtained.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.9 no.1
• /
• pp.95-102
• /
• 2013

This paper covers nulling algorithm. In this algorithm, we assume that nulling points are already known. In general, nulling algorithm using matrix equation was utilized. But, this algorithm is pointed out that computational complexity is disadvantage. So, we choose gradient method to reduce the computational complexity. In order to further reduce the computational complexity, we propose approximate gradient method using characteristic of trigonometric functions. The proposed method has same performance compared with conventional method while having half the amount of computation when the number of antenna and nulling point are 20 and 1, respectively. In addition, we could virtually eliminate the trigonometric functions arithmetic. Trigonometric functions arithmetic cause a big problem in actual implementation like FPGA processor(Field Programmable gate array). By utilizing the above algorithm in a multi-cell environment, beamforming gain can be obtained and interference can be reduced at same time. By the above results, the algorithm can show excellent performance in the cell boundary.

• ETRI Journal
• /
• v.41 no.6
• /
• pp.782-796
• /
• 2019

This paper presents a hierarchical framework for managing the sampling distribution of a particle filter (PF) that estimates the global positions of mobile robots in a large-scale area. The key concept is to gradually improve the accuracy of the global localization by fusing sensor information with different characteristics. The sensor observations are the received signal strength indications (RSSIs) of Wi-Fi devices as network facilities and the range of a laser scanner. First, the RSSI data used for determining certain global areas within which the robot is located are represented as RSSI bins. In addition, the results of the RSSI bins contain the uncertainty of localization, which is utilized for calculating the optimal sampling size of the PF to cover the regions of the RSSI bins. The range data are then used to estimate the precise position of the robot in the regions of the RSSI bins using the core process of the PF. The experimental results demonstrate superior performance compared with other approaches in terms of the success rate of the global localization and the amount of computation for managing the optimal sampling size.

• International journal of advanced smart convergence
• /
• v.7 no.3
• /
• pp.8-14
• /
• 2018

In the field of surveillance cameras, it is possible to increase the people detection accuracy by using depth information indicating the distance between the camera and the object. In general, depth information is obtained by calculating the parallax information of the stereo camera. However, this method is difficult to operate in real time in the embedded environment due to the large amount of computation. Jetson TX2, released by NVIDIA in March 2017, is a high-performance embedded board with a GPU that enables parallel processing using the GPU. In this paper, a stereo camera is installed in Jetson TX2 to acquire depth information in real time, and we proposed a people counting method using acquired depth information. Experimental results show that the proposed method had a counting accuracy of 98.6% and operating in real time.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.8
• /
• pp.50-59
• /
• 1996

In this paper, a new hierarchical motion estiamtion scheme using the wavelet transformed multi-resolution image layers is proposed. Compared with the full search motion estimation method, the existing hierarchical methods remarkably reduce the amount of the computation but their efficiencies are depreciated by the local minima problem. In order to solve the local minima problem, the multi-resolution image layers are composed using the wavelet transform and the number of layers participated in the motion estimation for a block is determined by considering of its low band energy and higher band energy on the first wavelet transformed layer. The ratio between higher band energy and low band energy of each block is evaluated and in the case of the blocks which include relatively large higher band energy, the motion estimation is carried out in the high resolution layer. Otherwise, all layers are used. The final motion vectors are obtained in the first wavelet transformed layer. So less bits for motion vectors are transmitted, and the decomposition of received image using inverse wavelet transform decreases the blocking effect.

• IEIE Transactions on Smart Processing and Computing
• /
• v.3 no.3
• /
• pp.103-109
• /
• 2014

This study derived the inter-conversion matrices, which can be used in heterogeneous image transcoding between the compressed images using different transforms, such as the $8{\times}8$ block discrete cosine transform (BDCT) and the one-level discrete wavelet transform (DWT). Basically, to obtain the one-level DWT coefficients from $8{\times}8$ BDCT, inverse BDCT should be performed followed by forward DWT, and vice versa. On the other hand, if the proposed interconversion approach is used, only one inter-conversion matrix multiplication makes the corresponding transcoding possible. Both theoretical and experimental analyses showed that the amount of computation of the proposed approach decreases over 20% when the inter-conversion matrices are used under specific conditions.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.8 no.4
• /
• pp.248-253
• /
• 2008

In this paper, a novel vehicle detection algorithm is proposed that utilizes the color histogram of the image. The color histogram is used to search the image for regions with shadow, block symmetry, and block non-homogeneity, thereby detecting the vehicle region. First, an integral histogram of the input image is computed to decrease the amount of required computation time for the block color histograms. Then, shadow detection is performed and the block symmetry and block non-homogeneity are checked in a cascade manner to detect the vehicle in the image. Finally, the proposed scheme is applied to both still images taken in a parking lot and an on-road video sequence to demonstrate its effectiveness.

• IE interfaces
• /
• v.20 no.4
• /
• pp.504-514
• /
• 2007

The multicast routing problem lies in the composition of a multicast routing tree including a source node and multiple destinations. There is a trade-off relationship between cost and delay, and the multicast routing problem of optimizing these two conditions at the same time is a difficult problem to solve and it belongs to a multi-objective optimization problem (MOOP). A multi-objective genetic algorithm (MOGA) is efficient to solve MOOP. A micro-genetic algorithm(${\mu}GA$) is a genetic algorithm with a very small population and a reinitialization process, and it is faster than a simple genetic algorithm (SGA). We propose a multi-objective micro-genetic algorithm (MO${\mu}GA$) that combines a MOGA and a ${\mu}GA$ to find optimal solutions (Pareto optimal solutions) of multicast routing problems. Computational results of a MO${\mu}GA$ show fast convergence and give better solutions for the same amount of computation than a MOGA.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.7
• /
• pp.1668-1676
• /
• 1996

This paper presents the evaluation of an angular spectrum-based method used to calculate scattering pattern of a three-dimensional object modelled as a collection composed of vertical sectional two-dimensional images. This is done via comparing a proposed method with two existing methods, i.e., a Fresnel hologram method and a ray-tracing method, in terms of computatioal complexities and reconstructed results. Maathematical derivations for each methods are reviewed and implementing procedures are described in detail, along with the amount of computaions required from the implementation point of view, rather than from the mathematical point of view. We show simulation results in which the Fresnel holoram method dose not exhibit promising results although it requires the least computation. Moreover, it is also shown that the proposed method, even with much less computational requirement than the ray-tracing method, produces good performances asmuch as the ray-tracing method does.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.43 no.3
• /
• pp.363-371
• /
• 1994

This thesis investigates an expert system(ES) to propose fault restoration plan by utilizing tree search strategies. In order to cope with an extensive amount of data and frequent breaker switching operations in distribution systems, the database of system configuration is constructed by using binary trees. This remarkably enhances the efficiency of search algorithm and makes the proposed ES easily adaptable to system changes due to switching operations. The rule-base is established to fully utilize the meris of tree-structured database. The inferring strategy is developed mainly based on the best-first search algorithm to increase computation efficiency. The proposed ES has been implemented to efficiently deal with large distribution systems by reducing computational burden remarkably compared with the conventional ES's.