Go to the main menu
Skip to content
Go to bottom
REFERENCE LINKING PLATFORM OF KOREA S&T JOURNALS
> Journal Vol & Issue
Journal of Information Processing Systems
Journal Basic Information
Journal DOI :
Korea Information Processing Society
Editor in Chief :
Volume & Issues
Volume 9, Issue 4 - Dec 2013
Volume 9, Issue 3 - Sep 2013
Volume 9, Issue 2 - Jun 2013
Volume 9, Issue 1 - Mar 2013
Selecting the target year
Interactive Semantic Image Retrieval
Patil, Pushpa B. ; Kokare, Manesh B. ;
Journal of Information Processing Systems, volume 9, issue 3, 2013, Pages 349~364
DOI : 10.3745/JIPS.2013.9.3.349
The big challenge in current content-based image retrieval systems is to reduce the semantic gap between the low level-features and high-level concepts. In this paper, we have proposed a novel framework for efficient image retrieval to improve the retrieval results significantly as a means to addressing this problem. In our proposed method, we first extracted a strong set of image features by using the dual-tree rotated complex wavelet filters (DT-RCWF) and dual tree-complex wavelet transform (DT-CWT) jointly, which obtains features in 12 different directions. Second, we presented a relevance feedback (RF) framework for efficient image retrieval by employing a support vector machine (SVM), which learns the semantic relationship among images using the knowledge, based on the user interaction. Extensive experiments show that there is a significant improvement in retrieval performance with the proposed method using SVMRF compared with the retrieval performance without RF. The proposed method improves retrieval performance from 78.5% to 92.29% on the texture database in terms of retrieval accuracy and from 57.20% to 94.2% on the Corel image database, in terms of precision in a much lower number of iterations.
An Efficient Load Balancing Scheme for Multi-Gateways in Wireless Mesh Networks
Liu, Junping ; Chung, Sang-Hwa ;
Journal of Information Processing Systems, volume 9, issue 3, 2013, Pages 365~378
DOI : 10.3745/JIPS.2013.9.3.365
In Wireless Mesh Networks (WMNs), we usually deploy multiple Internet Gateways (IGWs) to improve the capacity of WMNs. As most of the traffic is oriented towards the Internet and may not be distributed evenly among different IGWs, some IGWs may suffer from bottleneck problem. To solve the IGW bottleneck problem, we propose an efficient scheme to balance the load among different IGWs within a WMN. Our proposed load-balancing scheme consists of two parts: a traffic load calculation module and a traffic load migration algorithm. The IGW can judge whether the congestion has occurred or will occur by using a linear smoothing forecasting method. When the IGW detects that the congestion has occurred or will occur, it will firstly select another available IGW that has the lightest traffic load as the secondary IGW and then inform some mesh routers (MPs) which have been selected by using the Knapsack Algorithm to change to the secondary IGW. The MPs can return to their primary IGW by using a regression algorithm. Our Qualnet 5.0 experiment results show that our proposed scheme gives up to 18% end-to-end delay improvement compared with the existing schemes.
Round Robin with Server Affinity: A VM Load Balancing Algorithm for Cloud Based Infrastructure
Mahajan, Komal ; Makroo, Ansuyia ; Dahiya, Deepak ;
Journal of Information Processing Systems, volume 9, issue 3, 2013, Pages 379~394
DOI : 10.3745/JIPS.2013.9.3.379
Cloud computing is an evolving computing paradigm that has influenced every other entity in the globalized industry, whether it is in the public sector or the private sector. Considering the growing importance of cloud, finding new ways to improve cloud services is an area of concern and research focus. The limitation of the available Virtual Machine Load balancing policies for cloud is that they do not save the state of the previous allocation of a virtual machine to a request from a Userbase and the algorithm requires execution each time a new request for Virtual Machine allocation is received from the Userbase. This problem can be resolved by developing an efficient virtual machine load balancing algorithm for the cloud and by doing a comparative analysis of the proposed algorithm with the existing algorithms.
Classifying Malicious Web Pages by Using an Adaptive Support Vector Machine
Hwang, Young Sup ; Kwon, Jin Baek ; Moon, Jae Chan ; Cho, Seong Je ;
Journal of Information Processing Systems, volume 9, issue 3, 2013, Pages 395~404
DOI : 10.3745/JIPS.2013.9.3.395
In order to classify a web page as being benign or malicious, we designed 14 basic and 16 extended features. The basic features that we implemented were selected to represent the essential characteristics of a web page. The system heuristically combines two basic features into one extended feature in order to effectively distinguish benign and malicious pages. The support vector machine can be trained to successfully classify pages by using these features. Because more and more malicious web pages are appearing, and they change so rapidly, classifiers that are trained by old data may misclassify some new pages. To overcome this problem, we selected an adaptive support vector machine (aSVM) as a classifier. The aSVM can learn training data and can quickly learn additional training data based on the support vectors it obtained during its previous learning session. Experimental results verified that the aSVM can classify malicious web pages adaptively.
A New Approach for Information Security using an Improved Steganography Technique
Juneja, Mamta ; Sandhu, Parvinder Singh ;
Journal of Information Processing Systems, volume 9, issue 3, 2013, Pages 405~424
DOI : 10.3745/JIPS.2013.9.3.405
This research paper proposes a secured, robust approach of information security using steganography. It presents two component based LSB (Least Significant Bit) steganography methods for embedding secret data in the least significant bits of blue components and partial green components of random pixel locations in the edges of images. An adaptive LSB based steganography is proposed for embedding data based on the data available in MSB`s (Most Significant Bits) of red, green, and blue components of randomly selected pixels across smooth areas. A hybrid feature detection filter is also proposed that performs better to predict edge areas even in noisy conditions. AES (Advanced Encryption Standard) and random pixel embedding is incorporated to provide two-tier security. The experimental results of the proposed approach are better in terms of PSNR and capacity. The comparison analysis of output results with other existing techniques is giving the proposed approach an edge over others. It has been thoroughly tested for various steganalysis attacks like visual analysis, histogram analysis, chi-square, and RS analysis and could sustain all these attacks very well.
An Architecture for Home-Oriented IPTV Service Platform on Residential Gateway
Kim, Pyung Soo ;
Journal of Information Processing Systems, volume 9, issue 3, 2013, Pages 425~434
DOI : 10.3745/JIPS.2013.9.3.425
In order for end-users in home networks to receive opportunities for useful services that go beyond legacy Internet Protocol TV (IPTV) services, this paper proposes a service platform that resides on the residential gateway (RG) for interworking between the home network and IPTV. This proposed service platform is called the home-oriented IPTV service platform (HISP) on the RG (HISP-RG). The proposed HISP-RG provides open architecture and functionalities to enable 3rd party IPTV service providers to locally and directly deliver home-oriented IPTV services to end-users in home networks. The HISP-RG can be an "add-on" and not a "built-in" solution for the existing standard RG. This paper introduces several home-oriented IPTV services that can be executed and delivered locally through the HISP-RG. Then, the open architecture and functionalities of the HISP-RG are defined and their requirements are specified. Finally, use cases of the HISP-RG for home-oriented IPTV services are presented.
A Regularity-Based Preprocessing Method for Collaborative Recommender Systems
Toledo, Raciel Yera ; Mota, Yaile Caballero ; Borroto, Milton Garcia ;
Journal of Information Processing Systems, volume 9, issue 3, 2013, Pages 435~460
DOI : 10.3745/JIPS.2013.9.3.435
Recommender systems are popular applications that help users to identify items that they could be interested in. A recent research area on recommender systems focuses on detecting several kinds of inconsistencies associated with the user preferences. However, the majority of previous works in this direction just process anomalies that are intentionally introduced by users. In contrast, this paper is centered on finding the way to remove non-malicious anomalies, specifically in collaborative filtering systems. A review of the state-of-the-art in this field shows that no previous work has been carried out for recommendation systems and general data mining scenarios, to exactly perform this preprocessing task. More specifically, in this paper we propose a method that is based on the extraction of knowledge from the dataset in the form of rating regularities (similar to frequent patterns), and their use in order to remove anomalous preferences provided by users. Experiments show that the application of the procedure as a preprocessing step improves the performance of a data-mining task associated with the recommendation and also effectively detects the anomalous preferences.
Anonymous Authentication Scheme based on NTRU for the Protection of Payment Information in NFC Mobile Environment
Park, Sung-Wook ; Lee, Im-Yeong ;
Journal of Information Processing Systems, volume 9, issue 3, 2013, Pages 461~476
DOI : 10.3745/JIPS.2013.9.3.461
Recently, smart devices for various services have been developed using converged telecommunications, and the markets for near field communication mobile services is expected to grow rapidly. In particular, the realization of mobile NFC payment services is expected to go commercial, and it is widely attracting attention both on a domestic and global level. However, this realization would increase privacy infringement, as personal information is extensively used in the NFC technology. One example of such privacy infringement would be the case of the Google wallet service. In this paper, we propose an zero-knowledge proof scheme and ring signature based on NTRU for protecting user information in NFC mobile payment systems without directly using private financial information of the user.
Self-Localized Packet Forwarding in Wireless Sensor Networks
Dubey, Tarun ; Sahu, O.P. ;
Journal of Information Processing Systems, volume 9, issue 3, 2013, Pages 477~488
DOI : 10.3745/JIPS.2013.9.3.477
Wireless Sensor Networks (WSNs) are comprised of sensor nodes that forward data in the shape of packets inside a network. Proficient packet forwarding is a prerequisite in sensor networks since many tasks in the network, together with redundancy evaluation and localization, depend upon the methods of packet forwarding. With the motivation to develop a fault tolerant packet forwarding scheme a Self-Localized Packet Forwarding Algorithm (SLPFA) to control redundancy in WSNs is proposed in this paper. The proposed algorithm infuses the aspects of the gossip protocol for forwarding packets and the end to end performance of the proposed algorithm is evaluated for different values of node densities in the same deployment area by means of simulations.
A Simulation Model of Object Movement for Evaluating the Communication Load in Networked Virtual Environments
Lim, Mingyu ; Lee, Yunjin ;
Journal of Information Processing Systems, volume 9, issue 3, 2013, Pages 489~498
DOI : 10.3745/JIPS.2013.9.3.489
In this paper, we propose a common simulation model that can be reused for different performance evaluations of networked virtual environments. To this end, we analyzed the common features of NVEs, in which multiple regions compose a shared space, and where a user has his/her own interest area. Communication architecture can be client-server or peer-server models. In usual simulations, users move around the world while the number of users varies with the system. Our model provides various simulation parameters to customize the region configuration and user movement pattern. Furthermore, our model introduces a way to mimic a lot of users in a minimal experiment environment. The proposed model is integrated with our network framework, which supports various scalability approaches. We specifically applied our model to the interest management and load distribution schemes to evaluate communication overhead. With the proposed simulation model, a new simulation can be easily designed in a large-scale environment.
Hardware Software Co-Simulation of the Multiple Image Encryption Technique Using the Xilinx System Generator
Panduranga, H.T. ; Naveen, Kumar S.K. ; Sharath, Kumar H.S. ;
Journal of Information Processing Systems, volume 9, issue 3, 2013, Pages 499~510
DOI : 10.3745/JIPS.2013.9.3.499
Hardware-Software co-simulation of a multiple image encryption technique shall be described in this paper. Our proposed multiple image encryption technique is based on the Latin Square Image Cipher (LSIC). First, a carrier image that is based on the Latin Square is generated by using 256-bits of length key. The XOR operation is applied between an input image and the Latin Square Image to generate an encrypted image. Then, the XOR operation is applied between the encrypted image and the second input image to encrypt the second image. This process is continues until the nth input image is encrypted. We achieved hardware co-simulation of the proposed multiple image encryption technique by using the Xilinx System Generator (XSG). This encryption technique is modeled using Simulink and XSG Block set and synthesized onto Virtex 2 pro FPGA device. We validated our proposed technique by using the hardware software co-simulation method.