• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.6
• /
• pp.2271-2288
• /
• 2015

The emerging high efficiency video coding (HEVC) standard adopts the quadtree-structured transform unit (TU) in the residual quadtree (RQT) coding. Each TU allows to be split into four equal sub-TUs recursively. The RQT coding is performed for all the possible transform depth levels to achieve the highest coding efficiency, but it requires a very high computational complexity for HEVC encoders. In order to reduce the computational complexity requested by the RQT coding, in this paper, we propose a fast TU size decision method incorporating an adaptive maximum transform depth determination (AMTD) algorithm and a full check skipping - early termination (FCS-ET) algorithm. Because the optimal transform depth level is highly content-dependent, it is not necessary to perform the RQT coding at all transform depth levels. By the AMTD algorithm, the maximum transform depth level is determined for current treeblock to skip those transform depth levels rarely used by its spatially adjacent treeblocks. Additionally, the FCS-ET algorithm is introduced to exploit the correlations of transform depth level between four sub-CUs generated by one coding unit (CU) quadtree partitioning. Experimental results demonstrate that the proposed overall algorithm significantly reduces on average 21% computational complexity while maintaining almost the same rate distortion (RD) performance as the HEVC test model reference software, HM 13.0.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.2
• /
• pp.709-730
• /
• 2017

To address the challenge of unprecedented growth in mobile data traffic, ultra-dense network deployment is a cost efficient solution to offload the traffic over some small cells. The overlapped coverage areas of small cells create more than one candidate access points for one mobile user. Signal strength based user association in IEEE 802.11 results in a significantly unbalanced load distribution among access points. However, the effective bandwidth demand of each user actually differs vastly due to their different preferences for mobile applications. In this paper, we formulate a set of non-linear integer programming models for joint user association control and user demand guarantee problem. In this model, we are trying to maximize the system capacity and guarantee the effective bandwidth demand for each user by soft-association control with a software defined network controller. With the fact of NP-hard complexity of non-linear integer programming solver, we propose a Kernighan Lin Algorithm based graph-partitioning method for a large-scale network. Finally, we evaluated the performance of the proposed algorithm for the edge users with heterogeneous bandwidth demands and mobility scenarios. Simulation results show that the proposed adaptive soft-association control can achieve a better performance than the other two and improves the individual quality of user experience with a little price on system throughput.

• Geomechanics and Engineering
• /
• v.33 no.3
• /
• pp.279-289
• /
• 2023

Brittleness index (BI) is an important property of rocks because it is a good index to predict rockburst. Due to its importance, several empirical and soft computing (SC) models have been proposed in the literature based on the punch penetration test (PPT) results. These models are very important as there is no clear-cut experimental means for measuring BI asides the PPT which is very costly and time consuming to perform. This study used a novel Multivariate Adaptive regression spline (MARS), M5P, and white-box ANN to predict the BI of rocks using the available data in the literature for an improved BI prediction. The rock density, uniaxial compressive strength (σ_c) and tensile strength (σ_t) were used as the input parameters into the models while the BI was the targeted output. The models were implemented in the MATLAB software. The results of the proposed models were compared with those from existing multilinear regression, linear and nonlinear particle swarm optimization (PSO) and genetic algorithm (GA) based models using similar datasets. The coefficient of determination (R²), adjusted R² (Adj R²), root-mean squared error (RMSE) and mean absolute percentage error (MAPE) were the indices used for the comparison. The outcomes of the comparison revealed that the proposed ANN and MARS models performed better than the other models with R² and Adj R² values above 0.9 and least error values while the M5P gave similar performance to those of the existing models. Weight partitioning method was also used to examine the percentage contribution of model predictors to the predicted BI and tensile strength was found to have the highest influence on the predicted BI.

• Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
• /
• v.7 no.3
• /
• pp.383-391
• /
• 2017

In image processing, image segmentation has been studied by various methods in a long time. Image segmentation is the process of partitioning a digital image into multiple objects and face detection is a typical image segmentation field being used in a variety of applications that identifies human faces in digital images. In this paper, we propose a method for extracting the contours of faces included in images. Using the Viola-Jones algorithm, to do this, we detect the approximate locations of faces from images. But, the Viola-Jones algorithm could detected the approximate location of face not the correct position. In order to extract a more accurate face region from image, we use skin color in this paper. In details, face region would be extracted using the analysis of horizontal and vertical histograms on the skin area. Finally, the face contour is extracted using snake algorithm for the extracted face area. In this paperr, a modified snake energy function is proposed for face contour extraction based snake algorithm proposed by Williams et al.[7]