Sub-band coding of hexagonal images

According to the circle-packing theorem, the packing efficiency of a hexagonal lattice is higher than an equivalent square tessellation. Consequently, in several contexts, hexagonally sampled images compared to their Cartesian counterparts are better at preserving information content. In this paper, novel mapping techniques alongside the wavelet compression scheme are presented for hexagonal images. Specifically, we introduce two tree-based coding schemes, referred to as SBHex (spirally-mapped branch-coding for hexagonal images) and BBHex (breadth-first block-coding for hexagonal images). Both of these coding schemes respect the geometry of the hexagonal lattice and yield better compression results. Our empirical results show that the proposed algorithms for hexagonal images produce better reconstruction quality at low bits per pixel representations compared to the tree-based coding counterparts for the Cartesian grid.     

Accelerating BPC-PaCo through Visually Lossless Techniques

Fast image codecs are a current need in applications that deal with large amounts of images. Graphics Processing Units (GPUs) are suitable processors to speed up most kinds of algorithms, especially when they allow fine-grain parallelism. Bitplane Coding with Parallel Coefficient processing (BPC-PaCo) is a recently proposed algorithm for the core stage of wavelet-based image codecs tailored for the highly parallel architectures of GPUs. This algorithm provides complexity scalability to allow faster execution at the expense of coding efficiency. Its main drawback is that the speedup and loss in image quality is controlled only roughly, resulting in visible distortion at low and medium rates. This paper addresses this issue by integrating techniques of visually lossless coding into BPC-PaCo. The resulting method minimizes the visual distortion introduced in the compressed file, obtaining higher-quality images to a human observer. Experimental results also indicate 12% speedups with respect to BPC-PaCo.     

LPNN-based approach for LASSO problem via a sequence of regularized minimizations

In compressive sampling theory, the least absolute shrinkage and selection operator (LASSO) is a representative problem. Nevertheless, the non-differentiable constraint impedes the use of Lagrange programming neural networks (LPNNs). We present in this article the -LPNN model, a novel algorithm that tackles the LASSO minimization together with the underlying theory support. First, we design a sequence of smooth constrained optimization problems, by introducing a convenient differentiable approximation to the non-differentiable -norm constraint. Next, we prove that the optimal solutions of the regularized intermediate problems converge to the optimal sparse signal for the LASSO. Then, for every regularized problem from the sequence, the -LPNN dynamic model is derived, and the asymptotic stability of its equilibrium state is established as well. Finally, numerical simulations are carried out to compare the performance of the proposed -LPNN algorithm with both the LASSO-LPNN model and a standard digital method.     

金沙江水电工程智能建造技术体系研究与实践

运用"全面感知、真实分析、实时控制"的智能闭环控制理论,提出了以工程建设资源要素动态精准管理、业务流程数字化管理、工艺过程智能控制、实物成本精确分析、结构安全与进度耦合分析及联动调控的数字化技术和智能化技术为核心,以水电工程数据模型如大坝全景信息模型DIM为基础,以智能建造管理平台iDam为主体的智能建造技术体系,并对工程数据结构分解与编码体系、工程数据感知传输共享技术、iDam平台的系统架构与业务架构、智能建造工程绩效等关键技术进行了分析。通过统一规范的工程数据结构与编码体系,iDam平台可集成工程建设全过程的基础数据、环境数据、过程数据和监测数据,为各业务模块服务;建立的基于工程技术和管理大数据的机理分析功能,可为工程建设的业主、施工、监理、设计、科研及运行等单位服务。智能建造初步实践表明,本文构建的技术体系是科学可行的,对基础设施智能建造技术与管理体系的研究与实践具有参考价值。     

基于分段加权的反向稀疏跟踪算法研究

为提高稀疏表示跟踪模型性能，提出一种分段加权的反向稀疏跟踪算法，将跟踪问题转化为在贝叶斯框架下寻找概率最高的候选对象问题，构造不同的分段权重函数来分别度量候选目标与正负模板的判别特征系数。通过池化来降低跟踪结果的不确定性干扰，选择正负模板加权系数差值最大的候选表示作为跟踪结果。实验表明，在光照变化、遮挡、快速运动、运动模糊情况下，所提出的算法可以确保跟踪结果的准确性和鲁棒性。     

On the capacity of the state‐dependent interference relay channel

This paper considers the state‐dependent interference relay channel (SIRC) in which one of the two users may operate as a secondary user and the relay has a noncausal access to the signals from both users. For discrete memoryless SIRC, we first establish the achievable rate region by carefully merging Han‐Kobayashi rate splitting encoding technique, superposition encoding, and Gelfand‐Pinsker encoding technique. Then, based on the achievable rate region that we derive, the capacity of the SIRC is established in many different scenarios including (a) the weak interference regime, (b) the strong interference regime, and (c) the very strong interference regime. This means that our capacity results contain all available known results in the literature. Next, the achievable rate region and the associated capacity results are also evaluated in the case of additive Gaussian noise. Additionally, many numerical examples are investigated to show the value of our theoretical derivations.     

Learning a Deep Predictive Coding Network for a Semi-Supervised 3D-Hand Pose Estimation

In this paper we present a CNN based approach for a real time 3D-hand pose estimation from the depth sequence. Prior discriminative approaches have achieved remarkable success but are facing two main challenges: Firstly, the methods are fully supervised hence require large numbers of annotated training data to extract the dynamic information from a hand representation. Secondly, unreliable hand detectors based on strong assumptions or a weak detector which often fail in several situations like complex environment and multiple hands. In contrast to these methods, this paper presents an approach that can be considered as semi-supervised by performing predictive coding of image sequences of hand poses in order to capture latent features underlying a given image without supervision. The hand is modelled using a novel latent tree dependency model (LDTM) which transforms internal joint location to an explicit representation. Then the modeled hand topology is integrated with the pose estimator using data dependent method to jointly learn latent variables of the posterior pose appearance and the pose configuration respectively. Finally, an unsupervised error term which is a part of the recurrent architecture ensures smooth estimations of the final pose. Experiments on three challenging public datasets, ICVL, MSRA, and NYU demonstrate the significant performance of the proposed method which is comparable or better than state-of-the-art approaches.      

面向中小型服装企业的个性化定制订单管理体系构建

在开展个性化定制业务过程中,中小型服装企业易存在市场应变能力不强、信息化投入不足、数据利用能力较弱等问题,为此,构建了一个基于软件即服务(SaaS)模式的订单云管理体系。在分析该管理体系主要功能需求的基础上,优化提出了可充分借助云计算服务的服装个性化定制业务流程,设计了易于计算机处理的物料管理编码和业务数据信息体系。基于三级分层搭建了该订单管理体系的技术架构,设计了主要业务单元的智能化操作平台和核心计算技术。最后采用Java语言进行订单管理体系的开发,实现了订单信息的全流程、实时化、全方位共享,以期有效提升服装个性化定制业务的信息化管理水平。     

多共振分量融合CNN的行星齿轮箱故障诊断

针对行星齿轮箱中各部件所激起的振动成分混叠、早期故障特征经常被较强的各级齿轮谐波成分以及环境噪声所湮没的问题，提出一种多共振分量融合卷积神经网络（multi-resonance component fusion based convolutional neural network，简称MRCF-CNN）的行星齿轮箱故障诊断方法。首先，对振动信号进行共振稀疏分解，得到包含齿轮谐波成分的高共振分量和可能包含轴承故障冲击成分的低共振分量；其次，构建多共振分量融合卷积神经网络，将得到的高、低共振分量和原始振动信号进行自适应的特征级融合，通过有监督的方式训练模型并进行行星齿轮箱故障诊断。对行星齿轮箱实验数据的分析结果表明，该方法能够有效分类行星齿轮箱中滚动轴承和齿轮的故障，成功对行星齿轮箱故障进行诊断，同时能够进一步增强卷积神经网络对振动信号所蕴含的故障信息的辨识能力。