연구동향 분석
박사

GPU를 위한 Feature Extraction 및 Matching Algorithm 병렬화

이철희 2018년

논문상세정보
인용/피인용
' GPU를 위한 Feature Extraction 및 Matching Algorithm 병렬화' 의 주제별 논문영향력
논문영향력 선정 방법
논문영향력 요약
주제
  • 응용 물리
  • High-order graph matching
  • Scale-invariant feature transform
  • cuda
  • feature matching
  • gpu최적화
  • 병렬 처리
동일주제 총논문수 논문피인용 총횟수 주제별 논문영향력의 평균
4,829 0

0.0%

' GPU를 위한 Feature Extraction 및 Matching Algorithm 병렬화' 의 참고문헌

  • Z.-Q. Cheng, Y. Chen, R. R. Martin, Y.-K. Lai, and A. Wang, “SuperMatching: feature matching using supersymmetric geometric constraints,” IEEE Trans. Visual. Comput. graphics, vol. 19, no. 11, pp. 1885-1894, 2013.
  • Y. Zheng, and D. Doermann, “Robust point matching for nonrigid shapes by preserving local neighborhood structures,” IEEE Trans. Pattern. Anal. Mach. Intell., vol. 28, no. 4, pp. 643-649, 2006.
  • X. Shi, H. Ling, W. Hu, J. Xing, Y. Zhang, "Tensor Power Iteration for Multi-Graph Matching,” IEEE. Conf. Comput. Vis. Pattern. Recog., pp. 5062-5070, 2016.
  • V. Garcia, E. Debreuve, F. Nielsen, and M. Barlaud, “K-nearest neighbor search: fast GPU-based implementations and application to high-dimensional feature matching,” IEEE Int. Conf. Image. Process., pp. 3757-3760, 2010.
  • T. Tuytelaars and K. Mikolajczyk, “Local invariant feature detectors: a survey,” Foundations and Trends in Computer Graphcis and Vision, vol. 3, no. 3, pp. 177-280, 2008.
  • S. Park, S.-K. Park, and M. Hebert. “Fast and scalable approximate spectral matching for higher order graph matching,” IEEE Trans. Pattern. Anal. Mach. Intell., vol. 36, no. 3, pp. 479-492, 2014.
  • S. N. Shnha, J.-M. Frahm, “Feature tracking and matching in video using programmable graphics hardware,” Mach. Vis. Appl., vol. 22, no. 1, pp. 207-217, 2011.
  • S. Heymann, K. Muller, A. Smolic., B. Frohlich., T. Wiegand., “SIFT implementation and optimization for general-purpose GPU,” in Proc. WSCG, 2007, pp. 317-322.
  • S. Battiato, G. Gallo, G. Puglisi, S. Scellato, “SIFT features tracking for video stabilization,” in Proc. ICIAP, 2007, pp. 825-830.
  • R. Zhang; W. Wang, "Second- and High-order Graph Matching for Correspondence Problems," IEEE Trans. Circuits Syst. Video Technol., vol.PP, no.99, pp.1-1.
  • R. Zass, and A. Shashua, “Probabilistic graph and hypergraph matching,” IEEE Int. Conf. Comput. Vis. Pattern. Recog., 2008.
  • Q. Kuang, and L. Zhao, “A practical GPU based kNN algorithm,” in Proc. Int. computer Sci. Computational Technol., pp. 151-155, 2009.
  • O. Duchenne, F. bach, K. In-So, and J. Ponce, “Tensor-based high-order graph matching ” IEEE Trans. Pattern Anal. Mach. Intell., vol. 33, no. 12, pp. 2383-2395, 2011.
  • O. Chum and J. Matas, “Matching with PROSAC-progressive sample consensus,” IEEE Computer Society Conf. Comput. Vis. Pattern Anal., June, 2005.
  • M. Chertok, and Y. keller, “Efficient high order matching,” IEEE Trans. Pattern Anal. Mach. Intell., vol. 32, no. 12, pp. 2205-2215, 2010.
  • M. Calonder, V. Lepetit, C. Strecha, and P. Fua, "BRIEF: Binary robust independent elementary features," in Proc. European Conf. Comput. Vis., pp. 778-792, 2010.
  • M. Brown, D. G. Lowe, “Automatic panoramic image stitching using invariant features,” Int. J. Comput. Vis., vol. 74, no. 1, pp 59-73, 2007 .
  • L.-C. Chiu, T.-S. Chang, J.-Y. Chen, and N. Y.-C. Chang, “Fast SIFT design for realtime visual feature extraction,” IEEE Trans. Image Process., vol. 22, no. 8, pp. 3158- 3166, 2013.
  • L. Yao, H. Feng, Y. Zhu, Z. Jiang, D. Zhao, W. Feng, “An architecture of optimized SIFT feature detection for an FPGA implementation of an image matcher,” in Proc. Int. Conf. Field-Programmable Technol,, 2009, pp. 30-37.
  • L. Xu, J. Jia, and Y. Matsushita, “Motion detail preserving optical flow estimation,” IEEE Trans. Pattern Anal. Mach. Intell., vol. 34, no. 9, pp. 1744-1757, 2011.
  • L. Howes, The OpenCL specification (Version 2.1, Document Revision 23), https://www.khronos.org/registry/OpenCL/specs/opencl-2.1.pdf, Nov., 2015.
  • L. De Lathauwer, B. De Moor, and J. Vandewalle, “On the best rank-1 and rank- (r1,r2,. . .,rn) approximation of higher-order tensors,” SIAM J. Matrix Anal. Appl., 21(4):1324–1342, 2000.
  • K. Mikolajczyk and C. shmid, “Scale & affine invariant interest point detectors,” Int. J. Comput. Vis., vol. 60, no. 1, pp. 63–86, 2004.
  • K. Mikolajczyk and C. Shmid, “A performance evaluation of local descriptors,” IEEE Trans. Pattern Anal. Mach. Intell., vol. 27, no. 10, pp. 1615-1630, 2005.
  • J.Matas, O. Chu,. M. Urban, and T. Pajdla, “Robust wide-baseline stereo from maximally stable extremal regions,” Image and vision computing, vol. 22, no. 10, pp. 761-767, 2004.
  • J. Yum, C. Lee, J.-S. Kim, and H.-J. Lee, “A Novel Hardware Architecture with Reduced Internal Memory for Real-time Extraction of SIFT in an HD Video,” IEEE Trans. Circuits Syst. Video Technol.
  • J. R. Rice, R. F. Boisvert, “Solving elliptic problems using ELLPACK,” Springer Verlag, 1984
  • J. Luitjens, Faster Parallel Reductions on Kepler, http://devblogs.nvidia.com/parallelforall/faster-parallel-reductions-kepler, Feb., 2014.
  • J. Lee, M. Cho, and K. M. Lee, “Hyper-graph matching via reweighted random walks,” IEEE Int. Conf. Comput. Vis. Pattern. Recog., pp. 1633-1640, 2011.
  • J. Jiang, X. Li, and G. Zhang, “SIFT hardware implementation for real-time image feature extraction,” IEEE Trans. Circuits Syst. Video Technol., vol. 24, no. 7, pp. 1209-1220, 2014.
  • J. Heinly, E. Dunn, and J. M. Frahm, “Comparative evaluation of binary features,” in Proc. European Conf. Comput. Vis., pp. 759-773, 2012.
  • J. Cheng, C. Leng, J. Wu, H. Cui, and H. Lu, “Fast and accurate image matching with cascade hasing for 3D reconstruction.” In Proc. IEEE Conf. Comput. Vis. Pattern. Anal., pp. 1-8, 2014.
  • H. Bay, T. Tuytelaars, and L. V. Gool, "SURF: Speeded up Robust Features," in Proc. European Conf. Comput. Vis., 2006, pp. 404-417.
  • G.H. Golub and C.F.V. Loan, Matrix Computations, Johns Hopkins Univ. Press, 1996.
  • G. Wang, B. Rister, and J. R. Cavallaro, “Workload analysis and efficient OpenCLbased Implementation of SIFT algorithm on a smartphone,” in Proc. GlobalSIP, 2013, pp. 759-762.
  • F.-H. Huang, S.-Y. Huang, J.-W. Ker, and Y.-C. Chen, “High-performance SIFT hardware accelerator for real-time image feature extraction,” IEEE Trans Circuits Syst. Video Technol., vol. 22, no. 3, pp. 340-351, 2012.
  • E. S. Kim and H.-J. Lee, “A novel hardware design for SIFT generation with reduced memory requirement,” J. Semicond. Technol. Sci., vol. 13, no. 2, pp. 157–169, Apr. 2013.
  • E. Rublee, V. Rabaud, K. Konolige, and G. Bradski, “ORB: An efficient alternative to SIFT or SURF,” in Proc. IEEE Int. Conf. Comput. Vis., 2011, pp. 2564–2571.
  • E. Rosten, R. Porter, and T. Drummond, "Faster and better: A machine learning approach to corner detection," IEEE Trans. Pattern. Anal. Mach. Intell., vol. 32, no. 1, pp. 105-119, Jan., 2010.
  • D. G. Lowe, “Distinctive image features from scale-invariant keypoints,” Int. J. Comput. Vis., vol. 60, no. 2, pp.91-110, 2004.
  • Chli, and R. Siegwart, “BRISK: Binary robust invariant scalable keypoints,” in Proc. IEEE Int. Conf. Comput. Vis., 2011, pp. 2548–2555.
  • C. Wu, SiftGPU : A GPU implementation of scale invariant feature transform (SIFT), 2007, [Online]. Available: http:/cs.unc.edu/~ccwu/siftgpu/.
  • C. Schmid, and R. Mohr, “Local grayvalue invariants for image retrieval,” IEEE Trans. Pattern. Anal. Mach. Intell., vol. 19, no. 5, pp. 530-534, 1997.
  • B. Rister, G. Wang, M. Wu, “A fast and efficient SIFT detector using the mobile GPU,” in Proc. ICASSP, 2013, pp. 2674-2678.
  • A. Chariot, R. Keriven, “GPU-boosted online image matching,” Int. Conf. Pattern. Recog., pp. 1-4, 2008.