標(biāo)題: Titlebook: Computational Visual Media; First International Shi-Min Hu,Ralph R. Martin Conference proceedings 2012 Springer-Verlag Berlin Heidelberg 2 [打印本頁(yè)] 作者: MASS 時(shí)間: 2025-3-21 17:57
書目名稱Computational Visual Media影響因子(影響力)
作者: 撤退 時(shí)間: 2025-3-21 23:43 作者: 完成才能戰(zhàn)勝 時(shí)間: 2025-3-22 01:19 作者: 攝取 時(shí)間: 2025-3-22 07:04
https://doi.org/10.1007/978-0-387-75146-7 combining the Public Goods Game, our algorithm can efficiently solve the multi-label segmentation problem. Experiments on challenging datasets demonstrate that our algorithm outperforms the state-of-art. We believe that this algorithm can be extended to many other labeling problems.作者: 匯總 時(shí)間: 2025-3-22 10:10 作者: 柏樹(shù) 時(shí)間: 2025-3-22 13:46
A Novel Customized Recompression Framework for Massive Internet Imagesompression. In this paper, we propose a novel framework to efficiently customize image recompression according to a variety of applications. And our new framework has been successfully applied to many commercial applications, such as web portals, e-commerce, online game and so on.作者: 柏樹(shù) 時(shí)間: 2025-3-22 21:05 作者: ordain 時(shí)間: 2025-3-23 00:26
A Game-Theoretical Approach to Image Segmentation combining the Public Goods Game, our algorithm can efficiently solve the multi-label segmentation problem. Experiments on challenging datasets demonstrate that our algorithm outperforms the state-of-art. We believe that this algorithm can be extended to many other labeling problems.作者: comely 時(shí)間: 2025-3-23 05:23 作者: vasospasm 時(shí)間: 2025-3-23 07:22
0302-9743 viewed and selected from 81 submissions. The papers are organized in topical sections on image processing I and II, geometric processing, saliency, recognition, perception and learning, shape analysis, media retrieval, and capture, rendering and visualization.978-3-642-34262-2978-3-642-34263-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 光滑 時(shí)間: 2025-3-23 12:41 作者: BRACE 時(shí)間: 2025-3-23 15:12
https://doi.org/10.1007/978-0-387-75146-7stablished automatically. Finally, we optimize the parameters of the deformable model in an iterative way, and then obtain the clothed and naked 3D shapes of the person simultaneously. The experimental results on real images demonstrate the effectiveness of our method.作者: 聚集 時(shí)間: 2025-3-23 19:45
Asymptotics for Random Permanents, textures at voxel level and produces optimized solid textures using our representation. This avoids significant amount of unnecessary computation and storage with comparable quality to the state of the art.作者: 過(guò)度 時(shí)間: 2025-3-23 23:29
Error Estimation and Adaptivity,lly, we adjust surface normals of the original shape as the corresponding final normals of the manipulated surface. The experimental results show that our proposed algorithm can adjust the shading of the original shape and thus for improving its shape depiction.作者: Yourself 時(shí)間: 2025-3-24 04:21 作者: 官僚統(tǒng)治 時(shí)間: 2025-3-24 07:01 作者: Obverse 時(shí)間: 2025-3-24 11:23 作者: colony 時(shí)間: 2025-3-24 17:05
Clothed and Naked Human Shapes Estimation from a Single Imagestablished automatically. Finally, we optimize the parameters of the deformable model in an iterative way, and then obtain the clothed and naked 3D shapes of the person simultaneously. The experimental results on real images demonstrate the effectiveness of our method.作者: 膠水 時(shí)間: 2025-3-24 20:27
Efficient Solid Texture Synthesis Using Gradient Solids textures at voxel level and produces optimized solid textures using our representation. This avoids significant amount of unnecessary computation and storage with comparable quality to the state of the art.作者: Lamina 時(shí)間: 2025-3-25 01:25 作者: concentrate 時(shí)間: 2025-3-25 04:17 作者: ligature 時(shí)間: 2025-3-25 09:50 作者: Incisor 時(shí)間: 2025-3-25 15:20
Symmetric Functions and the Fock Space,inally, vertex positions are updated to be consistent with the filtered face normals using a least-squares formulation. Experiments on various types of meshes indicate that our method has advantages over previous surface denoising methods.作者: 自負(fù)的人 時(shí)間: 2025-3-25 15:50 作者: Nebulizer 時(shí)間: 2025-3-25 22:55 作者: 我說(shuō)不重要 時(shí)間: 2025-3-26 00:11
Symmetric Functions: A Beginner‘s Coursehing algorithm is performed to minimize distortions of the subdivision surface via updating texture coordinates of the .. Finally, an Iterative Closest Point (ICP)-based deformation algorithm is performed to remove subdivision errors caused by the added ..作者: overrule 時(shí)間: 2025-3-26 07:37 作者: Forsake 時(shí)間: 2025-3-26 09:47
A Robust Algorithm for Denoising Meshes with High-Resolution Detailsinally, vertex positions are updated to be consistent with the filtered face normals using a least-squares formulation. Experiments on various types of meshes indicate that our method has advantages over previous surface denoising methods.作者: 假裝是我 時(shí)間: 2025-3-26 16:04
Mesh Segmentation for Parallel Decompression on GPUcompression of each patch runs on a thread of GPU, we have evaluated its performance on various large benchmarks. In practice, the GPU-based decompression algorithm runs more than 48X faster with that on the CPU.作者: Cacophonous 時(shí)間: 2025-3-26 20:42
Modeling Residential Urban Areas from Dense Aerial LiDAR Point Cloudstructures invisible to laser scans; in contrast, trees do not possess such characteristic and thus point samples can exist underneath tree crowns. Once the point cloud is successfully classified, our system reconstructs buildings and trees respectively, resulting in a hybrid model representing the 3D urban reality of residential areas.作者: 摘要記錄 時(shí)間: 2025-3-26 23:19 作者: 性別 時(shí)間: 2025-3-27 04:31 作者: entrance 時(shí)間: 2025-3-27 08:38 作者: 使饑餓 時(shí)間: 2025-3-27 10:57
Weak Convergence of Permanent Processes,-down hierarchical manner. In addition, given that users can have different perspectives regarding how images should be clustered, our method allows each user to control the clustering process while browsing, and thus dynamically adjusts the clustering result according to the user’s preferences.作者: 陳腐思想 時(shí)間: 2025-3-27 14:44
Combinatorial Formula for Schur Polynomialsw that our method has better performance on yielding higher precision and recall rates. In the application of image editing, we demonstrate that using our saliency map as energy map can achieve more appealing retargeting results with less distortions in the important regions.作者: 有幫助 時(shí)間: 2025-3-27 20:53 作者: Ptsd429 時(shí)間: 2025-3-27 23:12
Semantic Image Clustering Using Object Relation Network-down hierarchical manner. In addition, given that users can have different perspectives regarding how images should be clustered, our method allows each user to control the clustering process while browsing, and thus dynamically adjusts the clustering result according to the user’s preferences.作者: Left-Atrium 時(shí)間: 2025-3-28 06:02
Similar Region Contrast Based Salient Object Detectionw that our method has better performance on yielding higher precision and recall rates. In the application of image editing, we demonstrate that using our saliency map as energy map can achieve more appealing retargeting results with less distortions in the important regions.作者: agglomerate 時(shí)間: 2025-3-28 08:51 作者: 鉤針織物 時(shí)間: 2025-3-28 11:26 作者: STERN 時(shí)間: 2025-3-28 17:51 作者: 色情 時(shí)間: 2025-3-28 20:55
Conference proceedings 2012in November 2012. .The 33 revised full papers were carefully reviewed and selected from 81 submissions. The papers are organized in topical sections on image processing I and II, geometric processing, saliency, recognition, perception and learning, shape analysis, media retrieval, and capture, rendering and visualization.作者: 蟄伏 時(shí)間: 2025-3-29 02:47 作者: intangibility 時(shí)間: 2025-3-29 05:23 作者: 他姓手中拿著 時(shí)間: 2025-3-29 07:59 作者: Obedient 時(shí)間: 2025-3-29 13:31
978-3-642-34262-2Springer-Verlag Berlin Heidelberg 2012作者: 駕駛 時(shí)間: 2025-3-29 16:08
https://doi.org/10.1007/978-0-387-75146-7 active forensic methods, such as digital watermarking or digital signatures, fail or are not present. The NIDIF for lossy JPEG compressed images are of special importance due to its pervasively use in many applications. Recently, researchers showed that certain types of tampering manipulations can 作者: Culmination 時(shí)間: 2025-3-29 22:31 作者: MAL 時(shí)間: 2025-3-30 02:10 作者: 挑剔為人 時(shí)間: 2025-3-30 07:51
Weak Convergence of ,-statistics,use the problem is extremely ill-posed. Smooth assumption is widely used in many methods, but pixels in plain areas and in edge areas are not well distinguished. We improve this assumption by adding a weight to every pixel in the image so that the smoothness is measured accordingly. There are always作者: ICLE 時(shí)間: 2025-3-30 10:33 作者: 笨拙的我 時(shí)間: 2025-3-30 13:58 作者: 引水渠 時(shí)間: 2025-3-30 20:27
Weak Convergence of ,-statistics,en semantically correct, which has been rarely considered previously. In this paper, we propose a complete system for the image colorization with an affective word. We only need users to assist object segmentation along with text labels and give an affective word. First, the text labels along with o作者: 生氣地 時(shí)間: 2025-3-31 00:29
Weak Convergence of Permanent Processes,es with no metadata as input, our method describes the semantics of each image with a . model (., a set of meaningful descriptors), which is derived from the image’s Object Relation Network [5] - an expressive graph model representing rich semantics for image objects and their relations. We adopt th作者: Hot-Flash 時(shí)間: 2025-3-31 02:19 作者: nitroglycerin 時(shí)間: 2025-3-31 05:20 作者: Amnesty 時(shí)間: 2025-3-31 10:17
Combinatorial Formula for Schur Polynomialsetween patches, and balancing the numbers of faces of patches for efficient parallel computing. First we generate a topology model of the original mesh and remove vertex positions. Then we assign the centers of patches using geodesic farthest point sampling and cluster the faces according to geodesi作者: PAGAN 時(shí)間: 2025-3-31 13:25 作者: aplomb 時(shí)間: 2025-3-31 20:37 作者: 羽飾 時(shí)間: 2025-3-31 23:49
Combinatorial Formula for Schur Polynomialsetection method, generating a saliency map that enables high contrast between the foreground salient object and background. Our method mainly integrates four principles, which are based on psychological evidences, visual research and general observation. In order to suppress the homogeneous regions,作者: deviate 時(shí)間: 2025-4-1 03:01 作者: 輕快帶來(lái)危險(xiǎn) 時(shí)間: 2025-4-1 07:57 作者: 過(guò)份 時(shí)間: 2025-4-1 12:25 作者: nautical 時(shí)間: 2025-4-1 15:13
https://doi.org/10.1007/BFb0070306 related information hidden in different labels which is crucial for lots of applications, it is essential to extract a latent structure shared among different labels. This paper presents an incremental approach for extracting a shared subspace on dynamic dataset. With the incremental lossless matri作者: DNR215 時(shí)間: 2025-4-1 18:28
Decomposition of the dirichlet form,logical research that line drawings trigger a neural response similar to natural color images, and propose a line-drawing-based 3D object recognition method. The contribution of the proposed method includes a feature defined for line drawings and a similarity metric for object recognition. Experimen作者: inspiration 時(shí)間: 2025-4-2 00:19
Computational Visual Media978-3-642-34263-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 防御 時(shí)間: 2025-4-2 06:07 作者: 讓空氣進(jìn)入 時(shí)間: 2025-4-2 07:59
A Novel Customized Recompression Framework for Massive Internet Imagesto improve user experience and save costs as much as possible, a lot of internet applications always focus on how to achieve the appropriate image recompression. In this paper, we propose a novel framework to efficiently customize image recompression according to a variety of applications. And our n作者: Graduated 時(shí)間: 2025-4-2 11:16 作者: Obvious 時(shí)間: 2025-4-2 16:22
Intrinsic Image Decomposition with Local Smooth Assumption and Global Color Assumptionuse the problem is extremely ill-posed. Smooth assumption is widely used in many methods, but pixels in plain areas and in edge areas are not well distinguished. We improve this assumption by adding a weight to every pixel in the image so that the smoothness is measured accordingly. There are always
