Normalized Cuts for image segmentation
E1017405
computer vision technique
graph-based clustering method
image segmentation algorithm
spectral clustering method
Normalized Cuts for image segmentation is a graph-based computer vision technique that partitions an image into meaningful regions by optimizing a global criterion balancing inter-group dissimilarity and intra-group similarity.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Normalized Cuts for image segmentation canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T13061798 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Normalized Cuts for image segmentation Context triple: [Jitendra Malik, knownFor, Normalized Cuts for image segmentation]
-
A.
Modeling image patches with a directed hierarchy of Markov random fields
"Modeling image patches with a directed hierarchy of Markov random fields" is a research paper that introduces a probabilistic hierarchical model for capturing complex statistical structure in image patches using directed Markov random fields.
-
B.
Markov random fields
Markov random fields are probabilistic graphical models that represent the joint distribution of a set of random variables with local dependencies encoded by an undirected graph, widely used in areas like statistical physics, computer vision, and spatial statistics.
-
C.
Shi–Tomasi corner detector
The Shi–Tomasi corner detector is a computer vision algorithm that identifies good feature points (corners) in images for robust tracking and recognition tasks.
-
D.
Proceedings of Imaging Understanding Workshop
Proceedings of Imaging Understanding Workshop is a research conference publication focused on advances in computer vision and image understanding.
-
E.
Lucas–Kanade optical flow algorithm
The Lucas–Kanade optical flow algorithm is a widely used computer vision method for estimating the motion of features between consecutive images by assuming locally constant motion and solving a least-squares problem.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Normalized Cuts for image segmentation Target entity description: Normalized Cuts for image segmentation is a graph-based computer vision technique that partitions an image into meaningful regions by optimizing a global criterion balancing inter-group dissimilarity and intra-group similarity.
-
A.
Modeling image patches with a directed hierarchy of Markov random fields
"Modeling image patches with a directed hierarchy of Markov random fields" is a research paper that introduces a probabilistic hierarchical model for capturing complex statistical structure in image patches using directed Markov random fields.
-
B.
Markov random fields
Markov random fields are probabilistic graphical models that represent the joint distribution of a set of random variables with local dependencies encoded by an undirected graph, widely used in areas like statistical physics, computer vision, and spatial statistics.
-
C.
Shi–Tomasi corner detector
The Shi–Tomasi corner detector is a computer vision algorithm that identifies good feature points (corners) in images for robust tracking and recognition tasks.
-
D.
Proceedings of Imaging Understanding Workshop
Proceedings of Imaging Understanding Workshop is a research conference publication focused on advances in computer vision and image understanding.
-
E.
Lucas–Kanade optical flow algorithm
The Lucas–Kanade optical flow algorithm is a widely used computer vision method for estimating the motion of features between consecutive images by assuming locally constant motion and solving a least-squares problem.
- F. None of above. chosen
Statements (51)
| Predicate | Object |
|---|---|
| instanceOf |
computer vision technique
ⓘ
graph-based clustering method ⓘ image segmentation algorithm ⓘ spectral clustering method ⓘ |
| advantage |
avoids bias toward small isolated regions
ⓘ
incorporates global image information ⓘ produces globally optimal partitions under relaxation ⓘ |
| alsoKnownAs |
Ncut
NERFINISHED
ⓘ
Normalized Cuts NERFINISHED ⓘ |
| appliedIn |
medical image analysis
ⓘ
object segmentation ⓘ scene segmentation ⓘ |
| assumes | image regions correspond to coherent groups in feature space ⓘ |
| balances |
between-group dissimilarity
ⓘ
within-group similarity ⓘ |
| basedOn |
graph theory
ⓘ
spectral graph theory ⓘ |
| coreConcept |
balancing inter-group dissimilarity and intra-group similarity
ⓘ
minimizing a normalized cut cost function ⓘ partitioning a graph into disjoint sets ⓘ |
| edgeWeightRepresents | similarity between pixels or regions ⓘ |
| field |
computer vision
ⓘ
image processing ⓘ pattern recognition ⓘ |
| graphMatrix |
affinity matrix
ⓘ
degree matrix ⓘ graph Laplacian ⓘ |
| influenced |
graph-based image segmentation methods
ⓘ
later spectral clustering algorithms ⓘ |
| introducedBy |
Jianbo Shi
NERFINISHED
ⓘ
Jitendra Malik NERFINISHED ⓘ |
| limitation |
computationally expensive for large images
ⓘ
requires construction of large affinity matrix ⓘ |
| objectiveFunction | normalized cut value ⓘ |
| objectiveMinimizes | sum of weights of edges cut between groups normalized by association within groups ⓘ |
| operatesOn |
image pixels
ⓘ
image regions ⓘ |
| publicationYear | 2000 ⓘ |
| publishedIn | IEEE Transactions on Pattern Analysis and Machine Intelligence NERFINISHED ⓘ |
| relatedTo |
graph partitioning
ⓘ
minimum cut ⓘ ratio cut ⓘ |
| representsImageAs | weighted undirected graph ⓘ |
| segmentationObtainedBy |
clustering in spectral embedding space
ⓘ
thresholding eigenvector components ⓘ |
| similarityCanBeBasedOn |
color
ⓘ
intensity ⓘ spatial proximity ⓘ texture ⓘ |
| solvedBy | generalized eigenvalue problem ⓘ |
| uses | eigenvectors of graph Laplacian ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: Normalized Cuts for image segmentation Description of subject: Normalized Cuts for image segmentation is a graph-based computer vision technique that partitions an image into meaningful regions by optimizing a global criterion balancing inter-group dissimilarity and intra-group similarity.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.