A fast image segmentation algorithm based on region maximal similarity
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Effective image segmentation is an important task in computer vision.In view of computational complexity and poor description of the image segmentation by maximal similarity based region merging(MSRM),a novel fast image segmentation algorithm,i.e.,improved MSRM(IMSRM),using local binary pattern(LBP) to calculate the similarity between the adjacent regions is proposed.LBP texture descriptor,which encodes the local micro-structure between the image pixels to achieve a description of their spatial relationship,effectively improves the description capability of the region feature,the obtained feature vector dimension is much smaller than the color histogram,and greatly improves calculation efficiency of the adjacent area similarity.The proposed algorithm automatically merges the regions which are over segmented by mean shift algorithm,with the marker indicating the region of the object and background.The region merging process is adaptive to the image content and it does not need to set the similarity threshold in advance.A large number of experiments compared with MSRM algorithm show that the IMSRM algorithm can effectively extract outline of the object from a variety of complex backgrounds with better edge details,and the efficiency of the algorithm can be improved by about 50%.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.002 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it