• Title/Summary/Keyword: High order scheme

Search Result 1,113, Processing Time 0.03 seconds

A Smoothing Data Cleaning based on Adaptive Window Sliding for Intelligent RFID Middleware Systems (지능적인 RFID 미들웨어 시스템을 위한 적응형 윈도우 슬라이딩 기반의 유연한 데이터 정제)

  • Shin, DongCheon;Oh, Dongok;Ryu, SeungWan;Park, Seikwon
    • Journal of Intelligence and Information Systems
    • /
    • v.20 no.3
    • /
    • pp.1-18
    • /
    • 2014
  • Over the past years RFID/SN has been an elementary technology in a diversity of applications for the ubiquitous environments, especially for Internet of Things. However, one of obstacles for widespread deployment of RFID technology is the inherent unreliability of the RFID data streams by tag readers. In particular, the problem of false readings such as lost readings and mistaken readings needs to be treated by RFID middleware systems because false readings ultimately degrade the quality of application services due to the dirty data delivered by middleware systems. As a result, for the higher quality of services, an RFID middleware system is responsible for intelligently dealing with false readings for the delivery of clean data to the applications in accordance with the tag reading environment. One of popular techniques used to compensate false readings is a sliding window filter. In a sliding window scheme, it is evident that determining optimal window size intelligently is a nontrivial important task in RFID middleware systems in order to reduce false readings, especially in mobile environments. In this paper, for the purpose of reducing false readings by intelligent window adaption, we propose a new adaptive RFID data cleaning scheme based on window sliding for a single tag. Unlike previous works based on a binomial sampling model, we introduce the weight averaging. Our insight starts from the need to differentiate the past readings and the current readings, since the more recent readings may indicate the more accurate tag transitions. Owing to weight averaging, our scheme is expected to dynamically adapt the window size in an efficient manner even for non-homogeneous reading patterns in mobile environments. In addition, we analyze reading patterns in the window and effects of decreased window so that a more accurate and efficient decision on window adaption can be made. With our scheme, we can expect to obtain the ultimate goal that RFID middleware systems can provide applications with more clean data so that they can ensure high quality of intended services.

Estimation of Fractional Urban Tree Canopy Cover through Machine Learning Using Optical Satellite Images (기계학습을 이용한 광학 위성 영상 기반의 도시 내 수목 피복률 추정)

  • Sejeong Bae ;Bokyung Son ;Taejun Sung ;Yeonsu Lee ;Jungho Im ;Yoojin Kang
    • Korean Journal of Remote Sensing
    • /
    • v.39 no.5_3
    • /
    • pp.1009-1029
    • /
    • 2023
  • Urban trees play a vital role in urban ecosystems,significantly reducing impervious surfaces and impacting carbon cycling within the city. Although previous research has demonstrated the efficacy of employing artificial intelligence in conjunction with airborne light detection and ranging (LiDAR) data to generate urban tree information, the availability and cost constraints associated with LiDAR data pose limitations. Consequently, this study employed freely accessible, high-resolution multispectral satellite imagery (i.e., Sentinel-2 data) to estimate fractional tree canopy cover (FTC) within the urban confines of Suwon, South Korea, employing machine learning techniques. This study leveraged a median composite image derived from a time series of Sentinel-2 images. In order to account for the diverse land cover found in urban areas, the model incorporated three types of input variables: average (mean) and standard deviation (std) values within a 30-meter grid from 10 m resolution of optical indices from Sentinel-2, and fractional coverage for distinct land cover classes within 30 m grids from the existing level 3 land cover map. Four schemes with different combinations of input variables were compared. Notably, when all three factors (i.e., mean, std, and fractional cover) were used to consider the variation of landcover in urban areas(Scheme 4, S4), the machine learning model exhibited improved performance compared to using only the mean of optical indices (Scheme 1). Of the various models proposed, the random forest (RF) model with S4 demonstrated the most remarkable performance, achieving R2 of 0.8196, and mean absolute error (MAE) of 0.0749, and a root mean squared error (RMSE) of 0.1022. The std variable exhibited the highest impact on model outputs within the heterogeneous land covers based on the variable importance analysis. This trained RF model with S4 was then applied to the entire Suwon region, consistently delivering robust results with an R2 of 0.8702, MAE of 0.0873, and RMSE of 0.1335. The FTC estimation method developed in this study is expected to offer advantages for application in various regions, providing fundamental data for a better understanding of carbon dynamics in urban ecosystems in the future.

Lattice Code of Interference Alignment for Interference Channel with 3 Users in CoMP (세 명의 사용자의 간섭 채널을 위한 협력 다중점 송수신(CoMP)에서의 격자(Lattice) 부호 간섭 정렬)

  • Lee, Moon-Ho;Peng, Bu Shi
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.49 no.6
    • /
    • pp.27-38
    • /
    • 2012
  • In this paper, we introduce CoMP in 3GPP LTE-Advanced Release 11 to take care of shadowing effects appearing in cell-edge areas to meet rapidly increasing demand for high speed transmission and multi-media data. In order to mitigate interference, orthogonalizing is ideal but it is slightly difficult to be applied to real systems. Therefore, interference alignment and avoidance are used in practical applications. Interference alignment is a scheme enabling us to consider interference our friend not enemy. We show lattice codes in Gaussian channel achieve Shannon capacity where strong interference exists. In addition, we show the relationship between channel parameter a and DoF(Degree of Freedom) applying lattice codes to interference alignment for interference channel with three users.

Effective MCTF based on Correlation Improvement of Motion Vector Field (움직임 벡터 필드의 상관도 향상을 통한 효과적인 MCTF 방법)

  • Kim, Jongho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.5
    • /
    • pp.1187-1193
    • /
    • 2014
  • This paper presents an effective motion estimation to improve the performance of the motion compensated temporal filtering (MCTF) which is a core part of the wavelet-based scalable video coding. The proposed scheme makes the motion vector field uniform by the modified median operation and the search strategies using adjacent motion vectors, in order to enhance the pixel connectivity which is significantly relevant to the performance of the MCTF. Moreover, the motion estimation with variable block sizes that reflects the features of frames is introduced for further correlation improvement of the motion vector field. Experimental results illustrate that the proposed method reduces the decomposed energy on the temporal high frequency subband frame up to 30.33% in terms of variance compared to the case of the full search with fixed block sizes.

Management and Control Scheme for Next Generation Packet-Optical Transport Network (차세대 패킷광 통합망 관리 및 제어기술 연구)

  • Kang, Hyun-Joong;Kim, Hyun-Cheol
    • Convergence Security Journal
    • /
    • v.12 no.1
    • /
    • pp.35-42
    • /
    • 2012
  • Increase of data traffic and the advent of new real-time services require to change from the traditional TDM-based (Time Division Multiplexing) networks to the optical networks that soft and dynamic configuration. Voice and lease line services are main service area of the traditional TDM-based networks. This optical network became main infrastructure that offer many channel that can convey data, video, and voice. To provide high resilience against failures, Packet-optical networks must have an ability to maintain an acceptable level of service during network failures. Fast and resource optimized lightpath restoration strategies are urgent requirements for the near future Packet-optical networks with a Generalized Multi-Protocol Label Switching(GMPLS) control plane. The goal of this paper is to provide packet-optical network with a hierarchical multi-layer recovery in order to fast and coordinated restoration in packet-optical network/GMPLS, focusing on new implementation information. The proposed schemes do not need an extension of optical network signaling (routing) protocols for support.

Cooperative Diversity Based on Interleavers and Its efficient Algorithm in Amplify-And-Forward Relay Networks (Amplify-Forward Relay Network의 인터리버에 근거한 협동 다이버시티와 그 효과적 알고리즘)

  • Yan, Yier;Jo, Gye-Mun;Balakannan, S.P.;Lee, Moon-Ho
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.46 no.6
    • /
    • pp.94-102
    • /
    • 2009
  • In [1], the authors have proposed a novel scheme to achieve full diversity and to combat the time delays from each relay node, but decode-and-forward (DF) model operation mode puts more processing burden on the relay. In this paper, we not only extend their model into amplify and forward (AF) model proposed in [2],[3], but also propose an efficient decoding algorithm, which is able to order the joint channel coefficients of overall channel consisting of source-relay link and relay-destination link and cancels the previous decoded symbols at the next decoding procedure. The simulation results show that this algorithm efficiently improves its performance achieving 2-3dB gain compared to [1] in high SNR region and also useful to DF achieving more than 3dB gain compared to an original algorithm.

Hybrid Multipath Routing in Mobile Ad Hoc Networks (MANET환경에서 적용 가능한 복합적 다중 라우팅 기술)

  • Ninh, Khanhchi;Jung, Sou-Hwan
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.48 no.2
    • /
    • pp.49-56
    • /
    • 2011
  • One of the most important VANET applications is providing active safety by broadcasting emergency messages. In order to prevent broadcast storm of flooding-based broadcasting scheme in which any node receiving message will rebroadcast, the existing protocols use the different methods to limit the number of relay nodes. Nevertheless, the existing protocols have low delivery ratio with high traffic density and cause message overhead. Currently, the dramatic increase in the number of vehicles equipped with Global Positioning System (GPS) and onboard radar created new application scenarios that were not feasible before. Consequently, we proposed a broadcasting protocol that selects relay node by using GPS-based position information and detecting neighboring vehicles with the help of onboard radar to. Simulation results show that our proposed protocol has better performance than the existing schemes.

Multi-level Consistency Control Techniques in P2P Multiplayer Game Architectures with Primary Copy (기본 사본을 갖는 P2P 멀티플레이어 게임 구조의 수준별 일관성 제어 기법)

  • Kim, Jin-Hwan
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.15 no.4
    • /
    • pp.135-143
    • /
    • 2015
  • A Multiplayer Online Game(MOG) is a game capable of supporting hundreds or thousands of players and is mostly played using the Internet. P2P(peer-to-peer) architectures for MOGs can potentially achieve high scalability, low cost, and good performance. The basic idea of many P2P-based games is to distribute the game state among peers and along with it processing, network, and storage tasks. In a primary-copy based replication scheme where any update to the object has to be first performed on the primary copy, this means distributing primary copies of objects among peers. Most multiplayer games use a primary-copy model in order to provide strong consistency control over an object. Games consist of various types of actions that have different levels of sensitivity and can be categorized according to their consistency requirements. With the appropriate consistency level of each action type within a game, this paper allows developers to choose the right trade-off between performance and consistency. The performance for P2P game architecture with the primary-copy model is evaluated through simulation experiments and analysis.

Lifetime Maximization of Wireless Video Sensor Network Node by Dynamically Resizing Communication Buffer

  • Choi, Kang-Woo;Yi, Kang;Kyung, Chong Min
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.10
    • /
    • pp.5149-5167
    • /
    • 2017
  • Reducing energy consumption in a wireless video sensor network (WVSN) is a crucial problem because of the high video data volume and severe energy constraints of battery-powered WVSN nodes. In this paper, we present an adaptive dynamic resizing approach for a SRAM communication buffer in a WVSN node in order to reduce the energy consumption and thereby, to maximize the lifetime of the WVSN nodes. To reduce the power consumption of the communication part, which is typically the most energy-consuming component in the WVSN nodes, the radio needs to remain turned off during the data buffer-filling period as well as idle period. As the radio ON/OFF transition incurs extra energy consumption, we need to reduce the ON/OFF transition frequency, which requires a large-sized buffer. However, a large-sized SRAM buffer results in more energy consumption because SRAM power consumption is proportional to the memory size. We can dynamically adjust any active buffer memory size by utilizing a power-gating technique to reflect the optimal control on the buffer size. This paper aims at finding the optimal buffer size, based on the trade-off between the respective energy consumption ratios of the communication buffer and the radio part, respectively. We derive a formula showing the relationship between control variables, including active buffer size and total energy consumption, to mathematically determine the optimal buffer size for any given conditions to minimize total energy consumption. Simulation results show that the overall energy reduction, using our approach, is up to 40.48% (26.96% on average) compared to the conventional wireless communication scheme. In addition, the lifetime of the WVSN node has been extended by 22.17% on average, compared to the existing approaches.

Parallel Coding Scheme for Flicker Mitigation in MIMO-VLC (다중입출력 가시광통신에서 플리커 현상을 완화하기 위한 병렬 코딩 기법)

  • Jeong, Jin-uk;Lee, Kye-san;Seo, Hyo-duck;Han, Doo-hee;Lee, Kyu-jin
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.15 no.3
    • /
    • pp.146-154
    • /
    • 2016
  • Visible light communication using LED is a technique for transmitting digital data using the light of the LED. Recently, high-speed data rate plays an important role. Therefore, many scholars have researched the MIMO-VLC which is able to increase data rate using a lot of LED transmitters. However, it has problems such as light interference and flicker when transmitting different bit. Many researcher have focused on reduce interference. However it is not considered about flicker problem. Flicker is defined unstable brightness. It occurred the tired of human eyes, lowers eyesight and also decreases concentration. In order to solve this flicker problem in MIMO-VLC, we propose the PFM(Parallel Flicker Mitigation) code. PFM code using combinatorial theory can maintain constant brightness the whole bit duration. Therefore, it is possible to assure the brightness by confirm simulation results.