scispace - formally typeset
Search or ask a question

Showing papers by "Shu-Chuan Chu published in 2018"


Journal ArticleDOI
02 Jan 2018
TL;DR: A load balancing to mitigate the hot spot problem in wireless sensor network (WSN), based on enhancing diversity pollens in Flower pollination algorithm (FPA), demonstrates that the proposed method performs better than the others regarding various performance metrics such as the load balancing, execution time, energy consumption, and convergence rate.
Abstract: This paper proposes a load balancing to mitigate the hot spot problem in wireless sensor network (WSN), based on enhancing diversity pollens in Flower pollination algorithm (FPA). The hotspot problem in the WSN is spots near base station (BS) that consume more energy and drain out energy more quickly than other nodes farther from the BS. The spots near BS are hotter than other places due to the heavy traffic from the cluster members and other cluster heads (CH) for relaying data to BS. Enhancing diversity pollens for FPA is one of the solutions to deal smoothly with trapping local extrema for solving the hotspot problem. To evaluate the proposed algorithm, we firstly use a set of benchmark functions to test performance quality, and secondly, we deal with the load balancing problem in WSN. The results compared with some metaheuristic approaches and other related clustering algorithms demonstrate that the proposed method performs better than the others regarding various performance metrics such as t...

13 citations


Journal ArticleDOI
TL;DR: A novel and adaptable calibration scheme is proposed, which is used to estimate approximate models to correct and transform raw depth data, and allows for smooth real-time performance using an optimization framework, including denoising and stabilizing.
Abstract: Reconstruction and projection mapping enable us to bring virtual worlds into real spaces, which can give spectators an immersive augmented reality experience. Based on an interactive system with RG...

11 citations


Book ChapterDOI
25 Oct 2018
TL;DR: Compared results with the other approaches in the literature show the proposed scheme provides the better performance in terms of stability period and protracted lifetime.
Abstract: The wireless sensor network (WSN) consists of a large number of sensor nodes collaborative to collect and transmit data to the end user. Since the network’s long life is an utmost requirement of WSN. Clustering is one of the most effective ways of prolonging the lifetime of the network. In clustering, a node takes charge of the cluster to coordinate and receive information from the member nodes and transfer it to the sink. With the imbalance of energy dissipation by the sensor node, it may lead to premature failure of the network. Therefore, a robust balanced clustering algorithm can solve this issue in which a worthy candidate will play the cluster head role in each round. This paper proposes an improvement of WSN based on fuzzy logic for clustering. Residual energy, distance from the sink, and density of the nodes in its locality are taken account as the input to feed into fuzzy inference system. Compared results with the other approaches in the literature show the proposed scheme provides the better performance in terms of stability period and protracted lifetime.

10 citations


Book ChapterDOI
01 Dec 2018
TL;DR: The results compared with the other methods in the literature shows that the proposed approach can provide the robot achieve to its target with collision-free obstacles, and be a competitive approach for optimal robot planning.
Abstract: This paper proposes a novel multi-objective approach for optimal robot path planning based on Ion Motion Optimization (IMO). Two criteria are the distance to the target and smooth path that considered to optimize for the robot path planning issue. Location targets and obstacles are used to model mathematically the fitness function. Robots update information during the move because of partially unknown environment due to the limited sensors in detecting range. Simulations of the robot reached to target are implemented in different scenario environments for the optimal path. The results compared with the other methods in the literature shows that the proposed approach can provide the robot achieve to its target with collision-free obstacles, and be a competitive approach for optimal robot planning.

7 citations


01 Feb 2018
TL;DR: The security weaknesses of the three famous schemes of Rhee et al. provides an efficient way to search encrypted files and discusses the security problems about the schemes.
Abstract: Public key encryption with keyword search (PEKS) provides an efficient way to search encrypted files. Recently, Rhee et al. contributed their knowledge to propose several literatures in this research area. In this paper, we first review their three famous schemes and then summarize the security weaknesses of the three schemes. Finally, we discuss the security problems about Rhee et al. like scheme and remain an open problem.

5 citations


Proceedings Article
01 Jan 2018
TL;DR: GAHL routing scheme based on genetic algorithm and Harel method is proposed to solve the problem of bottleneck for WSNs and shows a good performance compared to other well-known algorithms.
Abstract: Wireless sensor networks ( WSNs) are designed for a large scale monitoring applications such as military surveillance, medical treatment, environmental monitoring and industry management. In this network, usually hundreds or thousands of low-cost sensor nodes are deployed. These sensing nodes detect the events in the environment and pass an upstream message towards a Sink node. The Sink node is responsible for processing data those are collected by sensor nodes. However, bottleneck exists for WSN: these inner nodes whose positions are close to the Sink node run out of power much earlier than those outer nodes. Because those inner nodes not only perform sensing operation, but also replay data originated from other nodes. In this paper, GAHL routing scheme based on genetic algorithm and Harel method is proposed to solve the problem. The scheme finds the small number of center heads in the network. Those center heads play a role in balancing the workload of inner nodes. With the involvement of center head, a three-tier network is built. From the simulation experiment, the scheme shows a good performance compared to other well-known algorithms. We observe a decrease in the number of center heads, as well as an improvement in the stability of the scheme.

5 citations


01 Jan 2018
TL;DR: This paper exploits a region called affine invariant region (AIR) as an image feature to help effectively retrieve the images even when the images have been attacked or processed and uses vector quantization (VQ) to reduce the comparison of image features for improving the retrieval efficiency.
Abstract: The content-based image retrieval (CBIR) is the most acceptable method often used in an image retrieval system because it can manage image database efficiently and effectively. The CBIR methods usually retrieve the images by image features. In this paper, we exploit a region called affine invariant region (AIR) as an image feature to help effectively retrieve the images even when the images have been attacked or processed. Moreover, we use vector quantization (VQ) to reduce the comparison of image features for improving the retrieval efficiency. The experimental results show that the method has a higher recall rate, lower retrieval time, and promising accuracy.

4 citations


01 Jan 2018
TL;DR: This paper finds out adjacent pixels have similar values, which means it can utilize this large area of data embedding and extracting on a difference-coordinate plan instead of the traditional pixel- coordinate plan, and proposes a method aiming at solving these two problems mentioned above.
Abstract: Data hiding is a widely used technique to embed secrets in multimedia area so to achieve lower distortion and higher embedding capacity. Up to now, many methods which focus on solving these two problems have proposed constantly. Previous methods use various shaped shells to carry secret data in an image, but their schemes have high distortion of images and low capacity of carrying secrets due to their simple geometry layouts. We find out adjacent pixels have similar values, which means we can utilize this large area, and, therefore, we manipulate the data embedding and extracting on a difference-coordinate plan instead of the traditional pixel-coordinate plan. In this paper we propose a method aiming at solving these two problems mentioned above. This scheme embeds our secrets by using 3 pixels every time with the guidance of the flower-shaped reference matrix under a different coordinate system. The flower-shaped reference matrix combines three parts including petal matrix, calyx matrix and stamen matrix for secret embedding, which brings outstanding payload with good visual quality.

3 citations


Proceedings Article
01 Jul 2018
TL;DR: The obtained results show that the EBC algorithm is superior to EBA according to solution quality and robustness.
Abstract: In this paper, we concentrate on the modification of the evolved bat algorithm (EBA), designed for solving numerical optimization by utilizing the scheming idea of Artificial Bee Colony algorithm (ABC) .Three roles of bat colony and six successive processes are realized to accelerate the convergence characteristic of the modificatory algorithm, namely evolved bat colony algorithm (EBC). In the initialization, two roles (employed bats and onlooker bats) are set with equal probability, and the movement law of EBA is applied for obtaining candidate solutions by the greedy selection strategy. The last modified phase is movement phase of scout bats, the employed bats become scouts with randomly search in this phase, when one solution cannot be further improved any more. In the experiments, five well-know benchmark functions are utilized to evaluate the performance of EBC algorithm. The obtained results show that the EBC algorithm is superior to EBA according to solution quality and robustness.

1 citations


01 Dec 2018
TL;DR: This paper proposes an immersive online shopping system based on virtual reality (VR), which is composed of six modules, i.e., virtual mall, item display, online pay, interaction, gaming and advertisement, and the validation of this system is proved.
Abstract: This paper proposes an immersive online shopping system based on virtual reality (VR). The background of the developed VR mall is for cross-border e-commerce. In particular, the architecture of this VR-based prototype is designed, which is composed by six modules, i.e., virtual mall, item display, online pay, interaction, gaming and advertisement. Among these, the former there modules are essential, and the latter three are integrated elaborately in the system for shopping experience enhancement. The used commercial VR system is HTC Vive, which contains a headset, two independent controllers and two base station for localization. Wearing the headset, customers can roam in the mall freely. Based on controllers, they can pick up items and even compare when two different items are picked up by two controllers. In addition, the customer’s position can be real-time tracked and localized, which is benefited from the support of base stations. All the content are stored in a VR-ready backpack PC, in this way the customer can walk in a space (e.g., 3×4 square meters) at will. Extensive experimental results and practical usage proves the validation of this system.