scholarly journals Sistema de Visión Subacuático Inalámbrico Usando un Algoritmo de Compresión Progresivo con Región de Interés

2017 ◽  
Vol 15 (1) ◽  
pp. 46
Author(s):  
Eduardo M Rubino ◽  
D. Centelles ◽  
Jorge Sales ◽  
José V. Martí ◽  
Raúl Marín ◽  
...  
Keyword(s):  
Block Tree

<p>La creciente demanda en todo el mundo de sistemas de intervención submarina en diversos dominios de aplicación requiere sistemas más versátiles y económicos. Empleando un sistema de comunicación inalámbrica, los robots semiautónomos supervisados disponen de libertad de movimientos y, al mismo tiempo, permiten al operador obtener información visual y supervisar la intervención. Por otro lado, la velocidad de transmisión de datos típica de los canales inalámbricos submarinos es, en general, muy limitada, siendo necesaria la aplicación de técnicas de compresión avanzadas. En este artículo se presenta principalmente el algoritmo DEBT (Depth Embedded Block Tree) para la compresión progresiva de imágenes con región de interés (ROI). Los resultados demuestran ventajas con respecto a otros algoritmos de compresión, y la posibilidad de ejecución del algoritmo en tiempo real en ordenadores embebidos de bajo consumo basados en ARM.</p>

scholarly journals The Structure of Locally Finite Two-Connected Graphs

10.37236/1211 ◽  
1995 ◽  
Vol 2 (1) ◽  
Author(s):  
Carl Droms ◽  
Brigitte Servatius ◽  
Herman Servatius
Keyword(s):  
Connected Graph ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Locally Finite ◽  
Connected Graphs ◽  
Finite Graphs ◽  
Locally Finite Graphs ◽  
Necessary And Sufficient ◽  
Block Tree ◽  
Labeled Tree

We expand on Tutte's theory of $3$-blocks for $2$-connected graphs, generalizing it to apply to infinite, locally finite graphs, and giving necessary and sufficient conditions for a labeled tree to be the $3$-block tree of a $2$-connected graph.

Improved Techniques for Mammographic Image Compression using Balanced Multiwavelet Block Tree Coding

2012 ◽  
Vol 58 (1) ◽  
pp. 13
Author(s):  
US Ragupathy ◽  
A Tamilarasi ◽  
SChenthur Pandian
Keyword(s):  
Image Compression ◽  
Mammographic Image ◽  
Block Tree

scholarly journals Unanimous and Strategy-Proof Probabilistic Rules for Single-Peaked Preference Profiles on Graphs

2021 ◽  
Author(s):  
Hans Peters ◽  
Souvik Roy ◽  
Soumyarup Sadhukhan
Keyword(s):  
Probability Distribution ◽  
Connected Graph ◽  
Line Graph ◽  
Preference Profile ◽  
Tree Representation ◽  
General Characterization ◽  
Finite Set ◽  
Probabilistic Rule ◽  
Strategy Proof ◽  
Block Tree

Finitely many agents have preferences on a finite set of alternatives, single-peaked with respect to a connected graph with these alternatives as vertices. A probabilistic rule assigns to each preference profile a probability distribution over the alternatives. First, all unanimous and strategy-proof probabilistic rules are characterized when the graph is a tree. These rules are uniquely determined by their outcomes at those preference profiles at which all peaks are on leaves of the tree and, thus, extend the known case of a line graph. Second, it is shown that every unanimous and strategy-proof probabilistic rule is random dictatorial if and only if the graph has no leaves. Finally, the two results are combined to obtain a general characterization for every connected graph by using its block tree representation.

Linear layouts of weakly triangulated graphs

2016 ◽  
Vol 08 (03) ◽  
pp. 1650038 ◽  
Author(s):  
Asish Mukhopadhyay ◽  
S. V. Rao ◽  
Sidharth Pardeshi ◽  
Srinivas Gundlapalli
Keyword(s):  
Time Algorithm ◽  
Chordal Graphs ◽  
Sparse Graphs ◽  
Interesting Connection ◽  
Triangulated Graphs ◽  
Distance Data ◽  
Point Placement ◽  
Appl Math ◽  
Block Tree ◽  
Triangulated Graph

A graph [Formula: see text] is said to be triangulated if it has no chordless cycles of length 4 or more. Such a graph is said to be rigid if, for a valid assignment of edge lengths, it has a unique linear layout and non-rigid otherwise. Damaschke [Point placement on the line by distance data, Discrete Appl. Math. 127(1) (2003) 53–62] showed how to compute all linear layouts of a triangulated graph, for a valid assignment of lengths to the edges of [Formula: see text]. In this paper, we extend this result to weakly triangulated graphs, resolving an open problem. A weakly triangulated graph can be constructively characterized by a peripheral ordering of its edges. The main contribution of this paper is to exploit such an edge order to identify the rigid and non-rigid components of [Formula: see text]. We first show that a weakly triangulated graph without articulation points has at most [Formula: see text] different linear layouts, where [Formula: see text] is the number of quadrilaterals (4-cycles) in [Formula: see text]. When [Formula: see text] has articulation points, the number of linear layouts is at most [Formula: see text], where [Formula: see text] is the number of nodes in the block tree of [Formula: see text] and [Formula: see text] is the total number of quadrilaterals over all the blocks. Finally, we propose an algorithm for computing a peripheral edge order of [Formula: see text] by exploiting an interesting connection between this problem and the problem of identifying a two-pair in [Formula: see text]. Using an [Formula: see text] time solution for the latter problem, we propose an [Formula: see text] time algorithm for computing its peripheral edge order, where [Formula: see text] and [Formula: see text] are respectively the number of edges and vertices of [Formula: see text]. For sparse graphs, the time complexity can be improved to [Formula: see text], using the concept of handles [R. B. Hayward, J. P. Spinrad and R. Sritharan, Improved algorithms for weakly chordal graphs, ACM Trans. Algorithms 3(2) (2007) 19pp].

Connectivity

2013 ◽  
pp. 37-47
Author(s):  
Mahtab Hosseininia ◽  
Faraz Dadgostari
Keyword(s):  
Connected Graph ◽  
Directed Graphs ◽  
Graph Connectivity ◽  
Breadth First Search ◽  
Undirected Graphs ◽  
Vertex Connectivity ◽  
Edge Connectivity ◽  
Graph Traversal ◽  
Path Component ◽  
Block Tree

In this chapter, the concept of graph connectivity is introduced. In the first section, some concepts such as walk, path, component and connected graph are defined, and connectedness of a graph from the viewpoint of vertex connectivity, and also, edge connectivity are discussed. Then, blocks and block tree of graphs are illustrated. In addition, connectivity in directed graphs is introduced. Furthermore, in the last section, two graph traversal algorithms, depth first search and breadth first search, are described to investigate the connectedness of directed and undirected graphs.

Low memory block tree coding for hyperspectral images

2019 ◽  
Vol 78 (19) ◽  
pp. 27193-27209 ◽  
Author(s):  
Shrish Bajpai ◽  
Naimur Rahman Kidwai ◽  
Harsh Vikram Singh ◽  
Amit Kumar Singh
Keyword(s):  
Hyperspectral Images ◽  
Memory Block ◽  
Block Tree
Sign in / Sign up

Export Citation Format

Share Document