🏠 홈
벤치마크
📊 모든 벤치마크 🦖 공룡 v1 🦖 공룡 v2 ✅ 할 일 목록 앱 🎨 창의적인 자유 페이지 🎯 FSACB - 궁극의 쇼케이스 🌍 번역 벤치마크
모델
🏆 톱 10 모델 🆓 무료 모델 📋 모든 모델 ⚙️ 킬로 코드 모드
리소스
💬 프롬프트 라이브러리 📖 AI 용어 사전 🔗 유용한 링크

AI 용어집

인공지능 완전 사전

162
카테고리
2,032
하위 카테고리
23,060
용어
📖
용어

Density Mode

Point in the feature space where the data's probability density reaches a local maximum, to which the Mean Shift algorithm converges to identify the center of a cluster.

📖
용어

Search Window

Circular or spherical region around a data point, defined by the bandwidth, within which the algorithm calculates the weighted average of points to determine the direction of movement.

📖
용어

Displacement Vector

Vector calculated at each iteration of the algorithm, pointing from a point's current position towards the weighted center of mass of its neighbors, thus guiding its progression towards the density mode.

📖
용어

Mean Shift Trajectory

Path traveled by a data point through successive iterations of the algorithm, from its initial position to its final convergence position on a density mode.

📖
용어

Image Segmentation

Flagship application of the Mean Shift algorithm, where pixels are treated as points in a feature space (color, position) to group homogeneous regions of the image.

📖
용어

Combined Feature Space

Multidimensional space used for image segmentation, combining spatial attributes (x, y coordinates) and appearance attributes (RGB or Lab color values) to group pixels.

📖
용어

Kernel Density Estimation (KDE)

Statistical method on which Mean Shift is based, which estimates the probability density function of a dataset by summing kernel functions centered on each point.

📖
용어

Grid Search

Optimization technique to find the best bandwidth by evaluating clustering performance over a predefined range of values, often based on metrics like the silhouette score.

📖
용어

Mode Seeking

Alternative name and fundamental concept of Mean Shift, describing the nature of the algorithm as a procedure for finding the maxima (modes) of the underlying data density function.

📖
용어

Anchor Point

In some implementations, a subset of data points used to initialize the algorithm to reduce computational complexity, with other points then assigned to the nearest mode.

🔍

결과를 찾을 수 없습니다