Aiming at the disadvantages of the traditional off-line vector-based learning algorithm, this paper proposes a kind of Incremental Tensor Principal Component Analysis (ITPCA) algorithm. It represents an image as a ten...
详细信息
Lines provide important information in images and line detection is crucial in many applications. Many line features can be used to detect line position while line width (i.e., thickness) is a more structured, higher-...
详细信息
ISBN:
(纸本)9781479900145
Lines provide important information in images and line detection is crucial in many applications. Many line features can be used to detect line position while line width (i.e., thickness) is a more structured, higher-level feature compared to edge or other line features. Every point of the wide line structure has its own width in spite of the structure's asymmetry. In this paper, we use the parallel edges to get the line orientation and width. We do not need to know the actual width of the line, but rather recover it to get the region of interest (ROI). Then use a modified OTSU obtaining proper region threshold T to segment the wide line structures. By fusing feature of width and gray, a sequence of tests has been conducted on a variety of image samples obtained from simple natural scene and our experimental results demonstrate the practical and robust of the proposed method.
In order to settle incremental learning and preserve the space information of images, this paper proposes an incremental tensor discriminant analysis for facial image detection. The proposed algorithm employs tensor r...
详细信息
An image compression-encryption algorithm based on 2-D compressive sensing is proposed, which can accomplish encryption and compression simultaneously. The measurements are performed in two directi-ons and the measure...
详细信息
pattern matching is a fundamental application text retrieval, string query, biological sequence analysis, etc. Therefore, the effective algorithm performing this kind of matching is in great need. In this paper, the w...
详细信息
pattern matching is a fundamental application text retrieval, string query, biological sequence analysis, etc. Therefore, the effective algorithm performing this kind of matching is in great need. In this paper, the wildcard is defines to match any one character in a sequence. Multiple wildcards form a gap. The length of a flexible gap is arbitrary. We design CLPM algorithm by use of cross list index structure to realize pattern matching with flexible wildcard gaps. The preprocessing algorithm is designed to initialize cross list so as to reduce searching space. In CLPM algorithm, the effective intervals is defined and computed based on the start positions of each sub pattern in each string, which help to obtain matching result set. Moreover, the approximate pattern matching is converted to short extract pattern matching. The contrast experiments are done based on DBLP tile data set. The results show that CLMP algorithm has better performance in the same fields.
This paper proposes a new affine registration algorithm for 2D point matching. It is a two-step iterative registration algorithm by soft weight assignment based on bidirectional distance. At each iteration, the affine...
详细信息
ISBN:
(纸本)9781479923427
This paper proposes a new affine registration algorithm for 2D point matching. It is a two-step iterative registration algorithm by soft weight assignment based on bidirectional distance. At each iteration, the affine transformation is updated by two optimization steps, in which the model data and the test data are matched from each other respectively. By the optimization of registration at separate steps during each iteration, the proposed algorithm can provide a good estimate of the accurate affine transformation in condition of poor initialization and lack of geometric assumptions on point sets. Some experiments about comparison with the current state-of-the art approaches, demonstrate the robustness and accuracy of our method.
pattern Mining is a popular issue in biological sequence analysis. With the introduction of wildcard gaps, more interesting patterns can be mined. In this paper, we propose a new definition related to pattern frequenc...
详细信息
pattern Mining is a popular issue in biological sequence analysis. With the introduction of wildcard gaps, more interesting patterns can be mined. In this paper, we propose a new definition related to pattern frequency, under which the Apriori property holds. We define a pattern mining problem called Ming top-K Frequent patterns (MFP), where gaps are mined instead of specified. Compared with existing problems, MFP does not require any domain knowledge of the user. However, theoretical analysis and experimental results show that MFP favors inflexible patterns. We then define another problem where the flexibility threshold of each gap is specified by the user. The problem is called Mining top-K Frequent and Flexible patterns (MF 2 P). We develop algorithm with polynomial complexities for both problems. patterns can grow from both sides. Some interesting biological patterns mined by our algorithms are discussed.
Raisins grade identification in China still relies on photoelectric sorting and manual separation, also, the function of management system for the production, processing, and sales of raisin is traditional and simple....
详细信息
The study provides a design scheme for the mountain landslide monitoring System based on wireless sensor networks. Different sensors are mainly used to collect data about the water depth in the soil and the sloping an...
详细信息
We present the design and fabrication of metamaterials, and investigated the normalized power transmission properties of four metamaterials at different frequency in terahertz regime. We compared the power transmissio...
详细信息
暂无评论