… | |
… | |
68 | |
68 | |
69 | *h &= 255; |
69 | *h &= 255; |
70 | } |
70 | } |
71 | } |
71 | } |
72 | |
72 | |
|
|
73 | struct feature { |
|
|
74 | float v1, v2, v3; // mean, square, cube |
|
|
75 | int n; |
|
|
76 | }; |
|
|
77 | |
|
|
78 | static void |
|
|
79 | feature_init (struct feature *f) |
|
|
80 | { |
|
|
81 | f->v1 = 0.; |
|
|
82 | f->v2 = 0.; |
|
|
83 | f->v3 = 0.; |
|
|
84 | f->n = 0; |
|
|
85 | } |
|
|
86 | |
|
|
87 | // didn't find an algorithm to neatly do mean, variance and skew in one pass. |
|
|
88 | // elmex ist schuld. |
|
|
89 | static void |
|
|
90 | feature_update_pass_1 (struct feature *f, unsigned int v) |
|
|
91 | { |
|
|
92 | f->v1 += v; |
|
|
93 | f->n += 1; |
|
|
94 | } |
|
|
95 | |
|
|
96 | static void |
|
|
97 | feature_finish_pass_1 (struct feature *f) |
|
|
98 | { |
|
|
99 | if (f->n < 1) |
|
|
100 | return; |
|
|
101 | |
|
|
102 | f->v1 /= f->n; |
|
|
103 | } |
|
|
104 | |
|
|
105 | static void |
|
|
106 | feature_update_pass_2 (struct feature *f, unsigned int v) |
|
|
107 | { |
|
|
108 | float d = v - f->v1; |
|
|
109 | |
|
|
110 | f->v2 += d * d; |
|
|
111 | f->v3 += d * d * d; |
|
|
112 | } |
|
|
113 | |
|
|
114 | static void |
|
|
115 | feature_finish_pass_2 (struct feature *f) |
|
|
116 | { |
|
|
117 | if (f->n < 1) |
|
|
118 | return; |
|
|
119 | |
|
|
120 | f->v2 /= f->n; |
|
|
121 | f->v3 /= f->n; |
|
|
122 | |
|
|
123 | // this is a peculiar weightung, but it works fine |
|
|
124 | f->v1 /= 255.; |
|
|
125 | f->v2 /= 128. * 128.; |
|
|
126 | f->v3 /= 128. * 128. * 64.; |
|
|
127 | } |
|
|
128 | |
73 | static guint32 a85_val; |
129 | static guint32 a85_val; |
74 | static guint a85_cnt; |
130 | static guint a85_cnt; |
75 | static guchar a85_buf[LINELENGTH], *a85_ptr; |
131 | static guchar a85_buf[LINELENGTH], *a85_ptr; |
76 | |
132 | |
77 | static void |
133 | static void |
… | |
… | |
355 | assert (gdk_pixbuf_get_n_channels (b) == 3); |
411 | assert (gdk_pixbuf_get_n_channels (b) == 3); |
356 | |
412 | |
357 | double diff = 0.; |
413 | double diff = 0.; |
358 | int peak = 0; |
414 | int peak = 0; |
359 | |
415 | |
360 | if (x && y) |
416 | if (w && h) |
361 | for (y = 0; y < h; y++) |
417 | for (y = 0; y < h; y++) |
362 | { |
418 | { |
363 | guchar *pa_ = pa + y * sa; |
419 | guchar *pa_ = pa + y * sa; |
364 | guchar *pb_ = pb + y * sb; |
420 | guchar *pb_ = pb + y * sb; |
365 | |
421 | |
… | |
… | |
586 | ############################################################################# |
642 | ############################################################################# |
587 | |
643 | |
588 | MODULE = Gtk2::CV PACKAGE = Gtk2::CV::Plugin::RCluster |
644 | MODULE = Gtk2::CV PACKAGE = Gtk2::CV::Plugin::RCluster |
589 | |
645 | |
590 | SV * |
646 | SV * |
|
|
647 | extract_features (SV *ar) |
|
|
648 | CODE: |
|
|
649 | { |
|
|
650 | int i; |
|
|
651 | AV *av, *result; |
|
|
652 | |
|
|
653 | if (!SvROK (ar) || SvTYPE (SvRV (ar)) != SVt_PVAV) |
|
|
654 | croak ("Not an array ref as first argument to make_histogram"); |
|
|
655 | |
|
|
656 | av = (AV *) SvRV (ar); |
|
|
657 | result = newAV (); |
|
|
658 | |
|
|
659 | for (i = 0; i <= av_len (av); ++i) |
|
|
660 | { |
|
|
661 | SV *sv = *av_fetch (av, i, 1); |
|
|
662 | SV *histsv = newSV (9 * sizeof (float) + 1); |
|
|
663 | |
|
|
664 | SvPOK_on (histsv); |
|
|
665 | SvCUR_set (histsv, 9 * sizeof (float)); |
|
|
666 | float *hist = (float *)SvPVX (histsv); |
|
|
667 | |
|
|
668 | struct feature f_h, f_s, f_v; |
|
|
669 | feature_init (&f_h); |
|
|
670 | feature_init (&f_s); |
|
|
671 | feature_init (&f_v); |
|
|
672 | |
|
|
673 | { |
|
|
674 | STRLEN len; |
|
|
675 | unsigned char *buf = (unsigned char *)SvPVbyte (sv, len); |
|
|
676 | while (len >= 3) |
|
|
677 | { |
|
|
678 | unsigned int r, g, b, h, s, v; |
|
|
679 | r = *buf++; g = *buf++; b = *buf++; |
|
|
680 | rgb_to_hsv (r, g, b, &h, &s, &v); |
|
|
681 | |
|
|
682 | feature_update_pass_1 (&f_h, h); |
|
|
683 | feature_update_pass_1 (&f_s, s); |
|
|
684 | feature_update_pass_1 (&f_v, v); |
|
|
685 | |
|
|
686 | len -= 3; |
|
|
687 | } |
|
|
688 | |
|
|
689 | feature_finish_pass_1 (&f_h); |
|
|
690 | feature_finish_pass_1 (&f_s); |
|
|
691 | feature_finish_pass_1 (&f_v); |
|
|
692 | } |
|
|
693 | |
|
|
694 | { |
|
|
695 | STRLEN len; |
|
|
696 | unsigned char *buf = (unsigned char *)SvPVbyte (sv, len); |
|
|
697 | while (len >= 3) |
|
|
698 | { |
|
|
699 | unsigned int r, g, b, h, s, v; |
|
|
700 | r = *buf++; g = *buf++; b = *buf++; |
|
|
701 | rgb_to_hsv (r, g, b, &h, &s, &v); |
|
|
702 | |
|
|
703 | feature_update_pass_2 (&f_h, h); |
|
|
704 | feature_update_pass_2 (&f_s, s); |
|
|
705 | feature_update_pass_2 (&f_v, v); |
|
|
706 | |
|
|
707 | len -= 3; |
|
|
708 | } |
|
|
709 | |
|
|
710 | feature_finish_pass_2 (&f_h); |
|
|
711 | feature_finish_pass_2 (&f_s); |
|
|
712 | feature_finish_pass_2 (&f_v); |
|
|
713 | } |
|
|
714 | |
|
|
715 | hist [0] = f_h.v1 * 2.; hist [1] = f_h.v2 * 2.; hist [2] = f_h.v3 * 2.; |
|
|
716 | hist [3] = f_s.v1 ; hist [4] = f_s.v2 ; hist [5] = f_s.v3 ; |
|
|
717 | hist [6] = f_v.v1 ; hist [7] = f_v.v2 ; hist [8] = f_v.v3 ; |
|
|
718 | |
|
|
719 | av_push (result, histsv); |
|
|
720 | } |
|
|
721 | |
|
|
722 | RETVAL = newRV_noinc ((SV *)result); |
|
|
723 | } |
|
|
724 | OUTPUT: |
|
|
725 | RETVAL |
|
|
726 | |
|
|
727 | SV * |
591 | make_histograms (SV *ar) |
728 | make_histograms (SV *ar) |
592 | CODE: |
729 | CODE: |
593 | { |
730 | { |
594 | int i; |
731 | int i; |
595 | AV *av, *result; |
732 | AV *av, *result; |