• Journal of Broadcast Engineering
• /
• v.7 no.2
• /
• pp.181-191
• /
• 2002

Video based surveillance systems based on an active camera require a fast algorithm for real time detection and tracking of local motion in the presence of global motion. This paper presents a new fast and efficient motion detection and tracking algorithm using the displaced frame difference (DFD). In the Proposed algorithm, first, a Previous frame is adaptively selected according to the magnitude of object motion, and the global motion is estimated by using only a few confident matching blocks for a fast and accurate result. Then, a DFD is obtained between the current frame and the selected previous frame displaced by the global motion. Finally, a moving object is extracted from the noisy DFD by utilizing the correlation between the DFD and current frame. We implement this algorithm into an active camera system including a pan-tilt unit and a standard PC equipped with an AMD 800MHz processor. The system can perform the exhaustive search for a search range of 120, and achieve the processing speed of about 50 frames/sec for video sequences of 320$\times$240. Thereby, it provides satisfactory tracking results.

• Journal of Environmental Science International
• /
• v.26 no.6
• /
• pp.779-788
• /
• 2017

In this study, we analyzed the changes in the echolocation and prey-capture behavior of the horseshoe bat Rhinolophus ferrumequinum from search phase to capture time. The experiment was conducted in an indoor free-flight room fitted with an ultra-high-speed camera. We found that the bats searched for food while hanging from a structure, and capturing was carried out using the flight membrane. In addition, it was confirmed that the mouth and uropatagium were continuously used in tandem during the capturing process. Furthermore, using Constant Frequency (CF), we confirmed that the prey catching method reflected the wing morphology and echolocation pattern of R. ferrumequinum. The echolocation analysis revealed that the pulse duration, pulse interval, peak frequency, start-FM-bandwidth, and CF duration decreased as the search phase approached the terminal phase. Detailed analysis of echolocation pulse showed that the end-FM bandwidth, which increases as it gets nearer to the capture time of prey, was closely related to the accurate grasp of the location of an insect. At the final moment of prey capture, the passive listening that stopped the divergence of the echolocation was identified; this was determined to be the process of minimizing the interruption from the echo of the echolocation call emitted from the bat itself and sound waves emitted from the prey.

• Journal of Korea Multimedia Society
• /
• v.4 no.2
• /
• pp.116-129
• /
• 2001

To improve the performance of the inverse halftoning, smoothing masks should be designed optimally by using the accurate information of halftone cells. In this thesis, the method of energy minimization is so defined as to determine the exact information of halftone cell. A heuristic search method is proposed to obtain efficiently the parameters of halftone cells which determine the minimum energy. A halftone-peak modeling method with several functions is proposed and used to get initial values of the parameters. The dimension decomposition technique is also adopted to speed up the search process of energy minimization. Several experiments show that the proposed method extracts correct location of the seed pixel of the halftone cell and the extracted information of the halftone cell can be used to get more exactly smoothed color images. The proposed method can be applied to extract the texture patterns, to separate channel images of a scanned color halftone image, and to extract the moire area in an image.

• Journal of Broadcast Engineering
• /
• v.23 no.5
• /
• pp.628-635
• /
• 2018

In this paper, we propose a fast motion estimation algorithm which is important in video encoding. So many fast motion estimation algorithms have been published for improving prediction quality and computational reduction. In the paper, we propose an algorithm that reduces unnecessary computation, while almost keeping prediction quality compared with the full search algorithm. The proposed algorithm calculates the sum of partial block matching error for each candidate, selects the candidates for the next step, compares the stability of optimal candidates with minimum error, and finds optimal motion vectors by determining the progress of the next step. By doing that, we can find the minimum error point as soon as possible and obtain fast computational speed by reducing unnecessary computations. Additionally, the proposed algorithm can be used with conventional fast motion estimation algorithms and prove it in the experimental results.

• Journal of the Korean Society of Physical Medicine
• /
• v.13 no.3
• /
• pp.39-47
• /
• 2018

PURPOSE: The purpose of this investigation was to conduct a systemic review of studies that examine the effects of strengthening exercise on gait ability and GMFM in children with cerebral palsy and propose a standard for cerebral palsy therapy based on a meta-analysis of the studies. METHODS: An extensive literature search was conducted using databases including the KISS (Korean studies Information Service System), RISS, DBpia, PubMed and ScienceDirect, with the following search terms: 'Strengthening Exercise,' 'Resistance Exercise,' 'Gait ability,' 'GMFM' or 'cerebral palsy'. RESULTS: Eleven studies were included in this review and the duration of the intervention varied from 5 to 24 weeks. The number of application per week was mostly 2-3 times, while 5 intervention per week was adopted in a few cases. The total number of intervention applied varied from 18 to 36 and the respective effect sizes of GMFM on crawling and sitting were very high (1.075 and .881) while those of GMFM on standing and walking were very low(.206 and .125). The effect size was for gait speed was only .221. CONCLUSION: Trunk exercise and lower limb exercise effectively improved GMFM in children with cerebral palsy, resulting in improved outcomes in sitting and crawling. The results of this study will be useful for designing evidencebased cerebral palsy therapy programs.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.19 no.7
• /
• pp.258-264
• /
• 2018

This paper presents application of a differential search (DS) meta-heuristic optimization algorithm for optimal operation of a micro grid system. The DS algorithm simulates the Brownian-like random-walk movement used by an organism to migrate. The micro grid system consists of a wind turbine, a diesel generator, a fuel cell, and a photovoltaic system. The wind turbine generator is modeled by considering the characteristics of variable output. Optimization is aimed at minimizing the cost function of the system, including fuel costs and maximizing fuel efficiency to generate electric power. The simulation was applied to a micro grid system only. This study applies the DS algorithm with excellence and efficiency in terms of coding simplicity, fast convergence speed, and accuracy in the optimal operation of micro grids based on renewable energy resources, and we compared its optimum value to other algorithms to prove its superiority.

• Journal of Korea Multimedia Society
• /
• v.8 no.11
• /
• pp.1556-1564
• /
• 2005

Various optimization techniques are deployed in the compilation process of a source program for improving the program's execution speed and reducing the size of the source code. Of the optimization pattern matching techniques, the string pattern matching technique involves finding an optimal pattern that corresponds to the intermediate code. However, it is deemed inefficient due to excessive time required for optimized pattern search. The tree matching pattern technique can result in many redundant comparisons for pattern determination, and there is also the disadvantage of high cost involved in constructing a code tree. The objective of this paper is to propose a table-driven code optimizer using the DFA(Deterministic Finite Automata) optimization table to overcome the shortcomings of existing optimization techniques. Unlike other techniques, this is an efficient method of implementing an optimizer that is constructed with the deterministic automata, which determines the final pattern, refuting the pattern selection cost and expediting the pattern search process.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.38 no.2
• /
• pp.103-113
• /
• 2001

This paper described a design and implementation of a single-chip encoder/decoder using the LZSS algorithm and entropy coding in 0.6${\mu}{\textrm}{m}$ CMOS technology. Dictionary storage for the dictionary search processor(DISP) used a 2K$\times$8bit on-chip memory with 50MHz clock speed. It performs compression on byte-oriented input data at a data rate of one byte per clock cycle except when one out of every 33 cycles is used to update the string window of dictionary. In result, the average compression ratio is 46% by applied entropy coding of the LZSS codeword output. This is to improved on the compression performance of 7% much more then LZSS.

• Journal of the Korea Society of Computer and Information
• /
• v.3 no.2
• /
• pp.119-124
• /
• 1998

Block Matching Motion Estimation(BMME) Algorithm is demands a very large amount of computing power and have been proposed many fast algorithms. These algorithms are many problem that larger size of VLSI scale due to non-localized search block data and problem of non-reuse of input data for each processing step. In this paper, we designed systolic arry of high processing capacity, constraints input output pin size and reuse of input data for small VLSI size. The proposed systolic array is optimized memory access time because of iterative reuse of input data on search block and become independent of problem size due to increase of algorithm's parallelism and total processing elements connection is localized spatial and temporal. The designed systolic array is reduced O(N6) time complexity to O(N3) on moving vector and has O(N) input/output pin size.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.5 s.37
• /
• pp.33-40
• /
• 2005

Recently So far Many low-cost mobile machinery have been produced. Those are being used for study and business. But those are some weak Points which are small-capacity storage and quite low-speed system. If we use general database programs or key-searching algorithm, It could decrease in performance of system. To solve those Problems, we applied CBDS(Compact Binary Digital Search) trie to mobile environment. As a result we could accomplish our goal which are quick searching and low-capacity indexing. We compared with some Java classes such as TreeSet to evaluation. As a result, the velocity of searching was a little slow than B-tree based TreeSet. But the storage space have been decreased by 29 percent. So I think that it would be practical use.