Heart disease & pregnancy Dr Movahedi Clinical indicators of Hear disease & pregnancy.
Qualifying Exam: Contour Grouping Vida Movahedi Supervisor: James Elder Supervisory Committee: Minas...
-
Upload
charity-hood -
Category
Documents
-
view
216 -
download
0
Transcript of Qualifying Exam: Contour Grouping Vida Movahedi Supervisor: James Elder Supervisory Committee: Minas...
![Page 1: Qualifying Exam: Contour Grouping Vida Movahedi Supervisor: James Elder Supervisory Committee: Minas Spetsakis, Jeff Edmonds York University Summer 2009.](https://reader035.fdocuments.net/reader035/viewer/2022070412/56649cfa5503460f949cbf05/html5/thumbnails/1.jpg)
Qualifying Exam:Qualifying Exam:
Contour GroupingContour GroupingVida MovahediVida Movahedi
Supervisor: James ElderSupervisor: James Elder
Supervisory Committee:Supervisory Committee:
Minas Spetsakis, Jeff EdmondsMinas Spetsakis, Jeff Edmonds
York UniversityYork University
Summer 2009Summer 2009
![Page 2: Qualifying Exam: Contour Grouping Vida Movahedi Supervisor: James Elder Supervisory Committee: Minas Spetsakis, Jeff Edmonds York University Summer 2009.](https://reader035.fdocuments.net/reader035/viewer/2022070412/56649cfa5503460f949cbf05/html5/thumbnails/2.jpg)
ContentsContents• Introduction
• Preliminary Concepts– Pre-processing
– Gestalt cues
• Methods– Local & Heuristic
– Local & Probabilistic
– Global Saliency
• Evaluation
• Conclusion & open problems
![Page 3: Qualifying Exam: Contour Grouping Vida Movahedi Supervisor: James Elder Supervisory Committee: Minas Spetsakis, Jeff Edmonds York University Summer 2009.](https://reader035.fdocuments.net/reader035/viewer/2022070412/56649cfa5503460f949cbf05/html5/thumbnails/3.jpg)
ContentsContents• Introduction
• Preliminary Concepts– Pre-processing
– Gestalt cues
• Methods– Local & Heuristic
– Local & Probabilistic
– Global Saliency
• Evaluation
• Conclusion & open problems
![Page 4: Qualifying Exam: Contour Grouping Vida Movahedi Supervisor: James Elder Supervisory Committee: Minas Spetsakis, Jeff Edmonds York University Summer 2009.](https://reader035.fdocuments.net/reader035/viewer/2022070412/56649cfa5503460f949cbf05/html5/thumbnails/4.jpg)
IntroductionIntroduction
• SegmentationPartition an image into regions, each corresponding to
an object or entity
• Figure-Ground segmentation
![Page 5: Qualifying Exam: Contour Grouping Vida Movahedi Supervisor: James Elder Supervisory Committee: Minas Spetsakis, Jeff Edmonds York University Summer 2009.](https://reader035.fdocuments.net/reader035/viewer/2022070412/56649cfa5503460f949cbf05/html5/thumbnails/5.jpg)
Segmentation MethodsSegmentation Methods• Regional Segmentation
– Use regional info, optimize labelling of regional tokens, e.g. clustering
– Depending on uniformity in object region
• Active Contour Models– Use regional (external) & boundary (internal) info,
optimize deformation of model
– Sensitivity to initialization, too smooth
• Contour Grouping– Use boundary info (& regional info), optimize grouping of
contour fragments
![Page 6: Qualifying Exam: Contour Grouping Vida Movahedi Supervisor: James Elder Supervisory Committee: Minas Spetsakis, Jeff Edmonds York University Summer 2009.](https://reader035.fdocuments.net/reader035/viewer/2022070412/56649cfa5503460f949cbf05/html5/thumbnails/6.jpg)
Problem DefinitionProblem Definition• Input: Color image
• Goal: Figure-ground segmentation
• Method: Contour Grouping
• Other available info: None
- No motion, stereo or video information
- No user interactions
- No assumptions on object types, shapes, color, etc.
- No assumptions on background or lighting conditions
![Page 7: Qualifying Exam: Contour Grouping Vida Movahedi Supervisor: James Elder Supervisory Committee: Minas Spetsakis, Jeff Edmonds York University Summer 2009.](https://reader035.fdocuments.net/reader035/viewer/2022070412/56649cfa5503460f949cbf05/html5/thumbnails/7.jpg)
ChallengesChallenges• High-dimensional data space, lots of information,
many cues
• Unknown cue integration
• Global optimization in a non-convex multidimensional space
• Camera, imaging, quantization noise
• Clutter in natural scenes
• Occluded or overlapping objects
![Page 8: Qualifying Exam: Contour Grouping Vida Movahedi Supervisor: James Elder Supervisory Committee: Minas Spetsakis, Jeff Edmonds York University Summer 2009.](https://reader035.fdocuments.net/reader035/viewer/2022070412/56649cfa5503460f949cbf05/html5/thumbnails/8.jpg)
ContentsContents• Introduction
• Preliminary Concepts– Pre-processing
– Gestalt cues
• Methods– Local & Heuristic
– Local & Probabilistic
– Global Saliency
• Evaluation
• Conclusion & open problems
![Page 9: Qualifying Exam: Contour Grouping Vida Movahedi Supervisor: James Elder Supervisory Committee: Minas Spetsakis, Jeff Edmonds York University Summer 2009.](https://reader035.fdocuments.net/reader035/viewer/2022070412/56649cfa5503460f949cbf05/html5/thumbnails/9.jpg)
StepsStepsImage
Grouping Algorithm
Saliency
Computations
Optimization
Algorithm
Figure/Ground Segmentation
Pre-processing
Edge
Detection
Line /Curve
Approximation
Learned Parameters or Distributions
![Page 10: Qualifying Exam: Contour Grouping Vida Movahedi Supervisor: James Elder Supervisory Committee: Minas Spetsakis, Jeff Edmonds York University Summer 2009.](https://reader035.fdocuments.net/reader035/viewer/2022070412/56649cfa5503460f949cbf05/html5/thumbnails/10.jpg)
Pre-processingPre-processing
Image Edge Map Line Map Contour
![Page 11: Qualifying Exam: Contour Grouping Vida Movahedi Supervisor: James Elder Supervisory Committee: Minas Spetsakis, Jeff Edmonds York University Summer 2009.](https://reader035.fdocuments.net/reader035/viewer/2022070412/56649cfa5503460f949cbf05/html5/thumbnails/11.jpg)
Gestalt CuesGestalt Cues
How is grouping done in human vision?
• Proximity
• Similarity– Brightness– Contrast
• Good continuation – Parallelism– Co-circularity
![Page 12: Qualifying Exam: Contour Grouping Vida Movahedi Supervisor: James Elder Supervisory Committee: Minas Spetsakis, Jeff Edmonds York University Summer 2009.](https://reader035.fdocuments.net/reader035/viewer/2022070412/56649cfa5503460f949cbf05/html5/thumbnails/12.jpg)
ContentsContents• Introduction
• Preliminary Concepts– Pre-processing
– Gestalt cues
• Methods– Local & Heuristic
– Local & Probabilistic
– Global Saliency
• Evaluation
• Conclusion & open problems
![Page 13: Qualifying Exam: Contour Grouping Vida Movahedi Supervisor: James Elder Supervisory Committee: Minas Spetsakis, Jeff Edmonds York University Summer 2009.](https://reader035.fdocuments.net/reader035/viewer/2022070412/56649cfa5503460f949cbf05/html5/thumbnails/13.jpg)
Grouping MethodsGrouping Methods• Local Heuristic methods
– Defining a heuristic cost for contour hypotheses, find the optimal one
• Local Probabilistic methods– Find posterior probability of contour
hypotheses given cues, find the optimal one
• Global methods– An extra step of calculating global saliencies
based on local measures
![Page 14: Qualifying Exam: Contour Grouping Vida Movahedi Supervisor: James Elder Supervisory Committee: Minas Spetsakis, Jeff Edmonds York University Summer 2009.](https://reader035.fdocuments.net/reader035/viewer/2022070412/56649cfa5503460f949cbf05/html5/thumbnails/14.jpg)
ContentsContents• Introduction
• Preliminary Concepts– Pre-processing
– Gestalt cues
• Methods– Local & Heuristic
– Local & Probabilistic
– Global Saliency
• Evaluation
• Conclusion & open problems
![Page 15: Qualifying Exam: Contour Grouping Vida Movahedi Supervisor: James Elder Supervisory Committee: Minas Spetsakis, Jeff Edmonds York University Summer 2009.](https://reader035.fdocuments.net/reader035/viewer/2022070412/56649cfa5503460f949cbf05/html5/thumbnails/15.jpg)
Local & HeuristicLocal & HeuristicExample: Ratio Contour Method Example: Ratio Contour Method
(Wang et. al, PAMI’05)(Wang et. al, PAMI’05)
• Detected/ virtual fragments
• Contour cost= curvature & gap per unit length
• Graph model
• Alternate cycle
![Page 16: Qualifying Exam: Contour Grouping Vida Movahedi Supervisor: James Elder Supervisory Committee: Minas Spetsakis, Jeff Edmonds York University Summer 2009.](https://reader035.fdocuments.net/reader035/viewer/2022070412/56649cfa5503460f949cbf05/html5/thumbnails/16.jpg)
Local & HeuristicLocal & HeuristicExample: Ratio Contour Method Example: Ratio Contour Method
(Wang et. al, PAMI’05)(Wang et. al, PAMI’05)
• Edge/ Link costs
• Ratio Contour Algorithm
)(
2 )]()([)(eB
dtttew
)(
)(eB
dtel
Ce
Ce
el
ewC
)(
)()(
fragment real aon is )( if0
fragment virtualaon is )( f1)(
tv
tvit
![Page 17: Qualifying Exam: Contour Grouping Vida Movahedi Supervisor: James Elder Supervisory Committee: Minas Spetsakis, Jeff Edmonds York University Summer 2009.](https://reader035.fdocuments.net/reader035/viewer/2022070412/56649cfa5503460f949cbf05/html5/thumbnails/17.jpg)
Sample Results for RC methodSample Results for RC method
Image RC RRC
RC
Image
(from Stahl & Wang, TIP’07)
(from Wang et al., PAMI’05)
![Page 18: Qualifying Exam: Contour Grouping Vida Movahedi Supervisor: James Elder Supervisory Committee: Minas Spetsakis, Jeff Edmonds York University Summer 2009.](https://reader035.fdocuments.net/reader035/viewer/2022070412/56649cfa5503460f949cbf05/html5/thumbnails/18.jpg)
ContentsContents• Introduction
• Preliminary Concepts– Pre-processing
– Gestalt cues
• Methods– Local & Heuristic
– Local & Probabilistic
– Global Saliency
• Evaluation
• Conclusion & open problems
![Page 19: Qualifying Exam: Contour Grouping Vida Movahedi Supervisor: James Elder Supervisory Committee: Minas Spetsakis, Jeff Edmonds York University Summer 2009.](https://reader035.fdocuments.net/reader035/viewer/2022070412/56649cfa5503460f949cbf05/html5/thumbnails/19.jpg)
Local & ProbabilisticLocal & Probabilistic(Elder et al., PAMI’03)(Elder et al., PAMI’03)
• Bayesian Rule:
• Contour saliency= posterior probability of contour
• Assumptions:– Markov Chain Assumption– Independence of evidence from cues– Comparing contours of same length
11
1
)(
)().|()|(
LPDp
HpHDpDHp
)(
)(,
)|(
)|(
Hp
HpP
HDp
HDpL
)|(maxarg* DCcpcc
}...1{},...1{,),...,(11
niNCttc in
ctt
cij
ct
oi
jii
ppDCcp
),(
)|(
![Page 20: Qualifying Exam: Contour Grouping Vida Movahedi Supervisor: James Elder Supervisory Committee: Minas Spetsakis, Jeff Edmonds York University Summer 2009.](https://reader035.fdocuments.net/reader035/viewer/2022070412/56649cfa5503460f949cbf05/html5/thumbnails/20.jpg)
Local & Probabilistic Local & Probabilistic (Elder et al., PAMI’03)(Elder et al., PAMI’03)
• Graph Model
• Node weight
• Link weight
• Shortest path/cycle
• Approximate search
Nipvw oii
o ..1 ),log()( iv
ije jv
Njipew cijij
c ..1, ),log()(
cjicijii Pvvij
c
Pvi
o
ctt
cij
ct
oi ewvwppDCcp
),(),(
)()()log()log()|(log
![Page 21: Qualifying Exam: Contour Grouping Vida Movahedi Supervisor: James Elder Supervisory Committee: Minas Spetsakis, Jeff Edmonds York University Summer 2009.](https://reader035.fdocuments.net/reader035/viewer/2022070412/56649cfa5503460f949cbf05/html5/thumbnails/21.jpg)
Sample Results for Probabilistic MethodsSample Results for Probabilistic Methods
(from Estrada & Elder- CVPRW’06)
![Page 22: Qualifying Exam: Contour Grouping Vida Movahedi Supervisor: James Elder Supervisory Committee: Minas Spetsakis, Jeff Edmonds York University Summer 2009.](https://reader035.fdocuments.net/reader035/viewer/2022070412/56649cfa5503460f949cbf05/html5/thumbnails/22.jpg)
ContentsContents• Introduction
• Preliminary Concepts– Pre-processing
– Gestalt cues
• Methods– Local & Heuristic
– Local & Probabilistic
– Global Saliency
• Evaluation
• Conclusion & open problems
![Page 23: Qualifying Exam: Contour Grouping Vida Movahedi Supervisor: James Elder Supervisory Committee: Minas Spetsakis, Jeff Edmonds York University Summer 2009.](https://reader035.fdocuments.net/reader035/viewer/2022070412/56649cfa5503460f949cbf05/html5/thumbnails/23.jpg)
Global ModelGlobal Model
Local weights Global weights
![Page 24: Qualifying Exam: Contour Grouping Vida Movahedi Supervisor: James Elder Supervisory Committee: Minas Spetsakis, Jeff Edmonds York University Summer 2009.](https://reader035.fdocuments.net/reader035/viewer/2022070412/56649cfa5503460f949cbf05/html5/thumbnails/24.jpg)
Global SaliencyGlobal Saliency• Edge/Link Affinity
Based on collinearity, proximity, etc.
• Edge/ Link Saliency
Relative number of closed random walks which visit that edge/link (Mahamud et al., PAMI’03)
• Shown to be relevant to the eigenvalues and eigenvectors of the affinity matrix
• Grouping based on global saliency
![Page 25: Qualifying Exam: Contour Grouping Vida Movahedi Supervisor: James Elder Supervisory Committee: Minas Spetsakis, Jeff Edmonds York University Summer 2009.](https://reader035.fdocuments.net/reader035/viewer/2022070412/56649cfa5503460f949cbf05/html5/thumbnails/25.jpg)
Some Results of the Untangling methodSome Results of the Untangling method
(from Zhu; Song; Shi- ICCV’07)
![Page 26: Qualifying Exam: Contour Grouping Vida Movahedi Supervisor: James Elder Supervisory Committee: Minas Spetsakis, Jeff Edmonds York University Summer 2009.](https://reader035.fdocuments.net/reader035/viewer/2022070412/56649cfa5503460f949cbf05/html5/thumbnails/26.jpg)
ContentsContents• Introduction
• Preliminary Concepts– Pre-processing
– Gestalt cues
• Methods– Local & Heuristic
– Local & Probabilistic
– Global Saliency
• Evaluation
• Conclusion & open problems
![Page 27: Qualifying Exam: Contour Grouping Vida Movahedi Supervisor: James Elder Supervisory Committee: Minas Spetsakis, Jeff Edmonds York University Summer 2009.](https://reader035.fdocuments.net/reader035/viewer/2022070412/56649cfa5503460f949cbf05/html5/thumbnails/27.jpg)
EvaluationEvaluation
• Empirical discrepancy methods
The output of algorithms is compared with a reference segmentation or ground truth
• Requirements– A ground truth dataset– An error measure
![Page 28: Qualifying Exam: Contour Grouping Vida Movahedi Supervisor: James Elder Supervisory Committee: Minas Spetsakis, Jeff Edmonds York University Summer 2009.](https://reader035.fdocuments.net/reader035/viewer/2022070412/56649cfa5503460f949cbf05/html5/thumbnails/28.jpg)
SOD: Salient Object DatasetSOD: Salient Object Dataset
• Based on Berkeley Segmentation Dataset (BSD)
• 300 images, randomly showing 818 segmentations (half of BSD) to each of 7 subjects
• 12,110 object boundaries obtained
1
1
1
1
1
![Page 29: Qualifying Exam: Contour Grouping Vida Movahedi Supervisor: James Elder Supervisory Committee: Minas Spetsakis, Jeff Edmonds York University Summer 2009.](https://reader035.fdocuments.net/reader035/viewer/2022070412/56649cfa5503460f949cbf05/html5/thumbnails/29.jpg)
Region-based Error MeasuresRegion-based Error Measures• Example
• Not sensitive to some large shape features (e.g., spikes, wiggles)
BA
BAB
BA
BAA
BA
BA
RR
RRR
RR
RRRRR
RRBARIM
||||
1),(
![Page 30: Qualifying Exam: Contour Grouping Vida Movahedi Supervisor: James Elder Supervisory Committee: Minas Spetsakis, Jeff Edmonds York University Summer 2009.](https://reader035.fdocuments.net/reader035/viewer/2022070412/56649cfa5503460f949cbf05/html5/thumbnails/30.jpg)
Boundary-based Error Boundary-based Error MeasuresMeasures
• Not sensitive to object topology and some large shape features (e.g., loop-backs, wiggles)
),(minmax)),(max(),( badBASDBAhBbAa
B
}),({),( AaadBASD BB
),(),,(max),( ABhBAhBAH
AabadadBb
B
,),(min)(
![Page 31: Qualifying Exam: Contour Grouping Vida Movahedi Supervisor: James Elder Supervisory Committee: Minas Spetsakis, Jeff Edmonds York University Summer 2009.](https://reader035.fdocuments.net/reader035/viewer/2022070412/56649cfa5503460f949cbf05/html5/thumbnails/31.jpg)
Mixed Error MeasuresMixed Error Measures
fpfn N
kkB
fp
N
jjA
fn
qdN
pdN
BAMM11
)(1
)(1
2
1),(
• Example
• Not sensitive to some large shape features. Does not respect ordering along contours.
pj, j=1..Nfn are pixels in the false negative region (RB-RA)
qk, k=1..Nfp are pixels in the false positive region (RA-RB)
![Page 32: Qualifying Exam: Contour Grouping Vida Movahedi Supervisor: James Elder Supervisory Committee: Minas Spetsakis, Jeff Edmonds York University Summer 2009.](https://reader035.fdocuments.net/reader035/viewer/2022070412/56649cfa5503460f949cbf05/html5/thumbnails/32.jpg)
Contour Mapping MeasureContour Mapping Measure
• Based upon a matching between all points on the two boundaries
• Monotonically non-decreasing
• Allowing one-to-one, many-to-one, and one-to-many matching
• Error= average distance between matched pairs
• Dynamic Programming
Contour Mapping Distance=7.73
![Page 33: Qualifying Exam: Contour Grouping Vida Movahedi Supervisor: James Elder Supervisory Committee: Minas Spetsakis, Jeff Edmonds York University Summer 2009.](https://reader035.fdocuments.net/reader035/viewer/2022070412/56649cfa5503460f949cbf05/html5/thumbnails/33.jpg)
ContentsContents• Introduction
• Preliminary Concepts– Pre-processing
– Gestalt cues
• Methods– Local & Heuristic
– Local & Probabilistic
– Global Saliency
• Evaluation
• Conclusion & open problems
![Page 34: Qualifying Exam: Contour Grouping Vida Movahedi Supervisor: James Elder Supervisory Committee: Minas Spetsakis, Jeff Edmonds York University Summer 2009.](https://reader035.fdocuments.net/reader035/viewer/2022070412/56649cfa5503460f949cbf05/html5/thumbnails/34.jpg)
Conclusion & Open ProblemsConclusion & Open Problems• Cue selection and combination
• Grouping Model– Global saliency
– Probabilistic models
• Optimization Algorithms
• Hierarchical and multi-scale algorithms
• Quantitative evaluation