All the tool for build a network able to reconize any shapes.
Very complete, a good base for anything you want to do whith acknowledge, and neural network
acm HDOJ 1051WoodenSticks
Description:
There is a pile of n wooden sticks. The length and weight of each stick are known in advance. The sticks are to be processed by a woodworking machine in one by one fashion. It needs some time, called setup time, for the machine to prepare processing a stick. The setup times are associated with cleaning operations and changing tools and shapes in the machine. The setup times of the woodworking machine are given as follows:
(a) The setup time for the first wooden stick is 1 minute.
(b) Right after processing a stick of length l and weight w , the machine will need no setup time for a stick of length l and weight w if l<=l and w<=w . Otherwise, it will need 1 minute for setup.
The creation of believable and endearing characters in computer
graphics presents a number of technical challenges, including the
modeling, animation and rendering of complex shapes such as
heads, hands, and clothing.
We propose a simple and effective method for detecting view- and
scale-independent ridge-valley lines defined via first- and secondorder
curvature derivatives on shapes approximated by dense triangle
meshes.
圖像處理的關于Snakes : Active Contour Models算法和水平集以及GVF的幾篇文章，文章列表為：
[1]Snakes Active Contour Models.pdf
[2]Multiscale Active Contours.pdf
[3]Snakes, shapes, and gradient vector flow.pdf
[4]Motion of level sets by mean curvature I.pdf
[5]Spectral Stability of Local Deformations Spectral Stability of Local Deformations.pdf
[6]An active contour model for object tracking using the previous contour.pdf
[7]Volumetric Segmentation of Brain Images Using Parallel Genetic AlgorithmsI.pdf
[8]Segmentation in echocardiographic sequences using shape-based snake model.pdf
[9]Active Contours Without Edges.pdf
學習圖像處理的人必看的幾篇文章
PNG開放源接口 The interface has
been designed to be as simple and intuitive as possible. It supports plotting and reading in the RGB (red, green,
blue), HSV (hue, saturation, value/brightness) and CMYK (cyan, magenta, yellow, black) colour spaces, basic
shapes, scaling, bilinear interpolation, full TrueType antialiased and rotated text support, bezier curves, opening
existing PNG images and more.
We describe and demonstrate an algorithm that takes as input an
unorganized set of points fx1 xng IR3 on or near an unknown
manifold M, and produces as output a simplicial surface that
approximates M. Neither the topology, the presence of boundaries,
nor the geometry of M are assumed to be known in advance — all
are inferred automatically from the data. This problem naturally
arises in a variety of practical situations such as range scanning
an object from multiple view points, recovery of biological shapes
from two-dimensional slices, and interactive surface sketching.
