• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.6
• /
• pp.145-155
• /
• 2013

In this paper, we proposed a $4{\times}4$ block parallel architecture of interpolation for high-performance H.264/AVC Fractional Motion Estimation in 8K UHD($7680{\times}4320$) video real time processing. To improve throughput, we design $4{\times}4$ block parallel interpolation. For supplying the $10{\times}10$ reference data for interpolation, we design 2D cache buffer which consists of the $10{\times}10$ memory arrays. We minimize redundant storage of the reference pixel by applying the Search Area Stripe Reuse scheme(SASR), and implement high-speed plane interpolator with 3-stage pipeline(Horizontal Vertical 1/2 interpolation, Diagonal 1/2 interpolation, 1/4 interpolation). The proposed architecture was simulated in 0.13um standard cell library. The gate count is 436.5Kgates. The proposed H.264/AVC Fractional Motion Estimation can support 8K UHD at 30 frames per second by running at 187MHz.

• Journal of Intelligence and Information Systems
• /
• v.19 no.1
• /
• pp.19-33
• /
• 2013

In this research, a proposed Dynamic Virtual Ontology using Tags (DyVOT) supports dynamic search of resources depending on user's requirements using tags from social web driven resources. It is general that the tags are defined by annotations of a series of described words by social users who usually tags social information resources such as web-page, images, u-tube, videos, etc. Therefore, tags are characterized and mirrored by information resources. Therefore, it is possible for tags as meta-data to match into some resources. Consequently, we can extract semantic relationships between tags owing to the dependency of relationships between tags as representatives of resources. However, to do this, there is limitation because there are allophonic synonym and homonym among tags that are usually marked by a series of words. Thus, research related to folksonomies using tags have been applied to classification of words by semantic-based allophonic synonym. In addition, some research are focusing on clustering and/or classification of resources by semantic-based relationships among tags. In spite of, there also is limitation of these research because these are focusing on semantic-based hyper/hypo relationships or clustering among tags without consideration of conceptual associative relationships between classified or clustered groups. It makes difficulty to effective searching resources depending on user requirements. In this research, the proposed DyVOT uses tags and constructs ontologyfor effective search. We assumed that tags are extracted from user requirements, which are used to construct multi sub-ontology as combinations of tags that are composed of a part of the tags or all. In addition, the proposed DyVOT constructs ontology which is based on hierarchical and associative relationships among tags for effective search of a solution. The ontology is composed of static- and dynamic-ontology. The static-ontology defines semantic-based hierarchical hyper/hypo relationships among tags as in (http://semanticcloud.sandra-siegel.de/) with a tree structure. From the static-ontology, the DyVOT extracts multi sub-ontology using multi sub-tag which are constructed by parts of tags. Finally, sub-ontology are constructed by hierarchy paths which contain the sub-tag. To create dynamic-ontology by the proposed DyVOT, it is necessary to define associative relationships among multi sub-ontology that are extracted from hierarchical relationships of static-ontology. The associative relationship is defined by shared resources between tags which are linked by multi sub-ontology. The association is measured by the degree of shared resources that are allocated into the tags of sub-ontology. If the value of association is larger than threshold value, then associative relationship among tags is newly created. The associative relationships are used to merge and construct new hierarchy the multi sub-ontology. To construct dynamic-ontology, it is essential to defined new class which is linked by two more sub-ontology, which is generated by merged tags which are highly associative by proving using shared resources. Thereby, the class is applied to generate new hierarchy with extracted multi sub-ontology to create a dynamic-ontology. The new class is settle down on the ontology. So, the newly created class needs to be belong to the dynamic-ontology. So, the class used to new hyper/hypo hierarchy relationship between the class and tags which are linked to multi sub-ontology. At last, DyVOT is developed by newly defined associative relationships which are extracted from hierarchical relationships among tags. Resources are matched into the DyVOT which narrows down search boundary and shrinks the search paths. Finally, we can create the DyVOT using the newly defined associative relationships. While static data catalog (Dean and Ghemawat, 2004; 2008) statically searches resources depending on user requirements, the proposed DyVOT dynamically searches resources using multi sub-ontology by parallel processing. In this light, the DyVOT supports improvement of correctness and agility of search and decreasing of search effort by reduction of search path.

• IEIE Transactions on Smart Processing and Computing
• /
• v.4 no.1
• /
• pp.10-15
• /
• 2015

This paper proposes the parallel implementation of a self-similarity based image SR (super-resolution) algorithm using OpenCL. The SR algorithm requires tremendous computations to search for a similar patch. This becomes a bottleneck for the real-time conversion from a FHD image to UHD. Therefore, it is imperative to accelerate the processing speed of SR algorithms. For parallelization, the SR process is divided into several kernels, and memory optimization is performed. In addition, two GPUs are used for further acceleration. The experimental results shows that a GPGPU implementation can speed up over 140 times compared to a single-core CPU. Furthermore, it was confirmed experimentally that utilizing two GPUs can speed up the execution time proportionally, up to 277 times.

• Journal of the Korean Society of Costume
• /
• v.60 no.7
• /
• pp.61-73
• /
• 2010

This study aims to develop an fashion color design system based on personal color and sensorial images. This web-based system has a parallel structure which a user can search her own personal color, sensorial, and fashion images. The fashion image was presented according to the type of personal color image and sensorial image: futuristic fashion image from alluring image on all of personal color images; elegant fashion images from calm with pure/splendid images or faint/calm with alluring images; modern fashion image from pure/calm with alluring images or faint with lively images; plain fashion image from plain images with all personal color images but pure image; romantic fashion image from calm image with all personal color images but calm image. Fashion color and color combination palettes based on personal color images were presented with the each of those fashion images.

• The Transactions of the Korean Institute of Electrical Engineers P
• /
• v.58 no.4
• /
• pp.455-460
• /
• 2009

A number of factors combine to make ultraviolet radiation a superior means of water purification for ground water, rainwater harvesting systems and so on. Ultraviolet radiation is capable of destroying all types of bacteria. Additionally, ultraviolet radiation disinfects rapidly without the use of heat or chemical additives which may undesirably alter the composition of water. In a typical operation, water enters the inlet of a UV lamp and flows through the annular space between the quartz sleeve and the outside chamber wall. The irradiated water leaves through the outlet nozzle. Several design features are combined to determine the dosage delivered. The first is Wavelength output of the lamp, the Second is Length of the lamp - when the lamp is mounted parallel to the direction of water flow, the exposure time is proportional to the length of the lamp, the third is Design water flow rate - exposure time is inversely related to the linear flow rate, the forth is Diameter of the purification chamber - since the water itself absorbs UV energy, the delivered dosage diminishes logarithmically with the distance from the lamp. In this paper, It describe the how to design optimal UV disinfection device for ground water and rainwater. To search the optimal design method, it was performed computer simulation with 3D-CFD discrete ordinates model and manufactured prototype. Using proposed design method manufactured prototype applied to disinfection test and proved satisfied performance.

• The Korean Journal of Health Service Management
• /
• v.5 no.4
• /
• pp.161-175
• /
• 2011

The purpose of this study was to expand the home-based rehabilitation services in the long term care insurance. This study was reviewed on the home-based physical therapy in the OECD. The way of this study was literature search and review. This was to reviewed Proquest, Sciencedirect, SpingerLink, Pubmed. Kew word is "home-based therapy". This was collected 71 articles and final analyzed article was 49. The results were as follows; The article number is seven in Canada, fifteen in USA, five in UK, six in Australia, three in Sweden, five in New Zealand, two in Netherlands, one in Turkey, South Korea, Japan, France, Spain, Italy respectively. Randomized controlled trial is fifty, case-control study is eleven, interview is three, literature review is two, and case report, cost-analysis, cost-effectiveness, pilot study, single blinded parallel design, demonstrative study, survey is one respectively. Physical therapist played an important role in home-based rehabilitation among OECD than nurse. Therefore, we must introduce home-based physical therapy in long term care insurance in South Korea.

• Proceedings of the KIEE Conference
• /
• 2006.11a
• /
• pp.198-200
• /
• 2006

This paper presents a development of an educational simulator of particle swarm optimization (PSO) and application for solving the test functions and economic dispatch (ED) problems with nonsmooth cost functions. A particle swarm optimization is one of the most powerful methods for solving global optimization problems. It is a population-based search algorithm and searches in parallel using a group of particles similar to other AI-based heuristic optimization techniques. In developed simulator, lecturers and students can select the functions for simulation and set the parameters that have an influence on PSO performance. To improve searching capability for ED problems, a crossover operation is proposed to the position update of each individual (CR-PSO). To verify the feasibility of CR-PSO method, numerical studies have been performed for two different sample systems. The proposed CR-PSO method outperforms other algorithms in solving ED problems.

• Journal of Information Processing Systems
• /
• v.5 no.2
• /
• pp.105-116
• /
• 2009

To solve the general problems surrounding the application of genetic algorithms in stereo matching, two measures are proposed. Firstly, the strategy of simplified population-based incremental learning (PBIL) is adopted to reduce the problems with memory consumption and search inefficiency, and a scheme for controlling the distance of neighbors for disparity smoothness is inserted to obtain a wide-area consistency of disparities. In addition, an alternative version of the proposed algorithm, without the use of a probability vector, is also presented for simpler set-ups. Secondly, programmable graphics-hardware (GPU) consists of multiple multi-processors and has a powerful parallelism which can perform operations in parallel at low cost. Therefore, in order to decrease the running time further, a model of the proposed algorithm, which can be run on programmable graphics-hardware (GPU), is presented for the first time. The algorithms are implemented on the CPU as well as on the GPU and are evaluated by experiments. The experimental results show that the proposed algorithm offers better performance than traditional BMA methods with a deliberate relaxation and its modified version in terms of both running speed and stability. The comparison of computation times for the algorithm both on the GPU and the CPU shows that the former has more speed-up than the latter, the bigger the image size is.

• International Journal of Internet, Broadcasting and Communication
• /
• v.9 no.4
• /
• pp.1-7
• /
• 2017

Clipart is artificial visual contents that are created using various tools such as Illustrator to highlight some information. Here, the style of the clipart plays a critical role in determining how it looks. However, previous studies on clipart are focused only on the object recognition [16], segmentation, and retrieval of clipart images using hand-craft image features. Recently, some clipart classification researches based on the style similarity using CNN have been proposed, however, they have used different CNN-models and experimented with different benchmark dataset so that it is very hard to compare their performances. This paper presents an experimental analysis of the clipart classification based on the style similarity with two well-known CNN-models (Inception Resnet V2 [13] and VGG-16 [14] and transfers learning with the same benchmark dataset (Microsoft Style Dataset 3.6K). From this experiment, we find out that the accuracy of Inception Resnet V2 is better than VGG for clipart style classification because of its deep nature and convolution map with various sizes in parallel. We also find out that the end-to-end training can improve the accuracy more than 20% in both CNN models.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.7A
• /
• pp.632-638
• /
• 2010

In this paper, we propose a fixed-complexity sphere encoder (FSE) for multi-user MIMO (MU-MIMO) systems. The Proposed FSE accomplishes a scalable tradeoff between performance and complexity. Also, because it has a parallel tree-search structure, the proposed encoder can be easily pipelined, leading to a tremendous reduction in the precoding latency. The complexity of the proposed encoder is also analyzed, and we propose two techniques that reduce it. Simulation and analytical results demonstrate that in a $4\times4$ MU-MIMO system, the complexity of the proposed FSE is 16% that of the conventional QRD-M encoder (QRDM-E). Also, the encoding throughput of the proposed endoder is 7.5 times that of the QRDM-E with tolerable degradation in the BER performance, while achieving the optimum diversity order.