• Title/Summary/Keyword: Internet Based Laboratory

Search Result 498, Processing Time 0.032 seconds

Robust Three-step facial landmark localization under the complicated condition via ASM and POEM

  • Li, Weisheng;Peng, Lai;Zhou, Lifang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.9
    • /
    • pp.3685-3700
    • /
    • 2015
  • To avoid influences caused by pose, illumination and facial expression variations, we propose a robust three-step algorithm based on ASM and POEM for facial landmark localization. Firstly, Model Selection Factor is utilized to achieve a pose-free initialized shape. Then, we use the global shape model of ASM to describe the whole face and the texture model POEM to adjust the position of each landmark. Thirdly, a second localization is presented to discriminatively refine the subtle shape variation for some organs and contours. Experiments are conducted in four main face datasets, and the results demonstrate that the proposed method accurately localizes facial landmarks and outperforms other state-of-the-art methods.

Distributed Optimal Path Generation Based on Delayed Routing in Smart Camera Networks

  • Zhang, Yaying;Lu, Wangyan;Sun, Yuanhui
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.7
    • /
    • pp.3100-3116
    • /
    • 2016
  • With the rapid development of urban traffic system and fast increasing of vehicle numbers, the traditional centralized ways to generate the source-destination shortest path in terms of travel time(the optimal path) encounter several problems, such as high server pressure, low query efficiency, roads state without in-time updating. With the widespread use of smart cameras in the urban traffic and surveillance system, this paper maps the optimal path finding problem in the dynamic road network to the shortest routing problem in the smart camera networks. The proposed distributed optimal path generation algorithm employs the delay routing and caching mechanism. Real-time route update is also presented to adapt to the dynamic road network. The test result shows that this algorithm has advantages in both query time and query packet numbers.

Survey of Cognitive Radio VANET

  • He, Xinxin;Shi, Weisen;Luo, Tao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.11
    • /
    • pp.3837-3859
    • /
    • 2014
  • Vehicular Ad hoc Networks (VANET) becomes more popular in industry, academia and government. However, Typical VANET is challenged by high speed mobility and insufficient spectrum resources over congested scenarios. To address those serious problems, some articles have introduced Cognitive Radio (CR) technology into VANET and formed CR-VANET. In this article, we propose an overview of CR-VANET by exploring different architectures and features. Moreover, we provide taxonomy of state-of-the-art papers in this emerging field and the key articles are well analyzed respectively. In addition, we illustrate both research and application frameworks of CR-VANET based on our works, and propose some open research issues for inspiring future work.

Energy-Saving Oriented On/Off Strategies in Heterogeneous Networks : an Asynchronous Approach with Dynamic Traffic Variations

  • Tang, Lun;Wang, Weili;Chen, Qianbin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.11
    • /
    • pp.5449-5464
    • /
    • 2018
  • Recent works have validated the possibility of reducing the energy consumption in wireless heterogeneous networks, achieved by switching on/off some base stations (BSs) dynamically. In this paper, to realize energy conservation, the discrete time Markov Decision Process (DTMDP) is developed to match up the BS switching operations with the traffic load variations. Then, an asynchronous decision-making algorithm, which is based on the Bellman equation and the on/off priorities of the BSs, is firstly put forward and proved to be optimal in this paper. Through reducing the state and action space during one decision, the proposed asynchronous algorithm can avoid the "curse of dimensionality" occurred in DTMDP frequently. Finally, numerical simulations are conducted to validate the effectiveness and advantages of the proposed asynchronous on/off strategies.

Best Practice on Inspecting the Abnormal State of Bridge (Engineering works) Establishment with Augmented Reality (AR) Mechanism

  • Janghwan Kim;So Young Moon;R. Young Chul Kim
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.15 no.2
    • /
    • pp.168-174
    • /
    • 2023
  • In the current world, with the massive scale of SOC construction, it is difficult to diagnose and check all of a bridge's abnormal states with even the experts' eyes for maintenance. It is because we should spend huge costs and time on maintenance. Still, there are not many alternative ways to inspect bridges remotely regarding accuracy or reality. Therefore, we remark on the advantages and disadvantages of previous methods through practices in SOC maintenance. To inspect the abnormal state of the Bridge, we suggest inspecting bridges with an Augmented Reality (AR) mechanism to reduce cost, human resource consumption, and the risk of work. Through the proposed approach, we expect that it provides ways to solve massive construction problems with software-based technologies.

Replica Correlation-Based Synchronization with Low Complexity and Frequency Offset Immunity

  • Chang, Kapseok;Bang, Seung Chan;Kim, Hoon
    • ETRI Journal
    • /
    • v.35 no.5
    • /
    • pp.739-747
    • /
    • 2013
  • This paper investigates the multifarious nature of the long-term evolution (LTE) scheme and that of the modified LTE scheme for symbol timing synchronization (STS). This investigation allows us to propose a new replica correlation-based STS scheme to overcome the inherent weaknesses of the other two schemes. The proposed STS signal combines a gold sequence and a half sine wave in the time domain, whereas conventional STS signals specify either binary sequences or complex sequences in the time domain or in the frequency domain. In the proposed scheme, a sufficient correlation property is realized by the gold sequence, and robustness against the frequency offset (FO) is achieved through the sine wave. Compared to the existing LTE-related schemes, the proposed scheme can better achieve immunity to FO and reduction in detector complexity, as well as a low peak-to-average power ratio and a low detection error rate. Performance evaluations through analysis and simulation are provided in the paper to demonstrate these attributes.

Profit-Maximizing Virtual Machine Provisioning Based on Workload Prediction in Computing Cloud

  • Li, Qing;Yang, Qinghai;He, Qingsu;Kwak, Kyung Sup
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.12
    • /
    • pp.4950-4966
    • /
    • 2015
  • Cloud providers now face the problem of estimating the amount of computing resources required to satisfy a future workload. In this paper, a virtual machine provisioning (VMP) mechanism is designed to adapt workload fluctuation. The arrival rate of forthcoming jobs is predicted for acquiring the proper service rate by adopting an exponential smoothing (ES) method. The proper service rate is estimated to guarantee the service level agreement (SLA) constraints by using a diffusion approximation statistical model. The VMP problem is formulated as a facility location problem. Furthermore, it is characterized as the maximization of submodular function subject to the matroid constraints. A greedy-based VMP algorithm is designed to obtain the optimal virtual machine provision pattern. Simulation results illustrate that the proposed mechanism could increase the average profit efficiently without incurring significant quality of service (QoS) violations.

Real-Time Non-Local Means Image Denoising Algorithm Based on Local Binary Descriptor

  • Yu, Hancheng;Li, Aiting
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.2
    • /
    • pp.825-836
    • /
    • 2016
  • In this paper, a speed-up technique for the non-local means (NLM) image denoising method based on local binary descriptor (LBD) is proposed. In the NLM, most of the computation time is spent on searching for non-local similar patches in the search window. The local binary descriptor which represents the structure of patch as binary strings is employed to speed up the search process in the NLM. The descriptor allows for a fast and accurate preselection of non-local similar patches by bitwise operations. Using this approach, a tradeoff between time-saving and noise removal can be obtained. Simulations exhibit that despite being principally constructed for speed, the proposed algorithm outperforms in terms of denoising quality as well. Furthermore, a parallel implementation on GPU brings NLM-LBD to real-time image denoising.

A Symmetric Lookup-based Secure P2P Routing Algorithm

  • Luo, Bingqing;Jin, Yiai;Luo, Shengmei;Sun, Zhixin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.5
    • /
    • pp.2203-2217
    • /
    • 2016
  • To prevent structured peer to peer (P2P) overlay networksfrom being attacked by malicious nodes, a symmetric lookup-based routing algorithm referred to as Symmetric-Chord is proposed in this paper. The proposed algorithm determines the precision of routing lookup by constructing multiple paths to the destination. The selective routing algorithm is used to acquire information on the neighbors of the root. Authenticity of the root is validated via consistency shown between the information ascertained from the neighbors and information from the yet-to-be-verified root, resulting in greater efficiency of resource lookup. Simulation results demonstrate that Symmetric-Chordhas the capability of detecting malicious nodes both accurately and efficiently, so as to identify which root holds the correct key, and provides an effective approach to the routing security for the P2P overlay network.

Grid-Based Key Pre-Distribution in Wireless Sensor Networks

  • Mohaisen, Abedelaziz;Nyang, Dae-Hun;Maeng, Young-Jae;Lee, Kyung-Hee;Hong, Do-Won
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.3 no.2
    • /
    • pp.195-208
    • /
    • 2009
  • In this paper, we introduce a grid-based key pre-distribution scheme in wireless sensor networks, which aims to improve the connectivity and resiliency while maintaining a reasonable overhead. We consider simplification of the key establishment logic and enhancement of the connectivity via plat polynomial assignment on a three-dimensional grid for node allocation and keying material assignment. We demonstrate that our scheme results in improvements via a detailed discussion on the connectivity, resource usage, security features and resiliency. A comparison with other relevant works from the literature along with a demonstrated implementation on typical sensor nodes shows the feasibility of the introduced scheme and its applicability for large networks.