DTSC - GPM - Capítulos de Monografíashttp://hdl.handle.net/10016/15922015-04-28T18:18:13Z2015-04-28T18:18:13ZFilter optimization and complexity reduction for video coding using graph-based transformsMartínez Enríquez, EduardoDíaz-de-María, FernandoCid Sueiro, J.Ortega, Antoniohttp://hdl.handle.net/10016/187932014-04-23T00:00:13Z2013-01-01T00:00:00ZFilter optimization and complexity reduction for video coding using graph-based transforms
Martínez Enríquez, Eduardo; Díaz-de-María, Fernando; Cid Sueiro, J.; Ortega, Antonio
The basis functions of lifting transform on graphs are completely
determined by finding a bipartition of the graph and defining the
prediction and update filters to be used. In this work we consider the
design of prediction filters that minimize the quadratic prediction error
and therefore the energy of the detail coefficients, which will give
rise to higher energy compaction. Then, to determine the graph bipartition,
we propose a distributed maximum-cut algorithm that significantly
reduces the computational cost with respect to the centralized
version used in our previous work. The proposed techniques
show improvements in coding performance and computational cost
as compared to our previous work.
2013-01-01T00:00:00ZGene Expressio Array Exploration Using K-Formal Concept AnalysisGonzález-Calabozo, José MaríaPeláez-Moreno, CarmenValverde-Albacete, Francisco J.http://hdl.handle.net/10016/132522013-09-30T16:49:12Z2011-01-01T00:00:00ZGene Expressio Array Exploration Using K-Formal Concept Analysis
González-Calabozo, José María; Peláez-Moreno, Carmen; Valverde-Albacete, Francisco J.
DNA micro-arrays are a mechanism for eliciting gene expression values, the concentration of the transcription products of a set of genes, under different chemical conditions. The phenomena of interest—up-regulation, down-regulation and co-regulation—are hypothesized to stem from the functional relationships among transcription products. In [1,2,3] a generalisation of Formal Concept Analysis was developed with data mining applications in mind, K-Formal Concept Analysis, where incidences take values in certain kinds of semirings, instead of the usual Boolean carrier set. In this paper, we use (Rmin+)- and (Rmax+) to analyse gene expression data for Arabidopsis thaliana. We introduce the mechanism to render the data in the appropriate algebra and profit by the wealth of different Galois Connections available in Generalized Formal Concept Analysis to carry different analysis for up- and down-regulated genes.
Proceeding of: 9th International Conference, ICFCA 2011, Nicosia, Cyprus, May 2-6, 2011.
2011-01-01T00:00:00ZDetecting Features from Confusion Matrices using Generalized Formal Concept AnalysisPeláez-Moreno, CarmenValverde-Albacete, Francisco J.http://hdl.handle.net/10016/131102013-09-30T16:50:42Z2010-01-01T00:00:00ZDetecting Features from Confusion Matrices using Generalized Formal Concept Analysis
Peláez-Moreno, Carmen; Valverde-Albacete, Francisco J.
We claim that the confusion matrices of multiclass problems can be analyzed by means of a generalization of Formal Concept Analysis to obtain symbolic information about the feature sets of the underlying classification task.We prove our claims by analyzing the confusion matrices of human speech perception experiments and comparing our results to those elicited by experts.
2010-01-01T00:00:00ZSpectral lattices of (R)over-bar(max),(+)-Formal contextsValverde-Albacete, Francisco J.Peláez-Moreno, Carmenhttp://hdl.handle.net/10016/87872013-09-30T16:59:00Z2008-02-15T00:00:00ZSpectral lattices of (R)over-bar(max),(+)-Formal contexts
Valverde-Albacete, Francisco J.; Peláez-Moreno, Carmen
In [13] a generalisation of Formal Concept Analysis was introduced with data mining applications in mind, K-Formal Concept Analysis, where incidences take values in certain kinds of semirings, instead of the standard Boolean carrier set. Subsequently, the structural lattice of such generalised contexts was introduced in [15], to provide a limited equivalent to the main theorem of K-Formal Concept Analysis, resting on a crucial parameter, the degree of existence of the object-attribute pairs phi. In this paper we introduce the spectral lattice of a concrete instance of K-Formal Concept Analysis, as a further means to clarify the structural and the K-Concept Lattices and the choice of p. Specifically, we develop techniques to obtain the join- and meet-irreducibles of a (R) over bar (max),+-Concept Lattice independently of phi and try to clarify its relation to the corresponding structural lattice.
Proceeding of: 6th International Conference, ICFCA 2008, Montreal, Canada, February 25-28, 2008
2008-02-15T00:00:00Z