메뉴 건너뛰기




Volumn 19, Issue 6, 1996, Pages 719-724

An efficient nearest neighbor searching algorithm with application to LBG codebook generation

Author keywords

Nearest neighbor (NN); Reference points (RP); Triangular inequality; Vector quantization (VQ)

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; IMAGE CODING; PHASE MODULATION; VECTOR QUANTIZATION;

EID: 0030287339     PISSN: 02533839     EISSN: 21587299     Source Type: Journal    
DOI: 10.1080/02533839.1996.9677837     Document Type: Article
Times cited : (1)

References (10)
  • 4
    • 0024056708 scopus 로고
    • Image Coding Using Vector Quantization: A Review
    • Aug
    • Nasrabadi, N.M., and King, R.A., 1988. “Image Coding Using Vector Quantization:A Review”. IEEE Transactions on Communications, 36 Aug.:957–971.
    • (1988) IEEE Transactions on Communications , vol.36 , pp. 957-971
    • Nasrabadi, N.M.1    King, R.A.2
  • 5
    • 0026392379 scopus 로고
    • A Fast Nearest-Neighbour Search Algorithm
    • Orchard, M.D., 1991. “A Fast Nearest-Neighbour Search Algorithm”. IEEE ICASSP,:2297–2300.
    • (1991) IEEE ICASSP , pp. 2297-2300
    • Orchard, M.D.1
  • 6
    • 38249013493 scopus 로고
    • An Efficient Approximation-Elimination Algorithm for Fast Nearest-Neighbour Search Based on a Spherical Distance Coordinate Formulation
    • Ramasubramanian, V., and Paliwal, K.K., 1992. “An Efficient Approximation-Elimination Algorithm for Fast Nearest-Neighbour Search Based on a Spherical Distance Coordinate Formulation”. Pattern Recognition Letters, 13:471–480.
    • (1992) Pattern Recognition Letters , vol.13 , pp. 471-480
    • Ramasubramanian, V.1    Paliwal, K.K.2
  • 7
    • 0022858293 scopus 로고
    • An Algorithm for Finding Nearest Neighbours in (Approximately) Constant Average Time Complexity
    • Vidal, E., 1986. “An Algorithm for Finding Nearest Neighbours in (Approximately) Constant Average Time Complexity”. Pattern Recognition Letters, 4:145–157.
    • (1986) Pattern Recognition Letters , vol.4 , pp. 145-157
    • Vidal, E.1
  • 8
    • 0003046095 scopus 로고
    • New Formulation and Improvements of the Nearest-Neighbour Approximating and Eliminating Search Algorithm (AESA)
    • Vidal, E., 1994. “New Formulation and Improvements of the Nearest-Neighbour Approximating and Eliminating Search Algorithm (AESA)”. Pattern Recognition Letters, 15:1–7.
    • (1994) Pattern Recognition Letters , vol.15 , pp. 1-7
    • Vidal, E.1
  • 9
    • 0003159276 scopus 로고
    • A New Version of the Nearest-Neighbour Approximating and Elimination Search Algorithm (AESA) with Linear Preprocessing Time and Memory Requirements
    • Vidal, E., 1994. “A New Version of the Nearest-Neighbour Approximating and Elimination Search Algorithm (AESA) with Linear Preprocessing Time and Memory Requirements”. Pattern Recognition Letters, 15:9–11.
    • (1994) Pattern Recognition Letters , vol.15 , pp. 9-11
    • Vidal, E.1
  • 10
    • 0028368863 scopus 로고
    • Acceleration of the LBG Algorithm
    • Feb/Mar/Apr
    • Wu, X., and Guan, L., 1994. “Acceleration of the LBG Algorithm”. IEEE Transactions on Communications, 42 (2/3/4) Feb/Mar/Apr:1518–1523.
    • (1994) IEEE Transactions on Communications , vol.42 , Issue.2/4/3 , pp. 1518-1523
    • Wu, X.1    Guan, L.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.