메뉴 건너뛰기




Volumn 35, Issue 3, 1996, Pages 634-649

Adaptive fusion processor paradigms for fusion of information acquired at different levels of detail

Author keywords

Adaptive learning; Decision fusion; Feature fusion; Multilevel fusion; Nearest neighbor techniques; Sensor fusion

Indexed keywords


EID: 0000927496     PISSN: 00913286     EISSN: None     Source Type: Journal    
DOI: 10.1117/1.600656     Document Type: Article
Times cited : (13)

References (23)
  • 1
    • 0004197578 scopus 로고
    • IEEE Computer Press, Los Alamitos, CA
    • B. V. Dasarathy, Decision Fusion, IEEE Computer Press, Los Alamitos, CA (1994).
    • (1994) Decision Fusion
    • Dasarathy, B.V.1
  • 2
    • 15044363999 scopus 로고
    • Sell-partitioning neural networks
    • Automatic Object Recognition IV
    • H. S. Ranganath and S. R. F. Sims, "Sell-partitioning neural networks," in Automatic Object Recognition IV, Proc. SPIE 2234, (1994).
    • (1994) Proc. SPIE , vol.2234
    • Ranganath, H.S.1    Sims, S.R.F.2
  • 3
    • 0025206332 scopus 로고
    • Probabilistic neural networks
    • D. F. Specht, "Probabilistic neural networks," Neural Networks 3(1), 109-118 (1990).
    • (1990) Neural Networks , vol.3 , Issue.1 , pp. 109-118
    • Specht, D.F.1
  • 4
    • 0029296479 scopus 로고
    • Adaptive decision systems with extended learning for deployment in partially exposed environments
    • B. V. Dasarathy, "Adaptive decision systems with extended learning for deployment in partially exposed environments," Opt. Eng. 34(5), 1269-1280 (1995).
    • (1995) Opt. Eng. , vol.34 , Issue.5 , pp. 1269-1280
    • Dasarathy, B.V.1
  • 5
    • 3543145962 scopus 로고
    • CORPS: Class Overlap Region Partitioning Scheme - A tool for feature assessment
    • Architecture, Hardware, and Forward-Looking Infrared Issues in Automatic Target Recognition
    • B. V. Dasarathy, "CORPS: Class Overlap Region Partitioning Scheme - A tool for feature assessment," in Architecture, Hardware, and Forward-Looking Infrared Issues in Automatic Target Recognition, Proc. SPIE 1957, 215-226 (1993).
    • (1993) Proc. SPIE , vol.1957 , pp. 215-226
    • Dasarathy, B.V.1
  • 6
    • 0026226048 scopus 로고
    • Decision fusion strategies in multi-sensor environments
    • B. V. Dasarathy, "Decision fusion strategies in multi-sensor environments," IEEE Trans. Systems Man Cybernet. 21(5), 1140-1154 (1991).
    • (1991) IEEE Trans. Systems Man Cybernet. , vol.21 , Issue.5 , pp. 1140-1154
    • Dasarathy, B.V.1
  • 7
    • 0000059895 scopus 로고    scopus 로고
    • Fusion strategies for enhancing decision reliability in multisensor environments
    • B. V. Dasarathy, "Fusion strategies for enhancing decision reliability in multisensor environments," Opt. Eng. in this issue (1996).
    • (1996) Opt. Eng. , Issue.THIS ISSUE
    • Dasarathy, B.V.1
  • 9
    • 0028385080 scopus 로고
    • Minimal consistent subset (MCS) identification for optimal nearest neighbor decision systems design
    • B. V. Dasarathy, "Minimal consistent subset (MCS) identification for optimal nearest neighbor decision systems design," IEEE Trans. Systems Man Cybernet. 24(3), 511-517 (1994).
    • (1994) IEEE Trans. Systems Man Cybernet. , vol.24 , Issue.3 , pp. 511-517
    • Dasarathy, B.V.1
  • 10
    • 15044365912 scopus 로고
    • Is your nearest neighbor near enough a neighbor?
    • D. G. Lainiotis and N. S. Tzannes, Eds., Hemisphere Publishing
    • B. V. Dasarathy, "Is your nearest neighbor near enough a neighbor?" in Applications and Research in Information Systems and Sciences, D. G. Lainiotis and N. S. Tzannes, Eds., Vol. 1, pp. 114-117, Hemisphere Publishing (1977).
    • (1977) Applications and Research in Information Systems and Sciences , vol.1 , pp. 114-117
    • Dasarathy, B.V.1
  • 11
    • 0027242497 scopus 로고
    • A statistical decision rule with incomplete knowledge about classes
    • B. Dubuisson and M. Masson, "A statistical decision rule with incomplete knowledge about classes," Pattern Recog. 26(1), 155-165 (1993).
    • (1993) Pattern Recog. , vol.26 , Issue.1 , pp. 155-165
    • Dubuisson, B.1    Masson, M.2
  • 12
  • 13
    • 0026828784 scopus 로고
    • Fast K-dimensional tree algorithms for nearest neighbor search with application to vector quantization encoding
    • V. Ramasubramanian and K. K. Paliwal, "Fast K-dimensional tree algorithms for nearest neighbor search with application to vector quantization encoding," IEEE Trans. Commun. 40(3), 518-531 (1992).
    • (1992) IEEE Trans. Commun. , vol.40 , Issue.3 , pp. 518-531
    • Ramasubramanian, V.1    Paliwal, K.K.2
  • 14
    • 38249013493 scopus 로고
    • An efficient approximation algorithm for fast nearest-neighbor search based on spherical distance coordinate formulation
    • V. Ramasubramanian and K. K. Paliwal, "An efficient approximation algorithm for fast nearest-neighbor search based on spherical distance coordinate formulation," Pattern Recog. Lett. 13(7), 471-480 (1992).
    • (1992) Pattern Recog. Lett. , vol.13 , Issue.7 , pp. 471-480
    • Ramasubramanian, V.1    Paliwal, K.K.2
  • 17
    • 38249002676 scopus 로고
    • An improved method for finding nearest neighbors
    • Q. Jiang and W. Zhang, "An improved method for finding nearest neighbors," Pattern Recog. Lett. 14(7), 531-536 (1993).
    • (1993) Pattern Recog. Lett. , vol.14 , Issue.7 , pp. 531-536
    • Jiang, Q.1    Zhang, W.2
  • 18
    • 38249003811 scopus 로고
    • A hashing oriented nearest neighbor searching scheme
    • C.-C. Chang, "A hashing oriented nearest neighbor searching scheme," Pattern Recog. Lett. 14(8), 625-630 (1993).
    • (1993) Pattern Recog. Lett. , vol.14 , Issue.8 , pp. 625-630
    • Chang, C.-C.1
  • 20
    • 0003046095 scopus 로고
    • New formulation and improvements of the nearest-neighbor approximating and eliminating search algorithm (AESA)
    • E. Vidal, "New formulation and improvements of the nearest-neighbor approximating and eliminating search algorithm (AESA)," Pattern Recog. Lett. 15(1), 1-7 (1994).
    • (1994) Pattern Recog. Lett. , vol.15 , Issue.1 , pp. 1-7
    • Vidal, E.1
  • 21
    • 0003159276 scopus 로고
    • A new version of the nearest-neighbor approximating and eliminating search algorithm (AESA) with linear preprocessing time and memory requirements
    • M. L. Mico, J. Oncina, and E. Vidal, "A new version of the nearest-neighbor approximating and eliminating search algorithm (AESA) with linear preprocessing time and memory requirements," Pattern Recog. Lett. 15(1), 9-17 (1994).
    • (1994) Pattern Recog. Lett. , vol.15 , Issue.1 , pp. 9-17
    • Mico, M.L.1    Oncina, J.2    Vidal, E.3
  • 23
    • 0026837985 scopus 로고
    • Designing multilayer perceptrons from nearest-neighbor systems
    • S. G. Smyth, "Designing multilayer perceptrons from nearest-neighbor systems," IEEE Trans. Neural Networks 3(2), 329-333 (1992).
    • (1992) IEEE Trans. Neural Networks , vol.3 , Issue.2 , pp. 329-333
    • Smyth, S.G.1


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