ppxscal/embedding_network huggingface dataset:
Object Recognition Using Moments: Some Experiments and Observations
Authors: M. Sarfraz
Venue: Proceedings of the conference on Geometric Modeling and Imaging: New Trends (2006)

In many image analysis and computer vision applications, object recognition is the ultimate goal. This work presents study and experimentation for object recognition when isolated objects are under discussion. The circumstances of similarity transformations, presence of noise, and occlusion have been included as the part of the study. For simplicity, instead of objects, outline of the objects have been used for the whole process of the recognition. Hu's moments and their extended counterparts have been used as features of the objects. Various similarity measures have been used and compared for recognition. The test objects are matched with the model objects in database and the object with the least similarity measure is taken as the recognized object. A detailed experimental study has been made under different conditions and circumstances including transformation, noise, and occlusion. Databases of different sizes have been used to have a look at various experimentations. Some interesting observations have been made which may be useful for research and practicing community.
Clustering Appearance for Scene Analysis
Authors: Sanjeev J. Koppal, Srinivasa G. Narasimhan
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

We propose a new approach called "appearance clustering" for scene analysis. The key idea in this approach is that the scene points can be clustered according to their surface normals, even when the geometry, material and lighting are all unknown. We achieve this by analyzing an image sequence of a scene as it is illuminated by a smoothly moving distant source. Each pixel thus gives rise to a "continuous appearance profile" that yields information about derivatives of the BRDF w.r.t source direction. This information is directly related to the surface normal of the scene point when the source path follows an unstructured trajectory (obtained, say, by "hand-waving"). Based on this observation, we transform the appearance profiles and propose a metric that can be used with any unsupervised clustering algorithm to obtain iso-normal clusters. We successfully demonstrate appearance clustering for complex indoor and outdoor scenes. In addition, iso-normal clusters serve as excellent priors for scene geometry and can strongly impact any vision algorithm that attempts to estimate material, geometry and/or lighting properties in a scene from images. We demonstrate this impact for applications such as diffuse and specular separation, both calibrated and uncalibrated photometric stereo of non-lambertian scenes, light source estimation and texture transfer.
A Collaborative Approach for Access Control, Intrusion Detection and Security Testing
Authors: M. Blanc, J. Briffaut, P. Clemente, M. Gad El Rab, C. Toinard
Venue: Proceedings of the International Symposium on Collaborative Technologies and Systems (2006)

Security Management is becoming a critical aspect for large scale distributed systems. In this paper, we propose a global architecture, based on an original meta-policy approach for access control and intrusion detection, allowing to guarantee global security properties. In contrast with classical meta-policy based systems, by applying verification techniques on the meta-policy, our solution guarantees global security properties while supporting local updates of the security policy. It is thus a powerful solution that provides strong fault tolerance since the control is carried out in a complete decentralized manner. By using a meta-policy, the system can verify the respect of global security properties after meta or local modifications of the policy. Thanks to test components, our system is also able to evaluate and configure in real-time each of its functionalities while tracking self corruption by malicious hackers. Our architecture is a cooperative multi agent-based system, making it possible to activate a functionality independently from some others. It is divided into several levels, each one contributing to the automation of the security management.
Version Control using Cryptographic Access Control
Authors: K. Ganesan, R. Anandan
Venue: Proceedings of the 9th International Conference on Information Technology (2006)

In this paper, using cryptographic access control techniques, we demonstrate that a client can store various versions of a file in a secure way at the (remote) server and control its access. The proposed mechanism also permits different users (clients) to store simultaneously their files with the same name at the server in a common storage area, without any name conflict. This will be very useful for mobile clients with limited storage.
Unsupervised Learning of Categories from Sets of Partially Matching Image Features
Authors: Kristen Grauman, Trevor Darrell
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

We present a method to automatically learn object categories from unlabeled images. Each image is represented by an unordered set of local features, and all sets are embedded into a space where they cluster according to their partial-match feature correspondences. After efficiently computing the pairwise affinities between the input images in this space, a spectral clustering technique is used to recover the primary groupings among the images. We introduce an efficient means of refining these groupings according to intra-cluster statistics over the subsets of features selected by the partial matches between the images, and based on an optional, variable amount of user supervision. We compute the consistent subsets of feature correspondences within a grouping to infer category feature masks. The output of the algorithm is a partition of the data into a set of learned categories, and a set of classifiers trained from these ranked partitions that can recognize the categories in novel images.
Information systems research in the Asia Pacific region
Authors: Patrick Y. K. Chau, Lihua Huang, Ting-Peng Liang
Venue: European Journal of Information Systems (2005)

Research in information systems (IS) in the Asia Pacific has experienced fast progress in the past 10 years. A major driving force is the Pacific Asia Conference on Information Systems. In this paper, we provide an overview of the IS research in the Asia Pacific and in China and four best papers selected from the 2004 Pacific Asia Conference on Information System Shanghai Conference.
Self-regulation through social institutions: A framework for the design of open agent-based electronic marketplaces
Authors: Christian Hahn, Bettina Fley, Michael Florian
Venue: Computational Mathematical Organization Theory (2006)

In this paper, we argue that allowing self-interested agents to activate social institutions during runtime can improve the robustness (i.e., stability, reliability, or scalability) of open multiagent systems (MAS). Referring to sociological theory, we consider institutions to be rules that need to be activated and adopted by the agent population during runtime and propose a framework for self-regulation of MAS for the domain of electronic marketplaces. The framework consists of three different institutional types that are defined by the mechanisms and instances that generate, change or safeguard them. We suggest that allowing autonomous agents both the reasoning about their compliance with a rule and the selection of an adequate institutional types helps to balance the trade-off between the autonomy of self-interested agents and the maintenance of social order (cf. Castelfranchi, 2000) in MAS, and to ensure almost the same qualities as in closed environments. A preliminary report of the evaluation of the prototype by empirical simulations is given.
Incontrol Enterprise Dynamics: airport/rail solutions
Authors: Fred Jansma
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Airports, airlines and railway operators around the world use Enterprise Dynamics to model, simulate and visualize their operations. With dedicated solutions such as Samanta, Simone, Friso and Plato it is possible to simulate each process within an airport or the railways: SAMANTA-the most complete simulation solution for modeling baggage handling, passenger flow, scheduling security and check-in, traffic simulation; Simone- railway simulator developed together with Dutch Railways, application tests timetables for robustness; Frisooptimizing hump yard operations; Plato-simulating passenger flows on train stations. During this presentation the power of these dedicated simulation solutions will be demonstrated.
Latent Friend Mining from Blog Data
Authors: Dou Shen, Jian-Tao Sun, Qiang Yang, Zheng Chen
Venue: Proceedings of the Sixth International Conference on Data Mining (2006)

The rapid growth of blog (also known as "weblog") data provides a rich resource for social community mining. In this paper, we put forward a novel research problem of mining the latent friends of bloggers based on the contents of their blog entries. Latent friends are defined in this paper as people who share the similar topic distribution in their blogs. These people may not actually know each other, but they have the interest and potential to find each other out. Three approaches are designed for latent friend detection. The first one, called cosine similarity-based method, determines the similarity between bloggers by calculating the cosine similarity between the contents of the blogs. The second approach, known as topic-based method, is based on the discovery of latent topics using a latent topic model and then calculating the similarity at the topic level. The third one is two-level similarity-based, which is conducted in two stages. In the first stage, an existing topic hierarchy is exploited to build a topic distribution for a blogger. Then, in the second stage, a detailed similarity comparison is conducted for bloggers that are close in interest to each other which are discovered in the first stage. Our experimental results show that both the topic-based and two-level similarity-based methods work well, and the last approach performs much better than the first two. In this paper, we give a detailed analysis of the advantages and disadvantages of different approaches.
The lean transformation in engine overhaul
Authors: Mark Orth, Franklin Young
Venue: Proceedings of the 37th conference on Winter simulation (2005)

United Services, the MRO division of United Airlines, is transforming its operations through Lean. Eliminating waste and reducing repair cycle time make possible for additional work from outside customers and incremental revenues. One of the most dramatic transformations is in the engine overhaul area. A flow line similar to an auto assembly line is being built for the Pratt & Whitney 4000 engines flown on the B747-400 and B777. To quantify its economics, United's Industrial Engineering developed a simulation model of the proposed line. This model gave key insights without pouring an ounce of concrete or cutting any metal.
Bottled Sand Movies
Authors: Bruno M. Carvalho, Laurindo S. Britto Neto, Lucas M. Oliveira
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualisation (2006)

Non-Photorealistic Rendering (NPR) is a class of techniques defined by what they do not aim, the realistic rendering of artificial scenes. NPR techniques, on the other hand, aim to reproduce artistic techniques renderings, trying to express feelings and moods on the rendered scenes. This paper introduces a new style of NPR based on a typical art craft from the northeastern region of Brazil, that uses colored sand to compose landscapes inside glass bottles. A method for generating two-dimensional (2D) virtual sand textures is introduced, as well as techniques for combining them in a point-by-point or in an area basis.
Scrambling for Video Surveillance with Privacy
Authors: Frederic Dufaux, Touradj Ebrahimi
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

In this paper, we address the problem of scrambling regions of interest in a video sequence for the purpose of preserving privacy in video surveillance. We propose an efficient solution based on transform-domain scrambling. More specifically, the sign of selected transform coefficients is pseudo-randomly flipped during encoding. We address more specifically the two cases of MPEG-4 and Motion JPEG 2000. Simulation results show that the technique can be successfully applied to conceal information in regions of interest in the scene while providing with a good level of security. Furthermore, the scrambling is flexible and allows adjusting the amount of distortion introduced. Finally, this is achieved with a small impact on coding performance and negligible computational complexity increase.
Categorical Perception of Happiness and Fear Facial Expressions: An ERP Study
Authors: S. Campanella, P. Quinet, R. Bruyer, M. Crommelinck, J.-M. Guerit
Venue: Journal of Cognitive Neuroscience (2002)

Behavioral studies have shown that two different morphed faces perceived as reflecting the same emotional expression are harder to discriminate than two faces considered as two different ones. This advantage of between-categorical differences compared with within-categorical ones is classically referred as the categorical perception effect. The temporal course of this effect on fear and happiness facial expressions has been explored through event-related potentials (ERPs). Three kinds of pairs were presented in a delayed same-different matching task: (1) two different morphed faces perceived as the same emotional expression (within-categorical differences), (2) two other ones reflecting two different emotions (between-categorical differences), and (3) two identical morphed faces (same faces for methodological purpose). Following the second face onset in the pair, the amplitude of the bilateral occipito-temporal negativities (N170) and of the vertex positive potential (P150 or VPP) was reduced for within and same pairs relative to between pairs. This suggests a repetition priming effect. We also observed a modulation of the P3b wave, as the amplitude of the responses for the between pairs was higher than for the within and same pairs. These results indicate that the categorical perception of human facial emotional expressions has a perceptual origin in the bilateral occipito-temporal regions, while typical prior studies found emotion-modulated ERP components considerably later.
STAGGER: Periodicity Mining of Data Streams Using Expanding Sliding Windows
Authors: Mohamed G. Elfeky, Walid G. Aref, Ahmed K. Elmagarmid
Venue: Proceedings of the Sixth International Conference on Data Mining (2006)

Sensor devices are becoming ubiquitous, especially in measurement and monitoring applications. Because of the real-time, append-only and semi-infinite natures of the generated sensor data streams, an online incremental approach is a necessity for mining stream data types. In this paper, we propose STAGGER: a one-pass, online and incremental algorithm for mining periodic patterns in data streams. STAGGER does not require that the user pre-specify the periodicity rate of the data. Instead, STAGGER discovers the potential periodicity rates. STAGGER maintains multiple expanding sliding windows staggered over the stream, where computations are shared among the multiple overlapping windows. Small-length sliding windows are imperative for early and real-time output, yet are limited to discover short periodicity rates. As streamed data arrives continuously, the sliding windows expand in length in order to cover the whole stream. Larger-length sliding windows are able to discover longer periodicity rates. STAGGER incrementally maintains a tree-like data structure for the frequent periodic patterns of each discovered potential periodicity rate. In contrast to the Fourier/Wavelet-based approaches used for discovering periodicity rates, STAGGER not only discovers a wider, more accurate set of periodicities, but also discovers the periodic patterns themselves. In fact, experimental results with real and synthetic data sets show that STAGGER outperforms Fourier/Wavelet-based approaches by an order of magnitude in terms of the accuracy of the discovered periodicity rates. Moreover, realdata experiments demonstrate the practicality of the discovered periodic patterns.
Semantic Classification of Sports News Video Using Color and Motion Features
Authors: SangHyun Jang, MiYoung Song, HyungJe Cho
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 02 (2006)

With the growing popularity of digitized sports videos in the internet, an automated method to analyze semantic classification and content-based retrieval is essential to facilitate them. However, it is extremely difficult to categorize and label scenes in any video. This thesis uses the visual features(color and motion) of sports news videos to propose a method to extract certain scenes and analyze the sports genre and shows the experimental results after categorizing 5 sports games(soccer, baseball, golf, basketball, and volleyball).
Service-oriented and autonomous distribution and provision of multimedia contents
Authors: Fuyuki Ishikawa, Nobukazu Yoshioka, Shinichi Honiden
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

This work considers encapsulation of multimedia contents as services, and their autonomous provision and distribution by agents. This approach enables content providers to have their contents provided and distributed together with their own business logics regarding interaction with other services and contents, control logic for various options upon provision, and value-added services. This paper proposes a framework for development of agents that provide and distribute such content services. In the framework, the interaction logic of agents is first developed in the same way as in development of ordinary Web services. Control descriptions are then given for each aspect, such as selection of partner agents, negotiation on service options, and migration. The separated descriptions for each aspect facilitate incremental development and test, as well as later modification, of agents with complex behaviors.
Properties of Capability Based Agent Organization Transition
Authors: Eric Matson, Raj Bhatnagar
Venue: Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology (2006)

It has been said that the only constant in life is change. This rule can also be directly applied to the lives of organizations. Any organization of non-trivial size, scope, life expectancy or function, is destined to change. An organization without the ability to transition is not robust, evolvable or adaptable within its environment. These basic preconditions to human organizations must also hold in viable agent organizations. To model an adaptable agent organization, the capability must be present to transition from one state to the next over the life of the organization. The organization model must include not only the structural components, but also the ability to facilitate change. The ability to change empowers the organization to transition from one state to the next, over its useful life. To enable transition, we must formally capture and define what triggers an organization transition. In this paper, we will define the properties to formally model the ability of an adaptable organization to transition throughout its useful life.
Physics-Based Simulation of Surgical Fields for Preoperative Strategic Planning
Authors: Megumi Nakao, Tomohiro Kuroda, Hiroshi Oyama, Genichi Sakaguchi, Masashi Komeda
Venue: Journal of Medical Systems (2006)

Although careful planning of surgical approach is a key for success of surgery, conventional planning and simulation tools cannot support detailed discussion. This issue is derived from the difficulty of estimating complex physical behavior of soft tissues provided by a series of surgical procedures like cutting and deformation. This paper proposes an adaptive physics-based framework that simulates both interactive cutting and accurate deformation on virtual bodies, and performs preoperative planning for supporting strategic discussion. We focus on limited use of the two models: A particle-based model and an FEM-based model considering required quality and performance in different situations. FEM-based deformation of incision accurately produces estimated surgical fields. Based on the framework, a strategic planning system was developed for supporting decision of surgical approach using 3D representation of the surgical fields. We applied clinical CT dataset of an aortic aneurysm case to the system. Some experiments and usability tests confirmed that the system contributes to grasping 3D shape and location of the target organs and performs detailed discussion on patient-specific surgical approaches.
Automatic Derivation of Loop Bounds and Infeasible Paths for WCET Analysis Using Abstract Execution
Authors: Jan Gustafsson, Andreas Ermedahl, Christer Sandberg, Bjorn Lisper
Venue: Proceedings of the 27th IEEE International Real-Time Systems Symposium (2006)

Static Worst-Case Execution Time (WCET) analysis is a technique to derive upper bounds for the execution times of programs. Such bounds are crucial when designing and verifying real-time systems. A key component for statically deriving safe and tight WCET bounds is information on the possible program flow through the program. Such flow information can be provided manually by user annotations, or automatically by a flow analysis. To make WCET analysis as simple and safe as possible, it should preferably be automatically derived, with no or very limited user interaction. In this paper we present a method for deriving such flow information called abstract execution. This method can automatically calculate loop bounds, bounds for including nested loops, as well as many types of infeasible paths. Our evaluations show that it can calculate WCET estimates automatically, without any user annotations, for a range of benchmark programs, and that our techniques for nested loops and infeasible paths sometimes can give substantially better WCET estimates than using loop bounds analysis only.