• Journal of Advanced Navigation Technology
• /
• v.18 no.5
• /
• pp.468-475
• /
• 2014

The recommend system is getting more difficult real time recommend by lager preference data set, computing power and recommend algorithm. For this reason, recommend system is proceeding actively one's studies toward distribute processing method of large preference data set. This paper studied distribute processing method of large preference data set using hadoop distribute processing platform and mahout machine learning library. The recommend algorithm is used Co-occurrence Matrix similar to item Collaborative Filtering. The Co-occurrence Matrix can do distribute processing by many node of hadoop cluster, and it needs many computation scale but can reduce computation scale by distribute processing. This paper has simplified distribute processing of co-occurrence matrix by changes over from four stage to three stage. As a result, this paper can reduce mapreduce job and can generate recommend file. And it has a fast processing speed, and reduce map output data.

• KIISE Transactions on Computing Practices
• /
• v.23 no.7
• /
• pp.408-416
• /
• 2017

This paper proposes a real-time side-rear vehicle detection algorithm that detects vehicles quickly and accurately in blind spot areas when driving. The proposed algorithm uses a cascade classifier created by AdaBoost Learning using the MCT (modified census transformation) feature vector. Using this classifier, the smaller the detection window, the faster the processing speed of the MCT classifier, and the larger the detection window, the greater the accuracy of the MCT classifier. By considering these characteristics, the proposed algorithm uses two classifiers with different detection window sizes. The first classifier quickly generates candidates with a small detection window. The second classifier accurately verifies the generated candidates with a large detection window. Furthermore, the vehicle classifier and the wheel classifier are simultaneously used to effectively detect a vehicle entering the blind spot area, along with an adjacent vehicle in the blind spot area.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.9
• /
• pp.1955-1964
• /
• 2011

With fast deployment of high-speed networks and various online services, the demand for massive content distribution is also growing fast. An approach that is increasingly visible in communication research community and in industry domain is peer-to-peer (P2P) networks. The P2P swarming technique enables a content distribution system to achieve higher throughput, avoid server or network overload, and be more resilient to failure and traffic fluctuation. Moreover, as a P2P-based architecture pushed the computing and bandwidth cost toward the network edge, it allows scalability to support a large number of subscribers on a global scale, while imposing little demand for equipment on the content providers. However, the P2P swarming burdens message exchange overheads on the system. In this paper, we propose a new protocol which provides confidentiality, authentication, integrity, and access control to P2P swarming. We implemented a prototype of our protocol on Android smart phone platform. We believe our approach can be straightforwardly adapted to existing commercial P2P content distribution systems with modest modifications to current implementations.

• Journal of Navigation and Port Research
• /
• v.40 no.6
• /
• pp.369-374
• /
• 2016

Recently, due to the rapid development of smart computing technology, there have been a lot of studies on 3D navigation, and consequently the advanced commercial 3D navigation system and 3D VTS system are on the market. Even the 3D technology is well known and wide spreaded, unfortunately, the secret of code behind is still unleashed. The purpose of this paper is to show the basic methodologies to display ENC features under 3D display environment to meet the requirement of S-52 standards. The OpenGL ES is used to develop 3D ENC Viewer for further use on mobile platforms and web based vessel monitoring system. P articularly, area object triangulation, complex line drawing, polygon pattern filling and symbol drawing by texture mapping are explained in detail. The result of performance test is shown as table for correlation of SENC file size to display speed.

• The KIPS Transactions:PartC
• /
• v.15C no.6
• /
• pp.547-556
• /
• 2008

Recently, with the advance of computing and networking technique, the high speed internet becomes widespread, however, it is still hard job to do streaming the media which requires high network bandwidth over the internet. Previous researches for streaming over the internet mainly proposed techniques that controls the QoS(Quality of Service) of the media in proportion to the network status. Though, this could be the solution for the service provider while the service user who wants constant QoS may not satisfy with variable QoS. In the paper, we propose a network adaptive prefetching technique, NAP, for guarantee of constant QoS. The NAP prefetches frames by increasing the frame transmission rate while the available network bandwidth is high. The NAP uses the prefetched frames to guarantee the QoS while the available network bandwidth is low. The experiment result shows that the proposed NAP could guarantee the constant QoS by prefetching the frames adaptively to the network bandwidth with the characteristic of video stream.

• Journal of KIISE:Computing Practices and Letters
• /
• v.10 no.1
• /
• pp.57-65
• /
• 2004

In the block matching algorithm, search patterns of different shapes or sizes and the distribution of motion vectors have a large impact on both the searching speed and the image quality. In this paper, we propose a new fast block matching algorithm using the unit-diamond search pattern and the flat-hexagon search pattern. Our algorithm first finds the motion vectors that are close to the center of search window using the unit-diamond search pattern, and then fastly finds the other motion vectors that are not close to the center of search window using the flat-hexagon search pattern. Through experiments, compared with the hexagon-based search algorithm(HEXBS), the proposed unit-diamond and flat-hexagonal pattern search algorithm(UDFHS) improves as high as 11∼51% in terms of average number of search point per motion vector estimation and improves about 0.05∼0.74㏈ in terms of PSNR(Peak Signal to Noise Ratio).

• Journal of KIISE:Computing Practices and Letters
• /
• v.6 no.3
• /
• pp.275-287
• /
• 2000

A virtual reality system must provide participants with a natural interaction, a sufficient immersion, and mostly, realistic images. To achieve this, it is crucial to provide a fast and uniform rendering speed regardless of the complexity of virtual worlds, or the complexity of simulation. In this paper, a virtual reality system which offers an improved rendering performance for complex virtual reality applications has been designed and implemented. The key idea of the proposed system is to exploit the multi-thread scheme in system module design, and execute each modules in parallel. Taking such design approach, rendering, simulation, and interaction can be executed independently. Hence, in applications where a simulation is complex or a scene is very large, this system can provide a more uniform and faster frame rates. The proposed method has been experimented under the various application environments in which scenes and simulations are very complex.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.4
• /
• pp.1457-1470
• /
• 2015

In wireless multimedia sensor networks (WMSN), the latency of transmission is an increasingly problem. With the improvement of resolution, the time cost in image and video compression is more and more, which seriously affects the real-time of WMSN. In JPEG system, the core of the system is DCT, but DCT-JPEG is not the best choice. Block-based DCT transform coding has serious blocking artifacts when the image is highly compressed at low bit rates. APBT is used in this paper to solve that problem, but APBT does not have a fast algorithm. In this paper, we analyze the structure in JPEG and propose a parallel framework to speed up the algorithm of JPEG on GPU. And we use all phase biorthogonal transform (APBT) to replace the discrete cosine transform (DCT) for the better performance of reconstructed image. Therefore, parallel APBT-JPEG is proposed to solve the real-time of WMSN and the blocking artifacts in DCT-JPEG in this paper. We use the CUDA toolkit based on GPU which is released by NVIDIA to design the parallel algorithm of APBT-JPEG. Experimental results show that the maximum speedup ratio of parallel algorithm of APBT-JPEG can reach more than 100 times with a very low version GPU, compared with conventional serial APBT-JPEG. And the reconstructed image using the proposed algorithm has better performance than the DCT-JPEG in terms of objective quality and subjective effect. The proposed parallel algorithm based on GPU of APBT also can be used in image compression, video compression, the edge detection and some other fields of image processing.

• The Journal of the Korea Contents Association
• /
• v.16 no.10
• /
• pp.299-310
• /
• 2016

In this paper, we perform analysis of the performance of low-power communication technology, IEEE 802.15.4 MAC (Media Access Control) protocol used in internet of things. Wide variety of devices in internet of things generate different kinds of traffic characteristics and heterogeneous traffic environment is therefore considered in contrast to existing works. With the help of the Markov chain the performance of the protocol is derived as a function of the MAC parameters and based on the results a framework to determine energy-efficient optimal MAC parameters for applications in real time is proposed. Proposed method is shown to be more efficient in terms of energy consumption through performance comparison over application scenarios compared to operation with fixing MAC parameters, and its practicability on small devices with limited computing power is verified through evaluating the accuracy and speed of the proposed framework.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.12
• /
• pp.968-972
• /
• 2009

The multi-core processors are being widely exploited by many high-end systems. With significant advances in processor architecture, the network band-width required on the high-end systems is increasing drastically. It is therefore highly desirable to manage multiple cores efficiently to achieve high network band-width with minimum resource requirements. Modern operating systems, however, still have significant design and optimization space to leverage the network performance over multi-core systems. In this paper, we suggest a novel networking process scheduling scheme, which decides the best processor affinity of networking processes based on the processor cache layout, communication intensiveness, and processor loads. The experimental results show that the scheduling scheme implemented in the Linux kernel can improve the network bandwidth and the effectiveness of processor utilization by 20% and 59%, respectively.