Journal of Information Processing Systems

The Journal of Information Processing Systems (JIPS) is the official international journal of the Korea Information Processing Society. As information processing systems are progressing at a rapid pace, the Korea Information Processing Society is committed to providing researchers and other professionals with the academic information and resources they need to keep abreast with ongoing developments. The JIPS aims to be a premier source that enables researchers and professionals all over the world to promote, share, and discuss all major research issues and developments in the field of information processing systems and other related fields.

ISSN: 1976-913X (Print), ISSN: 2092-805X (Online)

JIPS
[Aug. 20, 2017] Call for 2017 JIPS survey paper awards is opened. Please refer to here for details.
[Dec. 12, 2016] Call for papers about Special sections scheduled in 2017 are registered. Please refer to here for details.
[Oct. 1, 2016] Call for papers about a new special issue titled "Smart Standards, Algorithms and Frameworks for Interoperability in Internet of Things" is now registered. Please refer to here for details.
[Aug. 20, 2016] Since August 20, 2016, the JIPS has started to manage two fast tracks as well as the regular track, and authors has been required to pay the publication charge. Please refer to the details on the author information page.
[Aug. 1, 2016] Since August 2016, the JIPS has been indexed in "Emerging Sources Citation Index (ESCI)", a new Web of Science index managed by Thomson Reuters, launched in late 2015 for journals that have passed an initial evaluation for inclusion in SCI/SCIE/AHCI/SSCI indexes. Indexing in the ESCI will improve the visibility of the JIPS and provide a mark of quality. This achievement is good for all authors of the JIPS. For more information about ESCI, please see the ESCI fact sheet file.

Latest Publications

Journal of Information Processing Systems, Vol. 13, No.5, 2017

Efficient Approaches to Computer Vision and Pattern Recognition
Jong Hyuk Park
Page: 1043~1051, Vol. 13, No.5, 2017
10.3745/JIPS.00.0007
Keywords:
Show / Hide Abstract
The Journal of Information Processing Systems (JIPS) publishes a wide range of topics related to a wide variety of advanced information and communication technologies, including systems, networks, architectures, algorithms, applications, and security. JIPS is the official international journal published by the Korea Information Processing Society and is the world's leading academic journal indexed by ESCI, SCOPUS, EI COMPENDEX, DOI, DBLP, EBSCO, Google Scholar, and CrossRef. The purpose of JIPS is to provide an outstanding, influential forum where researchers and experts gather to promote, share, and discuss crucial research issues and developments. The published theoretical and practical articles contribute to the relevant research area by presenting cutting-edge techniques related to information processing including new theories, approaches, concepts, analysis, functional experience reports, implementations, and applications. Topics covered in this journal include, but are not limited to, computer systems and theory, multimedia systems and graphics, communication systems and security, software systems, and applications.


A CTR Prediction Approach for Text Advertising Based on the SAE-LR Deep Neural Network
Zilong Jiang, Shu Gao and Wei Dai
Page: 1052~1070, Vol. 13, No.5, 2017
10.3745/JIPS.02.0069
Keywords: Deep Neural Network, Machine Learning, Text Advertising, SAE-LR
Show / Hide Abstract
For the autoencoder (AE) implemented as a construction component, this paper uses the method of greedy layer-by-layer pre-training without supervision to construct the stacked autoencoder (SAE) to extract the abstract features of the original input data, which is regarded as the input of the logistic regression (LR) model, after which the click-through rate (CTR) of the user to the advertisement under the contextual environment can be obtained. These experiments show that, compared with the usual logistic regression model and support vector regression model used in the field of predicting the advertising CTR in the industry, the SAE-LR model has a relatively large promotion in the AUC value. Based on the improvement of accuracy of advertising CTR prediction, the enterprises can accurately understand and have cognition for the needs of their customers, which promotes the multi-path development with high efficiency and low cost under the condition of internet finance.


Outage Performance of Selective Dual-Hop MIMO Relaying with OSTBC and Transmit Antenna Selection in Rayleigh Fading Channels
In-Ho Lee, Hyun-Ho Choi and Howon Lee
Page: 1071~1088, Vol. 13, No.5, 2017
10.3745/JIPS.03.0077
Keywords: Dual-Hop Relaying, Orthogonal Space-Time Block Code, Outage Probability, Rayleigh Fading, Transmit Antenna Selection
Show / Hide Abstract
For dual-hop multiple-input multiple-output (MIMO) decode-and-forward relaying systems, we propose a selective relaying scheme that uses orthogonal space-time block code (OSTBC) and transmit antenna selection with maximal-ratio combining (TAS/MRC) or vice versa at the first and second hops, respectively. The aim is to achieve an asymptotically identical performance to the dual-hop relaying system with only TAS/MRC, while requiring lower feedback overhead. In particular, we give the selection criteria based on the antenna configurations and the average channel powers for the first and second hops, assuming Rayleigh fading channels. Also, the numerical results are shown for the outage performance comparison between the dual-hop DF relaying systems with the proposed scheme, only TAS/MRC, and only OSTBC.


Test Set Generation for Pairwise Testing Using Genetic Algorithms
Sangeeta Sabharwal and Manuj Aggarwal
Page: 1089~1102, Vol. 13, No.5, 2017
10.3745/JIPS.04.0019
Keywords: Combinatorial Testing, Genetic Algorithm, Mixed Covering Arrays, Pairwise Testing, Test Set, t-way Testing
Show / Hide Abstract
In software systems, it has been observed that a fault is often caused by an interaction between a small number of input parameters. Even for moderately sized software systems, exhaustive testing is practically impossible to achieve. This is either due to time or cost constraints. Combinatorial (t-way) testing provides a technique to select a subset of exhaustive test cases covering all of the t-way interactions, without much of a loss to the fault detection capability. In this paper, an approach is proposed to generate 2-way (pairwise) test sets using genetic algorithms. The performance of the algorithm is improved by creating an initial solution using the overlap coefficient (a similarity matrix). Two mutation strategies have also been modified to improve their efficiency. Furthermore, the mutation operator is improved by using a combination of three mutation strategies. A comparative survey of the techniques to generate t-way test sets using genetic algorithms was also conducted. It has been shown experimentally that the proposed approach generates faster results by achieving higher percentage coverage in a fewer number of generations. Additionally, the size of the mixed covering arrays was reduced in one of the six benchmark problems examined.


Extraction of ObjectProperty-UsageMethod Relation from Web Documents
Chaveevan Pechsiri, Sumran Phainoun and Rapeepun Piriyakul
Page: 1103~1125, Vol. 13, No.5, 2017
10.3745/JIPS.04.0046
Keywords: Medicinal Property, N-Word-Co, Semantic Relation, Usage-Method
Show / Hide Abstract
This paper aims to extract an ObjectProperty-UsageMethod relation, in particular the HerbalMedicinalProperty- UsageMethod relation of the herb-plant object, as a semantic relation between two related sets, a herbal- medicinal-property concept set and a usage-method concept set from several web documents. This HerbalMedicinalProperty-UsageMethod relation benefits people by providing an alternative treatment/solution knowledge to health problems. The research includes three main problems: how to determine EDU (where EDU is an elementary discourse unit or a simple sentence/clause) with a medicinal-property/usage-method concept; how to determine the usage-method boundary; and how to determine the HerbalMedicinalProperty- UsageMethod relation between the two related sets. We propose using N-Word-Co on the verb phrase with the medicinal-property/usage-method concept to solve the first and second problems where the N-Word-Co size is determined by the learning of maximum entropy, support vector machine, and nai?ve Bayes. We also apply nai?ve Bayes to solve the third problem of determining the HerbalMedicinalProperty-UsageMethod relation with N-Word-Co elements as features. The research results can provide high precision in the HerbalMedicinalProperty-UsageMethod relation extraction.


3D Segmentation for High-Resolution Image Datasets Using a Commercial Editing Tool in the IoT Environment
Koojoo Kwon and Byeong-Seok Shin
Page: 1126~1134, Vol. 13, No.5, 2017
10.3745/JIPS.02.0070
Keywords: Segmentation, Large-Scale Image, Photo Editing, Visible Korean, Volume Rendering
Show / Hide Abstract
A variety of medical service applications in the field of the Internet of Things (IoT) are being studied. Segmentation is important to identify meaningful regions in images and is also required in 3D images. Previous methods have been based on gray value and shape. The Visible Korean dataset consists of serially sectioned high-resolution color images. Unlike computed tomography or magnetic resonance images, automatic segmentation of color images is difficult because detecting an object’s boundaries in colored images is very difficult compared to grayscale images. Therefore, skilled anatomists usually segment color images manually or semi-automatically. We present an out-of-core 3D segmentation method for large-scale image datasets. Our method can segment significant regions in the coronal and sagittal planes, as well as the axial plane, to produce a 3D image. Our system verifies the result interactively with a multi-planar reconstruction view and a 3D view. Our system can be used to train unskilled anatomists and medical students. It is also possible for a skilled anatomist to segment an image remotely since it is difficult to transfer such large amounts of data.


Speech Query Recognition for Tamil Language Using Wavelet and Wavelet Packets
P. Iswarya and V. Radha
Page: 1135~1148, Vol. 13, No.5, 2017
10.3745/JIPS.02.0033
Keywords: De-noising, Feature Extraction, Speech Recognition, Support Vector Machine, Wavelet Packet
Show / Hide Abstract
Speech recognition is one of the fascinating fields in the area of Computer science. Accuracy of speech recognition system may reduce due to the presence of noise present in speech signal. Therefore noise removal is an essential step in Automatic Speech Recognition (ASR) system and this paper proposes a new technique called combined thresholding for noise removal. Feature extraction is process of converting acoustic signal into most valuable set of parameters. This paper also concentrates on improving Mel Frequency Cepstral Coefficients (MFCC) features by introducing Discrete Wavelet Packet Transform (DWPT) in the place of Discrete Fourier Transformation (DFT) block to provide an efficient signal analysis. The feature vector is varied in size, for choosing the correct length of feature vector Self Organizing Map (SOM) is used. As a single classifier does not provide enough accuracy, so this research proposes an Ensemble Support Vector Machine (ESVM) classifier where the fixed length feature vector from SOM is given as input, termed as ESVM_SOM. The experimental results showed that the proposed methods provide better results than the existing methods.


An Algorithm Solving SAT Problem Based on Splitting Rule and Extension Rule
Youjun Xu
Page: 1149~1157, Vol. 13, No.5, 2017
10.3745/JIPS.02.0071
Keywords: Extension Rule, IER, MOAMD Strategy, Satisfiability Problem, Splitting Rule
Show / Hide Abstract
The satisfiability problem is always a core problem in artificial intelligence (AI). And how to improve the efficiency of algorithms solving the satisfiability problem is widely concerned. Algorithm IER (Improved Extension Rule) is based on extension rule. The number of atoms and the number of clauses affect the efficiency of the algorithm IER. DPLL rules are helpful to reduce these numbers. Then a complete algorithm CIER based on splitting rule and extension rule is proposed in this paper in order to improve the efficiency. At first, the algorithm CIER (Complete Improved Extension Rule) reduces the scale of a clause set with DPLL rules. Then, the clause set is split into a group of small clause sets. In the end, the satisfiability of the clause set is got from these small clause sets’. A strategy MOAMD (maximum occurrences and maximum difference) for the algorithm CIER is given. With this strategy, a better arrangement of atoms could be got. This arrangement could make the number of small clause sets fewer and the scale of these sets smaller. So, the algorithm CIER will be more efficient.


Similarity Evalution between Graphs: A Formal Concept Analysis Approach
Fei Hao, Dae-Soo Sim, Doo-Soon Park and Hyung-Seok Seo
Page: 1158~1167, Vol. 13, No.5, 2017
10.3745/JIPS.04.0048
Keywords: Formal Concept Analysis, Graph, Social Networks, Similarity Evaluation
Show / Hide Abstract
Many real-world applications information are organized and represented with graph structure which is often used for representing various ubiquitous networks, such as World Wide Web, social networks, and protein- protein interactive networks. In particular, similarity evaluation between graphs is a challenging issue in many fields such as graph searching, pattern discovery, neuroscience, chemical compounds exploration and so forth. There exist some algorithms which are based on vertices or edges properties, are proposed for addressing this issue. However, these algorithms do not take both vertices and edges similarities into account. Towards this end, this paper pioneers a novel approach for similarity evaluation between graphs based on formal concept analysis. The feature of this approach is able to characterize the relationships between nodes and further reveal the similarity between graphs. Therefore, the highlight of our approach is to take vertices and edges into account simultaneously. The proposed algorithm is evaluated using a case study for validating the effectiveness of the proposed approach on detecting and measuring the similarity between graphs.


Regularization Parameter Selection for Total Variation Model Based on Local Spectral Response
Yuhui Zheng, Kai Ma, Qiqiong Yu, Jianwei Zhang and Jin Wang
Page: 1168~1182, Vol. 13, No.5, 2017
10.3745/JIPS.02.0072
Keywords: Image Denoising, Local Spectral Response, Regularization Parameter Selection
Show / Hide Abstract
In the past decades, various image regularization methods have been introduced. Among them, total variation model has drawn much attention for the reason of its low computational complexity and well-understood mathematical behavior. However, regularization parameter estimation of total variation model is still an open problem. To deal with this problem, a novel adaptive regularization parameter selection scheme is proposed in this paper, by means of using the local spectral response, which has the capability of locally selecting the regularization parameters in a content-aware way and therefore adaptively adjusting the weights between the two terms of the total variation model. Experiment results on simulated and real noisy image show the good performance of our proposed method, in visual improvement and peak signal to noise ratio value.


Image Restoration and Object Removal Using Prioritized Adaptive Patch-Based Inpainting in a Wavelet Domain
Rajesh P. Borole and Sanjiv V. Bonde
Page: 1183~1202, Vol. 13, No.5, 2017
10.3745/JIPS.02.0031
Keywords: Image Inpainting, Object Removal, Region Filling, Texture and Structure Propagation, Wavelet Inpainting
Show / Hide Abstract
Image restoration has been carried out by texture synthesis mostly for large regions and inpainting algorithms for small cracks in images. In this paper, we propose a new approach that allows for the simultaneous fill-in of different structures and textures by processing in a wavelet domain. A combination of structure inpainting and patch-based texture synthesis is carried out, which is known as patch-based inpainting, for filling and updating the target region. The wavelet transform is used for its very good multiresolution capabilities. The proposed algorithm uses the wavelet domain subbands to resolve the structure and texture components in smooth approximation and high frequency structural details. The subbands are processed separately by the prioritized patch-based inpainting with isophote energy driven texture synthesis at the core. The algorithm automatically estimates the wavelet coefficients of the target regions of various subbands using optimized patches from the surrounding DWT coefficients. The suggested performance improvement drastically improves execution speed over the existing algorithm. The proposed patch optimization strategy improves the quality of the fill. The fill-in is done with higher priority to structures and isophotes arriving at target boundaries. The effectiveness of the algorithm is demonstrated with natural and textured images with varying textural complexions.


A Detailed Analysis of Classifier Ensembles for Intrusion Detection in Wireless Network
Bayu Adhi Tama and Kyung-Hyune Rhee
Page: 1203~1212, Vol. 13, No.5, 2017
10.3745/JIPS.03.0080
Keywords: Classifier Ensembles, Classifier’s Significance, Intrusion Detection Systems (IDSs), Wireless Network
Show / Hide Abstract
Intrusion detection systems (IDSs) are crucial in this overwhelming increase of attacks on the computing infrastructure. It intelligently detects malicious and predicts future attack patterns based on the classification analysis using machine learning and data mining techniques. This paper is devoted to thoroughly evaluate classifier ensembles for IDSs in IEEE 802.11 wireless network. Two ensemble techniques, i.e. voting and stacking are employed to combine the three base classifiers, i.e. decision tree (DT), random forest (RF), and support vector machine (SVM). We use area under ROC curve (AUC) value as a performance metric. Finally, we conduct two statistical significance tests to evaluate the performance differences among classifiers.


Thai Classical Music Matching using t-Distribution on Instantaneous Robust Algorithm for Pitch Tracking Framework
Pheerasut Boonmatham, Sunee Pongpinigpinyo and Tasanawan Soonklang
Page: 1213~1228, Vol. 13, No.5, 2017
10.3745/JIPS.02.0073
Keywords: Pitch Tracking Algorithm, Instantaneous Robust Algorithm for Pitch Tracking, T-Distribution, Shortest Query Sample
Show / Hide Abstract
The pitch tracking of music has been researched for several decades. Several possible improvements are available for creating a good t-distribution, using the instantaneous robust algorithm for pitch tracking framework to perfectly detect pitch. This article shows how to detect the pitch of music utilizing an improved detection method which applies a statistical method; this approach uses a pitch track, or a sequence of frequency bin numbers. This sequence is used to create an index that offers useful features for comparing similar songs. The pitch frequency spectrum is extracted using a modified instantaneous robust algorithm for pitch tracking (IRAPT) as a base combined with the statistical method. The pitch detection algorithm was implemented, and the percentage of performance matching in Thai classical music was assessed in order to test the accuracy of the algorithm. We used the longest common subsequence to compare the similarities in pitch sequence alignments in the music. The experimental results of this research show that the accuracy of retrieval of Thai classical music using the t-distribution of instantaneous robust algorithm for pitch tracking (t-IRAPT) is 99.01%, and is in the top five ranking, with the shortest query sample being five seconds long.


IDMMAC: Interference Aware Distributed Multi-Channel MAC Protocol for WSAN
Jagadeesh Kakarla, Banshidhar Majhi and Ramesh Babu Battula
Page: 1229~1242, Vol. 13, No.5, 2017
10.3745/JIPS.03.0038
Keywords: Actor, BCH, IDMMAC, Interference, Multichannel, PRR
Show / Hide Abstract
In this paper, an interference aware distributed multi-channel MAC (IDMMAC) protocol is proposed for wireless sensor and actor networks (WSANs). The WSAN consists of a huge number of sensors and ample amount of actors. Hence, in the IDMMAC protocol a lightweight channel selection mechanism is proposed to enhance the sensor's lifetime. The IDMMAC protocol divides the beacon interval into two phases (i.e., the ad- hoc traffic indication message (ATIM) window phase and data transmission phase). When a sensor wants to transmit event information to the actor, it negotiates the maximum packet reception ratio (PRR) and the capacity channel in the ATIM window with its 1-hop sensors. The channel negotiation takes place via a control channel. To improve the packet delivery ratio of the IDMMAC protocol, each actor selects a backup cluster head (BCH) from its cluster members. The BCH is elected based on its residual energy and node degree. The BCH selection phase takes place whenever an actor wants to perform actions in the event area or it leaves the cluster to help a neighbor actor. Furthermore, an interference and throughput aware multi- channel MAC protocol is also proposed for actor-actor coordination. An actor selects a minimum interference and maximum throughput channel among the available channels to communicate with the destination actor. The performance of the proposed IDMMAC protocol is analyzed using standard network parameters, such as packet delivery ratio, end-to-end delay, and energy dissipation, in the network. The obtained simulation results indicate that the IDMMAC protocol performs well compared to the existing MAC protocols.


Modeling and Simulation of Scheduling Medical Materials Using Graph Model for Complex Rescue
Ming Lv, Jingchen Zheng, Qingying Tong, Jinhong Chen, Haoting Liu and Yun Gao
Page: 1243~1258, Vol. 13, No.5, 2017
10.3745/JIPS.04.0042
Keywords: Bipartite Graph, BSCS, Drug Scheduling, Medical Rescue, Optimization Matching
Show / Hide Abstract
A new medical materials scheduling system and its modeling method for the complex rescue are presented. Different from other similar system, first both the BeiDou Satellite Communication System (BSCS) and the Special Fiber-optic Communication Network (SFCN) are used to collect the rescue requirements and the location information of disaster areas. Then all these messages will be displayed in a special medical software terminal. After that the bipartite graph models are utilized to compute the optimal scheduling of medical materials. Finally, all these results will be transmitted back by the BSCS and the SFCN again to implement a fast guidance of medical rescue. The sole drug scheduling issue, the multiple drugs scheduling issue, and the backup-scheme selection issue are all utilized: the Kuhn-Munkres algorithm is used to realize the optimal matching of sole drug scheduling issue, the spectral clustering-based method is employed to calculate the optimal distribution of multiple drugs scheduling issue, and the similarity metric of neighboring matrix is utilized to realize the estimation of backup-scheme selection issue of medical materials. Many simulation analysis experiments and applications have proved the correctness of proposed technique and system.


Spatio-temporal Sensor Data Processing Techniques
Jeong-Joon Kim
Page: 1259~1276, Vol. 13, No.5, 2017
10.3745/JIPS.04.0047
Keywords: Multi-dimensional Operator, Multi-dimensional Spatio-temporal Data Type, Sensor Networks, Sensor Query Processing System
Show / Hide Abstract
As technologies related to sensor network are currently emerging and the use of GeoSensor is increasing along with the development of Internet of Things (IoT) technology, spatial query processing systems to efficiently process spatial sensor data are being actively studied. However, existing spatial query processing systems do not support a spatial-temporal data type and a spatial-temporal operator for processing spatial- temporal sensor data. Therefore, they are inadequate for processing spatial-temporal sensor data like GeoSensor. Accordingly, this paper developed a spatial-temporal query processing system, for efficient spatial-temporal query processing of spatial-temporal sensor data in a sensor network. Lastly, this paper verified the utility of System through a scenario, and proved that this system’s performance is better than existing systems through performance assessment of performance time and memory usage.


Efficiently Processing Skyline Query on Multi-Instance Data
Shu-I Chiu and Kuo-Wei Hsu
Page: 1277~1298, Vol. 13, No.5, 2017
10.3745/JIPS.04.0049
Keywords: Multi-Instance Data, Product Search, Ranking, Recommendation, Skyline Query Processing
Show / Hide Abstract
Related to the maximum vector problem, a skyline query is to discover dominating tuples from a set of tuples, where each defines an object (such as a hotel) in several dimensions (such as the price and the distance to the beach). A tuple, an instance of an object, dominates another tuple if it is equally good or better in all dimensions and better in at least one dimension. Traditionally, skyline queries are defined upon single- instance data or upon objects each of which is associated with an instance. However, in some cases, an object is not associated with a single instance but rather by multiple instances. For example, on a review website, many users assign scores to a product or a service, and a user’s score is an instance of the object representing the product or the service. Such data is an example of multi-instance data. Unlike most (if not all) others considering the traditional setting, we consider skyline queries defined upon multi-instance data. We define the dominance calculation and propose an algorithm to reduce its computational cost. We use synthetic and real data to evaluate the proposed methods, and the results demonstrate their utility.


Sector Based Multiple Camera Collaboration for Active Tracking Applications
Sangjin Hong, Kyungrog Kim and Nammee Moon
Page: 1299~1319, Vol. 13, No.5, 2017
10.3745/JIPS.02.0074
Keywords: Active Tracking, Master-Slave, Object Dynamics, Sector-Based Representation
Show / Hide Abstract
This paper presents a scalable multiple camera collaboration strategy for active tracking applications in large areas. The proposed approach is based on distributed mechanism but emulates the master-slave mechanism. The master and slave cameras are not designated but adaptively determined depending on the object dynamic and density distribution. Moreover, the number of cameras emulating the master is not fixed. The collaboration among the cameras utilizes global and local sectors in which the visual correspondences among different cameras are determined. The proposed method combines the local information to construct the global information for emulating the master-slave operations. Based on the global information, the load balancing of active tracking operations is performed to maximize active tracking coverage of the highly dynamic objects. The dynamics of all objects visible in the local camera views are estimated for effective coverage scheduling of the cameras. The active tracking synchronization timing information is chosen to maximize the overall monitoring time for general surveillance operations while minimizing the active tracking miss. The real-time simulation result demonstrates the effectiveness of the proposed method


A Tier-Based Duty-Cycling Scheme for Forest Monitoring
Fuquan Zhang, Deming Gao and In-Whee Joe
Page: 1320~1330, Vol. 13, No.5, 2017
10.3745/JIPS.04.0043
Keywords: Link Redundancy, Rechargeable Dynamic Duty Cycle, Tier, Wireless Sensor Networks
Show / Hide Abstract
Wireless sensor networks for forest monitoring are typically deployed in fields in which manual intervention cannot be easily accessed. An interesting approach to extending the lifetime of sensor nodes is the use of energy harvested from the environment. Design constraints are application-dependent and based on the monitored environment in which the energy harvesting takes place. To reduce energy consumption, we designed a power management scheme that combines dynamic duty cycle scheduling at the network layer to plan node duty time. The dynamic duty cycle scheduling is realized based on a tier structure in which the network is concentrically organized around the sink node. In addition, the multi-paths preserved in the tier structure can be used to deliver residual packets when a path failure occurs. Experimental results show that the proposed method has a better performance.


Data Hiding Algorithm for Images Using Discrete Wavelet Transform and Arnold Transform
Geeta Kasana, Kulbir Singh and Satvinder Singh Bhatia
Page: 1331~1344, Vol. 13, No.5, 2017
10.3745/JIPS.03.0042
Keywords: Arnold Transform, DWT, JPEG, JPEG2000, PSNR, SIM
Show / Hide Abstract
In this paper, data hiding algorithm using Discrete Wavelet Transform (DWT) and Arnold Transform is proposed. The secret data is scrambled using Arnold Transform to make it secure. Wavelet subbands of a cover image are obtained using DWT. The scrambled secret data is embedded into significant wavelet coefficients of subbands of a cover image. The proposed algorithm is robust to a variety of attacks like JPEG and JPEG2000 compression, image cropping and median filtering. Experimental results show that the PSNR of the composite image is 1.05 dB higher than the PSNR of existing algorithms and capacity is 25% higher than the capacity of existing algorithms.


Nearest Neighbor Based Prototype Classification Preserving Class Regions
Doosung Hwang and Daewon Kim
Page: 1345~1357, Vol. 13, No.5, 2017
10.3745/JIPS.04.0045
Keywords: Class Prototype, Dissimilarity, Greedy Method, Nearest-Neighbor Rule, Set Cover Optimization
Show / Hide Abstract
A prototype selection method chooses a small set of training points from a whole set of class data. As the data size increases, the selected prototypes play a significant role in covering class regions and learning a discriminate rule. This paper discusses the methods for selecting prototypes in a classification framework. We formulate a prototype selection problem into a set covering optimization problem in which the sets are composed with distance metric and predefined classes. The formulation of our problem makes us draw attention only to prototypes per class, not considering the other class points. A training point becomes a prototype by checking the number of neighbors and whether it is preselected. In this setting, we propose a greedy algorithm which chooses the most relevant points for preserving the class dominant regions. The proposed method is simple to implement, does not have parameters to adapt, and achieves better or comparable results on both artificial and real-world problems.


Analysis on Ampacity of Overhead Transmission Lines Being Operated
Zhijie Yan, Yanling Wang and Likai Liang
Page: 1358~1371, Vol. 13, No.5, 2017
10.3745/JIPS.04.0044
Keywords: Ampacity, Dynamic Thermal Rating, Rating Scales, Risk Level, Transmission Line
Show / Hide Abstract
Dynamic thermal rating (DTR) system is an effective method to improve the capacity of existing overhead line. According to the methodology based on CIGRE (International Council on Large Electric systems) standard, ampacity values under steady-state heating balance can be calculated from ambient environmental conditions. In this study, simulation analysis of relations between parameters and ampacity is described as functional dependence, which can provide an effective basis for the design and research of overhead transmission lines. The simulation of ampacity variation in different rating scales is described in this paper, which are determined from real-time meteorological data and conductor state parameters. To test the performance of DTR in different rating scales, capacity improvement and risk level are presented. And the experimental results show that the capacity of transmission line by using DTR has significant improvement, with low probability of risk. The information of this study has an important reference value to the operation management of power grid


Content-based Image Retrieval Using Texture Features Extracted from Local Energy and Local Correlation of Gabor Transformed Images
Hee-Hyung Bu, Nam-Chul Kim, Bae-Ho Lee and Sung-Ho Kim
Page: 1372~1381, Vol. 13, No.5, 2017
10.3745/JIPS.02.0075
Keywords: Content-based Image Retrieval, Gabor Transformation, Local Energy, Local Correlation, Texture Feature
Show / Hide Abstract
In this paper, a texture feature extraction method using local energy and local correlation of Gabor transformed images is proposed and applied to an image retrieval system. The Gabor wavelet is known to be similar to the response of the human visual system. The outputs of the Gabor transformation are robust to variants of object size and illumination. Due to such advantages, it has been actively studied in various fields such as image retrieval, classification, analysis, etc. In this paper, in order to fully exploit the superior aspects of Gabor wavelet, local energy and local correlation features are extracted from Gabor transformed images and then applied to an image retrieval system. Some experiments are conducted to compare the performance of the proposed method with those of the conventional Gabor method and the popular rotation-invariant uniform local binary pattern (RULBP) method in terms of precision vs recall. The Mahalanobis distance is used to measure the similarity between a query image and a database (DB) image. Experimental results for Corel DB and VisTex DB show that the proposed method is superior to the conventional Gabor method. The proposed method also yields precision and recall 6.58% and 3.66% higher on average in Corel DB, respectively, and 4.87% and 3.37% higher on average in VisTex DB, respectively, than the popular RULBP method.


An Improved Secure Semi-fragile Watermarking Based on LBP and Arnold Transform
Heng Zhang, Chengyou Wang and Xiao Zhou
Page: 1382~1396, Vol. 13, No.5, 2017
10.3745/JIPS.02.0063
Keywords: Digital Image Watermarking, Semi-fragile Watermarking, False Detection, Local Binary Pattern (LBP), Arnold Transform
Show / Hide Abstract
In this paper, we analyze a recently proposed semi-fragile watermarking scheme based on local binary pattern (LBP) operators, and note that it has a fundamental flaw in the design. In this work, a binary watermark is embedded into image blocks by modifying the neighborhood pixels according to the LBP pattern. However, different image blocks might have the same LBP pattern, which can lead to false detection in watermark extraction process. In other words, one can modify the host image intentionally without affecting its watermark message. In addition, there is no encryption process before watermark embedding, which brings another potential security problem. To illustrate its weakness, two special copy-paste attacks are proposed in this paper, and several experiments are conducted to prove the effectiveness of these attacks. To solve these problems, an improved semi-fragile watermarking based on LBP operators is presented. In watermark embedding process, the central pixel value of each block is taken into account and Arnold transform is adopted to guarantee the security of watermark. Experimental results show that the improved watermarking scheme can overcome the above defects and locate the tampered region effectively.


A Novel Statistical Feature Selection Approach for Text Categorization
Mohamed Abdel Fattah
Page: 1397~1409, Vol. 13, No.5, 2017
10.3745/JIPS.02.0076
Keywords: Electronic Texts, E-mail Filtering, Feature Selection, SMS Spam Filtering, Text Categorization
Show / Hide Abstract
For text categorization task, distinctive text features selection is important due to feature space high dimensionality. It is important to decrease the feature space dimension to decrease processing time and increase accuracy. In the current study, for text categorization task, we introduce a novel statistical feature selection approach. This approach measures the term distribution in all collection documents, the term distribution in a certain category and the term distribution in a certain class relative to other classes. The proposed method results show its superiority over the traditional feature selection methods.


Hierarchical Location Caching Scheme for Mobile Object Tracking in the Internet of Things
Youn-Hee Han, Hyun-Kyo Lim and Joon-Min Gil
Page: 1410~1429, Vol. 13, No.5, 2017
10.3745/JIPS.03.0081
Keywords: Internet of Things, Location Caching Scheme, Location Tracking, Mobile Computing, Mobile Object
Show / Hide Abstract
Mobility arises naturally in the Internet of Things networks, since the location of mobile objects, e.g., mobile agents, mobile software, mobile things, or users with wireless hardware, changes as they move. Tracking their current location is essential to mobile computing. To overcome the scalability problem, hierarchical architectures of location databases have been proposed. When location updates and lookups for mobile objects are localized, these architectures become effective. However, the network signaling costs and the execution number of database operations increase particularly when the scale of the architectures and the numbers of databases becomes large to accommodate a great number of objects. This disadvantage can be alleviated by a location caching scheme which exploits the spatial and temporal locality in location lookup. In this paper, we propose a hierarchical location caching scheme, which acclimates the existing location caching scheme to a hierarchical architecture of location databases. The performance analysis indicates that the adjustment of such thresholds has an impact on cost reduction in the proposed scheme.


Featured Papers

Survey on 3D Surface Reconstruction
Alireza Khatamian and Hamid R. Arabnia
Pages: 338~357, Vol. 12, No.3, 2016
10.3745/JIPS.01.0010

Keywords: Explicit Surfaces, Implicit Surfaces, Point Cloud, Surface Reconstruction
Show / Hide Abstract

A Comprehensive Review of Emerging Computational Methods for Gene Identification
Ning Yu, Zeng Yu, Bing Li, Feng Gu and Yi Pan
Pages: 1~34, Vol. 12, No.1, 2016
10.3745/JIPS.04.0023

Keywords: Cloud Computing, Comparative Methods, Deep Learning, Fourier Transform, Gene Identification, Gene Prediction, Hidden Markov Model, Machine Learning, Protein-Coding Region, Support Vector Machine
Show / Hide Abstract

On the Performance of Oracle Grid Engine Queuing System for Computing Intensive Applications
Vladi Kolici, Albert Herrero and Fatos Xhafa
Pages: 491~502, Vol. 10, No.4, 2014
10.3745/JIPS.01.0004
Keywords: Benchmarking, Cloud Computing, Computing Intensive Applications, Genetic Algorithms, Grid Computing, Oracle Grid Engine, Scheduling, Simulation
Show / Hide Abstract

Training-Free Fuzzy Logic Based Human Activity Recognition
Eunju Kim and Sumi Helal
Pages: 335~354, Vol. 10, No.3, 2014
10.3745/JIPS.04.0005
Keywords: Activity Semantic Knowledge, Fuzzy Logic, Human Activity Recognition, Multi-Layer Neural Network
Show / Hide Abstract

Janus - Multi Source Event Detection and Collection System for Effective Surveillance of Criminal Activity
Cyrus Shahabi, Seon Ho Kim, Luciano Nocera, Giorgos Constantinou, Ying Lu, Yinghao Cai, Gérard Medioni, Ramakant Nevatia and Farnoush Banaei-Kashani
Pages: 1~22, Vol. 10, No.1, 2014
10.3745/JIPS.2014.10.1.001
Keywords: Multi-source, Multi-modal Event Detection, Law Enforcement, Criminal Activity, Surveillance, Security, Safety
Show / Hide Abstract

The Confinement Problem: 40 Years Later
Alex Crowell, Beng Heng Ng, Earlence Fernandes and Atul Prakash
Pages: 189~204, Vol. 9, No.2, 2013
10.3745/JIPS.2013.9.2.189
Keywords: Confinement Problem, Covert Channels, Virtualization, Isolation, Taint Tracking
Show / Hide Abstract

An Adaptive Approach to Learning the Preferences of Users in a Social Network Using Weak Estimators
B. John Oommen, Anis Yazidi and Ole-Christoffer Granmo
Pages: 191~212, Vol. 8, No.2, 2012
10.3745/JIPS.2012.8.2.191
Keywords: Weak es timators, User's Profiling, Time Varying Preferences
Show / Hide Abstract

Indoor Link Quality Comparison of IEEE 802.11a Channels in a Multi-radio Mesh Network Testbed
Asitha U Bandaranayake, Vaibhav Pandit and Dharma P. Agrawal
Pages: 1~20, Vol. 8, No.1, 2012
10.3745/JIPS.2012.8.1.001
Keywords: IEEE 802.11a, Indoor Test Bed, Link Quality, Wireless Mesh Networks
Show / Hide Abstract

A Survey of RFID Deployment and Security Issues
Amit Grover and Hal Berghel
Pages: 561~580, Vol. 7, No.4, 2011
10.3745/JIPS.2011.7.4.561
Keywords: RFID, RFID Standards, RFID Protocols, RFID Security, EPC structure, RFID Applications, RFID Classification
Show / Hide Abstract

The Principle of Justifiable Granularity and an Optimization of Information Granularity Allocation as Fundamentals of Granular Computing
Witold Pedrycz
Pages: 397~412, Vol. 7, No.3, 2011
10.3745/JIPS.2011.7.3.397
Keywords: Information Granularity, Principle of Justifiable Granularity, Knowledge Management, Optimal Granularity Allocation
Show / Hide Abstract

CASPER: Congestion Aware Selection of Path with Efficient Routing in Multimedia Networks
Mohammad S. Obaidat, Sanjay K. Dhurandher and Khushboo Diwakar
Pages: 241~260, Vol. 7, No.2, 2011
10.3745/JIPS.2011.7.2.241
Keywords: Routing, Multimedia Networks, Congestion-aware Selection, MANET, CASPER, Performance Evaluation
Show / Hide Abstract

An Efficient Broadcast Technique for Vehicular Networks
Ai Hua Ho, Yao H. Ho, Kien A. Hua, Roy Villafane and Han-Chieh Chao
Pages: 221~240, Vol. 7, No.2, 2011
10.3745/JIPS.2011.7.2.221
Keywords: V2V Communication Protocols, Vehicular Network, Ad Hoc Network, Broadcast, Broadcasting Storm, Routing
Show / Hide Abstract

Security Properties of Domain Extenders for Cryptographic Hash Functions
Elena Andreeva, Bart Mennink and Bart Preneel
Pages: 453~480, Vol. 6, No.4, 2010
10.3745/JIPS.2010.6.4.453
Keywords: Hash Functions, Domain Extenders, Security Properties
Show / Hide Abstract

Hiding Secret Data in an Image Using Codeword Imitation
Zhi-Hui Wang, Chin-Chen Chang and Pei-Yu Tsai
Pages: 435~452, Vol. 6, No.4, 2010
10.3745/JIPS.2010.6.4.435
Keywords: Data Hiding, Steganography, Vector Quantization
Show / Hide Abstract

DEESR: Dynamic Energy Efficient and Secure Routing Protocol for Wireless Sensor Networks in Urban Environments
Mohammad S. Obaidat, Sanjay K. Dhurandher, Deepank Gupta, Nidhi Gupta and Anupriya Asthana
Pages: 269~294, Vol. 6, No.3, 2010
10.3745/JIPS.2010.6.3.269
Keywords: Sensor Network, Security, Energy Efficiency, Routing, Dynamic Trust Factor
Show / Hide Abstract

Challenges to Next Generation Services in IP Multimedia Subsystem
Kai-Di Chang, Chi-Yuan Chen, Jiann-Liang Chen and Han-Chieh Chao
Pages: 129~146, Vol. 6, No.2, 2010
10.3745/JIPS.2010.6.2.129
Keywords: IP Multimedia Subsystems, Peer-to-Peer, Web Services, SCIM
Show / Hide Abstract

TOSS: Telecom Operations Support Systems for Broadband Services
Yuan-Kai Chen, Chang-Ping Hsu, Chung-Hua Hu, Rong-Syh Lin, Yi-Bing Lin, Jian-Zhi Lyu, Wudy Wu and Heychyi Young
Pages: 1~20, Vol. 6, No.1, 2010
10.3745/JIPS.2010.6.1.001
Keywords: Operations Support System (OSS), New Generation Operations Systems and Software (NGOSS), enhanced Telecom Operations Map (eTOM), Internet Protocol Television (IPTV), IP-Virtual Private Network (IP-VPN)
Show / Hide Abstract

Providing Efficient Secured Mobile IPv6 by SAG and Robust Header Compression
Tin-Yu Wu, Han-Chieh Chao and Chi-Hsiang Lo
Pages: 117~130, Vol. 5, No.3, 2009
10.3745/JIPS.2009.5.3. 117
Keywords: SAG, RoHC, MIPv6, Handoff Latency, Early Binding Update
Show / Hide Abstract

A Survey of Face Recognition Techniques
Rabia Jafri and Hamid R Arabnia
Pages: 41~68, Vol. 5, No.2, 2009
10.3745/JIPS.2009.5.2.041
Keywords: Face Recognition, Person Identification, Biometrics
Show / Hide Abstract

PUBLICATION ETHICS

With regard to ethical standards, the JIPS takes plagiarism very seriously and thoroughly checks all articles. The JIPS defines research ethics as securing objectivity and accuracy in the execution of research and the conclusion of results without any unintentional errors resulting from negligence or incorrect knowledge, etc. and without any intentional misconduct such as falsification, plagiarism, etc. When an author submits a paper to the JIPS online submission and peer-review system, he/she should also upload the separate file "author check list" which contains a statement that all his/her research has been performed in accordance with ethical standards.

Among the JIPS editorial board members, there are four associate manuscript editors who support the JIPS by dealing with any ethical problems associated with the publication process and give advice on how to handle cases of suspected research and publication misconduct. When the JIPS managing editor looks over submitted papers and checks that they are suitable for further processing, the managing editor also routes them to the CrossCheck service provided by iTenticate. Based on the results provided by the CrossCheck service, the JIPS associate manuscript editors inform the JIPS editor-in-chief of any plagiarism that is detected in a paper. Then, the JIPS editor-in-chief communicates such detection to the author(s) while rejecting the paper.

OPEN ACCESS

Since 2005, all papers published in the JIPS are subjected to a peer review and upon acceptance are immediately made permanently available free of charge for everyone worldwide to read and download from the journal’s homepage (http://www.jips-k.org) without any subscription fee or personal registration. This is an Open Access article distributed under the terms of the Creative Commons Attribution Non-Commercial License (http://creativecommons.org/licenses/by-nc/3.0/) which permits unrestricted non-commercial use, distribution, and reproduction in any medium, provided the original work is properly cited. The KIPS waives paper processing charges for submissions from international authors as well as society members. This waiver policy supports and encourages the publication of quality papers, making the journal an international forum for the exchange of different ideas and experiences.

Contact Information

JIPS Secretary: Ms. Joo-yeon Lee
Email: joo@kips.or.kr
Phone: +82-2-2077-1414, Fax: +82-2-2077-1472