Segmented gray-code kernels for fast pattern matching

The gray-code kernels (GCK) family, which has Walsh Hadamard transform on sliding windows as a member, is a family of kernels that can perform image analysis efficiently using a fast algorithm, such as the GCK algorithm. The GCK has been successfully used for pattern matching. In this paper, we prop...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on image processing : a publication of the IEEE Signal Processing Society. - 1992. - 22(2013), 4 vom: 07. Apr., Seite 1512-25
1. Verfasser: Ouyang, Wanli (VerfasserIn)
Weitere Verfasser: Zhang, Renqi, Cham, Wai-Kuen
Format: Online-Aufsatz
Sprache:English
Veröffentlicht: 2013
Zugriff auf das übergeordnete Werk:IEEE transactions on image processing : a publication of the IEEE Signal Processing Society
Schlagworte:Journal Article
LEADER 01000naa a22002652 4500
001 NLM223515744
003 DE-627
005 20231224060832.0
007 cr uuu---uuuuu
008 231224s2013 xx |||||o 00| ||eng c
024 7 |a 10.1109/TIP.2012.2233484  |2 doi 
028 5 2 |a pubmed24n0745.xml 
035 |a (DE-627)NLM223515744 
035 |a (NLM)23247853 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Ouyang, Wanli  |e verfasserin  |4 aut 
245 1 0 |a Segmented gray-code kernels for fast pattern matching 
264 1 |c 2013 
336 |a Text  |b txt  |2 rdacontent 
337 |a ƒaComputermedien  |b c  |2 rdamedia 
338 |a ƒa Online-Ressource  |b cr  |2 rdacarrier 
500 |a Date Completed 22.07.2013 
500 |a Date Revised 12.02.2013 
500 |a published: Print-Electronic 
500 |a Citation Status PubMed-not-MEDLINE 
520 |a The gray-code kernels (GCK) family, which has Walsh Hadamard transform on sliding windows as a member, is a family of kernels that can perform image analysis efficiently using a fast algorithm, such as the GCK algorithm. The GCK has been successfully used for pattern matching. In this paper, we propose that the G4-GCK algorithm is more efficient than the previous algorithm in computing GCK. The G4-GCK algorithm requires four additions per pixel for three basis vectors independent of transform size and dimension. Based on the G4-GCK algorithm, we then propose the segmented GCK. By segmenting input data into L(s) parts, the SegGCK requires only four additions per pixel for 3L(s) basis vectors. Experimental results show that the proposed algorithm can significantly accelerate the full-search equivalent pattern matching process and outperforms state-of-the-art methods 
650 4 |a Journal Article 
700 1 |a Zhang, Renqi  |e verfasserin  |4 aut 
700 1 |a Cham, Wai-Kuen  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t IEEE transactions on image processing : a publication of the IEEE Signal Processing Society  |d 1992  |g 22(2013), 4 vom: 07. Apr., Seite 1512-25  |w (DE-627)NLM09821456X  |x 1941-0042  |7 nnns 
773 1 8 |g volume:22  |g year:2013  |g number:4  |g day:07  |g month:04  |g pages:1512-25 
856 4 0 |u http://dx.doi.org/10.1109/TIP.2012.2233484  |3 Volltext 
912 |a GBV_USEFLAG_A 
912 |a SYSFLAG_A 
912 |a GBV_NLM 
912 |a GBV_ILN_350 
951 |a AR 
952 |d 22  |j 2013  |e 4  |b 07  |c 04  |h 1512-25