Digital Library

Vol. 13, No. 3, Jun. 2017  

1. [EDITORIAL] New Approaches to Advanced Network and Image Processing
   Jong Hyuk Park
   Vol. 13, No. 3, pp. 429-434, Jun. 2017  
   https://doi.org/10.3745/JIPS.00.0005
   Details
   Keywords:
   Show / Hide Abstract

   The Journal of Information Processing Systems (JIPS) publishes a broad array of subjects related to information communication technology across prevalent and advanced fields including system, network, architecture, algorithm, application, security, and so forth. As the official international journal published by the Korean Information Processing Society and a prominent, multidisciplinary journal throughout the world, JIPS is being indexed in ESCI, SCOPUS, EI COMPENDEX, DOI, DBLP, EBSCO, Google Scholar, and CrossRef. The purpose of JIPS is to provide a prominent, influential forum wherein researchers and professionals gather to promote, share, and discuss all major research issues and developments. Published theoretical and practical articles have contributed to related research areas by presenting new techniques, concepts, or analyses, featuring experience reports, experiments involving the implementation and application of new theories, and tutorials on state-of-the-art technologies related to information processing systems. The subjects covered by this journal include, but are not limited to, topics related to computer systems and theories, multimedia systems and graphics, communication systems and security, and software systems and applications


2. Granular Bidirectional and Multidirectional Associative Memories: Towards a Collaborative Buildup of Granular Mappings
   Witold Pedrycz
   Vol. 13, No. 3, pp. 435-447, Jun. 2017  
   https://doi.org/10.3745/JIPS.02.0058
   Details
   Keywords: Allocation of Information Granularity and Optimization, Bidirectional Associative Memory, Collaborative Clustering, Granular Computing, Multi-directional Associative Memory, Prototypes
   Show / Hide Abstract

   Associative and bidirectional associative memories are examples of associative structures studied intensively in the literature. The underlying idea is to realize associative mapping so that the recall processes (one- directional and bidirectional ones) are realized with minimal recall errors. Associative and fuzzy associative memories have been studied in numerous areas yielding efficient applications for image recall and enhancements and fuzzy controllers, which can be regarded as one-directional associative memories. In this study, we revisit and augment the concept of associative memories by offering some new design insights where the corresponding mappings are realized on the basis of a related collection of landmarks (prototypes) over which an associative mapping becomes spanned. In light of the bidirectional character of mappings, we have developed an augmentation of the existing fuzzy clustering (fuzzy c-means, FCM) in the form of a so- called collaborative fuzzy clustering. Here, an interaction in the formation of prototypes is optimized so that the bidirectional recall errors can be minimized. Furthermore, we generalized the mapping into its granular version in which numeric prototypes that are formed through the clustering process are made granular so that the quality of the recall can be quantified. We propose several scenarios in which the allocation of information granularity is aimed at the optimization of the characteristics of recalled results (information granules) that are quantified in terms of coverage and specificity. We also introduce various architectural augmentations of the associative structures.


3. Blind Image Quality Assessment on Gaussian Blur Images
   Liping Wang, Chengyou Wang, Xiao Zhou
   Vol. 13, No. 3, pp. 448-463, Jun. 2017  
   https://doi.org/10.3745/JIPS.02.0059
   Details
   Keywords: Blind Image Quality Assessment (BIQA), Gaussian Blur Image, Saliency Map, Structure Tensor, Structural Similarity (SSIM)
   Show / Hide Abstract

   Multimedia is a ubiquitous and indispensable part of our daily life and learning such as audio, image, and video. Objective and subjective quality evaluations play an important role in various multimedia applications. Blind image quality assessment (BIQA) is used to indicate the perceptual quality of a distorted image, while its reference image is not considered and used. Blur is one of the common image distortions. In this paper, we propose a novel BIQA index for Gaussian blur distortion based on the fact that images with different blur degree will have different changes through the same blur. We describe this discrimination from three aspects: color, edge, and structure. For color, we adopt color histogram; for edge, we use edge intensity map, and saliency map is used as the weighting function to be consistent with human visual system (HVS); for structure, we use structure tensor and structural similarity (SSIM) index. Numerous experiments based on four benchmark databases show that our proposed index is highly consistent with the subjective quality assessment.


4. Content-Based Image Retrieval Using Combined Color and Texture Features Extracted by Multi-resolution Multi-direction Filtering
   Hee-Hyung Bu, Nam-Chul Kim, Chae-Joo Moon, Jong-Hwa Kim
   Vol. 13, No. 3, pp. 464-475, Jun. 2017  
   https://doi.org/10.3745/JIPS.02.0060
   Details
   Keywords: Color and Texture Feature, Content-Based Image Retrieval, HSV Color Space, Multi-resolution Multi-direction Filtering
   Show / Hide Abstract

   In this paper, we present a new texture image retrieval method which combines color and texture features extracted from images by a set of multi-resolution multi-direction (MRMD) filters. The MRMD filter set chosen is simple and can be separable to low and high frequency information, and provides efficient multi- resolution and multi-direction analysis. The color space used is HSV color space separable to hue, saturation, and value components, which are easily analyzed as showing characteristics similar to the human visual system. This experiment is conducted by comparing precision vs. recall of retrieval and feature vector dimensions. Images for experiments include Corel DB and VisTex DB; Corel_MR DB and VisTex_MR DB, which are transformed from the aforementioned two DBs to have multi-resolution images; and Corel_MD DB and VisTex_MD DB, transformed from the two DBs to have multi-direction images. According to the experimental results, the proposed method improves upon the existing methods in aspects of precision and recall of retrieval, and also reduces feature vector dimensions.


5. NDynamic Framework for Secure VM Migration over Cloud Computing
   Suresh B. Rathod, V. Krishna Reddy
   Vol. 13, No. 3, pp. 476-490, Jun. 2017  
   https://doi.org/10.3745/JIPS.01.0015
   Details
   Keywords: Cloud computing, Datacenter (DC), Host Controller, Physical Host, Virtual Machine (VM)
   Show / Hide Abstract

   In the centralized cloud controlled environment, the decision-making and monitoring play crucial role where in the host controller (HC) manages the resources across hosts in data center (DC). HC does virtual machine (VM) and physical hosts management. The VM management includes VM creation, monitoring, and migration. If HC down,the services hosted by various hosts in DC can’t be accessed outside the DC. Decentralized VM management avoids centralized failure by considering one of the hosts from DC as HC that helps in maintaining DC in running state. Each host in DC has many VM’s with the threshold limit beyond which it can’t provide service.To maintain threshold , the host’s in DC does VM migration across various hosts. The data in migration is in the form of plaintext, the intruder can analyze packet movement and can control hosts traffic. The incorporation of security mechanism on hosts in DC helps protecting data in migration. This paper discusses an approach for dynamic HC selection, VM selection and secure VM migration over cloud environment.


6. A Fast Ground Segmentation Method for 3D Point Cloud
   Phuong Chu, Seoungjae Cho, Sungdae Sim, Kiho Kwak, Kyungeun Cho
   Vol. 13, No. 3, pp. 491-499, Jun. 2017  
   https://doi.org/10.3745/JIPS.02.0061
   Details
   Keywords: 3D point cloud, Ground Segmentation, Light Detection and Ranging, Start-Ground Point, Threshold Point
   Show / Hide Abstract

   In this study, we proposed a new approach to segment ground and nonground points gained from a 3D laser range sensor. The primary aim of this research was to provide a fast and effective method for ground segmentation. In each frame, we divide the point cloud into small groups. All threshold points and start- ground points in each group are then analyzed. To determine threshold points we depend on three features: gradient, lost threshold points, and abnormalities in the distance between the sensor and a particular threshold point. After a threshold point is determined, a start-ground point is then identified by considering the height difference between two consecutive points. All points from a start-ground point to the next threshold point are ground points. Other points are nonground. This process is then repeated until all points are labelled


7. An Improved Zone-Based Routing Protocol for Heterogeneous Wireless Sensor Networks
   Liquan Zhao, Nan Chen
   Vol. 13, No. 3, pp. 500-517, Jun. 2017  
   https://doi.org/10.3745/JIPS.03.0072
   Details
   Keywords: energy consumption, Heterogeneous Wireless Sensor Networks, Stable Election Protocol, Zone-based
   Show / Hide Abstract

   In this paper, an improved zone-based routing protocol for heterogeneous wireless sensor networks is proposed. The proposed protocol has fixed the sized zone according to the distance from the base station and used a dynamic clustering technique for advanced nodes to select a cluster head with maximum residual energy to transmit the data. In addition, we select an optimal route with minimum energy consumption for normal nodes and conserve energy by state transition throughout data transmission. Simulation results indicated that the proposed protocol performed better than the other algorithm by reducing energy consumption and providing a longer network lifetime and better throughput of data packets


8. Development of a CUBRID-Based Distributed Parallel Query Processing System
   Hyeong-Il Kim, HyeonSik Yang, Min Yoon, Jae-Woo Chang
   Vol. 13, No. 3, pp. 518-532, Jun. 2017  
   https://doi.org/10.3745/JIPS.01.0016
   Details
   Keywords: CUBRID, Distributed Parallel Environment, Query Processing
   Show / Hide Abstract

   Due to the rapid growth of the amount of data, research on bigdata processing has been highlighted. For bigdata processing, CUBRID Shard is able to support query processing in parallel way by dividing the database into a number of CUBRID servers. However, CUBRID Shard can answer a user’s query only when the query is required to gain accesses to a single CUBRID server, instead of multiple ones. To solve the problem, in this paper we propose a CUBRID based distributed parallel query processing system that can answer a user’s query in parallel and distributed manner. Finally, through the performance evaluation, we show that our proposed system provides 2–3 times better performance on query processing time than the existing CUBRID Shard


9. Improvement of OPW-TR Algorithm for Compressing GPS Trajectory Data
   Qingbin Meng, Xiaoqiang Yu, Chunlong Yao, Xu Li, Peng Li, Xin Zhao
   Vol. 13, No. 3, pp. 533-545, Jun. 2017  
   https://doi.org/10.3745/JIPS.03.0073
   Details
   Keywords: ASED, GPS Trajectory, SED, Trajectory Compression
   Show / Hide Abstract

   Massive volumes of GPS trajectory data bring challenges to storage and processing. These issues can be addressed by compression algorithm which can reduce the size of the trajectory data. A key requirement for GPS trajectory compression algorithm is to reduce the size of the trajectory data while minimizing the loss of information. Synchronized Euclidean distance (SED) as an important error measure is adopted by most of the existing algorithms. In order to further reduce the SED error, an improved algorithm for open window time ratio (OPW-TR) called local optimum open window time ratio (LO-OPW-TR) is proposed. In order to make SED error smaller, the anchor points are selected by calculating point’s accumulated synchronized Euclidean distance (ASED). A variety of error metrics are used for the algorithm evaluation. The experimental results show that the errors of our algorithm are smaller than the existing algorithms in terms of SED and speed errors under the same compression ratio


10. Multicast Tree Construction with User-Experienced Quality for Multimedia Mobile Networks
    Hoejung Jung, Namgi Kim
    Vol. 13, No. 3, pp. 546-558, Jun. 2017  
    https://doi.org/10.3745/JIPS.01.0017
    Details
    Keywords: GTM, Mobile Network, Multicast Tree Construction, SDN
    Show / Hide Abstract

    The amount of multimedia traffic over the Internet has been increasing because of the development of networks and mobile devices. Accordingly, studies on multicast, which is used to provide efficient multimedia and video services, have been conducted. In particular, studies on centralized multicast tree construction have attracted attention with the advent of software-defined networking. Among the centralized multicast tree construction algorithms, the group Takahashi and Matsuyama (GTM) algorithm is the most commonly used in multiple multicast tree construction. However, the GTM algorithm considers only the network-cost overhead when constructing multicast trees; it does not consider the temporary service disruption that arises from a link change for users receiving an existing service. Therefore, in this study, we propose a multiple multicast tree construction algorithm that can reduce network cost while avoiding considerable degradation of service quality to users. This is accomplished by considering both network-cost and link-change overhead of users. Experimental results reveal that, compared to the GTM algorithm, the proposed algorithm significantly improves the user-experienced quality of service by substantially reducing the number of link- changed users while only slightly adding to the network-cost overhead.


11. Cyberbullying and a Mobile Game App? An Initial Perspective on an Alternative Solution
    Manmeet Mahinderjit Singh, Ping Jie Ng, Kar Ming Yap, Mohd Heikal Husin, Nurul Hashimah Ahamed Hassain Malim
    Vol. 13, No. 3, pp. 559-572, Jun. 2017  
    https://doi.org/10.3745/JIPS.04.0033
    Details
    Keywords: Cyberbullying, Digital Etiquette, Intrusion Detection System, Mobile Application, Social Network
    Show / Hide Abstract

    Cyberbullying has been an emerging issue in recent years where research has revealed that users generally spend an increasing amount of time in social networks and forums to keep connected with each other. However, issue arises when cyberbullies are able to reach their victims through these social media platforms. There are different types of cyberbullying and like traditional bullying; it causes victims to feel overly self- conscious, increases their tendency to self-harm and generally affects their mental state negatively. Such situations occur due to security issues such as user anonymity and the lack of content restrictions in some social networks or web forums. In this paper, we highlight the existing solutions, which are Intrusion Prevention System and Intrusion Detection System from a number of researchers. However, even with such solutions, cyberbullying acts still occurs at an alarming rate. As such, we proposed an alternative solution that aims to prevent cyberbullying activities at a younger age, e.g., young children. The application would provide an alternative method to preventing cyberbullying activities among the younger generations in the future


12. Query with SUM Aggregate Function on Encrypted Floating-Point Numbers in Cloud
    Taipeng Zhu, Xianxia Zou, Jiuhui Pan
    Vol. 13, No. 3, pp. 573-589, Jun. 2017  
    https://doi.org/10.3745/JIPS.04.0034
    Details
    Keywords: Coding Scheme, DoubleListTree, Encryption, Floating-Point Numbers, Summation
    Show / Hide Abstract

    Cloud computing is an attractive solution that can provide low cost storage and powerful processing capabilities for government agencies or enterprises of small and medium size. Yet the confidentiality of information should be considered by any organization migrating to cloud, which makes the research on relational database system based on encryption schemes to preserve the integrity and confidentiality of data in cloud be an interesting subject. So far there have been various solutions for realizing SQL queries on encrypted data in cloud without decryption in advance, where generally homomorphic encryption algorithm is applied to support queries with aggregate functions or numerical computation. But the existing homomorphic encryption algorithms cannot encrypt floating-point numbers. So in this paper, we present a mechanism to enable the trusted party to encrypt the floating-points by homomorphic encryption algorithm and partial trusty server to perform summation on their ciphertexts without revealing the data itself. In the first step, we encode floating-point numbers to hide the decimal points and the positive or negative signs. Then, the codes of floating-point numbers are encrypted by homomorphic encryption algorithm and stored as sequences in cloud. Finally, we use the data structure of DoubleListTree to implement the aggregate function of SUM and later do some extra processes to accomplish the summation


13. Fire Detection Using Multi-Channel Information and Gray Level Co-occurrence Matrix Image Features
    Jae-Hyun Jun, Min-Jun Kim, Yong-Suk Jang, Sung-Ho Kim
    Vol. 13, No. 3, pp. 590-598, Jun. 2017  
    https://doi.org/10.3745/JIPS.02.0062
    Details
    Keywords: Color Features, Fire Detection, Texture Features
    Show / Hide Abstract

    Recently, there has been an increase in the number of hazardous events, such as fire accidents. Monitoring systems that rely on human resources depend on people; hence, the performance of the system can be degraded when human operators are fatigued or tensed. It is easy to use fire alarm boxes; however, these are frequently activated by external factors such as temperature and humidity. We propose an approach to fire detection using an image processing technique. In this paper, we propose a fire detection method using multi- channel information and gray level co-occurrence matrix (GLCM) image features. Multi-channels consist of RGB, YCbCr, and HSV color spaces. The flame color and smoke texture information are used to detect the flames and smoke, respectively. The experimental results show that the proposed method performs better than the previous method in terms of accuracy of fire detection


14. Copyright Protection for Digital Image by Watermarking Technique
    Suhad A. Ali, Majid Jabbar Jawad, Mohammed Abdullah Naser
    Vol. 13, No. 3, pp. 599-617, Jun. 2017  
    https://doi.org/10.3745/JIPS.03.0074
    Details
    Keywords: Digital watermarking, Discrete Cosine Transform (DCT), Normalized Correlation (NC), PSNR
    Show / Hide Abstract

    Due to the rapid growth and expansion of the Internet, the digital multimedia such as image, audio and video are available for everyone. Anyone can make unauthorized copying for any digital product. Accordingly, the owner of these products cannot protect his ownership. Unfortunately, this situation will restrict any improvement which can be done on the digital media production in the future. Some procedures have been proposed to protect these products such as cryptography and watermarking techniques. Watermarking means embedding a message such as text, the image is called watermark, yet, in a host such as a text, an image, an audio, or a video, it is called a cover. Watermarking can provide and ensure security, data authentication and copyright protection for the digital media. In this paper, a new watermarking method of still image is proposed for the purpose of copyright protection. The procedure of embedding watermark is done in a transform domain. The discrete cosine transform (DCT) is exploited in the proposed method, where the watermark is embedded in the selected coefficients according to several criteria. With this procedure, the deterioration on the image is minimized to achieve high invisibility. Unlike the traditional techniques, in this paper, a new method is suggested for selecting the best blocks of DCT coefficients. After selecting the best DCT coefficients blocks, the best coefficients in the selected blocks are selected as a host in which the watermark bit is embedded. The coefficients selection is done depending on a weighting function method, where this function exploits the values and locations of the selected coefficients for choosing them. The experimental results proved that the proposed method has produced good imperceptibility and robustness for different types of attacks


15. HESnW: History Encounters-Based Spray-and-Wait Routing Protocol for Delay Tolerant Networks
    Shunyi Gan, Jipeng Zhou, Kaimin Wei
    Vol. 13, No. 3, pp. 618-629, Jun. 2017  
    https://doi.org/10.3745/JIPS.03.0075
    Details
    Keywords: Delivery Cost, DTNs, History Node, Multiple Probability, Spray-and-Wait
    Show / Hide Abstract

    Mobile nodes can't always connect each other in DTNs (delay tolerant networks). Many DTN routing protocols that favor the “multi-hop forwarding” are proposed to solve these network problems. But they also lead to intolerant delivery cost so that designing a overhead-efficient routing protocol which is able to perform well in delivery ratio with lower delivery cost at the same time is valuable. Therefore, we utilize the small-world property and propose a new delivery metric called multi-probability to design our relay node selection principles that nodes with lower delivery predictability can also be selected to be the relay nodes if one of their history nodes has higher delivery predictability. So, we can find more potential relay nodes to reduce the forwarding overhead of successfully delivered messages through our proposed algorithm called HESnW. We also apply our new messages copies allocation scheme to optimize the routing performance. Comparing to existing routing algorithms, simulation results show that HESnW can reduce the delivery cost while it can also obtain a rather high delivery ratio.


16. Achievable Rate Analysis for Opportunistic Non-orthogonal Multiple Access-Based Cooperative Relaying Systems
    In-Ho Lee, Howon Lee
    Vol. 13, No. 3, pp. 630-642, Jun. 2017  
    https://doi.org/10.3745/JIPS.03.0076
    Details
    Keywords: Achievable Rate Analysis, Decode-and-Forward Relaying, Non-orthogonal Multiple Access, Opportunistic Transmission, Rayleigh Fading Channels, Superposition Coding
    Show / Hide Abstract

    In this paper, we propose the opportunistic non-orthogonal multiple access (NOMA)-based cooperative relaying system (CRS) with channel state information (CSI) available at the source, where CSI for the source- to-destination and source-to-relay links is used for opportunistic transmission. Using the CSI, for opportunistic transmission, the source instantaneously chooses between the direct transmission and the cooperative NOMA transmission. We provide an asymptotic expression for the average achievable rate of the opportunistic NOMA-based CRS under Rayleigh fading channels. We verify the asymptotic analysis through Monte Carlo simulations, and compare the average achievable rates of the opportunistic NOMA-based CRS and the conventional one for various channel powers and power allocation coefficients used for NOMA