8292565
Recognition and reconstruction of primitives in music scores
Abstract Music recognition bears similarities and differences to OCR. In this paper we identify some of the problems peculiar to musical scores, and propose an approach which succeeds in a wide range of non-trivial cases. The composer customarily proceeds by writing notes, then stems, beams, ties and slurs — we have inverted this approach by segmenting and then subsegmenting scores to recapture the component parts of symbols. In this paper, we concentrate on the strategy of recognizing sub-segmented primitives, and the reassembly process which reconstructs low level graphical primitives back to musical symbols. The sub-segmentation process proves to be worthwhile, since many primitives complement each other and high level musical theory can be employed to enhance the recognition process.
22708219
Automated Paper-Based Watermark Extraction and Processing
The boom of digital market and rapid expansion and demand of digital content consumption have many requirements for automated content processing, cataloguing, authenticating, indexing, etc.. Digital watermarking and fingerprinting techniques are being explored to authenticate and detect features in digital objects. This is similar to the analogue paper-based watermarking technique that was invented in the 13th century in Italy for the identification of the workers. This paper presents a framework for the digitisation, extraction and graphical representation of paper-based watermark designs. With a general overview of the framework by Hiary and Ng (2005), the paper focuses on automated processes which determine the configuration of processing parameters in order to allow optimal content processing without time-consuming manual intervention. With a machine readable graphical representation of the watermark, cataloguing and indexing of these heritage resources can be enhanced with the ease of digital content retrieval functionalities for scholarly usages and many other advantages of digital technologies including distribution and preservation
45868269
Minimum variance unbiased estimation based on bootstrap iterations
Practical computation of the minimum variance unbiased estimator (MVUE) is often a difficult, if not impossible, task, even though general theory assures its existence under regularity conditions. We propose a new approach based on iterative bootstrap bias correction of the maximum likelihood estimator to accurately approximate the MVUE. Viewing bootstrap iteration as a Markov process, we develop a computational algorithm for bias correction based on arbitrarily many bootstrap iterations. The algorithm, when applied parametrically to finite sample spaces, does not involve Monte Carlo simulation. For infinite sample spaces, a nonparametric version of the algorithm is combined with a preliminary round of Monte Carlo simulation to yield an approximate MVUE. Both algorithms are computationally more efficient and stable than conventional simulation-based bootstrap iterations. Examples are given of both finite and infinite sample spaces to illustrate the effectiveness of our new approach.
8169680
PINS push in and POUTS pop out: creating a tangible pin-board that ejects physical documents
There is an asymmetry in many tangible interfaces: while phicons can be used to manipulate digital information, the reverse is often not possible - the digital world cannot push back. We describe a tangible pin-board that pushes back by physically ejecting paper documents when they are digitally deleted. This is realized using pouts, addressable pin-like devices that communicate with a Pin&Play board and that can eject themselves by contracting an internal Muscle Wire actuator to trigger a mechanical latch. To demonstrate and begin to evaluate the technology we have developed an initial application of pouts involving a game where online players vote to eject physical pictures from a pin-board.
31564735
Improve the service quality of multi-agent system: ontology management
The association of ontology with services enables service providers to export their services and also enables clients to declare desired services so that new service providers can serve existing clients. Changes and enhancements can be kept track of through the ontology management. The ontology management platform in our system not only declares semantics of agent services, but also provides interface specification for clients to use such a system with semantic information provided.
29024680
On optimal orientation of cycle vertex multiplications
For a bridgeless connected graph G, let D(G) be the family of its strong orientations; and for any [email protected]?D(G), we denote by d(D) its diameter. The orientation number d->(G) of G is defined by d->(G)=min{d(D)|[email protected]?D(G)}. For a connected graph G of order n and for any sequence of n positive integers (s"i), let G(s"1,s"2,...,s"n) denote the graph with vertex set V^* and edge set E^* such that V^*[email protected]?"i"="1^nV"i, where V"i's are pairwise disjoint sets with |V"i|=s"i, i=1,2,...,n, and for any two distinct vertices x, y in V^*, [email protected]?E^* if and only if [email protected]?V"i and [email protected]?V"j for some i,[email protected]?{1,2,...,n} with i j such that v"iv"[email protected]?E(G). We call the graph G(s"1,s"2,...,s"n) a G vertex multiplication. In this paper, we determine the orientation numbers of various cycle vertex multiplications.
7581866
The orientation number of two complete graphs with linkages
For a connected graph G containing no bridges, let D(G) be the family of strong orientations of G; and for any D@?D(G), we denote by d(D) the diameter of D. The orientation number d->(G) of G is defined by d->(G)=min{d(D)|D@?D(G)}. In this paper, we study the orientation numbers of a family of graphs, denoted by G(p,q;m), that are obtained from the disjoint union of two complete graphs K"p and K"q by adding m edges linking them in an arbitrary manner. Define d->(m)=min{d->(G):G@?G(p,q;m)}. We prove that d->(2)=4 and min{m:d->(m)=3}=4. Let @a=min{m:d->(m)=2}. We evaluate the exact value of @a when p==p+4.