• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권8호
• /
• pp.3842-3855
• /
• 2018

A novel image completion method is proposed that uses the advantage of planar structural information to fill corrupted portions of an image. First, in estimating parameters of the projection plane, the image is divided into several planes, and their planar structural information is analyzed. Second, in calculating the a priori probability of patch and patch offset regularity, this information is converted into a constraint condition to guide the process of filling the hole. Experimental results show that the proposed algorithm is fast and effective, and ensures the structure continuity of the damaged region and smoothness of the texture.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권1호
• /
• pp.108-122
• /
• 2014

Massive antenna array is an attractive candidate technique for future broadband wireless communications to acquire high spectrum and energy efficiency. However, such benefits can be realized only when proper channel information is available at the transmitter. Since the amount of the channel information required by the transmitter is large for massive antennas, the feedback is burdensome in practice, especially for frequency division duplex (FDD) systems, and needs normally to be reduced. In this paper a novel channel feedback reduction scheme based on the theory of distributed compressive sensing (DCS) is proposed to apply to massive antenna arrays with spatial correlation, which brings substantially reduced feedback load. Simulation results prove that the novel scheme is better than the channel feedback technique based on traditional compressive sensing (CS) in the aspects of mean square error (MSE), cumulative distributed function (CDF) performance and feedback resources saving.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권10호
• /
• pp.4034-4053
• /
• 2015

In order to meet various requirements for transmission quality of both primary users (PUs) and secondary users (SUs) in cognitive radio networks, we introduce a channel bonding mechanism for PUs and a channel reservation mechanism for SUs, then we propose a novel spectrum allocation strategy. Taking into account the mistake detection and false alarm due to imperfect channel sensing, we establish a three-dimensional Markov chain to model the stochastic process of the proposed strategy. Using the method of matrix geometric solution, we derive the performance measures in terms of interference rate of PU packets, average delay and throughput of SU packets. Moreover, we investigate the influence of the number of the reserved (resp. licensed) channels on the system performance with numerical experiments. Finally, to optimize the proposed strategy socially, we provide a charging policy for SU packets.

• Journal of Information Processing Systems
• /
• 제15권3호
• /
• pp.457-463
• /
• 2019

The blockchain and crypto currency has become one of the most essential components of a communication network in the recent years. Through communication networking, we browse the internet, make VoIP phone calls, have video conferences and check e-mails via computers. A lot of researches are being conducting to address the blockchain and crypto currency challenges in communication networking and provide corresponding solutions. In this paper, a diverse kind of novel research works in terms of mechanisms, techniques, architectures, and frameworks have been proposed to provide possible solutions against the existing challenges in the communication networking. Such novel research works involve thermal load capacity techniques, intelligent sensing mechanism, secure cloud computing system communication algorithm for wearable healthcare systems, sentiment analysis, optimized resources.

• International Journal of Advanced Culture Technology
• /
• 제6권4호
• /
• pp.226-232
• /
• 2018

The rapid pace of growth in internet usage and rich mobile applications and with the advantage of incredible usage of internet enabled mobile devices the Green Mobile Crowd Computing will be the suitable area to research combining with cloud services architecture. Our proposed Framework will deploy the eHealth among various health care sectors and pave a way to create a Green Mobile Application to provide a better and secured way to access the Products/ Information/ Knowledge, eHealth services, experts / doctors globally. This green mobile crowd computing and cloud architecture for healthcare information systems are expected to lower costs, improve efficiency and reduce error by also providing better consumer care and service with great transparency to the patient universally in the field of medical health information technology. Here we introduced novel architecture to use of cloud services with crowd sourcing.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권9호
• /
• pp.4372-4389
• /
• 2019

Spectrum sensing has attracted much attention due to its significant contribution to idle spectrum detection in Cognitive Radio Networks. However, specialized discussion is on complexity-based sensing strategy for spectrum sensing seldom considered. Motivated by this, this paper is devoted to complexity-based sensing strategy for spectrum sensing. Firstly, three efficiency functions are defined to estimate sensing efficiency of a spectrum scheme. Then a novel sensing strategy is proposed given sensing performance and computational complexity. After that, the proposed sensing strategy is extended to energy detector, Cyclostationary feature detector, covariance matrix detector and cooperative spectrum detector. The proposed sensing strategy provides a novel insight into sensing performance estimation for its consideration of both sensing capacity and sensing complexity. Simulations analyze three efficiency functions and optimal sensing strategy of energy detector, Cyclostationary feature detector and covariance matrix detector.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권6호
• /
• pp.2115-2127
• /
• 2021

Although significant progress has been made in synthesizing visually realistic face images by Generative Adversarial Networks (GANs), there still lacks effective approaches to provide fine-grained control over the generation process for semantic facial attribute editing. In this work, we propose a novel cross channel self-attention based generative adversarial network (CCA-GAN), which weights the importance of multiple channels of features and archives pixel-level feature alignment and conversion, to reduce the impact on irrelevant attributes while editing the target attributes. Evaluation results show that CCA-GAN outperforms state-of-the-art models on the CelebA dataset, reducing Fréchet Inception Distance (FID) and Kernel Inception Distance (KID) by 15~28% and 25~100%, respectively. Furthermore, visualization of generated samples confirms the effect of disentanglement of the proposed model.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제18권3호
• /
• pp.653-669
• /
• 2024

Dynamic scene deblurring is a complex computer vision problem owing to its difficulty to model mathematically. In this paper, we present a novel approach for image deblurring with the help of the sharp reference image, which utilizes the reference image for high-quality and high-frequency detail results. To better utilize the clear reference image, we develop an encoder-decoder network and two novel modules are designed to guide the network for better image restoration. The proposed Reference Extraction and Aggregation Module can effectively establish the correspondence between blurry image and reference image and explore the most relevant features for better blur removal and the proposed Spatial Feature Fusion Module enables the encoder to perceive blur information at different spatial scales. In the final, the multi-scale feature maps from the encoder and cascaded Reference Extraction and Aggregation Modules are integrated into the decoder for a global fusion and representation. Extensive quantitative and qualitative experimental results from the different benchmarks show the effectiveness of our proposed method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권7호
• /
• pp.3128-3149
• /
• 2018

A number of effective methods for multiple-attribute group decision making (MAGDM) with interval-valued intuitionistic fuzzy numbers (IVIFNs) have been proposed in recent years. However, the different methods frequently yield different, even sometimes contradictory, results for the same problem. In this paper a novel criterion to determine the advantages and disadvantages of different methods is proposed. First, the decision-making process is divided into three parts: translation of experts' preferences, aggregation of experts' opinions, and comparison of the alternatives. Experts' preferences aggregation is considered the core step, and the quality of the collective matrix is considered the most important evaluation index for the aggregation methods. Then, methods to calculate the similarity measure, correlation, correlation coefficient, and energy of the intuitionistic fuzzy matrices are proposed, which are employed to evaluate the collective matrix. Thus, the optimal method can be selected by comparing the collective matrices when all the methods yield different results. Finally, a novel approach for aggregating experts' preferences with IVIFN is presented. In this approach, experts' preferences are mapped as points into two-dimensional planes, with the plant growth simulation algorithm (PGSA) being employed to calculate the optimal rally points, which are inversely mapped to IVIFNs to establish the collective matrix. In the study, four different methods are used to address one example problem to illustrate the feasibility and effectiveness of the proposed approach.

• International Journal of Internet, Broadcasting and Communication
• /
• 제16권2호
• /
• pp.22-30
• /
• 2024

Image compression-decompression methods have become increasingly crucial in modern times, facilitating the transfer of high-quality images while minimizing file size and internet traffic. Historically, early image compression relied on rudimentary codecs, aiming to compress and decompress data with minimal loss of image quality. Recently, a novel compression framework leveraging colorization techniques has emerged. These methods, originally developed for infusing grayscale images with color, have found application in image compression, leading to colorization-based coding. Within this framework, the encoder plays a crucial role in automatically extracting representative pixels-referred to as color seeds-and transmitting them to the decoder. The decoder, utilizing colorization methods, reconstructs color information for the remaining pixels based on the transmitted data. In this paper, we propose a novel approach to image compression, wherein we decompose the compression task into grayscale image compression and colorization tasks. Unlike conventional colorization-based coding, our method focuses on the colorization process rather than the extraction of color seeds. Moreover, we employ the Denoising Diffusion Null-Space Model (DDNM) for colorization, ensuring high-quality color restoration and contributing to superior compression rates. Experimental results demonstrate that our method achieves higher-quality decompressed images compared to standard JPEG and JPEG2000 compression schemes, particularly in high compression rate scenarios.