Analysis and improvement of the partial distance search algorithm

Fissore, L.; Laface, Pietro; Massafra, P.; Ravera, Franco

doi:10.1109/icassp.1993.319300

Cited by 8 publications

(4 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Recently, Yang and Wang [19] propose a partial search strategy which aims at finding the nearest cluster center in image data. The strategy is based on partitioning the space into partial regions, using Unbalanced-Binary-Tree (UBT).…”

Section: Partial Distancementioning

confidence: 99%

New Efficient Strategy to Accelerate k-Means Clustering Algorithm

Zoubi¹,

Hudaib²,

Huneiti³

et al. 2008

American J. of Applied Sciences

View full text Add to dashboard Cite

One of the most popular clustering techniques is the k-means clustering algorithm. However, the utilization of the k-means is severely limited by its high computational complexity. In this study, we propose a new strategy to accelerate the k-means clustering algorithm through the Partial Distance (PD) logic. The proposed strategy avoids many unnecessary distance calculations by applying efficient PD strategy. Experiments show the efficiency of the proposed strategy when applied to different data sets

show abstract

Section: Partial Distancementioning

confidence: 99%

New Efficient Strategy to Accelerate k-Means Clustering Algorithm

Zoubi¹,

Hudaib²,

Huneiti³

et al. 2008

American J. of Applied Sciences

View full text Add to dashboard Cite

show abstract

“…The proposed method has the advantage of being simple and producing the same results as the GLA algorithm. Using Winograd's Identity [3] or partial distance search [2], the search time could be improved even more. Quality of the codebook could be improved with iterative methods that have been proposed for GLA [6], [13].…”

Section: Introductionmentioning

confidence: 99%

A novel full-search vector quantization algorithm based on the law of cosines

Mielikäinen

2002

IEEE Signal Process. Lett.

View full text Add to dashboard Cite

Vector quantization (VQ) is an essential tool in signal processing. Although many algorithms for vector quantizer design have been developed, the classical generalized Lloyd algorithm (GLA) is still widely used, mainly for its simplicity and relatively good performance. Using law of cosines this letter presents a simple improved method for nearest-neighbor search in GLA. Experiments show that the proposed algorithm outperforms the traditional GLA.Index Terms-Fast nearest-neighbor search, law of cosines, vector quantization.

show abstract

“…The PDS algorithm is usually used in the last stage in VQ [2,3] when other elimination criterions cannot reject the unlikely codewords anymore. Previous work [4] proposed an improvement of the PDS algorithm called DPPDS by using dynamic programming (DP), and previous work [5] proposed an improvement of the PDS algorithm called the extended PDS (EPDS) algorithm. In addition, because of the energy compaction property of the DCT transform, previous work [6] proposed an improvement for the PDS algorithm in the DCT domain, which effectively speeded up the VQ encoding process.…”

mentioning

confidence: 99%

Partial distortion search algorithm based on two-step d _min updating

Pan

et al. 2011

Electron. Lett.

View full text Add to dashboard Cite

The encoding process of vector quantisation is computationally very expensive. To reduce distortion computation between the input vector and candidate codewords, the well-known partial distortion search (PDS) algorithm has been proposed. To reduce further its computational cost, a new PDS algorithm is proposed by making current d min decrease as quickly as possible. Experimental results have demonstrated the effectiveness of the proposed PDS algorithm in terms of both the computing dimensions and arithmetical operations per input vector.

show abstract

Analysis and improvement of the partial distance search algorithm

Cited by 8 publications

References 5 publications

New Efficient Strategy to Accelerate k-Means Clustering Algorithm

New Efficient Strategy to Accelerate k-Means Clustering Algorithm

A novel full-search vector quantization algorithm based on the law of cosines

Partial distortion search algorithm based on two-step d _min updating

Contact Info

Product

Resources

About

Analysis and improvement of the partial distance search algorithm

Cited by 8 publications

References 5 publications

New Efficient Strategy to Accelerate k-Means Clustering Algorithm

New Efficient Strategy to Accelerate k-Means Clustering Algorithm

A novel full-search vector quantization algorithm based on the law of cosines

Partial distortion search algorithm based on two-step d min updating

Contact Info

Product

Resources

About

Partial distortion search algorithm based on two-step d _min updating