this book constitutes the refereed proceedings of the 7thchineseconference on Biometric recognition, CCBR 2012, held in Guangzhou, China, in December 2012. the 46 revised full papers were carefully reviewed and sele...
详细信息
ISBN:
(数字)9783642351365
ISBN:
(纸本)9783642351358
this book constitutes the refereed proceedings of the 7thchineseconference on Biometric recognition, CCBR 2012, held in Guangzhou, China, in December 2012. the 46 revised full papers were carefully reviewed and selected from 80 submissions. the papers address the problems in face, iris, hand biometrics, speaker, handwriting, gait, soft biometrics, security and other related topics, and contribute new ideas to research and development of reliable and practical solutions for biometric authentication.
this book constitutes the refereed proceedings of the 7th International conference on computer Analysis of Images and patterns, CAIP '97, held in Kiel, Germany, in September 1997.;the volume presents 92 revised pa...
详细信息
ISBN:
(数字)9783540695561
ISBN:
(纸本)9783540634607
this book constitutes the refereed proceedings of the 7th International conference on computer Analysis of Images and patterns, CAIP '97, held in Kiel, Germany, in September 1997.;the volume presents 92 revised papers selected during a double-blind reviewing process from a total of 150 high-quality submissions. the papers are organized in topical sections on pattern analysis, object recognition and tracking, invariants, applications, shape, texture analysis, motion calibration, low-level processing, structure from motion, stereo and correspondence, segmentation and grouping, mathematical morphology, pose estimation, and face analysis.
Multi-target tracking is an interesting but challenging task in computervision field. Most previous data association based methods merely consider the relationships (e.g. appearance and motion pattern similarities) b...
详细信息
ISBN:
(纸本)9781479951178
Multi-target tracking is an interesting but challenging task in computervision field. Most previous data association based methods merely consider the relationships (e.g. appearance and motion pattern similarities) between detections in local limited temporal domain, leading to their difficulties in handling long-term occlusion and distinguishing the spatially close targets with similar appearance in crowded scenes. In this paper, a novel data association approach based on undirected hierarchical relation hyper-graph is proposed, which formulates the tracking task as a hierarchical dense neighborhoods searching problem on the dynamically constructed undirected affinity graph. the relationships between different detections across the spatio-temporal domain are considered in a high-order way, which makes the tracker robust to the spatially close targets with similar appearance. Meanwhile, the hierarchical design of the optimization process fuels our tracker to long-term occlusion with more robustness. Extensive experiments on various challenging datasets (i.e. PETS2009 dataset, ParkingLot), including both low and high density sequences, demonstrate that the proposed method performs favorably against the state-of-the-art methods.
Following color vision law is a good method for color harmony design. But there are two questions in dire need of resolve. First, the color models such as L*a*b*, RGB and HSV in actual CAD system are not uniform in vi...
详细信息
ISBN:
(纸本)9781424406838
Following color vision law is a good method for color harmony design. But there are two questions in dire need of resolve. First, the color models such as L*a*b*, RGB and HSV in actual CAD system are not uniform in vision;second there are short of harmony control techniques. In this article, a visual perceptual color model, i.e. HVC model is established based on artificial neural network (ANN). the ANN training data come from the Munsell system and chinese color system. And the comparison between the HVC model and the L*a*b* model in Photoshop software is presented. then, a set of harmony control algorithms are discussed in detail. Lastly, an interactive color harmony design system (ICHDS) is developed based on the HVC model and the harmony algorithms. Application testified that ICHDS provides effective color harmony design tools.
Age estimation is an important task in computervision and is widely used in applications. However, such a technology is largely affected by the resolution of face, and it would be a challenge if one has to estimate t...
详细信息
ISBN:
(纸本)9781538637883
Age estimation is an important task in computervision and is widely used in applications. However, such a technology is largely affected by the resolution of face, and it would be a challenge if one has to estimate the age of a person at a distance. While body image of a person is often captured more clearly, when and how to use body-based visual cues for age estimation are largely under studied. In this work, we argue that body-based visual cues are better for estimating the age group and can assist the estimation of exact age value. For this purpose, we develop a Body-based Age Net (BAN) that unifies selective local convolution features and contextual convolution features. the network is designed based on two assumptions: 1) a person's wearing is closely related to his/her age group property;2) some selective local parts of a body are more discriminative for age group estimation. We have contributed a large-scale and publicly available Body Age (BAG) dataset. We have quantitatively evaluated the proposed model on BAG.
Given an area of interest in a video sequence, one may want to manipulate or edit the area, e.g. remove occlusions from or replace with an advertisement on it. Such a task involves three main challenges including temp...
详细信息
ISBN:
(纸本)9780769549897
Given an area of interest in a video sequence, one may want to manipulate or edit the area, e.g. remove occlusions from or replace with an advertisement on it. Such a task involves three main challenges including temporal consistency, spatial pose, and visual realism. the proposed method effectively seeks an optimal solution to simultaneously deal with temporal alignment, pose rectification, as well as precise recovery of the occlusion. To make our method applicable to long video sequences, we propose a batch alignment method for automatically aligning and rectifying a small number of initial frames, and then show how to align the remaining frames incrementally to the aligned base images. From the error residual of the robust alignment process, we automatically construct a trimap of the region for each frame, which is used as the input to alpha matting methods to extract the occluding foreground. Experimental results on both simulated and real data demonstrate the accurate and robust performance of our method.
Part-based visual tracking is advantageous due to its robustness against partial occlusion. However, how to effectively exploit the confidence scores of individual parts to construct a robust tracker is still a challe...
详细信息
ISBN:
(纸本)9781479951178
Part-based visual tracking is advantageous due to its robustness against partial occlusion. However, how to effectively exploit the confidence scores of individual parts to construct a robust tracker is still a challenging problem. In this paper, we address this problem by simultaneously matching parts in each of multiple frames, which is realized by a locality-constrained low-rank sparse learning method that establishes multi-frame part correspondences through optimization of partial permutation matrices. the proposed part matching tracker (PMT) has a number of attractive properties. (1) It exploits the spatial-temporal locality-constrained property for robust part matching. (2) It matches local parts from multiple frames jointly by considering their low-rank and sparse structure information, which can effectively handle part appearance variations due to occlusion or noise. (3) the proposed PMT model has the inbuilt mechanism of leveraging multi-mode target templates, so that the dilemma of template updating when encountering occlusion in tracking can be better handled. this contrasts with existing methods that only do part matching between a pair of frames. We evaluate PMT and compare with 10 popular state-of-the-art methods on challenging benchmarks. Experimental results show that PMT consistently outperform these existing trackers.
this paper presents a novel tree-based cost aggregation method for dense stereo matching. Instead of employing the minimum spanning tree (MST) and its variants, a new tree structure, "Segment-Tree", is propo...
详细信息
ISBN:
(纸本)9780769549897
this paper presents a novel tree-based cost aggregation method for dense stereo matching. Instead of employing the minimum spanning tree (MST) and its variants, a new tree structure, "Segment-Tree", is proposed for non-local matching cost aggregation. Conceptually, the segment-tree is constructed in a three-step process: first, the pixels are grouped into a set of segments withthe reference color or intensity image;second, a tree graph is created for each segment;and in the final step, these independent segment graphs are linked to form the segment-tree structure. In practice, this tree can be efficiently built in time nearly linear to the number of the image pixels. Compared to MST where the graph connectivity is determined with local edge weights, our method introduces some 'non-local' decision rules: the pixels in one perceptually consistent segment are more likely to share similar disparities, and therefore their connectivity within the segment should be first enforced in the tree construction process. the matching costs are then aggregated over the tree within two passes. Performance evaluation on 19 Middlebury data sets shows that the proposed method is comparable to previous state-of-the-art aggregation methods in disparity accuracy and processing speed. Furthermore, the tree structure can be refined withthe estimated disparities, which leads to consistent scene segmentation and significantly better aggregation results.
Recent studies have shown that hashing methods are effective for high dimensional nearest neighbor search. A common problem shared by many existing hashing methods is that in order to achieve a satisfied performance, ...
详细信息
ISBN:
(纸本)9780769549897
Recent studies have shown that hashing methods are effective for high dimensional nearest neighbor search. A common problem shared by many existing hashing methods is that in order to achieve a satisfied performance, a large number of hash tables (i.e., long code-words) are required. To address this challenge, in this paper we propose a novel approach called Compressed Hashing by exploring the techniques of sparse coding and compressed sensing. In particular, we introduce a sparse coding scheme, based on the approximation theory of integral operator, that generate sparse representation for high dimensional vectors. We then project sparse codes into a low dimensional space by effectively exploring the Restricted Isometry Property (RIP), a key property in compressed sensing theory. Both of the theoretical analysis and the empirical studies on two large data sets show that the proposed approach is more effective than the state-of-the-art hashing algorithms.
the morphology of glands has been used routinely by pathologists to assess the malignancy degree of adenocarcinomas. Accurate segmentation of glands from histology images is a crucial step to obtain reliable morpholog...
详细信息
ISBN:
(纸本)9781467388511
the morphology of glands has been used routinely by pathologists to assess the malignancy degree of adenocarcinomas. Accurate segmentation of glands from histology images is a crucial step to obtain reliable morphological statistics for quantitative diagnosis. In this paper, we proposed an efficient deep contour-aware network (DCAN) to solve this challenging problem under a unified multi-task learning framework. In the proposed network, multi-level contextual features from the hierarchical architecture are explored with auxiliary supervision for accurate gland segmentation. When incorporated with multi-task regularization during the training, the discriminative capability of intermediate features can be further improved. Moreover, our network can not only output accurate probability maps of glands, but also depict clear contours simultaneously for separating clustered objects, which further boosts the gland segmentation performance. this unified framework can be efficient when applied to large-scale histopathological data without resorting to additional steps to generate contours based on low-level cues for post-separating. Our method won the 2015 MICCAI Gland Segmentation Challenge out of 13 competitive teams, surpassing all the other methods by a significant margin.
暂无评论