Tin Vlašić

Tin Vlašić

Auto-generated profile, based on publicly available information

Tin Vlašić

Genome Institute of Singapore (GIS), Agency for Science Technology and Research (A*STAR), Singapore, Republic of Singapore

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 July 2025 in Nature Communications
Verified
Journal Article
Open access
PDF file
RPRafael Josip Penić
Rafael Josip Penić
TVTin Vlašić
Tin Vlašić
RHRoland G. Huber
Roland G. Huber
YWYue Wan
Yue Wan
MŠMile Šikić
Mile Šikić
While RNA has recently been recognized as an interesting small-molecule drug target, many challenges remain to be addressed before we take full advantage of it. This emphasizes the necessity to improve our understanding of its structures and functions. Over the years, sequencing technologies have produced an enormous amount of unlabeled RNA data, which hides a huge potential. Motivated by the successes of protein language models, we introduce RiboNucleic Acid Language Model (RiNALMo) to unveil the hidden code of RNA. RiNALMo is the largest RNA language model to date, with 650M parameters pre-trained on 36M non-coding RNA sequences from several databases. It can extract hidden knowledge and capture the underlying structure information implicitly embedded within the RNA sequences. RiNALMo achieves state-of-the-art results on several downstream tasks. Notably, we show that its generalization capabilities overcome the inability of other deep learning methods for secondary structure prediction to generalize on unseen RNA families.

6 January 2022 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
TVTin Vlasic
Tin Vlasic
DSDamir Seršić
Damir Seršić
This paper introduces a novel framework and corresponding methods for sampling and reconstruction of sparse signals in shift-invariant (SI) spaces. We reinterpret the random demodulator, a system that acquires sparse bandlimited signals, as a system for the acquisition of linear combinations of the samples in the SI setting with the box function as the sampling kernel. The sparsity assumption is exploited by the compressive sensing (CS) paradigm for a recovery of the SI samples from a reduced set of measurements. The SI samples are subsequently filtered by a discrete-time correction filter to reconstruct expansion coefficients of the observed signal. Furthermore, we offer a generalization of the proposed framework to other compactly supported sampling kernels that span a wider class of SI spaces. The generalized method embeds the correction filter in the CS optimization problem which directly reconstructs expansion coefficients of the signal. Both approaches recast an inherently continuous-domain inverse problem in a set of finite-dimensional CS problems in an exact way. Finally, we conduct numerical experiments on signals in polynomial B-spline spaces whose expansion coefficients are assumed to be sparse in a certain transform domain. The coefficients can be regarded as parametric models of an underlying continuous-time signal, obtained from a reduced set of measurements. Such continuous signal representations are particularly suitable for signal processing without converting them into samples.

31 October 2022
Verified
Conference Paper
Open access
TVTin Vlašić
Tin Vlašić
HNHieu Nguyen
Hieu Nguyen
AKAmirEhsan Khorashadizadeh
AmirEhsan Khorashadizadeh
IDIvan Dokmanić
Ivan Dokmanić
Implicit representation of shapes as level sets of multilayer perceptrons has recently flourished in different shape analysis, compression, and reconstruction tasks. In this paper, we introduce an implicit neural representation-based framework for solving the inverse obstacle scattering problem in a mesh-free fashion. We express the obstacle shape as the zero-level set of a signed distance function which is implicitly determined by network parameters. To solve the direct scattering problem, we implement the implicit boundary integral method. It uses projections of the grid points in the tubular neighborhood onto the boundary to compute the PDE solution directly in the level-set framework. The proposed implicit representation conveniently handles the shape perturbation in the optimization process. To update the shape, we use PyTorch's automatic differentiation to backpropagate the loss function w.r.t. the network parameters, allowing us to avoid complex and error-prone manual derivation of the shape derivative. Additionally, we propose a deep generative model of implicit neural shape representations that can fit into the framework. The deep generative model effectively regularizes the inverse obstacle scattering problem, making it more tractable and robust, while yielding high-quality reconstruction results even in noise-corrupted setups.

3 December 2024 in bioRxiv
Verified
Preprint
Open access
PDF file
IMIvona Martinović
Ivona Martinović
TVTin Vlašić
Tin Vlašić
Yang LiYang Li
Yang Li
BHBryan Hooi
Bryan Hooi
Yang ZhangYang Zhang
Yang Zhang
MŠMile Šikić
Mile Šikić
Several deep learning-based tools for RNA 3D structure prediction have recently emerged, including DRfold, DeepFoldRNA, RhoFold, RoseTTAFoldNA, trRosettaRNA, and AlphaFold 3. In this study, we systematically evaluate these six models on three datasets: RNA Puzzles, CASP15 RNA targets, and a newly generated dataset of sequentially distinct RNAs, which serves as a benchmark for generalization capabilities. To ensure a robust evaluation, we also introduce a fourth, more stringent dataset that contains both sequentially and structurally distinct RNAs. We observed that each model predicts the best structure for certain RNAs, and evaluated whether commonly used scoring functions, Rosetta score and ARES, can reliably identify the most accurate structure from the predictions. Finally, since many RNA chains in the Protein Data Bank are part of complexes, we compare the performance of RoseTTAFoldNA and AlphaFold 3 in predicting RNA structures within complexes versus isolated RNA chains extracted from these complexes. This comprehensive evaluation highlights the strengths and limitations of current deep learning-based tools and provides valuable insights for advancing RNA 3D structure prediction.

4 April 2022 in Signal Processing: Image Communication
Verified
Journal Article
Closed access
TVTin Vlašić
Tin Vlašić
DSDamir Seršić
Damir Seršić

31 March 2022 in arXiv
Verified
Preprint
Open access
PDF file
TVTin Vlašić
Tin Vlašić
DSDamir Seršić
Damir Seršić
This paper introduces a novel framework for single-pixel imaging via compressive sensing (CS) in shift-invariant (SI) spaces by exploiting the sparsity property of a wavelet representation. We reinterpret the acquisition procedure of a single-pixel camera as filtering of the observed signal with continuous-domain functions that lie in an SI subspace spanned by the integer shifts of the box function. The signal is modeled by an arbitrary SI generator whose special case is the box function, which, as we show in the paper, is conventionally used in single-pixel imaging. We propose to use separable B-spline generators which are intuitively complemented by sparsity-inducing spline wavelets. The SI models of the acquisition and the underlying signal lead to an exact discretization of an inherently continuous-domain inverse problem to a finite-dimensional problem of CS type. By solving the CS optimization problem, a parametric representation of the signal is obtained. Such a representation offers many practical advantages in image processing applications. We propose an efficient matrix-free implementation of the framework and conduct it on the standard test images and real-world measurement data. Experimental results show that the proposed framework achieves a significant improvement of the reconstruction quality relative to the conventional discretization in CS setups. MATLAB implementation of the method described in this paper has been made publicly available on https://github.com/retiro/compressive_imaging_in_si_spaces.