检索结果-内蒙古大学图书馆

12th ISPE International Conference on Concurrent engineering: Research and Applications - Next Generation Concurrent engineering: Smart and Concurrent Integration of Product Data, Services, and Control Strategies, CE 2005

作者： Karunakaran, K.P. Dashora, Yogesh Tiwari, M.K. Dwivedi, S.N. Department of Mechanical Engineering Computer Graphics Laboratory Indian Institute of Technology Powai Bombay-400076 India Department of Manufacturing Engineering National Institute of Foundry and Forge Technology Ranchi-834003 India Department of Forge Technology National Institute of Foundry and Forge Technology Ranchi-834003 India Department of Mechanical Engineering University of Louisiana at Lafayette Lafayette LA 70504 United States

The past decade has witnessed remarkable changes in management and linkage issues, especially pertaining to plant chains. And although Concurrent engineering (CE) principles have been utilized widely in the formulation of web-supported plant chains (WSPCs), they are challenged by the intricacies involved in implementation issues. This paper attempts to resolve the concurrent planning and scheduling (CPAS) aspects of WSPCs. A new Algorithm of Hierarchical Ants (AHA) is being proposed here, in order to solve the CPAS problem optimally. This algorithm takes its governing traits from the Ant Colony Optimization (ACO). The algorithm is marked by cooperation among colonies that work in a hierarchical manner, so as to make it compatible to any problems characterized by successive decisions. Robustness of the proposed algorithm is authenticated by solving problems of varying dimension and then is simulated to map the industrial data, after which results are compared with an established GA-based strategy. © 2005 ISPE, Inc.

关键词： Concurrent engineering

来源：评论

学校读者我要写书评

暂无评论

Extended linear programming in models of location of concrete mix production plants

引用

Journal of Civil engineering and Management 2005年第4期11卷 289-297页

作者： Koźniewski, Edwin Orlowski, Zygmunt Institute of Civil Engineering Biatystok University of Technology ul. Wiejska 45E 15-351 Bialystok Poland Institute of Civil Engineering Engineering Graphics and Computer Methods Division Bialystok University of Technology Bialystok Poland International Society for Geometry and Graphics Dept of Construction Engineering and Management Institute of Civil Engineering Biaclystok University of Technology Bialystok Poland

The paper discusses the location problem of production plants exemplified by concrete mix production plants (Ist model), taking into consideration the demand variability in time (IInd model), and the analytical method of the localization of industrial plant with a considerable amount of transportation costs of concrete mix and concrete aggregate (III rd model). Changes in demand for concrete mix in time t lead to changes in plants' location. Assuming that there exist concrete mix production plants, one should make a simulation of demand for concrete mix which occurs at the time t. The presented models are the essential generalisation of the problem discussed in the earlier papers. The matrix of construction costs must be always defined as a four-dimensions vector (the set of four values): the production plant construction cost, the cost of plant's modernisation (which is the result of changing demand for concrete mix), the cost of liquidation (dismantling) of a production plant or the cost of moving of an existing production plant. Three new generalised notions concerning the classical linear programming (mixed programming, mixed programming with time and two-optimised conjugate linear system) have been introduced. The algorithms describing the above-mentioned models of location changes were suggested, and programmes solving the location problems were prepared in PASCAL.

关键词： Concrete mixing

来源：评论

学校读者我要写书评

暂无评论

A robust matching algorithm for active appearance models 1

引用

Workshops Bildverarbeitung fur die Medizin: Algorithmen - Systeme - Anwendungen, BVM 2005 - Workshop on Image Processing for Medicine: Algorithms - Systems - Applications, BVM 2005

作者： Beichel, Reinhard Bischof, Horst Langs, Georg Sonka, Milan Institute for Computer Graphics and Vision Graz University of Technology Inffeldgasse 16/2 A-8010 Graz Austria Pattern Recognition and Image Processing Group Vienna University of Technology Favoritenstr. 9 A-1040 Vienna Austria Department of Electrical and Computer Engineering University of Iowa Iowa City IA 52242 United States

ISBN: (数字)9783540264316

ISBN: (纸本)3540250522

This paper proposes a method for robustly matching active appearance models (AAMs) on images with gross disturbances (outliers). The method consists of two steps. First, an initial residual is calculated by comparing model and image appearance, and modes of the residual are analyzed. Second, all possible mode combinations are tested by evaluating an objective function. The objective function allows the selection of an outlier-free mode combination. Experiments demonstrate the ability of the robust matching method to successfully cope with outliers - compared to standard AAM matching, no degeneration of the model during matching occurs.

关键词： Statistics

来源：评论

学校读者我要写书评

暂无评论

Image-based 3D face modeling system

Image-based 3D face modeling system

引用

作者： Park, In Kyu Zhang, Hui Vezhnevets, Vladimir School of Information and Communication Engineering Inha University 253 Younghyun-dong Nam-gu Incheon 402-751 Korea Republic of Computing Lab Samsung Advanced Institute of Technology San 14-1 Nongseo-ri Giheung-eup Yongin 449-712 Korea Republic of Graphics and Media Lab Department of Computational Mathematics and Cybernetics Moscow State University Moscow 119899 Russia School of Information and Communication Engineering Inha University Korea Republic of IEEE IEEE Computer Society ACM Samsung Advanced Institute of Technology Yongin Korea Republic of Graphics and Media Lab Computer Science Department Moscow State University

This paper describes an automatic system for 3D face modeling using frontal and profile images taken by an ordinary digital camera. The system consists of four subsystems including frontal feature detection, profile feature detection, shape deformation, and texture generation modules. The frontal and profile feature detection modules automatically extract the facial parts such as the eye, nose, mouth, and ear. The shape deformation module utilizes the detected features to deform the generic head mesh model such that the deformed model coincides with the detected features. A texture is created by combining the facial textures augmented from the input images and the synthesized texture and mapped onto the deformed generic head model. This paper provides a practical system for 3D face modeling, which is highly automated by aggregating, customizing, and optimizing a bunch of individual computer vision algorithms. The experimental results show a highly automated process of modeling, which is sufficiently robust to various imaging conditions. The whole model creation including all the optional manual corrections takes only 2-3 minutes. © 2005 Hindawi Publishing Corporation.

关键词： computer simulation

来源：评论

学校读者我要写书评

暂无评论

Metabolic visualization and intelligent shape analysis of the hippocampus

引用

International Conference on Computational Intelligence and Security, CIS 2005

作者： Choi, Yoo-Joo Kim, Jeong-Sik Kim, Min-Jeong Choi, Soo-Mi Kim, Myoung-Hee Institute for Graphic Interfaces Ewha-SK Telecom Building 11-1 Daehyun-Dong Seodaemun-Ku Seoul Korea Republic of Department of Computer Science and Engineering Ewha Womans University Daehyun-Dong Seodaemun-Ku Seoul Korea Republic of Center for Computer Graphics and Virtual Reality Ewha Womans University Daehyun-Dong Seodaemun-Ku Seoul Korea Republic of School of Computer Engineering Sejong University Seoul Korea Republic of Department of Computer Application Technology Seoul University of Venture and Information Seoul Korea Republic of

ISBN: (纸本)3540308199

This paper suggests a prototype system for visualization and analysis of anatomic shape and functional features of the hippocampus. Based on the result of MR-SPECT multi-modality image registration, anatomical and functional features of hippocampus are extracted from MR and registered SPECT images, respectively. The hippocampus is visualized in 3D by applying volume rendering to hippocampus volume data extracted from the MR image with color coded by registered SPECT image. In order to offer the objective and quantitative data concerning to the anatomic shape and functional features of the hippocampus, the geometric volume and the SPECT intensity histogram of hippocampus regions are automatically measured based on the MR and the registered SPECT image, respectively. We also propose a new method for the analysis of hippocampal shape using an integrated Octree-based representation, consisting of meshes, voxels, and skeletons. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Image analysis

来源：评论

学校读者我要写书评

暂无评论

Performance of neural classifiers for fabric faults classification

Performance of neural classifiers for fabric faults classifi...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： M. Abdulhady H.M. Abbas Y.H. Dakrowry S. Nassar Computers & Systems Department Electronics Research Institute Giza Egypt Department Computer and Systems Engineering Ain Shams University Cairo Egypt Mentor Graphics Egypt Cairo Egypt

In this paper, fabric faults classification using CNeT (Behnke and Karayiannis, 1998) is studied. The basic objectives are to improve the features selection used in CNeT (Behnke and Karayiannis, 1998) classifier and compare the results with other neural network classifiers. The algorithm adopted here is composed of three stages. The first stage is a preprocessing phase where defects are detected and localized. Since every detected defect has its different shape and size, all defects are normalized to a predetermined size. In the second stage a set of features are calculated for each defect using the Haralick (1973, 1979) spatial features. The improved classification performance is achieved by employing a statistical method to select the most important features that can be used in classification. This is done by calculating a classification factor (Milligan and Cooper, 1985) for each feature vector to determine its effect in the classification process. During the third and last stage, those features are then used to train a competitive neural tree (CNeT) (Behnke and Karayiannis, 1998) designed to learn in a supervised manner the class associated with each set of features. The network can be then used to test and classify new defects. The approach is experimented with a set of images of fault free and faulty textiles and output results are compared with radial basis function classifiers.

关键词： Fabrics Fault detection Textiles Neural networks Inspection Phase detection Shape Systems engineering and theory Statistical analysis Testing

来源：评论

学校读者我要写书评

暂无评论

Method for automatically segmenting the spinal cord and canal from 3D CT images

引用

11th International Conference on computer Analysis of Images and Patterns, CAIP 2005

作者： Nyúl, Lászlo G. Kanyó, Judit Máté, Eörs Makay, Géza Balogh, Emese Fidrich, Márta Kuba, Attila Department of Image Processing and Computer Graphics University of Szeged Árpád tér 2 H-6720 Szeged Hungary Clinical Software Engineering GE Medical Systems Lajos u. 48-66 H-1036 Budapest Hungary Institute of Mathematics University of Szeged Aradi vértanuk tere 1 H-6720 Szeged Hungary

ISBN: (纸本)3540289690

We present two approaches for automatically segmenting the spinal cord/canal from native CT images of the thorax region containing the spine. Different strategies are included to handle images where only part of the spinal column is visible. The algorithms require one seed point given on a slice located in the middle region of the spine, and the rest is automatic. The spatial extent of the spinal cord/canal is determined automatically. An extended region-growing technique is suggested for segmenting the spinal canal while active contours are applied if the spinal cord is to be segmented. Both methods work in 2D and use propagated information from neighboring slices. They are also very rapid in execution, that means an efficient, user-friendly workflow. The methods were evaluated by radiologists and were found to be useful (in reducing/eliminating contouring labor and time) and met the accuracy and repeatability requirements for the particular task. © Springer-Verlag Berlin Heidelberg 2005.

关键词： computerized tomography

来源：评论

学校读者我要写书评

暂无评论

Profile Flags: a novel metaphor for probing of T/sub 2/ maps

Profile Flags: a novel metaphor for probing of T/sub 2/ maps

引用

IEEE Conference on Visualization

作者： M. Mlejnek P. Ermest A. Vilanova R. van der Rijt H. van den Bosch F. Gerritsen M.E. Groller Institute of Computer Graphics and Algorithms University of Technology Vienna Austria Deorlrtment of Biomedical Engineering Technische Universiteit Eindhoven Netherlands Catharina Hospital Eindhovn Netherlands Philips Medical Systems Best Netherlands

This paper describes a tool for the visualization of T/sub 2/ maps of knee cartilage. Given the anatomical scan, and the T/sub 2/ map of the cartilage, we combine the information on the shape and the quality of the cartilage in a single image. The Profile Flag is an intuitive 3D glyph for probing and annotating of the underlying data. It comprises a bulletin board pin-like shape with a small flag on top of it. While moving the glyph along the reconstructed surface of an object, the curve data measured along the pin's needle and in its neighborhood are shown on the flag. The application area of the Profile Flag is manifold, enabling the visualization of profile data of dense but in-homogeneous objects. Furthermore, it extracts the essential part of the data without removing or even reducing the context information. By sticking Profile Flags into the investigated structure, one or more significant locations can be annotated by showing the local characteristics of the data at that locations. In this paper we are demonstrating the properties of the tool by visualizing T/sub 2/ maps of knee cartilage.

关键词： Bones Shape Image reconstruction Lesions Surface reconstruction Switches Visualization USA Councils Osteoarthritis Medical treatment

来源：评论

学校读者我要写书评

暂无评论

Course notes SIGGRAPH 2005 course 10: Realistic materials in computer graphics July 31, 2005

Course notes SIGGRAPH 2005 course 10: Realistic materials in...

引用

ACM SIGGRAPH 2005 International Conference on computer graphics and Interactive Techniques, SIGGRAPH 2005

作者： Lensch, Hendrik P. A. Goesele, Michael Chuang, Yung-Yu Hawkins, Tim Marschner, Steve Matusik, Wojciech Mueller, Gero Stanford University Computer Graphics Laboratory Gates Bldg. 3B-364 353 Serra Mall StanfordCA94305 United States MPI Informatik Stuhlsatzenhausweg 85 Saarbruecken66123 Germany National Taiwan University Department of Computer Science and Information Engineering No.1 Sec. 4 Roosevelt Road Taipei106 Taiwan University of Southern California Institute for Creative Technologies 13274 Fiji Way Marina del ReyCA90292 United States Cornell University Computer Science Department 5159 Upson Hall IthacaNY14853 United States 201 Broadway CambridgeMA02139 United States Universität Bonn Institute for Computer Science II Roemerstr. 164 Bonn53117 Germany

A number of techniques in recent years have demonstrated photoreal relightable image based models. In particular, a number of efforts have focussed on capturing images under many illumination conditons, allowing for this relighting to be performed directly from captured data without making simplifying assumptions about the material properties or light transport within the scene. These approaches can often be considered attempts at characterizing or measuring the reflectance field of the scene, a prospect which remains elusive given the high dimensionality of the reflectance field.

关键词： Reflection

来源：评论

学校读者我要写书评

暂无评论

Neural network algorithm for computing matrix eigenvalues and eigenvectors

引用

Ruan Jian Xue Bao/Journal of Software 2005年第6期16卷 1064-1072页

作者： Liu, Yi-Guang You, Zhi-Sheng Cao, Li-Ping Jiang, Xin-Rong Institute of Image and Graphics School of Computer Science and Engineering Sichuan University Chengdu 610064 China School of Public Administration Sichuan University Chengdu 610064 China

While using continuous time neural network described by the ***. learning rule (Oja-N) for computing real symmetrical matrix eigenvalues and eigenvectors, the initial vector must be on Rn unit hyper-sphere surface, otherwise, the network may produce limit-time overflow. In order to get over this defect, a new neural network (lyNN) algorithm is proposed. By using the analytic solution of the differential equation of lyNN, the following results are received: If initial vector belongs to a space corresponding to certain eigenvector, the lyNN equilibrium vector will converge in this space;If initial vector does not fall into the space corresponding to any eigenvector, the equilibrium vector will belong to the space spanned by eigenvectors corresponding to the maximum eigenvalue. The initial vector maximum space for the lyNN equilibrium vector will fall into space spanned by eigenvectors corresponding to any eigenvalue received. If the initial vector is perpendicular to a known eigenvector, so is the equilibrium vector. The equilibrium vector is on the hyper-sphere surface decided by the initial vector. By using the above results, a method for computing real symmetric matrix eigenvalues and eigenvectors using lyNN is proposed, the validity of this algorithm is exhibited by two examples, indicating that this algorithm does not bring about limit-time overflow. But for Oja-N, if the initial vector is outside the unit hyper-sphere and the matrix is negatively determinant, the neural network will consequentially produce limit-time overflow. Compared with other algorithms based on optimization, lyNN can be realized directly and its computing weight is lighter.

关键词： Neural networks

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：