Abstract:
An approach to segmentation or clustering of a set of elements combines separate procedures and uses training data for those procedures on labeled data. This approach is applied to elements being components of an image of text (e.g., printed or handwritten). In some examples, the elements are connected sets of pixels. In images of text, the clusters can correspond to individual lines. The approach provides improved clustering performance as compared to any one of the procedures taken alone.
Abstract:
An approach to computation of kernel descriptors is accelerated using precomputed tables. In one aspect, a fast algorithm for kernel descriptor computation that takes O(1) operations per pixel in each patch, based on pre-computed kernel values. This speeds up the kernel descriptor features under consideration, to levels that are comparable with D-SIFT and color SIFT, and two orders of magnitude faster than STIP and HoG3D. In some examples, kernel descriptors are applied to extract gradient, flow and texture based features for video analysis. In tests of the approach on a large database of internet videos used in the TRECVID MED 2011 evaluations, the flow based kernel descriptors are up to two orders of magnitude faster than STIP and HoG3D, and also produce significant performance improvements. Further, using features from multiple color planes produces small but consistent gains.
Abstract translation:使用预先计算的表加速了内核描述符的计算方法。 在一个方面,一种用于内核描述符计算的快速算法,其基于预先计算的内核值在每个补丁中每像素执行O(1)个操作。 这将加速考虑的内核描述符功能,达到与D-SIFT和颜色SIFT相当的水平,比STIP和HoG3D快两个数量级。 在一些示例中,内核描述符被应用于提取用于视频分析的梯度,流和纹理的特征。 在对TRECVID MED 2011评估中使用的大量互联网视频数据库的方法进行测试时,基于流的内核描述符比STIP和HoG3D快两个数量级,并且还可以显着提高性能。 此外,使用来自多个颜色平面的特征产生小但恒定的增益。
Abstract:
Distributional information for a set of α vectors is determined using a sparse basis selection approach to representing an input image or video. In some examples, this distributional information is used for a classification task.
Abstract:
A computationally efficient approach to determining inner products between feature vectors is provided that eliminates or reduces the need for multiplication, and more specifically, provides an efficient and accurate basis selection for techniques such as Orthogonal Matching Pursuit.
Abstract:
Distributional information for a set of α vectors is determined using a sparse basis selection approach to representing an input image or video. In some examples, this distributional information is used for a classification task.
Abstract:
An approach to computation of kernel descriptors is accelerated using precomputed tables. In one aspect, a fast algorithm for kernel descriptor computation that takes O(1) operations per pixel in each patch, based on pre-computed kernel values. This speeds up the kernel descriptor features under consideration, to levels that are comparable with D-SIFT and color SIFT, and two orders of magnitude faster than STIP and HoG3D. In some examples, kernel descriptors are applied to extract gradient, flow and texture based features for video analysis. In tests of the approach on a large database of internet videos used in the TRECVID MED 2011 evaluations, the flow based kernel descriptors are up to two orders of magnitude faster than STIP and HoG3D, and also produce significant performance improvements. Further, using features from multiple color planes produces small but consistent gains.
Abstract translation:使用预先计算的表加速了内核描述符的计算方法。 在一个方面,一种用于内核描述符计算的快速算法,其基于预先计算的内核值在每个补丁中每像素执行O(1)个操作。 这将加速考虑的内核描述符功能,达到与D-SIFT和颜色SIFT相当的水平,比STIP和HoG3D快两个数量级。 在一些示例中,内核描述符被应用于提取用于视频分析的梯度,流和纹理的特征。 在对TRECVID MED 2011评估中使用的大量互联网视频数据库的方法进行测试时,基于流的内核描述符比STIP和HoG3D快两个数量级,并且还可以显着提高性能。 此外,使用来自多个颜色平面的特征产生小但恒定的增益。
Abstract:
An approach to segmentation or clustering of a set of elements combines separate procedures and uses training data for those procedures on labeled data. This approach is applied to elements being components of an image of text (e.g., printed or handwritten). In some examples, the elements are connected sets of pixels. In images of text, the clusters can correspond to individual lines. The approach provides improved clustering performance as compared to any one of the procedures taken alone.
Abstract:
A computationally efficient approach to determining inner products between feature vectors is provided that eliminates or reduces the need for multiplication, and more specifically, provides an efficient and accurate basis selection for techniques such as Orthogonal Matching Pursuit.