• 한국멀티미디어학회논문지
• /
• 제24권1호
• /
• pp.51-57
• /
• 2021

In this paper, we propose a task distribution scheme in fog computing environment considering opportunistic fog computing nodes. As latency is one of the important performance metric for IoT(Internet of Things) applications, there have been lots of researches on the fog computing system. However, since the load can be concentrated to the specific fog computing nodes due to the spatial and temporal IoT characteristics, the load distribution should be considered to prevent the performance degradation. Therefore, this paper proposes a task distribution scheme which considers the static as well as opportunistic fog computing nodes according to their mobility feature. Especially, based on the task requirements, the proposed scheme supports the delay sensitive task processing at the static fog node and delay in-sensitive tasks by means of the opportunistic fog nodes for the task distribution. Based on the performance evaluation, the proposed scheme shows low service response time compared to the conventional schemes.

• ETRI Journal
• /
• 제42권3호
• /
• pp.411-419
• /
• 2020

In real-world intelligent transportation systems, accuracy in vehicle license plate detection and recognition is considered quite critical. Many algorithms have been proposed for still images, but their accuracy on actual videos is not satisfactory. This stems from several problematic conditions in videos, such as vehicle motion blur, variety in viewpoints, outliers, and the lack of publicly available video datasets. In this study, we focus on these challenges and propose a license plate detection and recognition scheme for videos based on a temporal matching prior network. Specifically, to improve the robustness of detection and recognition accuracy in the presence of motion blur and outliers, forward and bidirectional matching priors between consecutive frames are properly combined with layer structures specifically designed for plate detection. We also built our own video dataset for the deep training of the proposed network. During network training, we perform data augmentation based on image rotation to increase robustness regarding the various viewpoints in videos.

• 반도체디스플레이기술학회지
• /
• 제19권2호
• /
• pp.31-36
• /
• 2020

Most of the background subtraction algorithms show good performance in static scenes. In the case of dynamic scenes, they frequently cause false alarm to "temporal clutter", a repetitive motion within a certain area. In this paper, we propose a robust technique for the multiple interval pixel sampling (MIS) algorithm to handle highly dynamic scenes. An adaptive threshold scheme is used to suppress false alarms in low-confidence regions. We also utilize multiple background models in the foreground segmentation process to handle repetitive background movements. Experimental results revealed that our approach works well in handling various temporal clutters.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2003년도 Proceedings of ACRS 2003 ISRS
• /
• pp.470-472
• /
• 2003

The primary goal in this paper is to analyze urban growth patterns using multi-temporal remote sensing images and geographic information data. In order to accomplish this purpose, firstly data pre-processing is carried out, and then land-use maps are generated with ancillary data source by heads-up on-screen digitizing. Lastly, using the results of the previous stages, the patterns of land-use and urban changes are monitored by the proposed scheme. In this research, using the multi-temporal images and geographic information data, monitoring of urban growth was carried out with the application of urban land-use changes.

• 한국멀티미디어학회논문지
• /
• 제11권6호
• /
• pp.796-806
• /
• 2008

This paper presents a blind video watermarking algorithm that has the robustness against spatial, temporal, and SNR scalability and transcoding for the copyright protection of video contents in heterogeneous multimedia service. The proposed process of watermark embedding and detecting is accomplished on base layer for considering spatial scalability. The watermark consists of the string and the ordering number of string for considering temporal scalability. Thus, each of frames has the bitstream of one character and a ordering number of its character. To robust against FGS, the proposed algorithm quantizes low and middle frequency coefficients in ROI region of each of frames and embeds its watermark bitstream into the specific bits of the quantized coefficients. Experimental results verified that the proposed algorithm satisfies the invisibility of watermark and also has the robustness against spatial scalability, temporal scalability and FGS.

• 한국정보통신학회논문지
• /
• 제12권12호
• /
• pp.2226-2231
• /
• 2008

모바일 기기와 무선 통신 기술이 발달함에 따라 모바일 기기에서 수집 또는 변경되는 대용량 시공간 데이터를 서버와 현장에서 동기화하는 서비스의 제공이 가능해졌다. 다수의 모바일 기기에서 변경된 대용량 시공간 데이터를 서버와 동기화하는 효율적인 양방향 동기화 프로토콜이 필요하다. 그러나 다수의 모바일 기기에 대하여 동기화 작업을 수행할 때 처리 시간이 길어지는 문제가 있다. 이 논문에서는 다수의 양방향 동기화 작업에 대하여 다중 큐를 이용하여 서버에서 동시 수행하는 처리기법에 대하여 제안한다.

• ETRI Journal
• /
• 제38권1호
• /
• pp.185-194
• /
• 2016

In this paper, a novel rate control scheme for low delay video coding of High Efficiency Video Coding (HEVC) is proposed. The proposed scheme is developed by considering a new temporal prediction structure of HEVC. In the proposed scheme, the relationship between bit rate and quantization step is exploited firstly to formulate an accurate quadratic rate-quantization (R-Q) model. Secondly, a method of determining the quantization parameters (QPs) for the first frames within a group of pictures is proposed. Thirdly, an accurate frame-level bit allocation method is proposed for HEVC. Finally, based on the proposed R-Q model and the target bit allocated for the frame, the QPs are predicted for coding tree units by using rate-distortion (R-D) optimization. We compare our scheme against that of three other state-of-the-art rate control schemes. Experimental results show that the proposed rate control scheme can increase the Bjøntegaard delta peak signal-to-noise ratio by 0.65 dB and 0.09 dB on average compared with the JCTVC-I0094 and JCTVC-M0036 schemes, respectively, both of which have been implemented in an HEVC test model encoder; furthermore, the proposed scheme achieves a similar R-D performance to Wang's scheme, as well as obtaining the smallest bit rate mismatch error of all the schemes.

• Journal of Information Processing Systems
• /
• 제16권6호
• /
• pp.1447-1458
• /
• 2020

This paper describes a structured overlay network scheme based on multiple different time intervals. Many types of data (e.g., sensor data) can be requested at specific time intervals that depend on the user and the system. These queries are referred to as "interval queries." A method for constructing an overlay network that efficiently processes interval queries based on multiple different time intervals is proposed herein. The proposed method assumes a ring topology and assigns nodes to a keyspace based on one-dimensional time information. To reduce the number of forwarded messages for queries, each node constructs shortcut links for each interval that users tend to request. This study confirmed that the proposed method reduces the number of messages needed to process interval queries. The contributions of this study include the clarification of interval queries with specific time intervals; establishment of a structured overlay network scheme based on multiple different time intervals; and experimental verification of the scheme in terms of communication load, delay, and maintenance cost.

• 한국정보통신학회논문지
• /
• 제15권5호
• /
• pp.1105-1110
• /
• 2011

모바일 클라이언트에서 갱신된 시공간 데이터는 서버와 무선 네트워크를 이용하여 동기화되고 사용자에게 신속하게 서비스 될 수 있다. 그러나 모바일 단말기나 무선 네트워크는 오류에 매우 취약하다. 만약 동기화 도중에 오류가 발생하면 동기화 대상 데이터에 대하여 데이터 불일치가 발생할 수 있다. 이 논문에서는 동기화 도중의 오류로 인하여 발생하는 문제를 해결하기 위한 회복 기법을 제안한다. 제안한 회복 기법은 모바일 클라이언트와 서버의 지역저장장치에 로그 레코드를 기록하고 오류가 발생하면 저장된 로그 레코드를 이용하여 회복한다. 그리고 제안한 회복 기법을 위한 회복 시스템을 설계하고 구현하였다.

• Journal of Electrical Engineering and Technology
• /
• 제9권5호
• /
• pp.1762-1773
• /
• 2014

In this paper, a distributed image coding scheme for multi-view video through an efficient generation of side information is proposed. A distributed video coding technique corrects the errors in the side information, which is generated with the original image, by using the channel coding technique at the decoder. Therefore, the more correct the generated side information is, the better the performance of distributed video coding. The proposed technique is to apply the distributed video coding schemes to the image coding for multi-view video. It generates side information by selectively and efficiently using both 3-dimensional warping based on the depth map with spatially adjacent frames and motion-compensated temporal interpolation with temporally adjacent frames. In this scheme the difference between the adjacent frames, the sizes of the motion vectors for the adjacent blocks, and the edge information are used as the selection criteria. From the experiments, it was observed that the quality of the side information generated by the proposed technique was improved by the average peak signal-to-noise ratio of 0.97dB than the one by motion-compensated temporal interpolation or 3-dimensional warping. The result from analyzing the rate-distortion curves revealed that the proposed scheme could reduce the bit-rate by 8.01% on average at the same peak signal-to-noise ratio value, compared to previous work.