Study on shock graphs: graph representation of objects
Desai, Abhi Hitesh
MetadataShow full item record
A shock graph is an abstraction of a two-dimensional shape of an object. It represents the shape as a graph, using its boundary information. In this thesis, we study the shock graph representation of two-dimensional shapes. We discuss a method to compute an approximation of shock graph. We discuss different thresholds we need to set for shock graph computation, and some solutions on how we can get rid of them in some cases. Next, we see the results showing some unique properties of shock graph. And finally, we discuss how we can use shock graphs in different applications, and for further research.
- M Tech Dissertations 
Showing items related by title, author, creator and subject.
The Study of Vertex Coloring Algorithms Using Heuristic Approaches Lodha, Pratik (Dhirubhai Ambani Institute of Information and Communication Technology, 2018)Graph vertex coloring is one of the most studied NP-complete optimization problem (READ, 1972) . The problem is that; given a graph G, determine the number of colors required to color G, so that no two adjacent vertices ...
Downsampling of signals on graphs: an algebraic perspective Vaishnav, Nileshkumar (Dhirubhai Ambani Institute of Information and Communication Technology, 2018)Real-world data such as weather data, seismic activity data, sensor networks data and social network data can be represented and processed conveniently using a mathematical structure called Graph. Graphs are a collection ...
Acyclic edge coloring of complete r-partite graphs Teja, V. Krishna (Dhirubhai Ambani Institute of Information and Communication Technology, 2011)An acyclic edge coloring of a graph G is a proper edge coloring of G which has no dichromatic cycle. The minimum number of colors required to acyclically edge color graph G is called its acyclic chromatic index, denoted ...