• 전자공학회논문지CI
• /
• 제40권3호
• /
• pp.137-143
• /
• 2003

Key frame extraction has been recognized as one of tile important research issues in video information retrieval. Although progress has been made in key frame extraction, the existing approaches do not evaluate the importance of extracted frame Quantitatively, and Dey are computationally expensive or ineffective. In this Paper, we introduce a new 미해rithm for key frame extraction using shot coverage and distortion. The algorithm finds significant key frames from candidate key frames. When selecting the candidate frames, the coverage rate to the total frames from each frame is computed by using the difference between the adjacent frames in tile shot. The frames within 10$\%$ from the top are selected as the candidates. Then, by comfuting the distortion rate of the candidates against all frames, pick the frames which arc most representative are selected. The performance of the proposed algorithm has been verified by a statistical test. Experiments show that more than 13-50$\%$ improvement has been obtained by the proposed algorithm compared to the existing methods.

• 대한수학회지
• /
• 제53권6호
• /
• pp.1331-1345
• /
• 2016

A K-g-frame is a generalization of a g-frame. It can be used to reconstruct elements from the range of a bounded linear operator K in Hilbert spaces. K-g-frames have a certain advantage compared with g-frames in practical applications. In this paper, the interchangeability of two g-Bessel sequences with respect to a K-g-frame, which is different from a g-frame, is discussed. Several construction methods of K-g-frames are also proposed. Finally, by means of the methods and techniques in frame theory, several results of the stability of K-g-frames are obtained.

• 한국컴퓨터정보학회논문지
• /
• 제23권9호
• /
• pp.43-50
• /
• 2018

In this paper, we propose a hexagon model-based efficient beacon frame scheduling approach for wireless sensor networks. The existing beacon frame scheduling approaches use a lot of slots and subslots for the beacon frame scheduling. Thus, the data from source nodes are not efficiently delivered to a sink node. Also in case a sink node needs to broadcast a beacon frame to the nodes in the network, delivering the beacon frame to the network nodes is not efficient as well. Thus, to solve the problem, we use a hexagon model to find the number of slots and subslots for the beacon frame scheduling. By using them for the beacon frame scheduling, the proposed approach performs better than other approaches in terms of the data transmission delay, the number of received data, the beacon transmission delay and the number of relaying the beacon frames.

• 한국통신학회논문지
• /
• 제25권3B호
• /
• pp.510-518
• /
• 2000

A new video interpolation technique based on variable skip rate of video sequence is proposed in this paper. in the proposed technique. the determination whether a frame is skipped or not is done by the degree of motion complexity of the frame. If the motion complexity of a frame is low the frame is skipped. otherwise it is coded and transmitted. To determine the motion complexity of a frame a new technique using MEF (moving edge in frame),the set of pixels considered as moving edges in a frame. is introduced. In the course of decoding and interpolating of receiver., the motion field is segmented. For the purpose of dividing vector field morphological filtering is applied. Morphological filtering also used to smooth the boundaries between the changed and unchanged region. In the simulation results, the proposed technique shows higher quality and lower fluctuation of picture quality than the conventional techniques on conditioning of the same bit rate.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제4권1호
• /
• pp.62-77
• /
• 2010

Emerging applications with high data rates will need to transport bulk data reliably in wireless sensor networks. ARQ (Automatic Repeat request) or Forward Error Correction (FEC) code schemes can be used to provide reliable transmission in a sensor network. However, the naive ARQ approach drops the whole frame, even though there is a bit error in the frame and the FEC at the bit level scheme may require a highly complex method to adjust the amount of FEC redundancy. We propose a bulk data transmission scheme based on erasure-resilient code in this paper to overcome these inefficiencies. The sender fragments bulk data into many small blocks, encodes the blocks with LT codes and packages several such blocks into a frame. The receiver only drops the corrupted blocks (compared to the entire frame) and the original data can be reconstructed if sufficient error-free blocks are received. An incidental benefit is that the frame error rate (FER) becomes irrelevant to frame size (error recovery). A frame can therefore be sufficiently large to provide high utilization of the wireless channel bandwidth without sacrificing the effectiveness of error recovery. The scheme has been implemented as a new data link layer in TinyOS, and evaluated through experiments in a testbed of Zigbex motes. Results show single hop transmission throughput can be improved by at least 20% under typical wireless channel conditions. It also reduces the transmission time of a reasonable range of size files by more than 30%, compared to a frame ARQ scheme. The total number of bytes sent by all nodes in the multi-hop communication is reduced by more than 60% compared to the frame ARQ scheme.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권1호
• /
• pp.165-182
• /
• 2014

An RFID systems employ efficient Anti-Collision Algorithms (ACAs) to enhance the performance in various applications. The EPC-Global G2 RFID system utilizes Frame Slotted Aloha (FSA) as its ACA. One of the common approaches used to maximize the system performance (tag identification efficiency) of FSA-based RFID systems involves finding the optimal value of the frame length relative to the contending population size of the RFID tags. Several analytical models for finding the optimal frame length have been developed; however, they are not perfectly optimized because they lack precise characterization for the timing details of the underlying ACA. In this paper, we investigate this promising direction by precisely characterizing the timing details of the EPC-Global G2 protocol and use it to derive a precise-optimal frame length model. The main objective of the model is to determine the optimal frame length value for the estimated number of tags that maximizes the performance of an RFID system. However, because precise estimation of the contending tags is difficult, we utilize a parametric-heuristic approach to maximize the system performance and propose two simple schemes based on the obtained optimal frame length-namely, Improved Dynamic-Frame Slotted Aloha (ID-FSA) and Exponential Random Partitioning-Frame Slotted Aloha (ERP-FSA). The ID-FSA scheme is based on the tag set estimation and frame size update mechanisms, whereas the ERP-FSA scheme adjusts the contending tag population in such a way that the applied frame size becomes optimal. The results of simulations conducted indicate that the ID-FSA scheme performs better than several well-known schemes in various conditions, while the ERP-FSA scheme performs well when the frame size is small.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2007년도 춘계학술발표대회
• /
• pp.1294-1296
• /
• 2007

The IEEE 802.11 DCF forces neighboring nodes of an active transmitter to switch into inactive state. This conservative nature brings frame latency at transmitter neighborhood. This work exploits the IEEE 802.11n Frame Aggregation scheme to allow simultaneous transmissions from nodes that are neighbors to each-other. This is accomplished by the synchronization of control and data transmissions in slots of fixed length. Proposed scheme reduces the frame latency and improves aggregated network throughput.

• 정보관리연구
• /
• 제38권2호
• /
• pp.153-173
• /
• 2007

[ $OntoFrame^{(R)}$ ]은 연구자들의 연구개발을 전주기적으로 지원하기 위해 시맨틱 웹 프레임워크를 기반으로 하여 정보유통 서비스와 추론 서비스를 제공하는 시스템이다. 기능성 측면에서 기존에 유사한 서비스를 찾지 못할 만큼 강력함을 가지고 있지만, 시스템 설계와 개발 단계에서 사용성 평가를 수행하지 않아 사용성 측면에서도 만족스러울 지의 여부를 판단하기 힘들다. 이에 본 연구를 통해 국내에서 거의 이루어지고 있지 않은 사용성 평가를 해당 시스템을 대상으로 수행하며, 평가 결과 분석을 통해 기능 중심적이 아닌 사용자 중심적 시스템으로 발전하기 위한 방향을 제시한다. 사용성 평가를 위해 소프트웨어 인간공학(Software Ergonomics) 전문가에 의한 '이론 중심 사용성 평가'와 사용자 그룹에 의한 '사용자 중심 평가(사용자 테스트)'를 병행하였으며, 본 연구 결과가 실제 서비스를 목표로 하는 시스템 개발에 있어서의 기반 연구가 될 것이라 기대한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권2호
• /
• pp.601-617
• /
• 2014

In digital radio broadcasting systems, long delays are incurred in service start time when tuning to a particular frequency because several synchronization steps, such as symbol timing synchronization, frame synchronization, and carrier frequency offset and sampling frequency offset compensation are necessary. Therefore, the operation of the synchronization blocks causes delays ranging from several hundred milliseconds to a few seconds until the start of the radio service after frequency tuning. Furthermore, if spectrum inversed signals are transmitted in digital radio broadcasting systems, the receivers are unable to decode them, even though most receivers can demodulate the spectral inversed signals in analog radio broadcasting systems. Accordingly, fast synchronization techniques and a method for spectral inversion detection are required in digital radio broadcasting systems that are to replace the analog radio systems. This paper presents a joint detection method of frame, integer carrier frequency offset, and spectrum inversion for DRM Plus digital broadcasting systems. The proposed scheme can detect the frame and determine whether the signal is normal or spectral inversed without any carrier frequency offset and sampling frequency offset compensation, enabling fast frame synchronization. The proposed method shows outstanding performance in environments where symbol timing offsets and sampling frequency offsets exist.

• Journal of Power Electronics
• /
• 제18권5호
• /
• pp.1424-1433
• /
• 2018

This paper presents a novel space vector pulse-width modulation (SVPWM) to synthesize an arbitrary non-sinusoidal phase voltage. The key of the proposed method is that the switching vectors used to comprise the reference vectors in the ${\alpha}_1-{\beta}_1$ frame and the ${\alpha}_3-{\beta}_3$ frame are decoupled. In the ${\alpha}_1-{\beta}_1$ frame, the reference vector is comprised by near two large vectors. The corresponding vector comprised by the two vectors in the ${\alpha}_3-{\beta}_3$ frame is considered as a disturbance, which is restrained by close-loop control. In the ${\alpha}_3-{\beta}_3$ frame, there are two methods to comprise the reference vector. Method I is a near two middle vectors method. Method II uses near four vectors (two middle and two little vectors). The proposed SVPWM using decoupled switching vectors can guarantee a maximum modulation index in the ${\alpha}_1-{\beta}_1$ frame. The effectiveness of the proposed method is verified by simulated and experimental results under various operation conditions.