Name
Abstract | ||
|---|---|---|
To the problem of no overall optimal merger for one-way merger in the segmentation algorithm proposed by Wang Yongzhong, et al., in this paper, we propose a method of overall optimal search and merger. At the same time, to the unreasonable problem of merging a segment which has non-value (value-segment) and a segment which values are zeros entirely (zeros-segment) to a large segment in Wang's method, we also propose a corresponding method to solve the problem. The main techniques are incarnated in local cosine transform (LCT) algorithm for a single small segment, rather than folding processing using its original neighboring data, instead of making zero-extension, and then fold the each zero-extension segment. A great deal of numerical simulations validate that this new improved technique solves several problems of the binary-based segment algorithm and Wang's segment algorithm, it not only obtains adapted effective segmentation result, but also there are not much more redundancy segmentations. |
Year | DOI | Venue |
|---|---|---|
2001 | null | ICASSP |
Keywords | Field | DocType |
speech,merging,numerical simulation,image segmentation,entropy,redundancy,numerical analysis,cosine transform | Computer science,Discrete cosine transform,Image segmentation,Redundancy (engineering),Artificial intelligence,Local cosine transform,Merge (version control),Binary number,Mathematical optimization,Pattern recognition,Segmentation,Algorithm,Numerical analysis | Conference |
Volume | Issue | Citations |
6 | null | 0 |
PageRank | References | Authors |
0.34 | 2 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Enqing Dong | 1 | 34 | 5.15 |
| Guizhong Liu | 2 | 634 | 74.47 |
| Yatong Zhou | 3 | 28 | 5.72 |