Accelerating Competitive Learning Graph Quantization

Details Accelerating Competitive Learning Graph Quantization Accelerating Competitive Learning Graph Quantization

2010-01-06

arxiv.org/abs/1001.0927v1

Computer Science

Computer Vision and Pattern Recognition

17 pages; submitted to CVIU

Scientific paper

Vector quantization(VQ) is a lossy data compression technique from signal processing for which simple competitive learning is one standard method to quantize patterns from the input space. Extending competitive learning VQ to the domain of graphs results in competitive learning for quantizing input graphs. In this contribution, we propose an accelerated version of competitive learning graph quantization (GQ) without trading computational time against solution quality. For this, we lift graphs locally to vectors in order to avoid unnecessary calculations of intractable graph distances. In doing so, the accelerated version of competitive learning GQ gradually turns locally into a competitive learning VQ with increasing number of iterations. Empirical results show a significant speedup by maintaining a comparable solution quality.

Affiliated with

Also associated with

No associations

Rating

Accelerating Competitive Learning Graph Quantization does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Accelerating Competitive Learning Graph Quantization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Accelerating Competitive Learning Graph Quantization will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-164477