• Journal of Korea Multimedia Society
• /
• v.20 no.6
• /
• pp.893-910
• /
• 2017

In this paper, we propose a simple online multiple object (human) tracking method, LKDeep (Lucas-Kanade feature and Detection based Simple Online Multiple Object Tracker), which can run in fast online enough on CPU core only with acceptable tracking performance for embedded surveillance purpose. The proposed LKDeep is a pragmatic hybrid approach which tracks multiple objects (humans) mainly based on LK features but is compensated by detection on periodic times or on necessity times. Compared to other state-of-the-art multiple object tracking methods based on 'Tracking-By-Detection (TBD)' approach, the proposed LKDeep is faster since it does not have to detect object on every frame and it utilizes simple association rule, but it shows a good object tracking performance. Through experiments in comparison with other multiple object tracking (MOT) methods using the public DPM detector among online state-of-the-art MOT methods reported in MOT challenge [1], it is shown that the proposed simple online MOT method, LKDeep runs faster but with good tracking performance for surveillance purpose. It is further observed through single object tracking (SOT) visual tracker benchmark experiment [2] that LKDeep with an optimized deep learning detector can run in online fast with comparable tracking performance to other state-of-the-art SOT methods.

• Communications for Statistical Applications and Methods
• /
• v.14 no.3
• /
• pp.483-495
• /
• 2007

In a general fractional factorial design, the n-levels of a factor are coded by the $n^{th}$ roots of the unity. Pistone and Rogantin (2007) gave a full generalization to mixed-level designs of the theory of the polynomial indicator function using this device. This article discusses the optimal blocking scheme for nonregular designs. According to hierarchical principle, the minimum aberration (MA) has been used as an important criterion for selecting blocked regular fractional factorial designs. MA criterion is mainly based on the defining contrast groups, which only exist for regular designs but not for nonregular designs. Recently, Cheng et al. (2004) adapted the generalized (G)-MA criterion discussed by Tang and Deng (1999) in studying $2^p$ optimal blocking scheme for nonregular factorial designs. The approach is based on the method of replacement by assigning $2^p$ blocks the distinct level combinations in the column with different blocks. However, when blocking level is not a power of two, we have no clue yet in any sense. As an example, suppose we experiment during 3 days for 12-run Plackett-Burman design. How can we arrange the 12-runs into the three blocks? To solve the problem, we apply G-MA criterion to nonregular mixed-level blocked scheme via the mixed-level indicator function and give an answer for the question.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1993.06a
• /
• pp.975-976
• /
• 1993

This talk presents the overview of the author's research and development activities on fuzzy inference hardware. We involved it with two distinct approaches. The first approach is to use application specific integrated circuits (ASIC) technology. The fuzzy inference method is directly implemented in silicon. The second approach, which is in its preliminary stage, is to use more conventional microprocessor architecture. Here, we use a quantitative technique used by designer of reduced instruction set computer (RISC) to modify an architecture of a microprocessor. In the ASIC approach, we implemented the most widely used fuzzy inference mechanism directly on silicon. The mechanism is beaded on a max-min compositional rule of inference, and Mandami's method of fuzzy implication. The two VLSI fuzzy inference chips are designed, fabricated, and fully tested. Both used a full-custom CMOS technology. The second and more claborate chip was designed at the University of North Carolina(U C) in cooperation with MCNC. Both VLSI chips had muliple datapaths for rule digital fuzzy inference chips had multiple datapaths for rule evaluation, and they executed multiple fuzzy if-then rules in parallel. The AT & T chip is the first digital fuzzy inference chip in the world. It ran with a 20 MHz clock cycle and achieved an approximately 80.000 Fuzzy Logical inferences Per Second (FLIPS). It stored and executed 16 fuzzy if-then rules. Since it was designed as a proof of concept prototype chip, it had minimal amount of peripheral logic for system integration. UNC/MCNC chip consists of 688,131 transistors of which 476,160 are used for RAM memory. It ran with a 10 MHz clock cycle. The chip has a 3-staged pipeline and initiates a computation of new inference every 64 cycle. This chip achieved an approximately 160,000 FLIPS. The new architecture have the following important improvements from the AT & T chip: Programmable rule set memory (RAM). On-chip fuzzification operation by a table lookup method. On-chip defuzzification operation by a centroid method. Reconfigurable architecture for processing two rule formats. RAM/datapath redundancy for higher yield It can store and execute 51 if-then rule of the following format: IF A and B and C and D Then Do E, and Then Do F. With this format, the chip takes four inputs and produces two outputs. By software reconfiguration, it can store and execute 102 if-then rules of the following simpler format using the same datapath: IF A and B Then Do E. With this format the chip takes two inputs and produces one outputs. We have built two VME-bus board systems based on this chip for Oak Ridge National Laboratory (ORNL). The board is now installed in a robot at ORNL. Researchers uses this board for experiment in autonomous robot navigation. The Fuzzy Logic system board places the Fuzzy chip into a VMEbus environment. High level C language functions hide the operational details of the board from the applications programme . The programmer treats rule memories and fuzzification function memories as local structures passed as parameters to the C functions. ASIC fuzzy inference hardware is extremely fast, but they are limited in generality. Many aspects of the design are limited or fixed. We have proposed to designing a are limited or fixed. We have proposed to designing a fuzzy information processor as an application specific processor using a quantitative approach. The quantitative approach was developed by RISC designers. In effect, we are interested in evaluating the effectiveness of a specialized RISC processor for fuzzy information processing. As the first step, we measured the possible speed-up of a fuzzy inference program based on if-then rules by an introduction of specialized instructions, i.e., min and max instructions. The minimum and maximum operations are heavily used in fuzzy logic applications as fuzzy intersection and union. We performed measurements using a MIPS R3000 as a base micropro essor. The initial result is encouraging. We can achieve as high as a 2.5 increase in inference speed if the R3000 had min and max instructions. Also, they are useful for speeding up other fuzzy operations such as bounded product and bounded sum. The embedded processor's main task is to control some device or process. It usually runs a single or a embedded processer to create an embedded processor for fuzzy control is very effective. Table I shows the measured speed of the inference by a MIPS R3000 microprocessor, a fictitious MIPS R3000 microprocessor with min and max instructions, and a UNC/MCNC ASIC fuzzy inference chip. The software that used on microprocessors is a simulator of the ASIC chip. The first row is the computation time in seconds of 6000 inferences using 51 rules where each fuzzy set is represented by an array of 64 elements. The second row is the time required to perform a single inference. The last row is the fuzzy logical inferences per second (FLIPS) measured for ach device. There is a large gap in run time between the ASIC and software approaches even if we resort to a specialized fuzzy microprocessor. As for design time and cost, these two approaches represent two extremes. An ASIC approach is extremely expensive. It is, therefore, an important research topic to design a specialized computing architecture for fuzzy applications that falls between these two extremes both in run time and design time/cost. TABLEI INFERENCE TIME BY 51 RULES {{{{Time }}{{MIPS R3000 }}{{ASIC }}{{Regular }}{{With min/mix }}{{6000 inference 1 inference FLIPS }}{{125s 20.8ms 48 }}{{49s 8.2ms 122 }}{{0.0038s 6.4㎲ 156,250 }} }}

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.3
• /
• pp.211-218
• /
• 2015

This paper introduces a 'divide-and-conquer' algorithm to the travelling salesman problem (TSP). Top 10n are selected beforehand from a pool of n(n-1) data which are sorted in the ascending order of each vertex's distance. The proposed algorithm then firstly selects partial paths that are interconnected with the shortest distance $r_1=d\{v_i,v_j\}$ of each vertex $v_i$ and assigns them as individual regions. For $r_2$, it connects all inter-vertex edges within the region and inter-region edges are connected in accordance with the connection rule. Finally for $r_3$, it connects only inter-region edges until one whole Hamiltonian cycle is constructed. When tested on TSP-1(n=26) and TSP-2(n=42) of real cities and on a randomly constructed TSP-3(n=50) of the Euclidean plane, the algorithm has obtained optimal solutions for the first two and an improved one from that of Valenzuela and Jones for the third. In contrast to the brute-force search algorithm which runs in n!, the proposed algorithm runs at most 10n times, with the time complexity of $O(n^2)$.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.10
• /
• pp.185-191
• /
• 2020

This article proposes the unified an arm's length price of transfer pricing for thin capitalization since the scope of permanent establishment has been enlarged under Digital Economy and the implementation of Blackchain system to resolve the drawback of finding an arm's length price. The rule of current thin capitalization runs against the non-discrimination of taxation of the tax treaties and the national treatment which deals fairly with goods, sercice and capital money within the country under the treaty of commerce and navigator. In addition, the information of comparable uncontrolled debt are not available of current system to prove the debt which is not subject to the rule of thin capitalization. The united an arm's length price of transfer pricing for thin capitalization can apply to foreign investment as well as domestic corporations, thereby resolving the problem of the non-discrimination of taxation of the tax treaties and the treaty of commerce and navigation. The availability of transaction level data through Blockchain platform to decide whether the debt can be subject to thin capitalization can resolve the issue of comparable uncontrolled debt transaction which can't be found in current business transactions. This article should shed light on the proposing of the unified an arm's length price of transfer pricing for thin capitalization and Blockchain system to prevent the income shifting. This propose provide implication for policymakers on current system of thin capitalization and arm's length principles.

• The Korean Journal of Nuclear Medicine
• /
• v.39 no.6
• /
• pp.489-490
• /
• 2005

Purpose: The thyroglossal duct runs from the base of the tongue to the thyroid. Rarely the thyroid completely fails to migrate and results in ectopic thyroid tissue, which can be demonstrated scintigraphically. A 31-year old female patient was referred for thyroid scintigraphy due to protruding mass at the base of the tongue. She was mildly hypothyroid. Te-99m pertechnetate thyroid scan was performed to rule out ectopic thyroid gland. There showed a focal area of intense tracer uptake in sublingual area, suggesting the sublingual thyroid. In addition there noted diffusely increased tracer uptake in both breasts. The patient delivered a baby 6 months prior to the scan and was on breast-feeding. Free Tc-99m pertechnetate physiologically secrets into the salivary glands, the stomach, the gastrointestinal tract, the genitourinary tract and the mammary glands and sodium-iodide symporter plays a role in the accumulation of free Tc-99m pertechnetate. We report simultaneous visualization of lactating breasts and ectopic thyroid gland in the base of the tongue.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.5
• /
• pp.137-144
• /
• 1989

A new algorithm is presented which efficiently reports minimum width/space violation in a geometric mask pattern. The proposed algorithm solves a sequence of range search problems by employing a plane sweep method. The algorithm runs in O(n log n) time, where n is the number of edges in a mask pattern. Since a lower bound in time conplexity for reporting all minimum width/space violations is ${\Omega}$ (n log n), this algorithm is theoretically optimal within a constant multiplicaive factor. It requires O($n^{0.5}$) space which is very efficient in practice. Moreover, this algorithm, we believe, is easy to implement and practically fast (116.7 seconds for a rectilinear region with 250000 vertices ar VAX 8650.)

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2002.11a
• /
• pp.101-105
• /
• 2002

FRP(Fiber glass reinforced plastics) is compound with materials, which are created to combine each other materials, of which nature of mechanical and chemical are different. Even though the weight and the thickness are identic, its physical figure of characteristic changes with consisting of lay-up and work situation. It is also a method of creating after manufacturing of mould. It has feature that manufacturing of FRP runs parallel design of material with design of structure simultaneously. The rule of FRP structure is distinguished from the length of a ship and it is hard to catch the feature of structure mechanics due to identical formula and figure used for it regardless of the shape of a ship or the speed. This studying, basing on a small FRP ship, will show te fundamental data needed to design of structure analysing the feature of intensity with direction, the method of Lay-up, and the characteristic of materials of FRP.

• Journal of the Korea Society for Simulation
• /
• v.20 no.3
• /
• pp.79-88
• /
• 2011

In most existing warships combat simulation system, the tactics of a warship is manipulated by human operators. For this reason, the simulation results are restricted due to the stereotype of human operators. To deal with this, we have employed the genetic algorithm for supporting the evolutionary simulation environment. In which, the tactical decision by human operators is replaced by the human model with a rule-based chromosome for representing tactics so that the population of simulations are created and hundreds of simulation runs are continued on the basis of the genetic algorithm without any human intervention until to find emergent tactics which shows the best performance throughout the simulation. This paper proposes an evolutionary tactics generation methodology for the emergent tactics in many-to-many warship combat simulation. To do this, 3:3 warship combat simulation tests are performed.

• The Journal of the Korea Contents Association
• /
• v.19 no.7
• /
• pp.36-46
• /
• 2019

If stock market is efficient, any well-devised trading rule can't consistently outperform the average stock market returns. This study aims to verify whether the strategy based on bid-ask volume information can beat the stock market. I suggested a day trading strategy using order imbalance indicator and empirically analyzed its profitability with the KOSPI 200 index futures data from 2001 to 2018. Entry rules are as follows: If BSI is over 50%, enter buy order, otherwise enter sell order, assuming that stock price rises after BSI is over 50% and stock price falls after BSI is less than 50%. The empirical results showed that the suggested trading strategy generated very high trading profit, that is, its annual return runs to minimum 71% per annum even after the transaction costs. The profit was generated consistently during 18 years. This study also improved the suggested trading strategy applying the genetic algorithm, which may help the market practitioners who trade the KOSPI 200 index futures.