Ioan Tabus

Prof. Ioan Tabus

orcid

Research Focus & Metrics

Academic Career Length

33Years (1994-Present)

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

Representative Publications

View All Publications
1 January 2005 in ACM Transactions on Information Systems
Verified
Journal Article
Open access
GKGergely Korodi
Gergely Korodi
ITIoan Tabus
Ioan Tabus
This article presents an efficient algorithm for DNA sequence compression, which achieves the best compression ratios reported over a test set commonly used for evaluating DNA compression programs. The algorithm introduces many refinements to a compression method that combines: (1) encoding by a simple normalized maximum likelihood (NML) model for discrete regression, through reference to preceding approximate matching blocks, (2) encoding by a first order context coding and (3) representing strings in clear, to make efficient use of the redundancy sources in DNA data, under fast execution times. One of the main algorithmic features is the constraint on the matching blocks to include reasonably long contiguous matches, which not only reduces significantly the search time, but also can be used to modify the NML model to exploit the constraint for getting smaller code lengths. The algorithm handles the changing statistics of DNA data in an adaptive way and by predictively encoding the matching pointers it is successful in compressing long approximate matches. Apart from comparison with previous DNA encoding methods, we present compression results for the recently published human genome data.

11 May 2006 in Proteomics
Verified
Journal Article
Closed access
PDF file
RJRongcai Jiang
Rongcai Jiang
CMCristian Mircean
Cristian Mircean
ISIlya Shmulevich
Ilya Shmulevich
DCDavid Cogdell
David Cogdell
YJYu Jia
Yu Jia
WZWei Zhang
Wei Zhang

1 November 2010 in Molecular & Cellular Proteomics
Verified
Journal Article
Open access
PDF file
JYJilong Yang
Jilong Yang
JEJames A. Eddy
James A. Eddy
YPYuan Pan
Yuan Pan
AHAndrea Hategan
Andrea Hategan
ITIoan Tabus
Ioan Tabus
WZWei Zhang
Wei Zhang
Leiomyosarcoma is one of the most common mesenchymal tumors. Proteomics profiling analysis by reverse-phase protein lysate array surprisingly revealed that expression of the epithelial marker E-cadherin (encoded by CDH1) was significantly elevated in a subset of leiomyosarcomas. In contrast, E-cadherin was rarely expressed in the gastrointestinal stromal tumors, another major mesenchymal tumor type. We further sought to 1) validate this finding, 2) determine whether there is a mesenchymal to epithelial reverting transition (MErT) in leiomyosarcoma, and if so 3) elucidate the regulatory mechanism responsible for this MErT. Our data showed that the epithelial cell markers E-cadherin, epithelial membrane antigen, cytokeratin AE1/AE3, and pan-cytokeratin were often detected immunohistochemically in leiomyosarcoma tumor cells on tissue microarray. Interestingly, the E-cadherin protein expression was correlated with better survival in leiomyosarcoma patients. Whole genome microarray was used for transcriptomics analysis, and the epithelial gene expression signature was also associated with better survival. Bioinformatics analysis of transcriptome data showed an inverse correlation between E-cadherin and E-cadherin repressor Slug (SNAI2) expression in leiomyosarcoma, and this inverse correlation was validated on tissue microarray by immunohistochemical staining of E-cadherin and Slug. Knockdown of Slug expression in SK-LMS-1 leiomyosarcoma cells by siRNA significantly increased E-cadherin; decreased the mesenchymal markers vimentin and N-cadherin (encoded by CDH2); and significantly decreased cell proliferation, invasion, and migration. An increase in Slug expression by pCMV6-XL5-Slug transfection decreased E-cadherin and increased vimentin and N-cadherin. Thus, MErT, which is mediated through regulation of Slug, is a clinically significant phenotype in leiomyosarcoma.

10 February 2012 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
Bogdan DumitrescuBogdan Dumitrescu
Bogdan Dumitrescu
AOAlexandru Onose
Alexandru Onose
PHPetri Helin
Petri Helin
ITIoan Tabus
Ioan Tabus
Starting from the orthogonal (greedy) least squares method, we build an adaptive algorithm for finding online sparse solutions to linear systems. The algorithm belongs to the exponentially windowed recursive least squares (RLS) family and maintains a partial orthogonal factorization with pivoting of the system matrix. For complexity reasons, the permutations that bring the relevant columns into the first positions are restrained mainly to interchanges between neighbors at each time moment. The storage scheme allows the computation of the exact factorization, implicitly working on indefinitely long vectors. The sparsity level of the solution, i.e., the number of nonzero elements, is estimated using information theoretic criteria, in particular Bayesian information criterion (BIC) and predictive least squares. We present simulations showing that, for identifying sparse time-varying FIR channels, our algorithm is consistently better than previous sparse RLS methods based on the -norm regularization of the RLS criterion. We also use our sparse greedy RLS algorithm for computing linear predictions in a lossless audio coding scheme and obtain better compression than MPEG4 ALS using an RLS-LMS cascade.

1 September 2017
Verified
Conference Paper
Closed access
ITIoan Tabus
Ioan Tabus
PHPetri Helin
Petri Helin
PAPekka Astola
Pekka Astola
This paper proposes a lenslet image compression method scalable from low bitrates to fully lossless. The subaperture images are split into two sets: a set of reference views, encoded by a standard lossy or lossless compressor, and the set of dependent views, which are reconstructed by sparse prediction from the reference set using the geometrical information from the depth map. The set of reference views may contain all views and all views may also be dependent views, in which case the sparse predictive stage does not reconstruct from scratch the views, but it refines in a sequential order all views by combining in an optimal way the information about the same region existing in neighbor views. The encoder transmits to the decoder a segmented version of the scene depthmap, the encoded versions of the reference views, displacements for each region from the central view to each of the dependent views, and finally the sparse predictors for each region and each dependent view. The scheme can be configured to ensure random access to the dependent views, while the reference views are compressed in a backward compatible way, e.g., using JPEG 2000. The experimental results show performance better than that of the baseline standard compressor used, JPEG 2000.

1 June 1996 in IEEE Transactions on Image Processing
Verified
Journal Article
Closed access
ITIoan Tabus
Ioan Tabus
DPD. Petrescu
D. Petrescu
MGMoncef Gabbouj
Moncef Gabbouj
A training framework is developed in this paper to design optimal nonlinear filters for various signal and image processing tasks. The targeted families of nonlinear filters are the Boolean filters and stack filters. The main merit of this framework at the implementation level is perhaps the absence of constraining models, making it nearly universal in terms of application areas. We develop fast procedures to design optimal or close to optimal filters, based on some representative training set. Furthermore, the training framework shows explicitly the essential part of the initial specification and how it affects the resulting optimal solution. Symmetry constraints are imposed on the data and, consequently, on the resulting optimal solutions for improved performance and ease of implementation. The case study is dedicated to natural images. The properties of optimal Boolean and stack filters, when the desired signal in the training set is the image of a natural scene, are analyzed. Specifically, the effect of changing the desired signal (using various natural images) and the characteristics of the noise (the probability distribution function, the mean, and the variance) is analyzed. Elaborate experimental conditions were selected to investigate the robustness of the optimal solutions using a sensitivity measure computed on data sets. A remarkably low sensitivity and, consequently, a good generalization power of Boolean and stack filters are revealed. Boolean-based filters are thus shown to be not only suitable for image restoration but also robust, making it possible to build libraries of "optimal" filters, which are suitable for a set of applications.