Token导航 LogoToken导航

Agent Skill · 研究检索

visual-search-array-generator(视觉搜索数组生成器)

用于辅助界面设计、视觉规范、排版、配色、布局和交互体验优化。它适合让 Agent 根据产品场景整理页面结构、生成 UI 方案、检查视觉一致性或改进组件层级。使用时需要结合现有品牌、设计系统和用户任务,不应只堆装饰元素;涉及真实页面改动时,应通过截图或浏览器预览检查文本溢出、对齐和响应式表现。

visual-search-array-generator 是研究检索类 Agent Skill,可用宿主为 Codex、Claude、Cursor、Gemini CLI,通过GitHub 仓库获取,权限为只读;许可证信息还不明确,第三方扫描已通过,按安装量在研究检索类的 73,675 个 Skill 里排第 17,413。

总安装 6,621周安装 291GitHub Stars 18下载 3,176核验 2026-05-01

安装说明

本站只整理中文说明,不托管安装包,也不代用户安装。
GitHub
许可证
unknown

安装方式

通过对话安装

复制提示词发给支持本地命令或 Skills 的 AI 助手,先确认命令和权限,再让它执行。

请帮我安装这个 Agent Skill:visual-search-array-generator(视觉搜索数组生成器)
来源仓库:https://github.com/haoxuanlithuai/awesome_cognitive_and_neuroscience_skills
仓库路径:skills/visual-search-array-generator
安装命令:
npx skills add https://github.com/haoxuanlithuai/awesome_cognitive_and_neuroscience_skills --skill 'Visual Search Array Generator'
安装前请先检查当前环境是否支持对应 CLI,并向我确认将要执行的命令、安装目录、联网范围和文件读写权限;确认后再执行。

命令行安装

复制命令到本机终端执行。该命令会通过 npx skills 从第三方来源获取 Skill;本站只展示命令,不托管安装包,也不自动执行。

skills.shnpx skills
npx skills add https://github.com/haoxuanlithuai/awesome_cognitive_and_neuroscience_skills --skill 'Visual Search Array Generator'

这个 Skill 是做什么的

研究检索类 Skill 主要解决「找资料、核对事实、把来源整理清楚」的问题,通常会让助手先检索再总结。

用于辅助界面设计、视觉规范、排版、配色、布局和交互体验优化。适合根据产品场景整理页面结构、生成 UI 方案或检查视觉一致性。使用时需结合现有品牌、设计系统和用户任务,不应只堆装饰元素;涉及页面改动时应通过截图或浏览器预览检查表现。

安装命令:npx skills add https://github.com/haoxuanlithuai/awesome_cognitive_and_neuroscience_skills --skill 'Visual Search Array Generator 注意:涉及真实页面改动时,应通过截图或浏览器预览检查文本溢出、对齐和响应式表现。

来源仓库内路径:skills/visual-search-array-generator

上手步骤

4 步
  1. 1

    确认自己的宿主工具

    公开资料标注支持 Codex、Claude、Cursor、Gemini CLI;先确认自己用的是其中之一,再按对应工具的 Skills 目录放置。

  2. 2

    拿到安装命令

    可以直接复制的命令是 npx skills add https://github.com/haoxuanlithuai/awesome_cognitive_and_neuroscie…;命令里的占位符换成自己的路径或密钥再执行。

  3. 3

    安装后重启宿主

    命令执行完要完全退出宿主工具再打开,让新装的 Skill 被重新扫描到,否则列表里可能看不到。

  4. 4

    按最小权限试用

    它标注为只读,先用只读任务试一次,确认行为符合预期再扩大使用范围。

常见问题

6 条

visual-search-array-generator 怎么安装?

在终端执行 npx skills add https://github.com/haoxuanlithuai/awesome_cognitive_and_neuroscience_skills…。装完完全退出宿主工具再打开,让它重新扫描本地 Skill。

visual-search-array-generator 支持哪些 AI 工具?

公开资料标注支持 Codex、Claude、Cursor、Gemini CLI。其他工具只要能读取本地 Skill 目录,一般也能手动放进去,但要自己确认触发方式是否一致。

visual-search-array-generator 需要什么权限?

权限级别是只读。该 Skill 主要提供规则、说明或参考内容,本身偏只读;真正读写文件、联网或执行命令仍取决于宿主 Agent 的任务。

visual-search-array-generator 是免费的吗?

公开资料没有标注明确许可证,收费和商用限制都无法确认。正式使用前请到来源仓库核对授权说明。

visual-search-array-generator 用的人多吗?

公开数据是累计安装 6,621 次,近一周安装 291 次,下载 3,176 次,GitHub 18 星。这些数字来自第三方目录统计,只能当作热度参考,不代表质量或安全性。

visual-search-array-generator 安全吗?

第三方扫描结果为通过,但这只覆盖已知的静态检查项,不能替代自己读一遍源码和安装命令。

值得选的地方和要先想清楚的地方

值得选的地方

  • 同时适配 4 种工具,换客户端不用重新找替代品。
  • 第三方扫描已通过,常见的高风险行为没有命中。
  • 标注为只读权限,试用阶段不容易误改本地文件。

先想清楚的地方

  • 许可证没有明确标注,能不能商用、能不能再分发都不确定。
  • 第三方目录整理,版本更新和行为细节以来源仓库为准。

适不适合你

更适合

  • 已经在用 Codex,想直接扩展它能力的人。
  • 需要处理研究检索类任务、又不想每次都手写提示词的人。
  • 只想先试试效果、不希望它改动本地文件的人。

不太适合

  • 需要明确授权才能用到公司项目里的场景。
  • 需要厂商级技术支持和 SLA 的生产系统。

研究检索类 Skill 对比

6 个同类
Skill总安装GitHub 星权限许可证扫描
find-skills

寻找技能 · Codex、Claude

31,199,81316,486操作浏览器MIT有提醒
self-improving-agent

自我改进 Agent · OpenClaw

16,464,0023,396接触敏感数据MIT-0通过
soultrace

灵魂追踪 · Codex、Claude

7,588,94412需要联网未明确有提醒
self-improving

自我完善 · OpenClaw

6,829,2841,046需要联网MIT-0通过
microsoft-foundry

微软代工厂 · Codex、Claude

6,614,144764调用外部服务未明确有提醒
visual-search-array-generator

视觉搜索数组生成器 · 本页

6,62118只读未明确通过

按安装量取同分类前几名;数字来自第三方目录统计,只作热度参考,不代表质量结论。

SKILL.md 原文

Visual Search Array Generator

Purpose

This skill encodes expert methodological knowledge for designing and generating visual search arrays. A competent programmer could easily generate random stimulus displays, but without domain training they would likely violate critical constraints: items too closely spaced (causing crowding), eccentricities beyond useful vision, inappropriate set sizes that cannot distinguish search types, target-distractor similarity levels that produce ceiling or floor effects, or trial ratios that distort search behavior. This skill provides the validated parameters needed to create psychophysically sound visual search experiments.

When to Use

Use this skill when:

  • Designing a visual search experiment (feature search, conjunction search, spatial configuration search)
  • Generating stimulus arrays with specific set sizes, spacings, and feature dimensions
  • Selecting target-distractor similarity levels to manipulate search efficiency
  • Choosing set sizes and trial structure for measuring search slopes
  • Configuring display timing, inter-trial intervals, and response windows

Do not use this skill when:

  • The task is not visual search (e.g., change detection, visual working memory, attentional capture without search)
  • You are analyzing existing visual search data rather than designing new experiments
  • The display involves naturalistic scenes rather than controlled arrays (use scene perception methods)

Research Planning Protocol

Before executing the domain-specific steps below, you MUST:

  1. State the research question -- What specific question is this analysis/paradigm addressing?
  2. Justify the method choice -- Why is this approach appropriate? What alternatives were considered?
  3. Declare expected outcomes -- What results would support vs. refute the hypothesis?
  4. Note assumptions and limitations -- What does this method assume? Where could it mislead?
  5. Present the plan to the user and WAIT for confirmation before proceeding.

For detailed methodology guidance, see the research-literacy skill.

⚠️ Verification Notice

This skill was generated by AI from academic literature. All parameters, thresholds, and citations require independent verification before use in research. If you find errors, please open an issue.

Search Type Classification

Feature Search (Parallel / Pop-out)

Target defined by a single unique feature (Treisman & Gelade, 1980).

  • Search slope: < 10 ms/item for target-present trials (Wolfe, 2021)
  • RT x set size function: Flat or near-flat
  • Example: Red target among green distractors; vertical target among horizontal distractors
  • Theoretical basis: Pre-attentive feature maps can detect unique singletons without serial scanning (Treisman & Gelade, 1980)

Conjunction Search (Inefficient / Serial)

Target defined by a combination of features shared individually with distractors (Treisman & Gelade, 1980).

  • Search slope: 20-30 ms/item for target-present trials (Wolfe, 2021)
  • Absent:present slope ratio: Approximately 2:1 if search is self-terminating (Treisman & Gelade, 1980)
  • Example: Red vertical target among red horizontal and green vertical distractors
  • Note: Many conjunction searches are more efficient than predicted by strict serial models; guided search theory accounts for this (Wolfe, 1994)

Spatial Configuration Search

Target differs from distractors in spatial arrangement of parts rather than simple features.

  • Search slope: 30-50+ ms/item (Wolfe, 2021)
  • Example: T among Ls; 2 among 5s
  • These are among the most inefficient search tasks and should be used when studying attentional limits

Search Slope Classification Benchmarks

Slope (ms/item)ClassificationCitation
< 5Highly efficient / pop-outWolfe, 2021
5-10Efficient (feature-like)Wolfe, 2021
10-20Moderately efficient (guided)Wolfe, 1994; Wolfe, 2021
20-30Inefficient (conjunction-like)Treisman & Gelade, 1980; Wolfe, 2021
> 30Very inefficient (serial)Wolfe, 2021

Display Parameters

Spatial Layout

ParameterRecommended ValueCitation / Rationale
Maximum eccentricity15 degrees of visual angle from fixationBeyond ~15 deg, acuity drops substantially; standard upper bound (Wolfe et al., 1998)
Minimum inter-item spacing> 1 degree center-to-centerPrevents crowding effects (Bouma, 1970: crowding zone ~ 0.5 x eccentricity)
Item size0.5-2 degrees of visual angleStandard range for search items (Wolfe, 2021)
Display areaCircular or rectangular region within eccentricity limitAvoid items near monitor edges where distortion may occur
Fixation crossPresent for 500-1000 ms before array onsetStandard in visual search (Wolfe et al., 1998)

Preventing Crowding

Crowding impairs identification when flanking items are too close to the target, especially in the periphery (Pelli & Tillman, 2008).

  • Critical spacing: Approximately 0.5 x eccentricity (Bouma, 1970)
  • At 5 degrees eccentricity, items must be > 2.5 degrees apart to avoid crowding
  • At 10 degrees eccentricity, items must be > 5 degrees apart
  • For items near fixation (< 2 degrees), minimum spacing of 1 degree is sufficient

Set Sizes

Design GoalRecommended Set SizesRationale
Classify search type4, 8, 12, 16 (minimum 3 set sizes)Need multiple points to estimate slope reliably (Wolfe, 2021)
Test for pop-out8, 16, 32 (wide range)Pop-out confirmed if slope ~ 0 even at large set sizes (Treisman & Gelade, 1980)
Standard conjunction search4, 8, 12, 16, 20Finer-grained slope estimation (Wolfe, 1994)
Quick screening6, 12, 18Three evenly spaced set sizes for slope estimation

Minimum set sizes: At least 3 different set sizes are required to reliably estimate a search slope. Two set sizes cannot distinguish linear from nonlinear search functions.

Maximum set size: Constrained by display density. With 1 degree minimum spacing and 15 degree eccentricity limit, the practical maximum is approximately 40-50 items for typical item sizes (Wolfe et al., 1998).

Trial Structure

ParameterRecommended ValueCitation
Target-present: target-absent ratio1:1 (50% present)Chun & Wolfe, 1996; standard in most search tasks
Low prevalence condition10% target-presentWolfe et al., 2005 (miss rate increases dramatically)
Trials per cellMinimum 20-30 trials per set size x presence combinationWolfe, 2021; more for stable RT distributions
Practice trials10-20 trials before data collectionStandard practice
Total trial countTypically 400-800 for a standard search taskDepends on number of conditions and set sizes

Critical warning about target prevalence: When target prevalence drops below ~25%, miss rates increase dramatically -- the "prevalence effect" (Wolfe et al., 2005). This is a critical design consideration for applied search tasks (e.g., medical image screening).

Timing Parameters

ParameterRecommended ValueRationale
Fixation duration500-1000 msAllow fixation stabilization
Display durationUntil response (standard) or fixed (brief search)Self-paced search is default (Wolfe, 2021)
Brief display search100-200 ms (then mask)Tests pre-attentive processing (Treisman & Gelade, 1980)
Response deadline3000-5000 msExclude abnormally slow RTs
Inter-trial interval500-1000 msPrevent carryover effects
Feedback duration500 ms (if used)Brief error/correct feedback

Feature Dimensions and Similarity

Color

ParameterGuidelineCitation
Feature search JNDTarget-distractor color difference > 30 degrees in CIE L*a*b* or CIELUV hue angle for pop-outDerived from Nagy & Sanchez, 1990
Conjunction controlEquate target-distractor color distance across conditionsEssential for isolating conjunction cost
Number of colorsTypically 2-4 distinct colors for conjunction searchWolfe, 1994
LuminanceEquate luminance across colors to avoid luminance pop-outUse isoluminant colors or verify with photometer
Color spaceSpecify in CIE L*a*b* or Munsell; avoid RGB for scientific reportingRGB is device-dependent

Orientation

ParameterGuidelineCitation
Feature search JNDTarget-distractor difference > 15-20 degrees for efficient searchFoster & Ward, 1991
Pop-out thresholdOrientation difference > 30 degrees produces reliable pop-outWolfe et al., 1992
Cardinal advantageVertical and horizontal orientations are detected faster than obliquesAppelle, 1972
Recommended: Use oblique orientations (e.g., 45 deg, 135 deg) to avoid cardinal effects unless cardinals are of interest

Size

ParameterGuidelineCitation
Feature search JNDTarget at least 1.5-2x distractor size for pop-outTreisman & Gelade, 1980
Weber fractionSize discrimination Weber fraction ~ 0.04-0.06 (JND/standard)Nachmias, 2011
For search: Size ratio of > 1.5:1 (target:distractor) typically needed for efficient searchWolfe, 2021

Target-Distractor Similarity and Distractor Heterogeneity

Duncan & Humphreys (1989) Framework

Search efficiency depends on two factors:

  1. Target-distractor (T-D) similarity: Higher similarity = less efficient search
  2. Distractor-distractor (D-D) similarity: Lower D-D similarity (heterogeneous distractors) = less efficient search
T-D SimilarityD-D SimilarityExpected SearchExample
LowHighVery efficient (pop-out)Red among identical greens
LowLowEfficientRed among varied colors (not red)
HighHighInefficientPink among reds
HighLowVery inefficientPink among varied warm colors

Practical Implementation

  • Homogeneous distractors: All distractors identical; cleanest test of T-D similarity
  • Heterogeneous distractors: Distractors vary in the search-relevant feature; tests the D-D similarity effect
  • Controlling heterogeneity: Sample distractor features from a uniform distribution within a defined range (e.g., orientation distractors drawn from 0 +/- 10 degrees; Duncan & Humphreys, 1989)

Array Generation Algorithm

Placement Algorithm (Recommended)

  1. Define the display region (circular with radius = max eccentricity)
  2. Generate candidate positions using one of:
  • Grid + jitter: Place items on a regular grid, then add random jitter (uniform, +/- 0.3 deg) to break regularity (Wolfe et al., 1998)
  • Random placement with rejection: Sample random positions; reject any that violate minimum spacing
  • Concentric rings: Place items on concentric rings at fixed eccentricities (controls eccentricity distribution)
  1. Enforce minimum inter-item spacing (> 1 degree center-to-center)
  2. Enforce minimum distance from fixation (> 1 degree; avoids masking by fixation cross)
  3. Balance target position across eccentricity bins and quadrants over the experiment
  4. For each trial, randomly assign target to one position (present trials) or assign no target (absent trials)

Randomization Constraints

  • Target position: Counterbalance across quadrants and eccentricity bins within each set size
  • Set size order: Randomize or pseudorandomize within blocks
  • Target presence: Pseudorandomize to avoid long runs of present or absent trials (max run length: 4 consecutive same-type trials; standard practice)
  • Feature assignment: For conjunction search, ensure equal numbers of each distractor type (e.g., 50% share color with target, 50% share orientation; Treisman & Gelade, 1980)
  • Block structure: If multiple set sizes are used, either mix within blocks or block by set size (within-block mixing is standard; Wolfe, 2021)

Common Pitfalls

  1. Not controlling for eccentricity confounds: Larger set sizes place items at greater eccentricities on average, confounding set size with acuity. Solution: Use a fixed display area and add items by filling in gaps, not by expanding the area (Wolfe et al., 1998).
  2. Interpreting null set-size effects as "pop-out" without verification: A flat slope does not guarantee parallel processing. Verify with brief presentations (100-200 ms + mask) and check that accuracy remains high (Treisman & Gelade, 1980).
  3. Ignoring the prevalence effect: With low target prevalence (<25%), observers adopt a more liberal quitting threshold, increasing miss rates from ~5% to >25% (Wolfe et al., 2005). Design accordingly for applied contexts.
  4. Using too few set sizes: Two set sizes define only a line; you cannot assess linearity or detect nonlinear search functions. Use at least 3 set sizes, preferably 4-5 (Wolfe, 2021).
  5. Not equating luminance across color conditions: Luminance differences create an unintended pop-out cue. Always measure and equate luminance (use a photometer or validated software settings; Nagy & Sanchez, 1990).
  6. Placing items too close together: Violating minimum spacing creates crowding, where items become unidentifiable not because of search difficulty but because of peripheral vision limits (Bouma, 1970; Pelli & Tillman, 2008).
  7. Confounding distractor heterogeneity with target discriminability: Adding distractor variability reduces search efficiency independently of T-D similarity. Manipulate one while controlling the other (Duncan & Humphreys, 1989).
  8. Failing to counterbalance target position: If the target systematically appears at certain locations, observers develop spatial biases. Counterbalance across quadrants and eccentricities.

Minimum Reporting Checklist

Based on current best practices in visual search research:

  • Search type (feature, conjunction, spatial configuration) and theoretical motivation
  • Set sizes used and number of trials per set size per target-presence condition
  • Target-present to target-absent ratio
  • Display parameters: eccentricity range, item size (in degrees of visual angle), minimum spacing
  • Item features: colors (in device-independent space), orientations (in degrees), sizes (in degrees)
  • Target-distractor similarity metric and value
  • Distractor composition (homogeneous vs. heterogeneous; how features were assigned)
  • Viewing distance and display specifications (size, resolution, refresh rate)
  • Timing: fixation duration, display duration, response deadline, ITI
  • Randomization scheme: how set size, target presence, and target position were randomized
  • Search slope values (ms/item) with confidence intervals for target-present and target-absent
  • Slope ratio (absent:present) to assess self-termination
  • Error rates by condition (especially miss rates)
  • RT trimming criteria and percentage of data excluded
  • Software used for stimulus generation and presentation (with version)

References

  • Appelle, S. (1972). Perception and discrimination as a function of stimulus orientation: The "oblique effect" in man and animals. *Psychological Bulletin*, 78, 266-278.
  • Bouma, H. (1970). Interaction effects in parafoveal letter recognition. *Nature*, 226, 177-178.
  • Chun, M. M., & Wolfe, J. M. (1996). Just say no: How are visual searches terminated when there is no target present? *Cognitive Psychology*, 30, 39-78.
  • Duncan, J., & Humphreys, G. W. (1989). Visual search and stimulus similarity. *Psychological Review*, 96, 433-458.
  • Foster, D. H., & Ward, P. A. (1991). Asymmetries in oriented-line detection indicate two orthogonal filters in early vision. *Proceedings of the Royal Society B*, 243, 75-81.
  • Nachmias, J. (2011). Shape and size discrimination compared. *Vision Research*, 51, 400-407.
  • Nagy, A. L., & Sanchez, R. R. (1990). Critical color differences determined with a visual search task. *Journal of the Optical Society of America A*, 7, 1209-1217.
  • Pelli, D. G., & Tillman, K. A. (2008). The uncrowded window of object recognition. *Nature Neuroscience*, 11, 1129-1135.
  • Treisman, A. M., & Gelade, G. (1980). A feature-integration theory of attention. *Cognitive Psychology*, 12, 97-136.
  • Wolfe, J. M. (1994). Guided Search 2.0: A revised model of visual search. *Psychonomic Bulletin & Review*, 1, 202-238.
  • Wolfe, J. M. (2021). Guided Search 6.0: An updated model of visual search. *Psychonomic Bulletin & Review*, 28, 1060-1092.
  • Wolfe, J. M., Cave, K. R., & Franzel, S. L. (1989). Guided search: An alternative to the feature integration model for visual search. *Journal of Experimental Psychology: Human Perception and Performance*, 15, 419-433.
  • Wolfe, J. M., Friedman-Hill, S. R., Stewart, M. I., & O'Connell, K. M. (1992). The role of categorization in visual search for orientation. *Journal of Experimental Psychology: Human Perception and Performance*, 18, 34-49.
  • Wolfe, J. M., Horowitz, T. S., & Kenner, N. M. (2005). Rare items often missed in visual searches. *Nature*, 435, 439-440.
  • Wolfe, J. M., O'Neill, P., & Bennett, S. C. (1998). Why are there eccentricity effects in visual search? Perception & Psychophysics, 60, 140-156.

See references/array-generation-parameters.yaml for a machine-readable parameter specification.

平台分布

Codex

37.03%
按下载量换算1,176

Claude

29.5%
按下载量换算937

Cursor

16.5%
按下载量换算524

Gemini CLI

9.36%
按下载量换算297

安全审计

Gen Agent Trust Hub

通过

Socket

通过

Snyk

通过

权限和风险

只读

该 Skill 主要提供规则、说明或参考内容,本身偏只读;真正读写文件、联网或执行命令仍取决于宿主 Agent 的任务。

安装前确认

本站仅展示第三方公开信息,不托管安装包,不提供自动安装或运行环境。安装前应自行审查源码、依赖和命令行为。目前只有一个公开来源,建议同时核对源仓库。

继续浏览同类 Skills