• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.9
• /
• pp.4606-4623
• /
• 2019

Nowadays modern cities develop in a very rapid speed. Buildings become larger than ever and the interior structures of the buildings are even more complex. This drives a high demand for precise and accurate indoor navigation systems. Although the existing commercially available 2D indoor navigation system can help users quickly find the best path to their destination, it does not intuitively guide users to their destination. In contrast, an indoor navigation system combined with augmented reality technology can efficiently guide the user to the destination in real time. Such practical applications still have various problems like position accuracy, position drift, and calculation delay, which causes errors in the navigation route and result in navigation failure. During the navigation process, the large computation load and frequent correction of the displayed paths can be a huge burden for the terminal device. Therefore, the navigation algorithm and navigation logic need to be improved in the practical applications. This paper proposes an improved navigation algorithm and navigation logic to solve the problems, creating a more accurate and effective augmented reality indoor navigation system.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.50 no.6
• /
• pp.385-391
• /
• 2022

This paper presents to develop a path planning algorithm combining gradient descent-based path planning (GBPP) and particle swarm optimization (PSO) for considering prohibited flight areas, terrain information, and characteristics of fixed-wing unmmaned aerial vehicle (UAV) in 3D space. Path can be generated fast using GBPP, but it is often happened that an unsafe path can be generated by converging to a local minimum depending on the initial path. Bio-inspired swarm intelligence algorithms, such as Genetic algorithm (GA) and PSO, can avoid the local minima problem by sampling several paths. However, if the number of optimal variable increases due to an increase in the number of UAVs and waypoints, it requires heavy computation time and efforts due to increasing the number of particles accordingly. To solve the disadvantages of the two algorithms, hierarchical path planning algorithm associated with hierarchical particle swarm optimization (HPSO) is developed by defining the initial path, which is the input of GBPP, as two variables including particles variables. Feasibility of the proposed algorithm is verified by software-in-the-loop simulation (SILS) of flight control computer (FCC) for UAVs.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.1
• /
• pp.1-15
• /
• 2022

The MobileNetV3 is specially designed for mobile devices with limited memory and computing power. To reduce the network parameters and improve the network inference speed, a new lightweight network is proposed based on MobileNetV3. Firstly, to reduce the computation of residual blocks, a partial residual structure is designed by dividing the input feature maps into two parts. The designed partial residual structure is used to replace the residual block in MobileNetV3. Secondly, a dual-path feature extraction structure is designed to further reduce the computation of MobileNetV3. Different convolution kernel sizes are used in the two paths to extract feature maps with different sizes. Besides, a transition layer is also designed for fusing features to reduce the influence of the new structure on accuracy. The CIFAR-100 dataset and Image Net dataset are used to test the performance of the proposed partial residual structure. The ResNet based on the proposed partial residual structure has smaller parameters and FLOPs than the original ResNet. The performance of improved MobileNetV3 is tested on CIFAR-10, CIFAR-100 and ImageNet image classification task dataset. Comparing MobileNetV3, GhostNet and MobileNetV2, the improved MobileNetV3 has smaller parameters and FLOPs. Besides, the improved MobileNetV3 is also tested on CPU and Raspberry Pi. It is faster than other networks

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.46 no.11
• /
• pp.66-76
• /
• 2009

The motion estimation in video encoding system occupies the biggest part. So, we require the motion estimator with efficient structure for real-time operation. And for motion estimator's implementation, it is desired to design hardware module of an exclusive use that perform the encoding process at high speed. This paper proposes motion estimation detection block(MED), 41 SADs(Sum of Absolute Difference) calculation block, minimum SAD calculation and motion vector generation block based on parallel processing. The parallel processing can reduce effectively the amount of the operation. The minimum SAD calculation and MED block uses the pre-computation technique for reducing switching activity of the input signal. It results in high-speed operation. The MED and 41 SADs calculation blocks are composed of adder tree which causes the problem of critical path. So, the structure of adder tree has changed the most commonly used ripple carry adder(RCA) with carry skip adder(CSA). It enables adder tree to operate at high speed. In addition, as we enabled to easily control key variables such as control signal of search range from the outside, the efficiency of hardware structure increased. Simulation and FPGA verification results show that the delay of MED block generating the critical path at the motion estimator is reduced about 19.89% than the conventional strukcture.

• Journal of Institute of Control, Robotics and Systems
• /
• v.17 no.2
• /
• pp.108-115
• /
• 2011

This paper describes a new sensor system for mobile robot motion estimation using stereo infrared light sources and a camera. Visibility is being applied to robotic obstacle avoidance path planning and localization. Using simple visibility computation, the environment is partitioned into many visibility sectors. Based on the recognized edges, the sector a robot belongs to is identified and this greatly reduces the search area for localization. Geometric modeling of the vision system enables the estimation of the characteristic pixel position with respect to the robot movement. Finite difference analysis is used for incremental movement and the error sources are investigated. With two characteristic points in the image such as vertices, the robot position and orientation are successfully estimated.

• Proceedings of the Korea Concrete Institute Conference
• /
• 2000.04a
• /
• pp.357-362
• /
• 2000

This Paper presents dynamic analysis of underground R/C Subway Structure, subjected to seismic actions. Earthquakes brought serious damage to RC subway Structure. Foe studying the collapse mechanism of underground RC Subway, seismic of a subway station is simulated in using FEM program ASP2000 of two-dimension based on the path dependent RC elastic model, soil foundation and interfacial models. The shear failure of intermediate vertical columns is founds to be the major cause of the structural collapse. According to FEM simulation of the failure mechanism, it is considered that the RC column would lose axial load carrying capacity after the occurrence of the localized diagonal shear cracks , and sudden failure of the outer frame would be followed. Specially, the shear stress in the middle slab reaches maximum shear capacity. So, the Structure would fail in the middle slab as a result of erasing the vertical ground motion computation.

• Journal of the Korean Ceramic Society
• /
• v.32 no.8
• /
• pp.957-965
• /
• 1995

The ionic conductivityof NASICON solid electrolytes was simulated by using Monte Carlo Method (MCM) based on a hopping model as functions of temoperature and composition. Two conduction paths were used : jumping from Na1 to Na2 and jumping from Na1 to Na2 and jumping from Na2 to Na2. Vacancy availability factor, V was affected by composition, temperature and the conduction paths. For β"-Alumina, it was known that the minimum of charge correlation factor, fc appears at the composition, p=0.5, but there was not shown the minimum of fc for NASICON. When the NASICON composition, x, approaches 2.5, the curve of In σT vs. 1/T* was shown Arrhenius behavior and also In (VWfc) was a linear function of 1/T*. The results of simulations on the considered conduction paths didn't agree with the experimental results. Thus it will be necessary to include the another Na sites as mid-Na site on the conduction path to obtain the better results.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.49 no.5
• /
• pp.269-277
• /
• 2000

We propose two new types multi-stage blind clustering equalizers for QAM demoulation, which are called a complex classification algorithm(CCA) and a radial basis function algorithm(RBFA). The CCA uses a clustering technique based on the joint gaussian probability function and computes separately the real part and imaginary part for simple implementation as well as less computation. In order to improve the performance of CCA, the Dual-Mode CCA(DMCCA) incorporates the CCA tap-updating mode with the decision-directed(DD) mode. The RBFA reduces the number of cluster centers through three steps using the classification technique of RBF and then updates the equalizer taps for QAM demodulation. Test results on 16-QAM confirm that the proposed algorithms perform better the conventional multi-state equalizers in the senses of SER and MSE under multi-path fading channel.

• Journal of Korea Multimedia Society
• /
• v.11 no.6
• /
• pp.816-827
• /
• 2008

In this paper, two-stage pipelined floating-point arithmetic unit (FP-AU) is designed. The FP-AU processor supports seventeen operations to apply 3D graphics processor and has area-efficient and low-latency architecture that makes use of modified dual-path computation scheme, new normalization circuit, and modified compound adder based on flagged prefix adder. The FP-AU has about 4-ns delay time at logic synthesis condition using $0.18{\mu}m$ CMOS standard cell library and consists of about 5,930 gates. Because it has 250 MFLOPS execution rate and supports saturated arithmetic including a number of graphics-oriented operations, it is applicable to mobile 3D graphics accelerator efficiently.

• Convergence Security Journal
• /
• v.16 no.7
• /
• pp.113-120
• /
• 2016

This paper presents a new high-speed SHA-1 pipeline architecture having a computation delay close to the maximum critical path delay of the original SHA-1. The typical SHA-1 pipelines are based on either a hash operation or unfolded hash operations. Their throughputs are greatly enhanced by the parallel processing in the pipeline, but the maximum critical path delay will be increased in comparison with the unfolding of all hash operations in each round. The pipeline stage logics in the proposed SHA-1 has the latency is similar with the result of dividing the maximum threshold delay of a round by the number of iterations. Experimental results show that the proposed SHA-1 pipeline structure is 0.99 and 1.62 at the operating speed ratio according to circuit size, which is superior to the conventional structure. The proposed pipeline architecture is expected to be applicable to various cryptographic and signal processing circuits with iterative operations.