High precision angular actuators are used for high demanding applications such as laser steering for photolithography. Piezo technology allows developing actuators with such a high resolution that the characterization of the same is out of the capabilities of commercially available instruments. At INRIM we have designed and built a device to the purpose of characterizing precision 2D angular actuators with a resolution surpassing the best devices on the market. The device is based on a multi reflection scheme that allows multiplying the deflection angle by a factor of 70. The ultimate resolution of the device is 2 prad/√Hz over a measurement range of 36 µrad with a measurement band > 10 kHz. The working principle, the practical realization and the case study on a top-level commercial angular actuator (Nano-MTA2 produced by MadCityLabs) are described.

In this paper, we present the idea of Self Supervised learning on the Shape Completion and Classification of point clouds. Most 3D shape completion pipelines utilize autoencoders to extract features from point clouds used in downstream tasks such as Classification, Segmentation, Detection, and other related applications. Our idea is to add Contrastive Learning into Auto-Encoders to learn both global and local feature representations of point clouds. We use a combination of Triplet Loss and Chamfer distance to learn global and local feature representations. To evaluate the performance of embeddings for Classification, we utilize the PointNet classifier. We also extend the number of classes to evaluate our model from 4 to 10 to show the generalization ability of learned features. Based on our results, embedding generated from the Contrastive autoencoder enhances Shape Completion and Classification performance from 84.2% to 84.9% of point clouds achieving the state-of-the-art results with 10 classes.

We extend Ziv and Lempel's model of finite-state encoders to the realm of lossy compression of individual sequences. In particular, the model of the encoder includes a finite-state reconstruction codebook followed by an information lossless finite-state encoder that compresses the reconstruction codeword with no additional distortion. We first derive two different lower bounds to the compression ratio that depend on the number of states of the lossless encoder. Both bounds are asymptotically achievable by conceptually simple coding schemes. We then show that when the number of states of the lossless encoder is large enough in terms of the reconstruction block-length, the performance can be improved, sometimes significantly so. In particular, the improved performance is achievable using a random-coding ensemble that is universal, not only in terms of the source sequence, but also in terms of the distortion measure.