Sciweavers

40 search results - page 4 / 8
» On Graphs and Codes Preserved by Edge Local Complementation
Sort
View
TIP
2008
92views more  TIP 2008»
14 years 11 months ago
Edge-Oriented Uniform Intra Prediction
We propose an intra prediction solution to block-based image compression. In order to adapt to local image features during intra prediction, we consider the distinct image singular...
Dong Liu, Xiaoyan Sun, Feng Wu, Ya-Qin Zhang
DAGM
2003
Springer
15 years 4 months ago
Hierarchy of Partitions with Dual Graph Contraction
Abstract. We present a hierarchical partitioning of images using a pairwise similarity function on a graph-based representation of an image. This function measures the difference ...
Yll Haxhimusa, Walter G. Kropatsch
ICMCS
2006
IEEE
152views Multimedia» more  ICMCS 2006»
15 years 5 months ago
Coding Artifact Reduction using Non-Reference Block Grid Visibility Measure
In this work a new method is proposed for coding artifact reduction of MPEG compressed video sequences. The method makes use of a simple cost-effective technique that allows the b...
Ihor O. Kirenko, Remco Muijs, Ling Shao
CORR
2008
Springer
76views Education» more  CORR 2008»
14 years 11 months ago
Constraint Complexity of Realizations of Linear Codes on Arbitrary Graphs
ABSTRACT. A graphical realization of a linear code C consists of an assignment of the coordinates of C to the vertices of a graph, along with a specification of linear state spaces...
Navin Kashyap
JCT
2007
107views more  JCT 2007»
14 years 11 months ago
Vertex-minors, monadic second-order logic, and a conjecture by Seese
We prove that one can express the vertex-minor relation on finite undirected graphs by formulas of monadic second-order logic (with no edge set quantification) extended with a p...
Bruno Courcelle, Sang-il Oum