From a Modified Ambrosio-Tortorelli to a Randomized Part Hierarchy Tree

04/12/2011
by   Sibel Tari, et al.
0

We demonstrate the possibility of coding parts, features that are higher level than boundaries, using a modified AT field after augmenting the interaction term of the AT energy with a non-local term and weakening the separation into boundary/not-boundary phases. The iteratively extracted parts using the level curves with double point singularities are organized as a proper binary tree. Inconsistencies due to non-generic configurations for level curves as well as due to visual changes such as occlusion are successfully handled once the tree is endowed with a probabilistic structure. The work is a step in establishing the AT function as a bridge between low and high level visual processing.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/05/2014

CoMIC: Good features for detection and matching at object boundaries

Feature or interest points typically use information aggregation in 2D p...
research
04/23/2015

High-for-Low and Low-for-High: Efficient Boundary Detection from Deep Object Features and its Applications to High-Level Vision

Most of the current boundary detection systems rely exclusively on low-l...
research
01/16/2013

Tree structured sparse coding on cubes

A brief description of tree structured sparse coding on the binary cube....
research
08/01/2016

Attention Tree: Learning Hierarchies of Visual Features for Large-Scale Image Recognition

One of the key challenges in machine learning is to design a computation...
research
07/22/2020

Point-Location in The Arrangement of Curves

An arrangement of n curves in the plane is given. The query is a point q...
research
10/24/2016

IB2d: a Python and MATLAB implementation of the immersed boundary method

The development of fluid-structure interaction (FSI) software involves t...

Please sign up or login with your details

Forgot password? Click here to reset