• Journal of Digital Contents Society
• /
• v.18 no.1
• /
• pp.159-165
• /
• 2017

In order to solve problems in automatic quality inspection of tablet capsules, computation-efficient image processing technique, appropriate threshold setting, edge detection and segmentation methods are required. And since existing automatic system for quality inspection of tablet capsules is of very high cost, it needs to be reduced through the realization of low-price hardware system. This study suggests a technique that uses low-cost camera module to obtain image and inspects dents on tablet capsules and sorting them by applying TLS curve fitting technique and edge-based image segmentation. In order to assess the performance, the major classifications algorithm of PCA, ICA and SVM are used to evaluate training time, test time and accuracy for capsule image area and curve fitting edge data sets.

• Journal of IKEEE
• /
• v.17 no.4
• /
• pp.469-477
• /
• 2013

This paper enhances the speed of a pedestrian detection using an estimation of feature information based on integral image. Pedestrian model or input image should be resized to the size of various pedestrians. In case that the size of pedestrian model would be changed, pedestrian models with respect to the size of pedestrians should be required. Reducing the size of pedestrian model, however, deteriorates the quality of the model information. Since various features according to the size of pedestrian models should be extracted, repetitive feature extractions spend the most time in overall process of pedestrian detection. In order to enhance the processing time of feature extraction, this paper proposes the fast extraction of pedestrian features based on the estimate of integral image. The efficiency of the proposed method is evaluated by comparative experiments with the Channel Feature and Adaboost training using INRIA person dataset.

• Journal of the Institute of Convergence Signal Processing
• /
• v.9 no.2
• /
• pp.164-172
• /
• 2008

This paper presents the efficient localization of a mobile robot traveling on the floor with tags installed, using the spatial and temporal information acquired from passive RFID environment. Compared to previous research, the proposed localization method can reduce the position estimation error and also cut down the initial cost tag installation cost. Basically, it is assumed that a mobile robot is traveling over a series of straight line segments, each at a certain constant velocity, and that the number of tags sensed by a mobile robot at each sampling instant is at most one. First, the velocity and position estimation of a mobile robot starting from a known position, which is valid for all segments except the first one. Second, for the first segment in which the starting position is unknown, the velocity and position estimation is made possible by enforcing a mobile robot to traverse at least two tags at a constant velocity with the steering angle unchanged. Third, through experiments using our passive RFID localization system, the validity and performance of the mobile robot localization proposed in this paper is demonstrated.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.1A
• /
• pp.142-155
• /
• 2000

In this paper, we propose an efficient policing mechanism for Markov model-based traffic descriptors of VBR MPEG video traffic. A VBR video sequence is described by a set of traffic descriptors using a scene-basedMarkov model to the network for the effective resource allocation and accurate QoS prediction. The networkmonitors the input traffic from the source using a proposed new policing method. for policing the steady statetransition probability of scene states, we define two representative monitoring parameters (mean holding andrecurrence time) for each state. For frame level cell rate policing of each scene state, accumulated average cellrates for the frame types are compared with the model parameters. We propose an exponential bounding functionto accommodate dynanic behaviors during the transient period. Our simulation results show that the proposedpolicing mechanism for Markovian traffic descriptors monitors the sophisticated traffic such as MPEG videoeffectively and well protects network resources from the nalicious or misbehaved traffic.

• Journal of the Institute of Convergence Signal Processing
• /
• v.9 no.3
• /
• pp.195-200
• /
• 2008

To compress the moving picture data effectively, it is needed to reduce spatial and temporal redundancy of input image data. While motion estimation! compensation methods is effectively able to reduce temporal redundancy but it is increased computation complexity because of the prediction between frames. So, the study of algorithm for computation reduction and real time processing is needed. This paper is presenting quantizer effectively able to quantize DCT coefficient considering the human visual sensitivity. As quantizer that proposed DCT-based H.263 could make transmit more frame than TMN5 at a same transfer speed, and it could decrease the frame drop effect. And the luminance signal appeared the difference of $-0.3{\sim}+0.65dB$ in the average PSNR for the estimation of objective image quality and the chrominance signal appeared the improvement in about 1.73dB in comparision with TMN5. The proposed method reduces $30{\sim}31%$ compared with NTSS and $20{\sim}21%$ compared to 4SS in comparition of calculation quantity.

• Journal of the Korea Society for Simulation
• /
• v.24 no.2
• /
• pp.1-9
• /
• 2015

The tactical employment is a critical factor to win the war in the modern battlefield. To apply optimized tactics, it needs analyses related to a battle system. Normally, M&S (Modeling & Simulation) has been studied to analyze data in general problems. However, this method is not suitable for military simulations because there are many variables which make complex interaction in the system. For this reason, we suggested the optimized simulation framework based on the M&S by using DPSO (Discrete binary version of PSO) algorithm. This optimized simulation framework makes the best tactical employment to reduce the searching time compared with the normal M&S used by Monte Carlo search method. This paper shows an example to find the best combination of anti-torpedo scenario in a short searching time. From the simulation example, the optimized simulation framework presents the effectiveness.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.16 no.4
• /
• pp.345-351
• /
• 2003

Due to increasing legal and market demands for safety in the automotive design process, the design of integrated seat is important more and mote because it should satisfy the conflict between stronger and lower weight for safety and environmental demands. In this study for crash simulations, the numerical simulations have been carried out using the explicit finite element program LS-Dyna according to the FMVSS 210 standard for safety test of seat. Since crash simulations are very time-consuming and a series of simulations that does not lead to a better result is very costly, the optimization method must be both efficient and reliable. As a result of that, statistical approaches such as design of experiments and response surface model have been successfully implemented to reduce time-consuming LS-Dyna simulations and optimize the safety and environmental demands together with nonlinear optimization algorithm. Design of experiments is used lot exploring the design space of maximum displacement and total weight and for building response surface models in order to minimize the maximum displacement and total weight of integrated seat.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.41 no.8
• /
• pp.75-84
• /
• 2004

In this paper, we proposed an efficient hardware architecture of line-based lifting algorithm for Motion JPEG2000. We proposed a new architecture of a lifting-based filtering cell which has an optimized and simplified structure. It was implemented in a hardware accommodating both (9,7) and (5,4) filter. Since the output rate is linearly proportional to the input rate, one can obtain the high throughput through parallel operation simply by adding the hardware units. It was implemented into both of ASIC and FPGA The 0.35${\mu}{\textrm}{m}$ CMOS library from Samsung was used for ASIC and Altera was the target for FRGA. In ASIC, the proposed architecture used 41,592 gates for the lifting arithmetic and 128 Kbit memory. For FPGA it used 6,520 LEs(Logic Elements) and 128 ESBs(Embedded System Blocks). The implementations were stably operated in the clock frequency of 128MHz and 52MHz, respectively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.6C
• /
• pp.625-631
• /
• 2002

This paper presents a MSB-first digit-serial systolic array for computing modular multiplication of A(x)B(x) mod G(x) in finite fields $GF(2^m)$. From the MSB-first multiplication algorithm in $GF(2^m)$, we obtain a new data dependence graph and design an efficient digit-serial systolic multiplier. For circuit synthesis, we obtain VHDL code for multiplier, If input data come in continuously, the implemented multiplier can produce multiplication results at a rate of one every [m/L] clock cycles, where L is the selected digit size. The analysis results show that the proposed architecture leads to a reduction of computational delay time and it has much more simple structure than existing digit-serial systolic multiplier. Furthermore, since the propose architecture has the features of unidirectional data flow and regularity, it shows good extension characteristics with respect to m and L.

• Journal of KIISE
• /
• v.43 no.1
• /
• pp.40-46
• /
• 2016

Digital road map generation is primarily based on artificial satellite photographing or in-site manual survey work. Therefore, these map generation procedures require a lot of time and a large budget to create and update road maps. Consequently, people have tried to develop automated map generation systems using GPS trajectory data sets obtained by public vehicles. A fundamental problem in this road generation procedure involves the extraction of representative trajectory such as main roads. Extracting a representative trajectory requires the base data set of piecewise line segments(GPS-trajectories), which have close starting and ending points. So, geometrically similar trajectories are selected for clustering before extracting one representative trajectory from among them. This paper proposes a new divide- and-conquer approach by partitioning the whole map region into regular grid sub-spaces. We then try to find similar trajectories by sweeping. Also, we applied the $Fr{\acute{e}}chet$ distance measure to compute the similarity between a pair of trajectories. We conducted experiments using a set of real GPS data with more than 500 vehicle trajectories obtained from Gangnam-gu, Seoul. The experiment shows that our grid partitioning approach is fast and stable and can be used in real applications for vehicle trajectory clustering.