Probability Distributions.- Linear Models for Regression.- Linear Models for Classification.- Neural Networks.- Kernel Methods.- Sparse Kernel Machines.- Graphical Models.- Mixture Models and EM.- Approximate Inference.- Sampling Methods.- Continuous Latent Variables.- Sequential Data.- Combining Models.

Pattern Recognition and Machine Learning

Deposits of clastic carbonate-dominated (calciclastic) sedimentary slope systems in the rock record have been identified mostly as linearly-consistent carbonate apron deposits, even though most ancient clastic carbonate slope deposits fit the submarine fan systems better. Calciclastic submarine fans are consequently rarely described and are poorly understood. Subsequently, very little is known especially in mud-dominated calciclastic submarine fan systems. Presented in this study are a sedimentological core and petrographic characterisation of samples from eleven boreholes from the Lower Carboniferous of Bowland Basin (Northwest England) that reveals a >250 m thick calciturbidite complex deposited in a calciclastic submarine fan setting. Seven facies are recognised from core and thin section characterisation and are grouped into three carbonate turbidite sequences. They include: 1) Calciturbidites, comprising mostly of highto low-density, wavy-laminated bioclast-rich facies; 2) low-density densite mudstones which are characterised by planar laminated and unlaminated muddominated facies; and 3) Calcidebrites which are muddy or hyper-concentrated debrisflow deposits occurring as poorly-sorted, chaotic, mud-supported floatstones. These

Phd by thesis

“Unpaired Image-to-Image Translation using Cycle-Consistent Adversarial Networks”の学習報告

MUCKE aims to mine a large volume of images, to structure them conceptually and to use this conceptual structuring in order to improve large-scale image retrieval. The last decade witnessed important progress concerning low-level image representations. However, there are a number problems which need to be solved in order to unleash the full potential of image mining in applications. The central problem with low-level representations is the mismatch between them and the human interpretation of image content. This problem can be instantiated, for instance, by the incapability of existing descriptors to capture spatial relationships between the concepts represented or by their incapability to convey an explanation of why two images are similar in a content-based image retrieval framework. We start by assessing existing local descriptors for image classification and by proposing to use co-occurrence matrices to better capture spatial relationships in images. The main focus in MUCKE is on cleaning large scale Web image corpora and on proposing image representations which are closer to the human interpretation of images. Consequently, we introduce methods which tackle these two problems and compare results to state of the art methods. Note: some aspects of this deliverable are withheld at this time as they are pending review. Please contact the authors for a preview.

http://ieeexplore.ieee.org/iel2/4524/12820/00592460.pdf

Image Processing

IEEE Transactions on Pattern Analysis and Machine Intelligence

Cloth-Changing person re-identification (CC-ReID) aims at matching the same person across different locations over a long-duration, e.g., over days, and therefore inevitably meets challenge of changing clothing. In this paper, we focus on handling well the CC-ReID problem under a more challenging setting, i.e., just from a single image, which enables high-efficiency and latency-free pedestrian identify for real-time surveillance applications. Specifically, we introduce Gait recognition as an auxiliary task to drive the Image ReID model to learn cloth-agnostic representations by leveraging personal unique and cloth-independent gait information, we name this framework as GI-ReID. GI-ReID adopts a two-stream architecture that consists of a image ReID-Stream and an auxiliary gait recognition stream (Gait-Stream). The Gait-Stream, that is discarded in the inference for high computational efficiency, acts as a regulator to encourage the ReID-Stream to capture cloth-invariant biometric motion features during the training. To get temporal continuous motion cues from a single image, we design a Gait Sequence Prediction (GSP) module for Gait-Stream to enrich gait information. Finally, a high-level semantics consistency over two streams is enforced for effective knowledge regularization. Experiments on multiple image-based Cloth-Changing ReID benchmarks, e.g., LTCC, PRCC, Real28, and VC-Clothes, demonstrate that GI-ReID performs favorably against the state-of-the-arts. Codes are available at this https URL.

Cloth-Changing Person Re-identification from A Single Image with Gait Prediction and Regularization.

We propose a new compression algorithm for massive models, which consist of a large number of small to medium sized connected components. It is by efficiently exploiting repetitive patterns in the input model. Compared with the similar work by finding repetitive patterns, our new algorithm is more efficient on detecting repeated components by recognizing instances repeating in various scalings. We also propose an efficient compression scheme for transformation data. As a result, it can achieve a considerably higher compression ratio.

Compression of massive models by efficiently exploiting repeated patterns

In the tile-based 360-degree video streaming, predicting user’s future viewpoints and developing adaptive bitrate (ABR) algorithms are essential for optimizing user’s quality of experience (QoE). Traditional single-user based viewpoint prediction methods fail to achieve good performance in long-term prediction, and the recently proposed reinforcement learning (RL) based ABR schemes applied in traditional video streaming can not be directly applied in the tile-based 360-degree video streaming due to the exponential action space. Therefore, we propose a sequential reinforced 360-degree video streaming scheme with cross-user attentive network. Firstly, considering different users may have the similar viewing preference on the same video, we propose a cross-user attentive network (CUAN), boosting the performance of long-term viewpoint prediction by selectively utilizing cross-user information. Secondly, we propose a sequential RL-based (360SRL) ABR approach, transforming action space size of each decision step from exponential to linear via introducing a sequential decision structure. We evaluate the proposed CUAN and 360SRL using trace-driven experiments and experimental results demonstrate that CUAN and 360SRL outperform existing viewpoint prediction and ABR approaches with a noticeable margin.

Sequential Reinforced 360-Degree Video Adaptive Streaming With Cross-User Attentive Network

Adaptive quantization matrix selection (AQMS) method was recently proposed in ITU-T VCEG to improve video coding performance. As a reference model for VCEG, this method involves coding a frame multiple times to obtain optimal candidate matrix parameters. In this paper, the method in AQMS is analyzed and an fast adaptive quantization matrix selection method is proposed. The proposed method keeps the quantization matrix selection in the macroblock level but removes the iterative quantization matrix parameter calculation in the frame level. Therefore, computational complexity is greatly reduced while the coding gain is maintained.

A fast adaptive quantization matrix selection method in H.264/AVC

Optimised bit allocation is important in video compression to increase the coding efficiency, i.e. to make optimum use of the available data rate. In view of the human visual system, a human usually pays more attention to some part of a picture rather than to other parts of that picture. Therefore the bit allocation should be optimised for different-attention picture areas (GOB i ). The inventive distortion-driven bit allocation scheme allocates the coding/decoding error distortion to picture areas consistently with the human visual system, and satisfies the constraint of bit rate as well. The invention uses a distortion/bitrate/rhoquantization parameter histogram analysis. Based on corresponding tables (D GOBi [QP n ], R GOBi [QP n ] and ρ GOBi [QP n ]), the relationships between quantization parameter, rate, distortion and percentage of non-zero coefficients for the different-attention areas are determined (PREALUTI, DISALL, RALL). Thereafter a rho-domain bit rate control is used (RDBALL) for calculating the bit allocation inside each group of macroblocks.

Zhibo Chen

Papers

Cloth-Changing Person Re-identification from A Single Image with Gait Prediction and Regularization.

Compression of massive models by efficiently exploiting repeated patterns

Sequential Reinforced 360-Degree Video Adaptive Streaming With Cross-User Attentive Network

A fast adaptive quantization matrix selection method in H.264/AVC

Method and apparatus for determining bit allocation for groups of pixel blocks in a picture according to attention importance level