• Journal of Information Processing Systems
• /
• v.12 no.1
• /
• pp.149-168
• /
• 2016

The Active Appearance Model (AAM) is a class of deformable models, which, in the segmentation process, integrates the priori knowledge on the shape and the texture and deformation of the structures studied. This model in its sequential form is computationally intensive and operates on large data sets. This paper presents another framework to implement the standard version of the AAM model. We suggest a distributed and parallel approach justified by the characteristics of the model and their potentialities. We introduce a schema for the representation of the overall model and we study of operations that can be parallelized. This approach is intended to exploit the benefits build in the area of advanced image processing.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.2
• /
• pp.1292-1303
• /
• 2015

Jeju province is the highest area about obesity(1st), alcohol consumption(2nd) and male smoking(2nd) among sixteen Korean provinces by the report of Statistics Korea: 2013 community health survey. Therefore, it is assumed that the incidence rate of colon, liver, lung and breast cancer can be high. The purpose of this study is to test these cancer's incidence and mortality trends and compare comparability with national average. The Joinpoint regression model and permutation tests for identifying changes and parallelism in trend were used to test registered data at Jeju Regional Cancer Registry from 1999 to 2012. In male colorectal cancer, Average Age Percent Change(AAPC) of Age-Standardized incidence Rate(ASR) was 8.4% per year(p-value<.000) and the hypothesis of parallelism with Korean male average was rejected because of steep increasing of Jeju male patients' AAPC(p-value=.047). In male liver cancer, AAPC of ASR was -2.98 % per year(p-value<.000) and parallelism with Korean male average was rejected because of sluggish decreasing of Jeju(p-value=.026). In male lung cancer, the ASR parallelism with Korean male average was rejected(p-value=.009) because Jeju patients APC(4.37% per year) was increased during 2006~2012. This study demonstrates that AAPC and Trends of male colon, male lung and male liver were difference from national average. Further studies are needed to understand its causes.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10a
• /
• pp.765-767
• /
• 1998

Many application in human computer interaction(HCI) require tacking a human face and facial features. In this paper we propose efficient parallel processing system for face tracking under heterogeneous networked. To track a face in the video image we use the skin color information and connected components. In terms of parallelism we choose the master-slave model which has thread for each processes, master and slaves, The threads are responsible for real computation in each process. By placing queues between the threads we give flexibility of data flowing

• Proceedings of the IEEK Conference
• /
• 2000.06d
• /
• pp.151-154
• /
• 2000

Standard of implementing a robot is Man, so in many field, Many studies are processing to archive a robot, very similar to human being. This paper, based on the theory of man, implemented on the model of parallelism sense and visual information, which is needed when it's moving. Introduced robot uses CCD and designed Image Processing Board for the purpose of archiving vision data. To keep parallel condition, This use ultrasonic sensors for auto-mobile.

• ETRI Journal
• /
• v.39 no.3
• /
• pp.301-309
• /
• 2017

In this paper, we propose a parallelization method for a High Efficiency Video Coding (HEVC) deblocking filter with transform unit (TU) split information. HEVC employs a deblocking filter to boost perceptual quality and coding efficiency. The deblocking filter was designed for data-level parallelism. In this paper, we demonstrate a method of distributing equal workloads to all cores or threads by anticipating the deblocking filter complexity based on the coding unit depth and TU split information. We determined that the average time saving of our proposed deblocking filter parallelization method has a speed-up factor that is 2% better than that of the uniformly distributed parallel deblocking filter, and 6% better than that of coding tree unit row distribution parallelism. In addition, we determined that the speed-up factor of our proposed deblocking filter parallelization method, in terms of percentage run-time, is up to 3.1 compared to the run-time of the HEVC test model 12.0 deblocking filter with a sequential implementation.

• Korean Journal of Child Studies
• /
• v.9 no.2
• /
• pp.133-156
• /
• 1988

This study investigated developmental change with reference to continuity theory in the acquisition of concepts of kin relation, task difficulty with reference to cognitive complexity, and interrelationships in the performance of cognitive tasks of kinship concepts with reference to cognitive parallelism. The subjects consisted of 6-, 8-, 10, and 12-year-old randomly selected children attending kindergartens or elementary schools in Seoul. The schools were located in various residental areas regarded as either middle or lower class. The 81 boys and 80 girls participated in 3 experiments on classification, seriation, and grouping. The instrument for the classification, seriation, and grouping tasks was composed of 10 10cm black on white line drawings of the head and upper torso area of persons in kin relationship. The data was analyzed with MANOVA. A significant age effect was found in the 3 quasi- experiments. There were significant effects on task difficulty. The biosocial power distribution indirectly influenced children's acquisition of kin relational concepts; that is, children performed better in male-kin than in female-kin tasks. There was a high correlation in performance between the 3 cognitive tasks. These findings support the continuity theory (except for seriation), a model which arranges kin-names in order of cognitive load, the centric status of men in society, and the theory of cognitive developmental parallelism.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.46 no.8
• /
• pp.102-116
• /
• 2009

There have been lots of researches for H.264/AVC performance enhancement on a multi-core processor. The enhancement has been performed through parallelization methods. Parallelization methods can be classified into a task-level parallelization method and a data level parallelization method. A task-level parallelization method for H.264/AVC decoder is implemented by dividing H.264/AVC decoder algorithms into pipeline stages. However, it is not suitable for complex and large bitstreams due to poor load-balancing. Considering load-balancing and performance scalability, we propose a horizontal data level parallelization method for H.264/AVC decoder in such a way that threads are assigned to macroblock lines. We develop a mathematical performance expectation model for the proposed parallelization methods. For evaluation of the mathematical performance expectation, we measured the performance with JM 13.2 reference software on ARM11 MPCore Evaluation Board. The cycle-accurate measurement with SoCDesigner Co-verification Environment showed that expected performance and performance scalability of the proposed parallelization method was accurate in relatively high level

• ETRI Journal
• /
• v.44 no.2
• /
• pp.313-326
• /
• 2022

This study presents a noble scheme for distributed and parallel simulations with optimized agent placement for simulation instances. The traditional parallel simulation has some limitations in that it does not provide sufficient performance even though using multiple resources. The main reason for this discrepancy is that supporting parallelism inevitably requires additional costs in addition to the base simulation cost. We present a comprehensive study of parallel simulation architectures, execution flows, and characteristics. Then, we identify critical challenges for optimizing large simulations for parallel instances. Based on our cost-benefit analysis, we propose a novel approach to overcome the performance constraints of agent-based parallel simulations. We also propose a solution for eliminating the synchronizing cost among local instances. Our method ensures balanced performance through optimal deployment of agents to local instances and an adaptive agent placement scheme according to the simulation load. Additionally, our empirical evaluation reveals that the proposed model achieves better performance than conventional methods under several conditions.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.3
• /
• pp.11-23
• /
• 1995

In this paper, a parallel pipelined processor model which acts as a small VLIW processor architecture and a scheduling algorithm for extracting instruction-level parallelism on this architecture are proposed. The proposed model has a dual-instruction mode which has maximum 4 basic operations being executed in parallel. By combining these basic operations, variable instruction set can be designed for various applications. The scheduling algorithm schedules basic operations for parallel execution and removes pipeline hazards by examining data dependency and resource conflict relations. In order to examine operation and evaluate the performance,a C compiler and a simulator are developed. By simulating various test programs with the compiler and the simulator, the characteristics and the performance result of the proposed architecture are measured.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2000.10a
• /
• pp.124-132
• /
• 2000

Distributed processing approach for structural optimization is presented in this study. It is implemented on network of personal computers. The validity and efficiency of this approach are demonstrated and verified by test model of truss. Repeated structural analysis algorithm, which spend a lot of overall structural optimization processes, are based on substructuring scheme with domain-wise parallelism and converted to be adapted to hardware and software environments. The design information data are modularized and assigned to each computer in order to minize the communication cost. The communications between nodes are limited to static condensation and constraint-related data collection.