Digital Library
Vol. 12, No. 4, Dec. 2016
-
[EDITORIAL] Advances in Multimedia Computing and Security and the Introduction of New Senior EditorsJong Hyuk Park
Vol. 12, No. 4, pp. 549-554, Dec. 2016
https://doi.org/10.3745/JIPS.00.0002
Keywords:
Show / Hide AbstractThe Journal of Information Processing Systems (JIPS) is the official international journal of the Korea Information Processing Society, and has become the leading journal in the various areas of information processing technology in Korea that was indexed in ESCI, SCOPUS, EI, DOI, DBLP, COMPENDEX, EBSCO, Google Scholar, and CrossRef. This rapid growth represents result as paper submissions amount of papers submitted in 2016 is about 15 times higher than in 2013. Thus, the accepted rate has been decreasing, which means that we have been publishing outstanding papers from the high competition. -
Ibtissem Bekkouche, Hadria Fizazi
Vol. 12, No. 4, pp. 555-576, Dec. 2016
https://doi.org/10.3745/JIPS.02.0047
Keywords: Fourier transform, Fuzzy Clustering, Harmony Search, Processing Image, Remote Sensing
Show / Hide AbstractIn the conventional clustering algorithms, an object could be assigned to only one group. However, this is sometimes not the case in reality, there are cases where the data do not belong to one group. As against, the fuzzy clustering takes into consideration the degree of fuzzy membership of each pixel relative to different classes. In order to overcome some shortcoming with traditional clustering methods, such as slow convergence and their sensitivity to initialization values, we have used the Harmony Search algorithm. It is based on the population metaheuristic algorithm, imitating the musical improvisation process. The major thrust of this algorithm lies in its ability to integrate the key components of population-based methods and local search-based methods in a simple optimization model. We propose in this paper a new unsupervised clustering method called the Fuzzy Harmony Search-Fourier Transform (FHS-FT). It is based on hybridization fuzzy clustering and the harmony search algorithm to increase its exploitation process and to further improve the generated solution, while the Fourier transform to increase the size of the image's data. The results show that the proposed method is able to provide viable solutions as compared to previous work -
Suman P, ey, Young Joon Won, Mi-Jung Choi, Joon-Min Gil
Vol. 12, No. 4, pp. 577-590, Dec. 2016
https://doi.org/10.3745/JIPS.03.0057
Keywords: Community Formation, Datamining, HbbTV, Smart TV
Show / Hide AbstractWe studied the current state-of-the-art of Smart TV, the challenges and the drawbacks. Mainly we discussed the lack of end-to-end solution. We then illustrated the differences between Smart TV and IPTV from network service provider point of view. Unlike IPTV, viewer of Smart TV’s over-the-top (OTT) services could be global, such as foreign nationals in a country or viewers having special viewing preferences. Those viewers are sparsely distributed. The existing TV service deployment models over Internet are not suitable for such viewers as they are based on content popularity, hence we propose a community based service deployment methodology with proactive content caching on rendezvous points (RPs). In our proposal, RPs are intermediate nodes responsible for caching routing and decision making. The viewer’s community formation is based on geographical locations and similarity of their interests. The idea of using context information to do proactive caching is itself not new, but we combined this with “in network caching” mechanism of content centric network (CCN) architecture. We gauge the performance improvement achieved by a community model. The result shows that when the total numbers of requests are same; our model can have significantly better performance, especially for sparsely distributed communities -
Arif Muntasa
Vol. 12, No. 4, pp. 591-611, Dec. 2016
https://doi.org/10.3745/JIPS.01.0011
Keywords: Eigenspaces, feature extraction, Homogeneous, Non-homogeneous
Show / Hide AbstractHigh dimensional space is the biggest problem when classification process is carried out, because it takes longer time for computation, so that the costs involved are also expensive. In this research, the facial space generated from homogeneous and non-homogeneous polynomial was proposed to extract the facial image features. The homogeneous and non-homogeneous polynomial-based eigenspaces are the second opinion of the feature extraction of an appearance method to solve non-linear features. The kernel trick has been used to complete the matrix computation on the homogeneous and non-homogeneous polynomial. The weight and projection of the new feature space of the proposed method have been evaluated by using the three face image databases, i.e., the YALE, the ORL, and the UoB. The experimental results have produced the highest recognition rate 94.44%, 97.5%, and 94% for the YALE, ORL, and UoB, respectively. The results explain that the proposed method has produced the higher recognition than the other methods, such as the Eigenface, Fisherface, Laplacianfaces, and O-Laplacianfaces -
Jiyoung Jeon, Min Hong, Manhui Yi, Jiyoon Chun, Ji Sim Kim, Yoo-Joo Cho
Vol. 12, No. 4, pp. 612-630, Dec. 2016
https://doi.org/10.3745/JIPS.02.0048
Keywords: Augmented Reality, Authoring Tool, Interactive Mobile, Mobile App
Show / Hide AbstractAs mobile augmented reality technologies are spreading these days, many users want to produce augmented reality (AR) contents what they need by themselves. To keep pace with such needs, we have developed a mobile AR contents builder (hereafter referred to as MARB) that enables the user to easily connect a natural marker and a virtual object with various interaction events that are used to manipulate the virtual object in a mobile environment so that users can simply produce an AR content using natural photos and virtual objects that they select. MARB consists of five major modules—target manger, virtual object manager, AR accessory manager, AR content manager, and AR viewer. The target manager, virtual object manager and AR accessory manager register and manage natural target markers, various virtual objects and content accessories (such as various decorating images), respectively. The AR content manger defines a connection between a target and a virtual object with enabling various interactions for the desired functions such as translation/rotation/scaling of the virtual object, playing of a music, etc. AR viewer augments various virtual objects (such as 2D images, 3D models and video clips) on the pertinent target. MARB has been developed in a mobile application (app) format in order to create AR contents simply using mobile smart devices without switching to a PC environment for authoring the content. In this paper, we present the detail organizations and applications of MARB. It is expected that MARB will enable ordinary users to produce diverse mobile AR contents for various purposes with ease and contribute to expanding the mobile AR market based on spread of a variety of AR contents -
Liping Wang, Chengyou Wang, Wei Huang, Xiao Zhou
Vol. 12, No. 4, pp. 631-643, Dec. 2016
https://doi.org/10.3745/JIPS.02.0046
Keywords: Image deblocking, Adaptive-Weighted Bilateral Filter, Blind Image Quality Assessment (BIQA), Local Entropy
Show / Hide AbstractDue to the block-based discrete cosine transform (BDCT), JPEG compressed images usually exhibit blocking artifacts. When the bit rates are very low, blocking artifacts will seriously affect the image’s visual quality. A bilateral filter has the features for edge-preserving when it smooths images, so we propose an adaptiveweighted bilateral filter based on the features. In this paper, an image-deblocking scheme using this kind of adaptive-weighted bilateral filter is proposed to remove and reduce blocking artifacts. Two parameters of the proposed adaptive-weighted bilateral filter are adaptive-weighted so that it can avoid over-blurring unsmooth regions while eliminating blocking artifacts in smooth regions. This is achieved in two aspects: by using local entropy to control the level of filtering of each single pixel point within the image, and by using an improved blind image quality assessment (BIQA) to control the strength of filtering different images whose blocking artifacts are different. It is proved by our experimental results that our proposed image-deblocking scheme provides good performance on eliminating blocking artifacts and can avoid the over-blurring of unsmooth regions -
Mohamed Belaoued, Smaine Mazouzi
Vol. 12, No. 4, pp. 644-660, Dec. 2016
https://doi.org/10.3745/JIPS.03.0058
Keywords: Chi-Square Test, Malware Analysis, PE-Optional Header, Real-Time Detection Windows API
Show / Hide AbstractThe real-time detection of malware remains an open issue, since most of the existing approaches for malware categorization focus on improving the accuracy rather than the detection time. Therefore, finding a proper balance between these two characteristics is very important, especially for such sensitive systems. In this paper, we present a fast portable executable (PE) malware detection system, which is based on the analysis of the set of Application Programming Interfaces (APIs) called by a program and some technical PE features (TPFs). We used an efficient feature selection method, which first selects the most relevant APIs and TPFs using the chi-square (KHI²) measure, and then the Phi (?) coefficient was used to classify the features in different subsets, based on their relevance. We evaluated our method using different classifiers trained on different combinations of feature subsets. We obtained very satisfying results with more than 98% accuracy. Our system is adequate for real-time detection since it is able to categorize a file (Malware or Benign) in 0.09 seconds -
Md. Mostafa Kamal Sarker, Moon Kyou Song
Vol. 12, No. 4, pp. 661-680, Dec. 2016
https://doi.org/10.3745/JIPS.02.0050
Keywords: Cross-correlation, Global Threshold, License Plate Recognition, Radon Transformation, Traffic Surveillance
Show / Hide AbstractThe vehicle license plate recognition (VLPR) system analyzes and monitors the speed of vehicles, theft of vehicles, the violation of traffic rules, illegal parking, etc., on the motorway. The VLPR consists of three major parts: license plate detection (LPD), license plate character segmentation (LPCS), and license plate character recognition (LPCR). This paper presents an efficient method for the LPCS and LPCR of Korean vehicle license plates (LPs). LP tilt adjustment is a very important process in LPCS. Radon transformation is used to correct the tilt adjustment of LP. The global threshold segmentation method is used for segmented LP characters from two different types of Korean LPs, which are a single row LP (SRLP) and double row LP (DRLP). The cross-correlation matching method is used for LPCR. Our experimental results show that the proposed methods for LPCS and LPCR can be easily implemented, and they achieved 99.35% and 99.85% segmentation and recognition accuracy rates, respectively for Korean LPs -
Salima Lalani, D. D. Doye
Vol. 12, No. 4, pp. 681-687, Dec. 2016
https://doi.org/10.3745/JIPS.02.0045
Keywords: DWT, Image Watermarking, torus
Show / Hide AbstractToday’s modern world requires a digital watermarking technique that takes the redundancy of an image into consideration for embedding a watermark. The novel algorithm used in this paper takes into consideration the redundancies of spatial domain and wavelet domain for embedding a watermark. Also, the cryptographybased secret key makes the algorithm difficult to hack and help protect ownership. Watermarking is blind, as it does not require the original image. Few coefficient matrices and secret keys are essential to retrieve the original watermark, which makes it redundant to various intentional attacks. The proposed technique resolves the challenge of optimizing transparency and robustness using a Canny-based edge detector technique. Improvements in the transparency of the cover image can be seen in the computed PSNR value, which is 44.20 dB -
Nawal Sad Houari, Noria Taghezout
Vol. 12, No. 4, pp. 688-710, Dec. 2016
https://doi.org/10.3745/JIPS.03.0056
Keywords: Business Rules (BR), Business Rules Management System (BRMS), Encryption Algorithms, Security Agent
Show / Hide AbstractOur approach permits to capitalize the expert’s knowledge as business rules by using an agent-based platform. The objective of our approach is to allow experts to manage the daily evolutions of business domains without having to use a technician, and to allow them to be implied, and to participate in the development of the application to accomplish the daily tasks of their work. Therefore, the manipulation of an expert’s knowledge generates the need for information security and other associated technologies. The notion of cryptography has emerged as a basic concept in business rules modeling. The purpose of this paper is to present a cryptographic algorithm based approach to integrate the security aspect in business rules modeling. We propose integrating an agent-based approach in the framework. This solution utilizes a security agent with domain ontology. This agent applies an encryption/decryption algorithm to allow for the confidentiality, authenticity, and integrity of the most important rules. To increase the security of these rules, we used hybrid cryptography in order to take advantage of symmetric and asymmetric algorithms. We performed some experiments to find the best encryption algorithm, which provides improvement in terms of response time, space memory, and security -
Fei Hao, Doo-Soon Park, Sang Yeon Woo, Se Dong Min, Sewon Park
Vol. 12, No. 4, pp. 711-723, Dec. 2016
https://doi.org/10.3745/JIPS.04.0026
Keywords: Degree of Membership, Fuzzy Evaluation, Smart Medical, Sustainable, Treatment Plan
Show / Hide AbstractWith the rapid development of both ubiquitous computing and the mobile internet, big data technology is gradually penetrating into various applications, such as smart traffic, smart city, and smart medical. In particular, smart medical, which is one core part of a smart city, is changing the medical structure. Specifically, it is improving treatment planning for various diseases. Since multiple treatment plans generated from smart medical have their own unique treatment costs, pollution effects, side-effects for patients, and so on, determining a sustainable strategy for treatment planning is becoming very critical in smart medical. From the sustainable point of view, this paper first presents a three-dimensional evaluation model for representing the raw medical data and then proposes a sustainable strategy for treatment planning based on the representation model. Finally, a case study on treatment planning for the group of “computer autism” patients is then presented for demonstrating the feasibility and usability of the proposed strategy -
Mohd-Norhadri Mohd-Hilmi, Marwah Haitham Al-Laila, Nurul Hashimah Ahamed Hassain Malim
Vol. 12, No. 4, pp. 724-740, Dec. 2016
https://doi.org/10.3745/JIPS.01.0012
Keywords: Chemoinformatics, Graphical Processing Unit, Group Fusion, Open Multiprocessing, Virtual Screening
Show / Hide AbstractThe performance issues of screening large database compounds and multiple query compounds in virtual screening highlight a common concern in Chemoinformatics applications. This study investigates these problems by choosing group fusion as a pilot model and presents efficient parallel solutions in parallel platforms, specifically, the multi-core architecture of CPU and many-core architecture of graphical processing unit (GPU). A study of sequential group fusion and a proposed design of parallel CUDA group fusion are presented in this paper. The design involves solving two important stages of group fusion, namely, similarity search and fusion (MAX rule), while addressing embarrassingly parallel and parallel reduction models. The sequential, optimized sequential and parallel OpenMP of group fusion were implemented and evaluated. The outcome of the analysis from these three different design approaches influenced the design of parallel CUDA version in order to optimize and achieve high computation intensity. The proposed parallel CUDA performed better than sequential and parallel OpenMP in terms of both execution time and speedup. The parallel CUDA was 5-10x faster than sequential and parallel OpenMP as both similarity search and fusion MAX stages had been CUDA-optimized -
Meeyeon Lee, Ye-Seul Park, Jung-Won Lee
Vol. 12, No. 4, pp. 741-753, Dec. 2016
https://doi.org/10.3745/JIPS.04.0027
Keywords: Acute Myocardial Infarction, Data Model, Hospital Information System, Ischemic Stroke, Medical Image, Medical Information, Ontology
Show / Hide AbstractIn the medical fields, many efforts have been made to develop and improve Hospital Information System (HIS) including Electronic Medical Record (EMR), Order Communication System (OCS), and Picture Archiving and Communication System (PACS). However, materials generated and used in medical fields have various types and forms. The current HISs separately store and manage them by different systems, even though they relate to each other and contain redundant data. These systems are not helpful particularly in emergency where medical experts cannot check all of clinical materials in the golden time. Therefore, in this paper, we propose a process to build an integrated data model for medical information currently stored in various HISs. The proposed data model integrates vast information by focusing on medical images since they are most important materials for the diagnosis and treatment. Moreover, the model is disease-specific to consider that medical information and clinical materials including images are different by diseases. Two case studies show the feasibility and the usefulness of our proposed data model by building models about two diseases, acute myocardial infarction (AMI) and ischemic stroke -
Kethepalli Mallikarjuna, Kodati Satya Prasad, M. V. Subramanyam
Vol. 12, No. 4, pp. 754-764, Dec. 2016
https://doi.org/10.3745/JIPS.02.0049
Keywords: Degree of Sparsity, Discrete Rajan Transform, Sparsification
Show / Hide AbstractThe exhaustive list of sparsification methods for a digital image suffers from achieving an adequate number of zero and near-zero coefficients. The method proposed in this paper, which is known as the Discrete Rajan Transform Sparsification, overcomes this inadequacy. An attempt has been made to compare the simulation results for benchmark images by various popular, existing techniques and analyzing from different aspects. With the help of Discrete Rajan Transform algorithm, both lossless and lossy sparse representations are obtained. We divided an image into 8×8-sized blocks and applied the Discrete Rajan Transform algorithm to it to get a more sparsified spectrum. The image was reconstructed from the transformed output of the Discrete Rajan Transform algorithm with an acceptable peak signal-to-noise ratio. The performance of the Discrete Rajan Transform in providing sparsity was compared with the results provided by the Discrete Fourier Transform, Discrete Cosine Transform, and the Discrete Wavelet Transform by means of the Degree of Sparsity. The simulation results proved that the Discrete Rajan Transform provides better sparsification when compared to other methods -
Dongyan Wang, Fanfan Yang, Heng Zhang
Vol. 12, No. 4, pp. 765-778, Dec. 2016
https://doi.org/10.3745/JIPS.03.0055
Keywords: Digital Color Image Watermark, Discrete Wavelet Transformation (DWT), LU Decomposition, Normalized Correlation (NC), Structural Similarity (SSIM)
Show / Hide AbstractIn watermarking schemes, the discrete wavelet transform (DWT) is broadly used because its frequency component separation is very useful. Moreover, LU decomposition has little influence on the visual quality of the watermark. Hence, in this paper, a novel blind watermark algorithm is presented based on LU transform and DWT for the copyright protection of digital images. In this algorithm, the color host image is first performed with DWT. Then, the horizontal and vertical diagonal high frequency components are extracted from the wavelet domain, and the sub-images are divided into 4×4 non-overlapping image blocks. Next, each sub-block is performed with LU decomposition. Finally, the color image watermark is transformed by Arnold permutation, and then it is inserted into the upper triangular matrix. The experimental results imply that this algorithm has good features of invisibility and it is robust against different attacks to a certain degree, such as contrast adjustment, JPEG compression, salt and pepper noise, cropping, and Gaussian noise