59,323 Hits in 4.8 sec

Efficient Shape Matching Via Graph Cuts [chapter]

Frank R. Schmidt, Eno Töppe, Daniel Cremers, Yuri Boykov
Lecture Notes in Computer Science  
In this paper, we show that shape matching can be cast as a problem of finding a minimum cut through a graph which can be solved efficiently by computing the maximum network flow.  ...  In particular, we show the equivalence of the minimum cut formulation and the shortest path formulation, i.e. we show that there exists a one-to-one correspondence of a shortest path and a graph cut and  ...  Shape Matching Via Graph Cuts In the following, we will cast the problem of matching two planar shapes as a problem of cutting an appropriate graph.  ... 
doi:10.1007/978-3-540-74198-5_4 fatcat:ha64jygqxfcvtgo5q2xwf7vgfu

Efficient planar graph cuts with applications in Computer Vision

Frank R. Schmidt, Eno Toppe, Daniel Cremers
2009 2009 IEEE Conference on Computer Vision and Pattern Recognition  
We present a fast graph cut algorithm for planar graphs. It is based on the graph theoretical work [3, 2] 1 and leads to an efficient method that we apply on shape matching and image segmentation.  ...  We present two experimental benchmark studies which demonstrate that the presented method is also in practice faster than previously proposed graph cut methods: On planar shape matching and image segmentation  ...  Shape Matching via Graph Cuts It is possible to transform the shape matching problem into a graph cut problem: By identifying every node (a, 0) with (a + N, N ) , the graph becomes a cylinder and each  ... 
doi:10.1109/cvpr.2009.5206863 dblp:conf/cvpr/SchmidtTC09 fatcat:vz4vu5so2jdkdigjzyqr7qlxlm

Author Index

2010 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition  
Isoperimetric Cut on a Directed Graph Liu, Qingshan Image Retrieval via Probabilistic Hypergraph Ranking Exploring Facial Expression with Compositional Features Liu, Shaohui Visual Tracking via  ...  via Graph Cuts Li, Li-Jia Building and Using a Semantivisual Image Hierarchy Li, Liyuan Spatialized Epitome and Its Applications Li, Min Visual Tracking via Incremental Self-tuning Particle Filtering  ... 
doi:10.1109/cvpr.2010.5539913 fatcat:y6m5knstrzfyfin6jzusc42p54

Layered shape matching and registration: Stochastic sampling with hierarchical graph representation

Xiaobai Liu, Liang Lin, Hongwei Li, Hai Jin, Wenbing Tao
2008 Pattern Recognition (ICPR), Proceedings of the International Conference on  
operators are defined for matching measurement.  ...  Then, the Swendsen-Wang Cuts and Gibbs sampling methods are performed for global optimal solution to generate the final subgraph-level representation, where a mixture bending function and a set of topological  ...  To rapidly search the complex solution space, the efficient SW-Cut computation method is applied for the second layer graph G S 2 to sampling the posterior probability defined in Eq.3, and the bottom-up  ... 
doi:10.1109/icpr.2008.4760958 dblp:conf/icpr/LiuLLJT08 fatcat:dyvui32jgnax7mni5a7tukivgm

Structured Prediction Problem Archive [article]

Paul Swoboda, Andrea Hornakova, Paul Roetzer, Bogdan Savchynskyy, Ahmed Abbas
2022 arXiv   pre-print
Fast approximate energy minimiza-tion via graph cuts.  ...  CGC [BKK + 14]: Cut, Glue & Cut, a heuristic that alternatingly bipartitions the graph and exchanges nodes in pairs of clusters via max-cut computed by a reduction to perfect matching.  ... 
arXiv:2202.03574v2 fatcat:n5ez3attlveyvamyz5l4sdgozi

Convex Joint Graph Matching and Clustering via Semidefinite Relaxations [article]

Maximilian Krahn and Florian Bernard and Vladislav Golyanik
2021 arXiv   pre-print
This paper proposes a new algorithm for simultaneous graph matching and clustering.  ...  For joint reasoning, we first rephrase graph matching as a rigid point set registration problem operating on spectral graph embeddings.  ...  In [61] , a graph cut and matching problem is solved simultaneously. However, in this work the aim is to cut a single graph into two clusters, and then perform a matching between these clusters.  ... 
arXiv:2110.11335v1 fatcat:3vojpob54zanjmjmo5lk5r6lq4

Approximate tree matching and shape similarity

Tyng-Luh Liu, D. Geiger
1999 Proceedings of the Seventh IEEE International Conference on Computer Vision  
The optimization process gives guaranteed globally optimal match efficiently. Experimental results on a variety of shape contours are provided.  ...  To deal with articulations, stretchings and occlusions, three local tree matching operations, merge, cut, and merge-and-cut, are introduced to yield optimally approximate matches, which can accommodate  ...  (h) An example of stretching match via a cut operation (C-operation) overlapped with its shape contour.  ... 
doi:10.1109/iccv.1999.791256 dblp:conf/iccv/LiuG99 fatcat:twi5thrrnrcaplxmcdabgpuqwi

Efficient MRF Energy Propagation for Video Segmentation via Bilateral Filters

Ozan Sener, Kemal Ugur, A. Aydin Alatan
2014 IEEE transactions on multimedia  
Recently presented bi-exponential filter is utilized for efficiency, whereas a novel technique is also developed to dynamically solve graph-cuts for varying, non-lattice graphs in general linear filtering  ...  For this purpose, a novel and efficient method is proposed to propagate MRF energies throughout the frames via bilateral filters without using any global texture, color or shape model.  ...  Efficiency obtained via dynamic graph-cut can be crucial factor to increase the interaction quality for interactive multimedia applications.  ... 
doi:10.1109/tmm.2014.2314069 fatcat:ozq7mh4nsrao3ohqegol4c7zpu

Circular Shape Antenna Embedded with b-Shape Slot for UWB Applications

Kirandeep Randhawa,, Davinder Parkash
2014 International Journal of Engineering Research  
The impedance matching and radiation characteristics of the designed structure are investigated by using IE3D.  ...  The proposed antenna has simple structure consisting of b-shape slot in a circular patch. The overall dimension of the antenna come around 32 mm  22 mm X 1.6 mm and fed by 50Ω CPW feed.  ...  It shows the comparison graph of return losses when there was no cut at the centre of slot; when the length of ground plane is decreased.  ... 
doi:10.17950/ijer/v3s2/206 fatcat:dqqkog76gbglpo4mjtgnxy4z4e

A Bayesian approach for image segmentation with shape priors

Hang Chang, Qing Yang, Bahram Parvin
2008 2008 IEEE Conference on Computer Vision and Pattern Recognition  
The novelties of our approach are in (i) formulating the segmentation problem in a well-defined Bayesian framework with multiple shape priors, (ii) efficiently estimating parameters of the Bayesian model  ...  In this paper, we propose an interactive image segmentation approach with shape prior models within a Bayesian framework.  ...  We have opted to use the graph cut algorithm [2] for its efficiency.  ... 
doi:10.1109/cvpr.2008.4587430 dblp:conf/cvpr/ChangYP08 fatcat:menbraudtvc5vepn4hckllql4q

ICCV Program

2007 2007 IEEE 11th International Conference on Computer Vision  
Prior View Stereo via Graph Cuts on the Dual of an Adaptive Tetrahedral Mesh Brian Amberg, Andrew Blake, Andrew Fitzgibbon, Sami Romdhani, Thomas [PDF paper] E.  ...  and Distinctive Feature Configurations Victor Lempitsky, Carsten Rother, Andrew Blake: LogCut -Efficient Graph Cut Optimization for Markov Random Fields Huai-Yu Wu, Chunhong Pan, Qing Yang, Songde  ... 
doi:10.1109/iccv.2007.4408821 fatcat:csxpst65sbagxhouhz5yuj3qbu

Graph Cuts Based Image Segmentation with Part-Based Models

Wei Liu, Xuejun Xu
2013 Research Journal of Applied Sciences Engineering and Technology  
Many priors have been introduced into graph cuts to improve the segmentation results and our work is inspired by the shape prior.  ...  The user involvement is reduced and the performance of the graph cuts algorithm is improved at the first iteration. Our assumption is based on the compact shape.  ...  Yangel and Vetrov (2011) proposed a shape prior that represents object shape via simplified skeleton graph, edges of the graph correspond to meaningful parts of an object.  ... 
doi:10.19026/rjaset.5.4979 fatcat:chrvvjuexfetzo4ji7yfhbhsum

Left Ventricle Segmentation via Graph Cut Distribution Matching [chapter]

Ismail Ben Ayed, Kumaradevan Punithakumar, Shuo Li, Ali Islam, Jaron Chong
2009 Lecture Notes in Computer Science  
cuts.  ...  The energy and its graph cut optimization based on an original first-order approximation of the Bhattacharyya measure have not been proposed previously, and yield competitive results in nearly real-time  ...  Global and efficient graph cut optimization. Optimization of the distribution matching functions in F (L, I n ) is not directly amenable to graph cut computation. It is an NP-hard problem.  ... 
doi:10.1007/978-3-642-04271-3_109 fatcat:p57es7pwvnbvxmqu23y546zq2a

Learning to segment dense cell nuclei with shape prior

Xinghua Lou, U. Koethe, J. Wittbrodt, F. A. Hamprecht
2012 2012 IEEE Conference on Computer Vision and Pattern Recognition  
We therefore propose a novel extension to the graph cut framework that incorporates a "blob"-like shape prior. The corresponding energy terms are parameterized via structured learning.  ...  We study the problem of segmenting multiple cell nuclei from GFP or Hoechst stained microscope images with a shape prior.  ...  In the context of graph cut segmentation on which our method is based, many shape priors have been explored.  ... 
doi:10.1109/cvpr.2012.6247778 dblp:conf/cvpr/LouKWH12 fatcat:6v74fdwvpvbopnxxsw22kgizq4

Markov random fields for sketch based video retrieval

Rui Hu, Stuart James, Tinghuai Wang, John Collomosse
2013 Proceedings of the 3rd ACM conference on International conference on multimedia retrieval - ICMR '13  
We parse space-time volumes from video to form graph representation, which we match to sketches under a Markov Random Field (MRF) optimization.  ...  The MRF energy function is used to rank videos for relevance and contains unary, pairwise and higher-order potentials that reflect the colour, shape, motion and type of sketched objects.  ...  GRAPH CUT BASED VIDEO RETRIEVAL We propose a spatio-temporal graph representation of videos and formulate the video retrieval problem as a supervoxellabelling and matching problem.  ... 
doi:10.1145/2461466.2461510 dblp:conf/mir/HuJWC13 fatcat:r2ybk5kmc5hqrbafjebbyj2yae
« Previous Showing results 1 — 15 out of 59,323 results