Author image not provided
 Ioan Tăbuş

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article1.92
Citation Count71
Publication count37
Publication years1996-2013
Available for download6
Average downloads per article324.00
Downloads (cumulative)1,944
Downloads (12 Months)25
Downloads (6 Weeks)5
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


37 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 20 of 37
Result page: 1 2

Sort by:

1
November 2013 IEEE Transactions on Image Processing: Volume 22 Issue 11, November 2013
Publisher: IEEE Press
Bibliometrics:
Citation Count: 2

This paper introduces an efficient method for lossless compression of depth map images, using the representation of a depth image in terms of three entities: 1) the crack-edges; 2) the constant depth regions enclosed by them; and 3) the depth value over each region. The starting representation is identical with ...

2
May 2013 CSCS '13: Proceedings of the 2013 19th International Conference on Control Systems and Computer Science
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 0

We present a method for lossless compression of contours in images using a specific crack-edge representation, where each horizontal binary crack-edge is bundled together with a vertical binary crack-edge in a new symbol, having four possible values. One can represent all contours in an image using an auxiliary quaternary image, ...
Keywords: image contour coding, lossless compression, fractal images, depth map images

3
May 2013 CSCS '13: Proceedings of the 2013 19th International Conference on Control Systems and Computer Science
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 0

We propose several methods for minimizing the codelength achievable when encoding histological images in two phases, where a segmentation of the image is encoded in the first phase and the image conditional on its segmentation is encoded in the second phase. The main goal of the paper is to establish ...
Keywords: minimum description length principle, image segmentation, histological images, computer assisted diagnostics

4
January 2013 IEEE Transactions on Audio, Speech, and Language Processing: Volume 21 Issue 1, January 2013
Publisher: IEEE Press
Bibliometrics:
Citation Count: 1

We investigate the problem of sparse modeling for predictive coding and introduce an efficient algorithm for computing sparse stereo linear predictors for lossless audio compression. Sparse linear predictive coding offers both improved compression and reduction of decoding complexity compared with non-sparse linear predictive coding. The modeling part amounts to finding ...

5
May 2012 IEEE Transactions on Signal Processing: Volume 60 Issue 5, May 2012
Publisher: IEEE Press
Bibliometrics:
Citation Count: 3

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 ...

6
April 2009 ICASSP '09: Proceedings of the 2009 IEEE International Conference on Acoustics, Speech and Signal Processing
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 1

This paper presents a new algorithm for identifying the language of words in a multilingual automatic speech recognition system. The new algorithm uses as input written words and it is composed of a method for language modelling and a method to select the language of a given word based on ...

7
March 2009 DCC '09: Proceedings of the 2009 Data Compression Conference
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 0

In this paper we study how to encode N-long vectors, with N in the range of hundreds, at low bit rates of 0.5 bit per sample or lower. We adopt a vector quantization structure, where an overall gain is encoded with a scalar quantizer and the remaining scaled vector is ...
Keywords: quantization, Golay codes

8
January 2008 EURASIP Journal on Bioinformatics and Systems Biology: Volume 2008, January 2008
Publisher: Hindawi Limited
Bibliometrics:
Citation Count: 4
Downloads (6 Weeks): 0,   Downloads (12 Months): 2,   Downloads (Overall): 78

Full text available: PDFPDF
The Boolean network paradigm is a simple and effective way to interpret genomic systems, but discovering the structure of these networks remains a difficult task. The minimum description length (MDL) principle has already been used for inferring genetic regulatory networks from time-series expression data and has proven useful for recovering ...

9
July 2007 IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB): Volume 4 Issue 3, July 2007
Publisher: IEEE Computer Society Press
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 0,   Downloads (12 Months): 4,   Downloads (Overall): 251

Full text available: PDFPDF
This article introduces an algorithm for the lossless compression of DNA files, which contain annotation text besides the nucleotide sequence. First a grammar is specifically designed to capture the regularities of the annotation text. A revertible transformation uses the grammar rules in order to equivalently represent the original file as ...
Keywords: 4 [Data]: Coding and Information Theory | Data compaction and compression, F.4 [Theory of Computation]: Mathematical Logic and Formal Languages | Formal languages, G.3 [Mathematics of Computing]: Probability and Statistics | Markov processes, J.3 [Computer Applications]: Life and Medical Sciences | Biology and genetics, Annotation, Compression, Formal Grammars, Nucleotide sequences

10
March 2007 DCC '07: Proceedings of the 2007 Data Compression Conference
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 2

We present the NML model for classes of models with memory described by first order dependencies. The model is used for efficiently locating and encoding the best regressor present in a dictionary. By combining the order-1 NML with the order- 0 NML model the resulting algorithm achieves a consistent improvement ...

11
October 2006 NOLASC'06: Proceedings of the 5th WSEAS international conference on Non-linear analysis, non-linear systems and chaos
Publisher: World Scientific and Engineering Academy and Society (WSEAS)
Bibliometrics:
Citation Count: 0

As more biological data become available, the need for specific tools to analyze the data is more pressing. The methods for protein comparisons, which can asses if two given proteins are similar or not, are amongst the most important tools for analyzing biological data. These methods are very useful when ...
Keywords: compositional adjustment, substitution matrix, local similarity score, protein lossless compression

12
October 2006 IEEE Transactions on Signal Processing - Part II: Volume 54 Issue 6, June 2006
Publisher: IEEE Press
Bibliometrics:
Citation Count: 0

This paper addresses the problem of estimating the expressions or concentrations of proteins from measurements obtained from protein arrays and illustrates the methodology on lysate microarray data. With several families of parametric models we design a number of algorithms for the estimation of a highly nonlinear calibration curve as well ...
Keywords: maximum-likelihood estimation, proteins, microarray data, nonlinear estimation, Heteroscedastic noise, model order selection

13
September 2006 IEEE Transactions on Information Theory: Volume 48 Issue 7, July 2002
Publisher: IEEE Press
Bibliometrics:
Citation Count: 1

In this paper, alphabet extension for Markov sources is studied such that each extension tree is grown by splitting the node with the maximum value for a weight as a generalization of the leaf probability in Tunstall's (1967) algorithm. We show that the optimal asymptotic rate of convergence of the ...

14
May 2005 Bioinformatics: Volume 21 Issue 9, May 2005
Publisher: Oxford University Press
Bibliometrics:
Citation Count: 0

Motivation: The protein lysate microarray is a developing proteomic technology for measuring protein expression levels in a large number of biological samples simultaneously. A challenge for accurate quantification is the relatively narrow dynamic range associated with the commonly used chromogenic signal detection system. To facilitate accurate measurement of the relative ...

15
March 2005 DCC '05: Proceedings of the Data Compression Conference
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 0

We discuss a lossless data compression system that uses fixed Tree Machines to encode data. The idea is to create a sequence of Tree Machines and a robust escape method aimed at preventing expansion of the encoded string for data whose statistics deviate from those represented by the machines. The ...

16 published by ACM
January 2005 ACM Transactions on Information Systems (TOIS): Volume 23 Issue 1, January 2005
Publisher: ACM
Bibliometrics:
Citation Count: 11
Downloads (6 Weeks): 5,   Downloads (12 Months): 20,   Downloads (Overall): 1,339

Full text available: PDFPDF
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 ...
Keywords: DNA compression, normalized maximum likelihood model, Approximate sequence matching

17
January 2005 EURASIP Journal on Applied Signal Processing: Volume 2005, 1 January 2005
Publisher: Hindawi Limited
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 0,   Downloads (12 Months): 0,   Downloads (Overall): 123

Full text available: PDFPDF
This paper presents a method based on fitting a sum-of-exponentials model to the nonuniformly sampled data, for clustering the time series of gene expression data. The structure of the model is estimated by using the minimum description length (MDL) principle for nonlinear regression, in a new form, incorporating a normalized ...
Keywords: gene expression data, nonuniformly sampled data, developmental biology, normalized maximum likelihood, time series, clustering, sum-of-exponentials model

18
January 2004 EURASIP Journal on Applied Signal Processing: Volume 2004, 1 January 2004
Publisher: Hindawi Limited
Bibliometrics:
Citation Count: 4
Downloads (6 Weeks): 0,   Downloads (12 Months): 0,   Downloads (Overall): 104

Full text available: PDFPDF
This paper focuses on the stability-based approach for estimating the number of clusters K in microarray data. The cluster stability approach amounts to performing clustering successively over random subsets of the available data and evaluating an index which expresses the similarity of the successive partitions obtained. We present a method ...
Keywords: clustering stability, hierarchical clustering methods, partition distance, similarity indices, microarray data, number of clusters

19
July 2003 Signal Processing - From signal processing theory to implementation: Volume 83 Issue 7, July 2003
Publisher: Elsevier North-Holland, Inc.
Bibliometrics:
Citation Count: 0

In this paper we develop two families of indexing methods for permutation codes and lattices, the lexicographical and binomial indexing families. The parameters of a method within a family can be optimized with respect to a given criterion in order to obtain a good indexing method on the considered set ...
Keywords: lattice, channel, indexing, multiple scale leader lattice, permutation codes

20
April 2003 Signal Processing - Special issue: Genomic signal processing: Volume 83 Issue 4, April 2003
Publisher: Elsevier North-Holland, Inc.
Bibliometrics:
Citation Count: 0




The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us